{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SMOWETUMZA2QPVGIGEHOHG234C","short_pith_number":"pith:SMOWETUM","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"},"canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","source":{"kind":"arxiv","id":"2601.16535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.16535","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.16535v3","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16535","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"SMOWETUMZA2Q","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_16","alias_value":"SMOWETUMZA2QPVGI","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_8","alias_value":"SMOWETUM","created_at":"2026-06-01T01:02:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SMOWETUMZA2QPVGIGEHOHG234C","target":"record","payload":{"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"},"canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","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"},"source_kind":"arxiv","source_id":"2601.16535","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu5mS8cR2hHwc84DjaLanedF08XTY89QfIR0EoyCRS/lc1nfqlc6PZPpUzrmpZUYVzIWcjElVm1fsL1tmMJIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:21:38.222705Z"},"content_sha256":"a0beb341ef828080102974c211602636ccfdbb0484ba90d642aebff0c4d3da75","schema_version":"1.0","event_id":"sha256:a0beb341ef828080102974c211602636ccfdbb0484ba90d642aebff0c4d3da75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SMOWETUMZA2QPVGIGEHOHG234C","target":"graph","payload":{"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"},"verdict_id":"ef2df909-d029-4c7e-a991-471f282dda57"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/c62lTWGa7lLerjZ4C30iSTa8b1dEEswSvCqnmTWi4BF9U7r8Zkgm6RkcbMqTZZFZciABQ85VsFoFy+02lZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:21:38.223270Z"},"content_sha256":"dcae68782e520f4d0f6551c422c551ca51c2e6a872332dcba825b5531d757a04","schema_version":"1.0","event_id":"sha256:dcae68782e520f4d0f6551c422c551ca51c2e6a872332dcba825b5531d757a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/bundle.json","state_url":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMOWETUMZA2QPVGIGEHOHG234C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T07:21:38Z","links":{"resolver":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C","bundle":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/bundle.json","state":"https://pith.science/pith/SMOWETUMZA2QPVGIGEHOHG234C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMOWETUMZA2QPVGIGEHOHG234C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SMOWETUMZA2QPVGIGEHOHG234C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a056980cfeda69eeaa3309b5b68d8e7eec767dc1511e1beb702cdb80460b3419","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-01-23T08:11:17Z","title_canon_sha256":"388db6f832ef155f9e8ead88c91c88d9176b3dd153505a65155227b64e6f3369"},"schema_version":"1.0","source":{"id":"2601.16535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.16535","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.16535v3","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16535","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"SMOWETUMZA2Q","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_16","alias_value":"SMOWETUMZA2QPVGI","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_8","alias_value":"SMOWETUM","created_at":"2026-06-01T01:02:30Z"}],"graph_snapshots":[{"event_id":"sha256:dcae68782e520f4d0f6551c422c551ca51c2e6a872332dcba825b5531d757a04","target":"graph","created_at":"2026-06-01T01:02:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"4e6ca389c4e6f7e0ce6feac6e8ca8914b4262b1c3c0bcf153088892525015a78"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2e08bb1318ba50dd014633b50cf863068cde16da65b92f9a26497f8a8e9b302a"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.16535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Gy\\\"orgy D\\'osa, Zsolt L\\'angi, Zsolt Tuza","cross_cats":[],"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-01-23T08:11:17Z","title":"Covering a square by congruent squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.16535","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T12:16:18.575716Z","id":"ef2df909-d029-4c7e-a991-471f282dda57","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"ef2df909-d029-4c7e-a991-471f282dda57"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0beb341ef828080102974c211602636ccfdbb0484ba90d642aebff0c4d3da75","target":"record","created_at":"2026-06-01T01:02:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a056980cfeda69eeaa3309b5b68d8e7eec767dc1511e1beb702cdb80460b3419","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-01-23T08:11:17Z","title_canon_sha256":"388db6f832ef155f9e8ead88c91c88d9176b3dd153505a65155227b64e6f3369"},"schema_version":"1.0","source":{"id":"2601.16535","kind":"arxiv","version":3}},"canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"931d624e8cc83507d4c8310ee39b5be0bf41780177546827cf19554acf025eb7","first_computed_at":"2026-06-01T01:02:30.131570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:30.131570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wXwiPsiIizmWfeIpIG/+aorcmXhCZUe8/SGipQy3JjuFmn3I2AHI0RLQGs0vEC+bQ4H3n15gOJLrZ0dZDKCDg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:30.132308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.16535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0beb341ef828080102974c211602636ccfdbb0484ba90d642aebff0c4d3da75","sha256:dcae68782e520f4d0f6551c422c551ca51c2e6a872332dcba825b5531d757a04"],"state_sha256":"9879b27e50ffc915c94ccfa1d2001009a2ef8c87f22e688022b38f75d7d1cca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nSg3LenmcsbcT/cxVZ3u37svlqU5h4dkhkrWtcSghvw5c2Y5Tr9Qm8VXPRDfWN1DF7gvqG3s5071mwE/KhJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:21:38.225979Z","bundle_sha256":"b20dd0abd84376d71b6d2bfce14575e34649e23508b70ce2f166c74a9094ef5a"}}