Birdwatch Archive

Birdwatch Note Rating

2023-12-08 19:54:45 UTC - HELPFUL

Rated by Participant: 138BA2A950051FEE12E1542B66AA80877247F393C424CE246DF339764C9FA60A
Participant Details

Original Note:

The optimal way to pack 21 squares inside a larger square is currently unknown. Optimal solutions have been proven for numbers of squares from 1-10, 14-16, 22-25, 33-36, 62-64, 79-81, 98-100, and any square integer. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS7 https://en.m.wikipedia.org/wiki/Packing_problems

All Note Details

Original Tweet

All Information

  • noteId - 1733051937434845264
  • participantId -
  • raterParticipantId - 138BA2A950051FEE12E1542B66AA80877247F393C424CE246DF339764C9FA60A
  • createdAtMillis - 1702065285500
  • version - 2
  • agree - 0
  • disagree - 0
  • helpful - 0
  • notHelpful - 0
  • helpfulnessLevel - HELPFUL
  • helpfulOther - 0
  • helpfulInformative - 0
  • helpfulClear - 1
  • helpfulEmpathetic - 0
  • helpfulGoodSources - 1
  • helpfulUniqueContext - 0
  • helpfulAddressesClaim - 1
  • helpfulImportantContext - 1
  • helpfulUnbiasedLanguage - 1
  • notHelpfulOther - 0
  • notHelpfulIncorrect - 0
  • notHelpfulSourcesMissingOrUnreliable - 0
  • notHelpfulOpinionSpeculationOrBias - 0
  • notHelpfulMissingKeyPoints - 0
  • notHelpfulOutdated - 0
  • notHelpfulHardToUnderstand - 0
  • notHelpfulArgumentativeOrBiased - 0
  • notHelpfulOffTopic - 0
  • notHelpfulSpamHarassmentOrAbuse - 0
  • notHelpfulIrrelevantSources - 0
  • notHelpfulOpinionSpeculation - 0
  • notHelpfulNoteNotNeeded - 0
  • ratingsId - 1733051937434845264138BA2A950051FEE12E1542B66AA80877247F393C424CE246DF339764C9FA60A