{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KGQULWCPHJCU7PYDTQUNAVNJN6","short_pith_number":"pith:KGQULWCP","schema_version":"1.0","canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","source":{"kind":"arxiv","id":"1401.0108","version":4},"attestation_state":"computed","paper":{"title":"On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","submitted_at":"2013-12-31T07:54:16Z","abstract_excerpt":"In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \\cite{croft91,tutte69} in the 1960s by Dumitrescu and T{\\'o}th \\cite{adriancasaba2011}. The puzzle has been popularized of late by Peter Winkler \\cite{Winkler2007}. Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. The problem is to construct $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each rectangle coincides with a point in $P_{n}$ and the total area covered by the rectangles is maximized. We would "},"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":"1401.0108","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-31T07:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"9820d89f30b4b14b6f4f8aa99b41a270b89ad1990aa751d552718a95c7c3a835","abstract_canon_sha256":"83d73b25d81d534c22f2795c4cd6aa4b18fd772e605b4e74d7089113b6584275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.538856Z","signature_b64":"urgEg5Fx9c102WbFHKofS+0pH/AioAMZXfyN1wnkcBKDQDdlk86S3iTpmAZPgODmY/Ad2DcjKQPQHzBgn6NMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","last_reissued_at":"2026-05-18T02:53:07.538170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.538170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","submitted_at":"2013-12-31T07:54:16Z","abstract_excerpt":"In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \\cite{croft91,tutte69} in the 1960s by Dumitrescu and T{\\'o}th \\cite{adriancasaba2011}. The puzzle has been popularized of late by Peter Winkler \\cite{Winkler2007}. Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. The problem is to construct $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each rectangle coincides with a point in $P_{n}$ and the total area covered by the rectangles is maximized. We would "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0108","kind":"arxiv","version":4},"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":"1401.0108","created_at":"2026-05-18T02:53:07.538277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0108v4","created_at":"2026-05-18T02:53:07.538277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0108","created_at":"2026-05-18T02:53:07.538277+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGQULWCPHJCU","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGQULWCPHJCU7PYD","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGQULWCP","created_at":"2026-05-18T12:27:49.015174+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/KGQULWCPHJCU7PYDTQUNAVNJN6","json":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6.json","graph_json":"https://pith.science/api/pith-number/KGQULWCPHJCU7PYDTQUNAVNJN6/graph.json","events_json":"https://pith.science/api/pith-number/KGQULWCPHJCU7PYDTQUNAVNJN6/events.json","paper":"https://pith.science/paper/KGQULWCP"},"agent_actions":{"view_html":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6","download_json":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6.json","view_paper":"https://pith.science/paper/KGQULWCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0108&json=true","fetch_graph":"https://pith.science/api/pith-number/KGQULWCPHJCU7PYDTQUNAVNJN6/graph.json","fetch_events":"https://pith.science/api/pith-number/KGQULWCPHJCU7PYDTQUNAVNJN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/action/storage_attestation","attest_author":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/action/author_attestation","sign_citation":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/action/citation_signature","submit_replication":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/action/replication_record"}},"created_at":"2026-05-18T02:53:07.538277+00:00","updated_at":"2026-05-18T02:53:07.538277+00:00"}