{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KGQULWCPHJCU7PYDTQUNAVNJN6","short_pith_number":"pith:KGQULWCP","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"},"canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","source":{"kind":"arxiv","id":"1401.0108","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0108","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0108v4","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0108","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"KGQULWCPHJCU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KGQULWCPHJCU7PYD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KGQULWCP","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KGQULWCPHJCU7PYDTQUNAVNJN6","target":"record","payload":{"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"},"canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","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"},"source_kind":"arxiv","source_id":"1401.0108","source_version":4,"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":"UcuCaJayZz4ggh5KKxFISZXoQu8IbO1K3vnbuVFuR5DiGV0tfsI4FAjKVOsOE1J+K9oeqKUGmKjsqIbmIYntAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:21:51.559135Z"},"content_sha256":"59f27ff72043b6f8ee08934dab20655e3db1df2ca94b1333800233a270317421","schema_version":"1.0","event_id":"sha256:59f27ff72043b6f8ee08934dab20655e3db1df2ca94b1333800233a270317421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KGQULWCPHJCU7PYDTQUNAVNJN6","target":"graph","payload":{"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"},"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":"UaEShLE9L/Pg1+ZNScGlMVm2vgY+rZ3vVqNYhG7RsxUMbSCVKDhGb3ESOQSTiC0+qKT8CXtwMIItPBPeOIvzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:21:51.559513Z"},"content_sha256":"49fc8f82422a7e19a765191eb3f997da6af3f55785986355bd0a53910511184e","schema_version":"1.0","event_id":"sha256:49fc8f82422a7e19a765191eb3f997da6af3f55785986355bd0a53910511184e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/bundle.json","state_url":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/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-25T02:21:51Z","links":{"resolver":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6","bundle":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/bundle.json","state":"https://pith.science/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGQULWCPHJCU7PYDTQUNAVNJN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KGQULWCPHJCU7PYDTQUNAVNJN6","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":"83d73b25d81d534c22f2795c4cd6aa4b18fd772e605b4e74d7089113b6584275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-31T07:54:16Z","title_canon_sha256":"9820d89f30b4b14b6f4f8aa99b41a270b89ad1990aa751d552718a95c7c3a835"},"schema_version":"1.0","source":{"id":"1401.0108","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0108","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0108v4","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0108","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"KGQULWCPHJCU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KGQULWCPHJCU7PYD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KGQULWCP","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:49fc8f82422a7e19a765191eb3f997da6af3f55785986355bd0a53910511184e","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":"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 ","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-31T07:54:16Z","title":"On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0108","kind":"arxiv","version":4},"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:59f27ff72043b6f8ee08934dab20655e3db1df2ca94b1333800233a270317421","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":"83d73b25d81d534c22f2795c4cd6aa4b18fd772e605b4e74d7089113b6584275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-31T07:54:16Z","title_canon_sha256":"9820d89f30b4b14b6f4f8aa99b41a270b89ad1990aa751d552718a95c7c3a835"},"schema_version":"1.0","source":{"id":"1401.0108","kind":"arxiv","version":4}},"canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51a145d84f3a454fbf039c28d055a96fb8ae46bc2f39fad2b9f982829d7cd87e","first_computed_at":"2026-05-18T02:53:07.538170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.538170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"urgEg5Fx9c102WbFHKofS+0pH/AioAMZXfyN1wnkcBKDQDdlk86S3iTpmAZPgODmY/Ad2DcjKQPQHzBgn6NMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.538856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0108","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59f27ff72043b6f8ee08934dab20655e3db1df2ca94b1333800233a270317421","sha256:49fc8f82422a7e19a765191eb3f997da6af3f55785986355bd0a53910511184e"],"state_sha256":"11927c63035bf42b86911e6b0710b2308bdb3f72229678e6e9652731158971d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCrVgSKStAcF+K1A/narKmqtK6SDmdAWXOaCbVphfoOl2UcL7pObwoDR5+eBFqUtEPiL/AokA9Dw4+eBb17vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:21:51.561854Z","bundle_sha256":"c06c8548aa57d7eb0b018b97ad23190900942d343ab60f37270202e4137b1834"}}