{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HZJT3Y6LHIDF677OUBRNFGV3RD","short_pith_number":"pith:HZJT3Y6L","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"},"canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","source":{"kind":"arxiv","id":"1310.8403","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8403","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8403v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8403","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"HZJT3Y6LHIDF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HZJT3Y6LHIDF677O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HZJT3Y6L","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HZJT3Y6LHIDF677OUBRNFGV3RD","target":"record","payload":{"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"},"canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","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"},"source_kind":"arxiv","source_id":"1310.8403","source_version":3,"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NjYOUloT6nUR/f4W821q/Hd4qDnKSCRBEbgPhca1M0S3q0WtPhaD+205BqJjiypByfIRwRNi5bOSwMxszW5HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:24.289688Z"},"content_sha256":"330e2ce4d8bd6e7ca439fd800d15ca5c15ceebf49e706333ced3c8590dbeca06","schema_version":"1.0","event_id":"sha256:330e2ce4d8bd6e7ca439fd800d15ca5c15ceebf49e706333ced3c8590dbeca06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HZJT3Y6LHIDF677OUBRNFGV3RD","target":"graph","payload":{"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"},"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZPwE340oSJ4QU9YS7mReWM2tjLWQvXgARqDLg0tKmGurWJzNKcK/5zJxFAu1mNqM9fnvyW/pznO7gKn6tNjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:24.290031Z"},"content_sha256":"ba1438605573ca2c3f94cb2dec77c4d75db0eefa192c824b1e718590d3d29e0b","schema_version":"1.0","event_id":"sha256:ba1438605573ca2c3f94cb2dec77c4d75db0eefa192c824b1e718590d3d29e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/bundle.json","state_url":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/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-06-25T00:04:24Z","links":{"resolver":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD","bundle":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/bundle.json","state":"https://pith.science/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZJT3Y6LHIDF677OUBRNFGV3RD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HZJT3Y6LHIDF677OUBRNFGV3RD","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":"3272873d77b690634c19a4ecc023ac9846b87fdadcf98b28919edc8995f001e7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-31T06:55:05Z","title_canon_sha256":"a5cd0454f3d6105301167f54b98dfbdbdd8268b07dd2faa2c1826e87dd08e8fd"},"schema_version":"1.0","source":{"id":"1310.8403","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8403","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8403v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8403","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"HZJT3Y6LHIDF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HZJT3Y6LHIDF677O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HZJT3Y6L","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ba1438605573ca2c3f94cb2dec77c4d75db0eefa192c824b1e718590d3d29e0b","target":"graph","created_at":"2026-05-18T02:53:07Z","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":"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.","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-31T06:55:05Z","title":"An Existential Proof of the Conjecture on Packing Anchored Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8403","kind":"arxiv","version":3},"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:330e2ce4d8bd6e7ca439fd800d15ca5c15ceebf49e706333ced3c8590dbeca06","target":"record","created_at":"2026-05-18T02:53:07Z","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":"3272873d77b690634c19a4ecc023ac9846b87fdadcf98b28919edc8995f001e7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-31T06:55:05Z","title_canon_sha256":"a5cd0454f3d6105301167f54b98dfbdbdd8268b07dd2faa2c1826e87dd08e8fd"},"schema_version":"1.0","source":{"id":"1310.8403","kind":"arxiv","version":3}},"canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e533de3cb3a065f7feea062d29abb88f854d1fc05b590c4521e5a441fbe766a","first_computed_at":"2026-05-18T02:53:07.860067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.860067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ued05AD1jr19ZUgIkqLSqv56mJ2d3gAUEW+Si6vS08k4P0OPquW1SCKcL68/R0lsfRrzKOjxnrmHYoAodF1XDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.860661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8403","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:330e2ce4d8bd6e7ca439fd800d15ca5c15ceebf49e706333ced3c8590dbeca06","sha256:ba1438605573ca2c3f94cb2dec77c4d75db0eefa192c824b1e718590d3d29e0b"],"state_sha256":"45856f8644d821ea9ac69ae52d4304d53ad487704cfee0aedb543c2669e3ac43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qy5lod9T5QikHMUF1fQ6V0Nk0imyco+POTydYEaCQz7eJLJBYBv4JrYUScJ5IBjqfn2FaFDExQy4W7Fq7iTLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T00:04:24.291923Z","bundle_sha256":"b2c021573f81f86106b7b2bfbd32c5c3f31d98399d362244e06f6a663be924c5"}}