{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HZJT3Y6LHIDF677OUBRNFGV3RD","short_pith_number":"pith:HZJT3Y6L","schema_version":"1.0","canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","source":{"kind":"arxiv","id":"1310.8403","version":3},"attestation_state":"computed","paper":{"title":"An Existential Proof of the Conjecture on Packing Anchored Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","submitted_at":"2013-10-31T06:55:05Z","abstract_excerpt":"Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $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 \\cite{ibmpuzzle}, \\cite{Winkler2007}, \\cite{Winkler2010a}, \\cite{Winkler2010b}. The longstanding conjecture has been that at least half of $U$ can be covered when such rectangles are properly placed. In this paper, we give an existential proof of the conjecture."},"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":"1310.8403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-31T06:55:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a5cd0454f3d6105301167f54b98dfbdbdd8268b07dd2faa2c1826e87dd08e8fd","abstract_canon_sha256":"3272873d77b690634c19a4ecc023ac9846b87fdadcf98b28919edc8995f001e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.860661Z","signature_b64":"Ued05AD1jr19ZUgIkqLSqv56mJ2d3gAUEW+Si6vS08k4P0OPquW1SCKcL68/R0lsfRrzKOjxnrmHYoAodF1XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","last_reissued_at":"2026-05-18T02:53:07.860067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.860067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Existential Proof of the Conjecture on Packing Anchored Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","submitted_at":"2013-10-31T06:55:05Z","abstract_excerpt":"Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $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 \\cite{ibmpuzzle}, \\cite{Winkler2007}, \\cite{Winkler2010a}, \\cite{Winkler2010b}. The longstanding conjecture has been that at least half of $U$ can be covered when such rectangles are properly placed. In this paper, we give an existential proof of the conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8403","kind":"arxiv","version":3},"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":"1310.8403","created_at":"2026-05-18T02:53:07.860156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.8403v3","created_at":"2026-05-18T02:53:07.860156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8403","created_at":"2026-05-18T02:53:07.860156+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZJT3Y6LHIDF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZJT3Y6LHIDF677O","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZJT3Y6L","created_at":"2026-05-18T12:27:46.883200+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/HZJT3Y6LHIDF677OUBRNFGV3RD","json":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD.json","graph_json":"https://pith.science/api/pith-number/HZJT3Y6LHIDF677OUBRNFGV3RD/graph.json","events_json":"https://pith.science/api/pith-number/HZJT3Y6LHIDF677OUBRNFGV3RD/events.json","paper":"https://pith.science/paper/HZJT3Y6L"},"agent_actions":{"view_html":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD","download_json":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD.json","view_paper":"https://pith.science/paper/HZJT3Y6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.8403&json=true","fetch_graph":"https://pith.science/api/pith-number/HZJT3Y6LHIDF677OUBRNFGV3RD/graph.json","fetch_events":"https://pith.science/api/pith-number/HZJT3Y6LHIDF677OUBRNFGV3RD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/action/storage_attestation","attest_author":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/action/author_attestation","sign_citation":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/action/citation_signature","submit_replication":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/action/replication_record"}},"created_at":"2026-05-18T02:53:07.860156+00:00","updated_at":"2026-05-18T02:53:07.860156+00:00"}