{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DR7FHGP2X22B23AGBLTSZ64JPL","short_pith_number":"pith:DR7FHGP2","canonical_record":{"source":{"id":"1603.04210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-14T11:21:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e75469423888882ca19c86b6367eefa97548c2ca406ab5425b5a8686b2acd769","abstract_canon_sha256":"2d443a2338fafb2b625d09e596e396ddfe3e2aa01a70d1cb3c19506b5cb06e42"},"schema_version":"1.0"},"canonical_sha256":"1c7e5399fabeb41d6c060ae72cfb897ae67fe74b80656798f470b24a2482c7cf","source":{"kind":"arxiv","id":"1603.04210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04210","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04210v2","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04210","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"DR7FHGP2X22B","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DR7FHGP2X22B23AG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DR7FHGP2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DR7FHGP2X22B23AGBLTSZ64JPL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-14T11:21:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e75469423888882ca19c86b6367eefa97548c2ca406ab5425b5a8686b2acd769","abstract_canon_sha256":"2d443a2338fafb2b625d09e596e396ddfe3e2aa01a70d1cb3c19506b5cb06e42"},"schema_version":"1.0"},"canonical_sha256":"1c7e5399fabeb41d6c060ae72cfb897ae67fe74b80656798f470b24a2482c7cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.938236Z","signature_b64":"5q1GToqZeReakM9lkdjS+23g5wMmnqsxZOELFsNfV6oxZJ5cVOrNvlOzvgyUDmo1JCgbBCeLZsYwzOfvDPUxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c7e5399fabeb41d6c060ae72cfb897ae67fe74b80656798f470b24a2482c7cf","last_reissued_at":"2026-05-18T01:19:04.937811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.937811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04210","source_version":2,"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-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pp5Z25/MXqeyzimxXgV1FJ/42v7UnGXNCmOwXZSd6zvnfFukvDYL084R9P3+uXZpKOn/K7uLnfpcSICkNG9/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:56:39.280382Z"},"content_sha256":"33cb1c3d0a9247e047841c042aea0e3d161a6f2cced6c1e593abb9a6909eaa7f","schema_version":"1.0","event_id":"sha256:33cb1c3d0a9247e047841c042aea0e3d161a6f2cced6c1e593abb9a6909eaa7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DR7FHGP2X22B23AGBLTSZ64JPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Runaway Rectangle Escape Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Aniket Basu Roy, Anil Maheshwari, Neeldhara Misra, Sathish Govindarajan, Shreyas Shetty, Subhas C Nandy","submitted_at":"2016-03-14T11:21:56Z","abstract_excerpt":"Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles $\\mathcal{S}$ in a rectangular region $R$, and we would like to extend these rectangles to one of the four sides of $R$. Define the density of a point $p$ in $R$ as the number of extended rectangles that contain $p$. The question is then to find an extension with the smallest maximum density.\n  We consider the problem of maximizing the number of rectangles that can be extended when the maximum density allowed is at most $d$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04210","kind":"arxiv","version":2},"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-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOdg0+H6vBofmUgxbjee3LgaMFh1jlxZDcZvqUk0Ipa3clhfJ/NC6NoGJNjzMDVBOgOs0jakZVj0AkSjJQrGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:56:39.280736Z"},"content_sha256":"083c7dc4bd6bf1fcef1759984c56415739ea85ebe2aca0b03c2ec8525cc782f0","schema_version":"1.0","event_id":"sha256:083c7dc4bd6bf1fcef1759984c56415739ea85ebe2aca0b03c2ec8525cc782f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DR7FHGP2X22B23AGBLTSZ64JPL/bundle.json","state_url":"https://pith.science/pith/DR7FHGP2X22B23AGBLTSZ64JPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DR7FHGP2X22B23AGBLTSZ64JPL/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-08T14:56:39Z","links":{"resolver":"https://pith.science/pith/DR7FHGP2X22B23AGBLTSZ64JPL","bundle":"https://pith.science/pith/DR7FHGP2X22B23AGBLTSZ64JPL/bundle.json","state":"https://pith.science/pith/DR7FHGP2X22B23AGBLTSZ64JPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DR7FHGP2X22B23AGBLTSZ64JPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DR7FHGP2X22B23AGBLTSZ64JPL","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":"2d443a2338fafb2b625d09e596e396ddfe3e2aa01a70d1cb3c19506b5cb06e42","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-14T11:21:56Z","title_canon_sha256":"e75469423888882ca19c86b6367eefa97548c2ca406ab5425b5a8686b2acd769"},"schema_version":"1.0","source":{"id":"1603.04210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04210","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04210v2","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04210","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"DR7FHGP2X22B","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DR7FHGP2X22B23AG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DR7FHGP2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:083c7dc4bd6bf1fcef1759984c56415739ea85ebe2aca0b03c2ec8525cc782f0","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles $\\mathcal{S}$ in a rectangular region $R$, and we would like to extend these rectangles to one of the four sides of $R$. Define the density of a point $p$ in $R$ as the number of extended rectangles that contain $p$. The question is then to find an extension with the smallest maximum density.\n  We consider the problem of maximizing the number of rectangles that can be extended when the maximum density allowed is at most $d$. ","authors_text":"Aniket Basu Roy, Anil Maheshwari, Neeldhara Misra, Sathish Govindarajan, Shreyas Shetty, Subhas C Nandy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-14T11:21:56Z","title":"The Runaway Rectangle Escape Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04210","kind":"arxiv","version":2},"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:33cb1c3d0a9247e047841c042aea0e3d161a6f2cced6c1e593abb9a6909eaa7f","target":"record","created_at":"2026-05-18T01:19:04Z","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":"2d443a2338fafb2b625d09e596e396ddfe3e2aa01a70d1cb3c19506b5cb06e42","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-14T11:21:56Z","title_canon_sha256":"e75469423888882ca19c86b6367eefa97548c2ca406ab5425b5a8686b2acd769"},"schema_version":"1.0","source":{"id":"1603.04210","kind":"arxiv","version":2}},"canonical_sha256":"1c7e5399fabeb41d6c060ae72cfb897ae67fe74b80656798f470b24a2482c7cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c7e5399fabeb41d6c060ae72cfb897ae67fe74b80656798f470b24a2482c7cf","first_computed_at":"2026-05-18T01:19:04.937811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.937811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5q1GToqZeReakM9lkdjS+23g5wMmnqsxZOELFsNfV6oxZJ5cVOrNvlOzvgyUDmo1JCgbBCeLZsYwzOfvDPUxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.938236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33cb1c3d0a9247e047841c042aea0e3d161a6f2cced6c1e593abb9a6909eaa7f","sha256:083c7dc4bd6bf1fcef1759984c56415739ea85ebe2aca0b03c2ec8525cc782f0"],"state_sha256":"7c5c2cef88c7a6e640361ad29ed438825ad3c8b71eab79e8ebb79705e4b87058"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygQfeHX2P6eBZ6qfwHoXhEAmSg0XlLmtoi2/qDVN+/yXB1H71l1LBDTKatEQIuPzklSVL1naFHnkGv0c/uhyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:56:39.282734Z","bundle_sha256":"45d0b676230ec9ecfafb80b8b03f7a248a3ff8532f3aa8ff6c3b2ec4139719c6"}}