{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SMOWETUMZA2QPVGIGEHOHG234C","short_pith_number":"pith:SMOWETUM","schema_version":"1.0","canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","source":{"kind":"arxiv","id":"2601.16535","version":3},"attestation_state":"computed","paper":{"title":"Covering a square by congruent squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The largest square coverable by n unit squares has the same size for full covering and boundary covering when n is at most 4, but the sizes differ when n equals 5.","cross_cats":[],"primary_cat":"math.MG","authors_text":"Gy\\\"orgy D\\'osa, Zsolt L\\'angi, Zsolt Tuza","submitted_at":"2026-01-23T08:11:17Z","abstract_excerpt":"The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate also the variant in which the goal is to cover only the boundary of a square. We show that these two problems are equivalent for $n \\leq 4$, but not for $n=5$. For both problems, we also present the solutions for $n=5$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2601.16535","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-01-23T08:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"388db6f832ef155f9e8ead88c91c88d9176b3dd153505a65155227b64e6f3369","abstract_canon_sha256":"a056980cfeda69eeaa3309b5b68d8e7eec767dc1511e1beb702cdb80460b3419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:30.132308Z","signature_b64":"8wXwiPsiIizmWfeIpIG/+aorcmXhCZUe8/SGipQy3JjuFmn3I2AHI0RLQGs0vEC+bQ4H3n15gOJLrZ0dZDKCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","last_reissued_at":"2026-06-01T01:02:30.131570Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:30.131570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering a square by congruent squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The largest square coverable by n unit squares has the same size for full covering and boundary covering when n is at most 4, but the sizes differ when n equals 5.","cross_cats":[],"primary_cat":"math.MG","authors_text":"Gy\\\"orgy D\\'osa, Zsolt L\\'angi, Zsolt Tuza","submitted_at":"2026-01-23T08:11:17Z","abstract_excerpt":"The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate also the variant in which the goal is to cover only the boundary of a square. We show that these two problems are equivalent for $n \\leq 4$, but not for $n=5$. For both problems, we also present the solutions for $n=5$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that these two problems are equivalent for n ≤ 4, but not for n=5. For both problems, we also present the solutions for n=5.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the optimal coverings for n=5 are attained by finite, explicitly describable arrangements of the five unit squares whose side lengths can be computed exactly from the geometry.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For n=5 the maximum side length of a square coverable by 5 unit squares is found exactly and shown to differ between full-area and boundary-only versions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The largest square coverable by n unit squares has the same size for full covering and boundary covering when n is at most 4, but the sizes differ when n equals 5.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4e6ca389c4e6f7e0ce6feac6e8ca8914b4262b1c3c0bcf153088892525015a78"},"source":{"id":"2601.16535","kind":"arxiv","version":3},"verdict":{"id":"ef2df909-d029-4c7e-a991-471f282dda57","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T12:16:18.575716Z","strongest_claim":"We show that these two problems are equivalent for n ≤ 4, but not for n=5. For both problems, we also present the solutions for n=5.","one_line_summary":"For n=5 the maximum side length of a square coverable by 5 unit squares is found exactly and shown to differ between full-area and boundary-only versions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the optimal coverings for n=5 are attained by finite, explicitly describable arrangements of the five unit squares whose side lengths can be computed exactly from the geometry.","pith_extraction_headline":"The largest square coverable by n unit squares has the same size for full covering and boundary covering when n is at most 4, but the sizes differ when n equals 5."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.16535/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2e08bb1318ba50dd014633b50cf863068cde16da65b92f9a26497f8a8e9b302a"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.16535","created_at":"2026-06-01T01:02:30.131659+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.16535v3","created_at":"2026-06-01T01:02:30.131659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16535","created_at":"2026-06-01T01:02:30.131659+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMOWETUMZA2Q","created_at":"2026-06-01T01:02:30.131659+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMOWETUMZA2QPVGI","created_at":"2026-06-01T01:02:30.131659+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMOWETUM","created_at":"2026-06-01T01:02:30.131659+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C","json":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C.json","graph_json":"https://pith.science/api/pith-number/SMOWETUMZA2QPVGIGEHOHG234C/graph.json","events_json":"https://pith.science/api/pith-number/SMOWETUMZA2QPVGIGEHOHG234C/events.json","paper":"https://pith.science/paper/SMOWETUM"},"agent_actions":{"view_html":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C","download_json":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C.json","view_paper":"https://pith.science/paper/SMOWETUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.16535&json=true","fetch_graph":"https://pith.science/api/pith-number/SMOWETUMZA2QPVGIGEHOHG234C/graph.json","fetch_events":"https://pith.science/api/pith-number/SMOWETUMZA2QPVGIGEHOHG234C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/action/storage_attestation","attest_author":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/action/author_attestation","sign_citation":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/action/citation_signature","submit_replication":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/action/replication_record"}},"created_at":"2026-06-01T01:02:30.131659+00:00","updated_at":"2026-06-01T01:02:30.131659+00:00"}