{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVETRGJLIXCSQJGHV63SUSEHPL","short_pith_number":"pith:FVETRGJL","canonical_record":{"source":{"id":"1806.09562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-25T16:51:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c10675fb208a6f482ec6531433f5ed71fe0676faaca4adce4999684baf511142","abstract_canon_sha256":"c7ebf631673c384e54bd98274d046e12b30714145875414e7c073a79126aec4c"},"schema_version":"1.0"},"canonical_sha256":"2d4938992b45c52824c7afb72a48877ad98f538ff287a383738367306e6deed5","source":{"kind":"arxiv","id":"1806.09562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09562","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09562v1","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09562","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"FVETRGJLIXCS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVETRGJLIXCSQJGH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVETRGJL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVETRGJLIXCSQJGHV63SUSEHPL","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-25T16:51:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c10675fb208a6f482ec6531433f5ed71fe0676faaca4adce4999684baf511142","abstract_canon_sha256":"c7ebf631673c384e54bd98274d046e12b30714145875414e7c073a79126aec4c"},"schema_version":"1.0"},"canonical_sha256":"2d4938992b45c52824c7afb72a48877ad98f538ff287a383738367306e6deed5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:25.439483Z","signature_b64":"6TmJw9Xxu4HTSIx2EukEMbxnL2AzOFPYLiUA8hCAaf72gQhKY0VJtLhcRIbn94IXMttFaDrfuSrpK/qwomvSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4938992b45c52824c7afb72a48877ad98f538ff287a383738367306e6deed5","last_reissued_at":"2026-05-18T00:12:25.439032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:25.439032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09562","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-18T00:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfmkSszpwY/s3iDI9vuRtvcMq8pd2vW+vBL2+I7meKCQ+6qUGcTO25BEFS2sF1yAEJaV1hTrVQ/hnISdPJKvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:48.499014Z"},"content_sha256":"ffa3f8e42d31c40bbb276b1258cdb92a075886672f68c2d11b5b40ca5336e01d","schema_version":"1.0","event_id":"sha256:ffa3f8e42d31c40bbb276b1258cdb92a075886672f68c2d11b5b40ca5336e01d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVETRGJLIXCSQJGHV63SUSEHPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Area Axis-Aligned Square Packings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, David Stalfa, Hugo A. Akitaya, Matthew D. Jones","submitted_at":"2018-06-25T16:51:34Z","abstract_excerpt":"Given a point set $S=\\{s_1,\\ldots , s_n\\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set of points that may be covered by such a packing, that is, the union of all empty squares anchored at points in $S$. It is shown that area$(R(S))\\geq \\frac12$ for every finite set $S\\subset U$, and this bound is the best possible. The region $R(S)$ can be computed in $O(n\\log n)$ time. Finally, we prove that finding a maximum area anchored square packing is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09562","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-18T00:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Icpf2npqmjDDXU2ci5heOgujgLCgBQt/L1B3UZzHYA0KJYQOD+/NHXqotYAR3GhqA9UgoAH6qRijGakjetY5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:48.499368Z"},"content_sha256":"1c5754c342bd6e5f21d1c8f443a9dcca9ccacb486ed69dccf41ec323d95a10c8","schema_version":"1.0","event_id":"sha256:1c5754c342bd6e5f21d1c8f443a9dcca9ccacb486ed69dccf41ec323d95a10c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVETRGJLIXCSQJGHV63SUSEHPL/bundle.json","state_url":"https://pith.science/pith/FVETRGJLIXCSQJGHV63SUSEHPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVETRGJLIXCSQJGHV63SUSEHPL/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-05-28T03:58:48Z","links":{"resolver":"https://pith.science/pith/FVETRGJLIXCSQJGHV63SUSEHPL","bundle":"https://pith.science/pith/FVETRGJLIXCSQJGHV63SUSEHPL/bundle.json","state":"https://pith.science/pith/FVETRGJLIXCSQJGHV63SUSEHPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVETRGJLIXCSQJGHV63SUSEHPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVETRGJLIXCSQJGHV63SUSEHPL","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":"c7ebf631673c384e54bd98274d046e12b30714145875414e7c073a79126aec4c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-25T16:51:34Z","title_canon_sha256":"c10675fb208a6f482ec6531433f5ed71fe0676faaca4adce4999684baf511142"},"schema_version":"1.0","source":{"id":"1806.09562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09562","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09562v1","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09562","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"FVETRGJLIXCS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVETRGJLIXCSQJGH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVETRGJL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:1c5754c342bd6e5f21d1c8f443a9dcca9ccacb486ed69dccf41ec323d95a10c8","target":"graph","created_at":"2026-05-18T00:12:25Z","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":"Given a point set $S=\\{s_1,\\ldots , s_n\\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set of points that may be covered by such a packing, that is, the union of all empty squares anchored at points in $S$. It is shown that area$(R(S))\\geq \\frac12$ for every finite set $S\\subset U$, and this bound is the best possible. The region $R(S)$ can be computed in $O(n\\log n)$ time. Finally, we prove that finding a maximum area anchored square packing is ","authors_text":"Csaba D. T\\'oth, David Stalfa, Hugo A. Akitaya, Matthew D. Jones","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-25T16:51:34Z","title":"Maximum Area Axis-Aligned Square Packings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09562","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:ffa3f8e42d31c40bbb276b1258cdb92a075886672f68c2d11b5b40ca5336e01d","target":"record","created_at":"2026-05-18T00:12:25Z","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":"c7ebf631673c384e54bd98274d046e12b30714145875414e7c073a79126aec4c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-25T16:51:34Z","title_canon_sha256":"c10675fb208a6f482ec6531433f5ed71fe0676faaca4adce4999684baf511142"},"schema_version":"1.0","source":{"id":"1806.09562","kind":"arxiv","version":1}},"canonical_sha256":"2d4938992b45c52824c7afb72a48877ad98f538ff287a383738367306e6deed5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d4938992b45c52824c7afb72a48877ad98f538ff287a383738367306e6deed5","first_computed_at":"2026-05-18T00:12:25.439032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:25.439032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TmJw9Xxu4HTSIx2EukEMbxnL2AzOFPYLiUA8hCAaf72gQhKY0VJtLhcRIbn94IXMttFaDrfuSrpK/qwomvSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:25.439483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffa3f8e42d31c40bbb276b1258cdb92a075886672f68c2d11b5b40ca5336e01d","sha256:1c5754c342bd6e5f21d1c8f443a9dcca9ccacb486ed69dccf41ec323d95a10c8"],"state_sha256":"eede5a3b926692f458a3f23ec9b0e7af67ab861b79a546eb807e4cfbcc6cda12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWAz+LLbovzMYM9quXSomYQL9zcvAcBrXjxFvZsY/RxB2Pg5dskJn3zs039qNZ1xbbikQh0QpFS0/j5juNc9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:58:48.501396Z","bundle_sha256":"b9d24fff9df9e3779dce9e524006dbbf34b79fbb085ea69a6cf099e6fc03722f"}}