{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CEPNKXLHAQBRUSJGIYVQ44HMMN","short_pith_number":"pith:CEPNKXLH","canonical_record":{"source":{"id":"1906.11948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-27T20:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"513509e10fb160a1060ccb4b811a54c9ca171b88f41f993b3caf12e6f910b7f5","abstract_canon_sha256":"f5fcdd96150f997a048a9de2307da767bfc3b9a7675b06f4d515fd02a931bd8a"},"schema_version":"1.0"},"canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","source":{"kind":"arxiv","id":"1906.11948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11948","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11948v1","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11948","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"pith_short_12","alias_value":"CEPNKXLHAQBR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CEPNKXLHAQBRUSJG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CEPNKXLH","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CEPNKXLHAQBRUSJGIYVQ44HMMN","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-27T20:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"513509e10fb160a1060ccb4b811a54c9ca171b88f41f993b3caf12e6f910b7f5","abstract_canon_sha256":"f5fcdd96150f997a048a9de2307da767bfc3b9a7675b06f4d515fd02a931bd8a"},"schema_version":"1.0"},"canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:01.510339Z","signature_b64":"uwiMR4WwWgnBhxZ8AGrd6jVCMiSww+nQhq7E7qhJSGYmdzUqPxcSFpOLhGUNkAAqssPH6wcckFdVU3zShr5PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","last_reissued_at":"2026-05-17T23:42:01.509686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:01.509686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11948","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-17T23:42:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3MkWKgTYuLOFMpLcmmQZWmuQ8TJjWsPCo2IASBq3UBQss/92vdbYzHQLz+KlIGcakW9gG71FTuH9PGgIIqRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:52:06.355261Z"},"content_sha256":"cebc53e6a249a9afe7b470de723306b6b8b73200b8696b17c42b7fc9de6b1914","schema_version":"1.0","event_id":"sha256:cebc53e6a249a9afe7b470de723306b6b8b73200b8696b17c42b7fc9de6b1914"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CEPNKXLHAQBRUSJGIYVQ44HMMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing Boundary-Anchored Rectangles and Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi, Therese Biedl","submitted_at":"2019-06-27T20:29:50Z","abstract_excerpt":"Consider a set $P$ of $n$ points on the boundary of an axis-aligned square $Q$. We study the boundary-anchored packing problem on $P$ in which the goal is to find a set of interior-disjoint axis-aligned rectangles in $Q$ such that each rectangle is anchored (has a corner at some point in $P$), each point in $P$ is used to anchor at most one rectangle, and the total area of the rectangles is maximized. Here, a rectangle is anchored at a point $p$ in $P$ if one of its corners coincides with $p$. In this paper, we show how to solve this problem in time linear in $n$, provided that the points of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11948","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-17T23:42:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a01ZxKhFl7H/Z+gz8gnEkWGCMOUEG3U1FO2Mm2F3IHnIcP3mpJdYSlxYXGdB1rd1yem3QjVgVLMRdcc62AawDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:52:06.355771Z"},"content_sha256":"552ee5a45861bdaca72546613925b614e9b06e3ac367f4ee1971376f364ef594","schema_version":"1.0","event_id":"sha256:552ee5a45861bdaca72546613925b614e9b06e3ac367f4ee1971376f364ef594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/bundle.json","state_url":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/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-31T01:52:06Z","links":{"resolver":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN","bundle":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/bundle.json","state":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CEPNKXLHAQBRUSJGIYVQ44HMMN","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":"f5fcdd96150f997a048a9de2307da767bfc3b9a7675b06f4d515fd02a931bd8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-27T20:29:50Z","title_canon_sha256":"513509e10fb160a1060ccb4b811a54c9ca171b88f41f993b3caf12e6f910b7f5"},"schema_version":"1.0","source":{"id":"1906.11948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11948","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11948v1","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11948","created_at":"2026-05-17T23:42:01Z"},{"alias_kind":"pith_short_12","alias_value":"CEPNKXLHAQBR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CEPNKXLHAQBRUSJG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CEPNKXLH","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:552ee5a45861bdaca72546613925b614e9b06e3ac367f4ee1971376f364ef594","target":"graph","created_at":"2026-05-17T23:42:01Z","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":"Consider a set $P$ of $n$ points on the boundary of an axis-aligned square $Q$. We study the boundary-anchored packing problem on $P$ in which the goal is to find a set of interior-disjoint axis-aligned rectangles in $Q$ such that each rectangle is anchored (has a corner at some point in $P$), each point in $P$ is used to anchor at most one rectangle, and the total area of the rectangles is maximized. Here, a rectangle is anchored at a point $p$ in $P$ if one of its corners coincides with $p$. In this paper, we show how to solve this problem in time linear in $n$, provided that the points of $","authors_text":"Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-27T20:29:50Z","title":"Packing Boundary-Anchored Rectangles and Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11948","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:cebc53e6a249a9afe7b470de723306b6b8b73200b8696b17c42b7fc9de6b1914","target":"record","created_at":"2026-05-17T23:42:01Z","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":"f5fcdd96150f997a048a9de2307da767bfc3b9a7675b06f4d515fd02a931bd8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-27T20:29:50Z","title_canon_sha256":"513509e10fb160a1060ccb4b811a54c9ca171b88f41f993b3caf12e6f910b7f5"},"schema_version":"1.0","source":{"id":"1906.11948","kind":"arxiv","version":1}},"canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","first_computed_at":"2026-05-17T23:42:01.509686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:01.509686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwiMR4WwWgnBhxZ8AGrd6jVCMiSww+nQhq7E7qhJSGYmdzUqPxcSFpOLhGUNkAAqssPH6wcckFdVU3zShr5PBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:01.510339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cebc53e6a249a9afe7b470de723306b6b8b73200b8696b17c42b7fc9de6b1914","sha256:552ee5a45861bdaca72546613925b614e9b06e3ac367f4ee1971376f364ef594"],"state_sha256":"94a41225e195ff79290188d2aa761a1765da0758dee5aaa4a3191dd8bdccd998"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYTnPlO3ftFDBXF9ctSxrRMqpeQcDAbL6e2kAomESjL5d7A0s/C+LcfcuiLSkjraJTVszbwhiIa/iqCL3vn9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:52:06.360083Z","bundle_sha256":"dde713766a8af4b6084038146c71f7ba8976f40976927c12fd34ceeeff616136"}}