{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CEPNKXLHAQBRUSJGIYVQ44HMMN","short_pith_number":"pith:CEPNKXLH","schema_version":"1.0","canonical_sha256":"111ed55d6704031a4926462b0e70ec637cddf363b93a03adac89033b48967723","source":{"kind":"arxiv","id":"1906.11948","version":1},"attestation_state":"computed","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 $"},"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":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.11948","created_at":"2026-05-17T23:42:01.509774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11948v1","created_at":"2026-05-17T23:42:01.509774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11948","created_at":"2026-05-17T23:42:01.509774+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEPNKXLHAQBR","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEPNKXLHAQBRUSJG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEPNKXLH","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN","json":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN.json","graph_json":"https://pith.science/api/pith-number/CEPNKXLHAQBRUSJGIYVQ44HMMN/graph.json","events_json":"https://pith.science/api/pith-number/CEPNKXLHAQBRUSJGIYVQ44HMMN/events.json","paper":"https://pith.science/paper/CEPNKXLH"},"agent_actions":{"view_html":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN","download_json":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN.json","view_paper":"https://pith.science/paper/CEPNKXLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11948&json=true","fetch_graph":"https://pith.science/api/pith-number/CEPNKXLHAQBRUSJGIYVQ44HMMN/graph.json","fetch_events":"https://pith.science/api/pith-number/CEPNKXLHAQBRUSJGIYVQ44HMMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/action/storage_attestation","attest_author":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/action/author_attestation","sign_citation":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/action/citation_signature","submit_replication":"https://pith.science/pith/CEPNKXLHAQBRUSJGIYVQ44HMMN/action/replication_record"}},"created_at":"2026-05-17T23:42:01.509774+00:00","updated_at":"2026-05-17T23:42:01.509774+00:00"}