{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EM6BXB4TYKWX7QMJFP43CLN5OD","short_pith_number":"pith:EM6BXB4T","canonical_record":{"source":{"id":"1606.03746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T18:17:20Z","cross_cats_sorted":[],"title_canon_sha256":"20bb6f5bb3f813a0280b5ab7521bcad44662432e05ba2e235dee503cd9f09585","abstract_canon_sha256":"62431fac541db74b051cee5f0f9447f82bc37e1d3a33ee7bd683e890ab97c850"},"schema_version":"1.0"},"canonical_sha256":"233c1b8793c2ad7fc1892bf9b12dbd70fe867901eacdd20d32c8de720c1c7e1d","source":{"kind":"arxiv","id":"1606.03746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03746","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03746v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03746","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"EM6BXB4TYKWX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EM6BXB4TYKWX7QMJ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EM6BXB4T","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EM6BXB4TYKWX7QMJFP43CLN5OD","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T18:17:20Z","cross_cats_sorted":[],"title_canon_sha256":"20bb6f5bb3f813a0280b5ab7521bcad44662432e05ba2e235dee503cd9f09585","abstract_canon_sha256":"62431fac541db74b051cee5f0f9447f82bc37e1d3a33ee7bd683e890ab97c850"},"schema_version":"1.0"},"canonical_sha256":"233c1b8793c2ad7fc1892bf9b12dbd70fe867901eacdd20d32c8de720c1c7e1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:33.154988Z","signature_b64":"aC8beR++MejeTMLuCch8Of01BTbQGAzmJR1J52InTZhPJzd0CEPAfb6OIwFujZtHHq1+6N183ZHsEChLHAu7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233c1b8793c2ad7fc1892bf9b12dbd70fe867901eacdd20d32c8de720c1c7e1d","last_reissued_at":"2026-05-18T01:12:33.154338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:33.154338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03746","source_version":1,"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-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBzzgzcP887W1b1LhaPFEfMZ+aQLl6tZ02ssDyp2Hw9tJ2exSF8IfAsvFaZJAawLo7CZCC/xBUOSfAqnCKdwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:36:10.804884Z"},"content_sha256":"6aa3b8abf6ed6971a2daa8b93e01fac985765d6562117002c77c1e43e1f081ad","schema_version":"1.0","event_id":"sha256:6aa3b8abf6ed6971a2daa8b93e01fac985765d6562117002c77c1e43e1f081ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EM6BXB4TYKWX7QMJFP43CLN5OD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Packings of 22 and 33 Unit Squares in a Square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wolfram Bentz","submitted_at":"2016-06-12T18:17:20Z","abstract_excerpt":"Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results strongly suggest that $s(m^2-3)=m$ for $m\\ge 3$, in particular for the values $m=5,6$, which correspond to cases that lie in between the previous results.\n  In this article we show that indeed $s(m^2-3)=m$ for $m=5,6$, implying that the most efficient packings of 22 and 33 squares are the trivial ones. To achieve our results, we modify the well-known method of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03746","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBi6OABzzCLIgqs8ThIZEwwJkUYRBMmiLa8NL6KbjDwI/dmCGDlMlxxn3zBLmK7W9pB/oy1t7lMrgi2u8XmkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:36:10.805576Z"},"content_sha256":"fa4ebe923db7a7da2eaf7e6e4d467a1e2112bd36671b28f13187192b39908ac7","schema_version":"1.0","event_id":"sha256:fa4ebe923db7a7da2eaf7e6e4d467a1e2112bd36671b28f13187192b39908ac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/bundle.json","state_url":"https://pith.science/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/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-12T02:36:10Z","links":{"resolver":"https://pith.science/pith/EM6BXB4TYKWX7QMJFP43CLN5OD","bundle":"https://pith.science/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/bundle.json","state":"https://pith.science/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EM6BXB4TYKWX7QMJFP43CLN5OD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EM6BXB4TYKWX7QMJFP43CLN5OD","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":"62431fac541db74b051cee5f0f9447f82bc37e1d3a33ee7bd683e890ab97c850","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T18:17:20Z","title_canon_sha256":"20bb6f5bb3f813a0280b5ab7521bcad44662432e05ba2e235dee503cd9f09585"},"schema_version":"1.0","source":{"id":"1606.03746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03746","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03746v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03746","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"EM6BXB4TYKWX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EM6BXB4TYKWX7QMJ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EM6BXB4T","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:fa4ebe923db7a7da2eaf7e6e4d467a1e2112bd36671b28f13187192b39908ac7","target":"graph","created_at":"2026-05-18T01:12:33Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results strongly suggest that $s(m^2-3)=m$ for $m\\ge 3$, in particular for the values $m=5,6$, which correspond to cases that lie in between the previous results.\n  In this article we show that indeed $s(m^2-3)=m$ for $m=5,6$, implying that the most efficient packings of 22 and 33 squares are the trivial ones. To achieve our results, we modify the well-known method of ","authors_text":"Wolfram Bentz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T18:17:20Z","title":"Optimal Packings of 22 and 33 Unit Squares in a Square"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03746","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6aa3b8abf6ed6971a2daa8b93e01fac985765d6562117002c77c1e43e1f081ad","target":"record","created_at":"2026-05-18T01:12:33Z","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":"62431fac541db74b051cee5f0f9447f82bc37e1d3a33ee7bd683e890ab97c850","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T18:17:20Z","title_canon_sha256":"20bb6f5bb3f813a0280b5ab7521bcad44662432e05ba2e235dee503cd9f09585"},"schema_version":"1.0","source":{"id":"1606.03746","kind":"arxiv","version":1}},"canonical_sha256":"233c1b8793c2ad7fc1892bf9b12dbd70fe867901eacdd20d32c8de720c1c7e1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"233c1b8793c2ad7fc1892bf9b12dbd70fe867901eacdd20d32c8de720c1c7e1d","first_computed_at":"2026-05-18T01:12:33.154338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:33.154338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aC8beR++MejeTMLuCch8Of01BTbQGAzmJR1J52InTZhPJzd0CEPAfb6OIwFujZtHHq1+6N183ZHsEChLHAu7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:33.154988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa3b8abf6ed6971a2daa8b93e01fac985765d6562117002c77c1e43e1f081ad","sha256:fa4ebe923db7a7da2eaf7e6e4d467a1e2112bd36671b28f13187192b39908ac7"],"state_sha256":"b2bb88ccb6670a17dcd014d1e42b4e28c27b0fe61cafdfd1cf2600c8d98d28bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2S3Xjfnvw/3dXykChxm6j3omgmUvStT8t9iFiqUOrZ1uovPskGozHbdsGBZtNWOfJe8GRsXYbGNrOgDGNtjXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:36:10.809476Z","bundle_sha256":"7854cacf69cce6f40c464e71b282b622636f21ddcd8d55a7641321d846089137"}}