{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VEBCMTZUBHDUEEXGUHUWXUN4TE","short_pith_number":"pith:VEBCMTZU","canonical_record":{"source":{"id":"1703.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-25T07:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"84d99d73961f4928d8838c17dfc60de29d5dd05aa9e3ef843379a4fc1f13e506","abstract_canon_sha256":"41903c06044f87af3ad453b731182c4d30f3d052890a07cdd41d755bed9cf7ca"},"schema_version":"1.0"},"canonical_sha256":"a902264f3409c74212e6a1e96bd1bc991631ba7bf9b814f3e4ddca054e4f81b7","source":{"kind":"arxiv","id":"1703.08658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08658","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08658v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08658","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"VEBCMTZUBHDU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEBCMTZUBHDUEEXG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEBCMTZU","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VEBCMTZUBHDUEEXGUHUWXUN4TE","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-25T07:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"84d99d73961f4928d8838c17dfc60de29d5dd05aa9e3ef843379a4fc1f13e506","abstract_canon_sha256":"41903c06044f87af3ad453b731182c4d30f3d052890a07cdd41d755bed9cf7ca"},"schema_version":"1.0"},"canonical_sha256":"a902264f3409c74212e6a1e96bd1bc991631ba7bf9b814f3e4ddca054e4f81b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.947345Z","signature_b64":"rNuKEbntbjRfeTJx2nIycwvupwXYJliR+kUneynz9uLWq92D3+GcKDInULoXZQB7YwUKBSiJtJ+O5SPfsY45Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a902264f3409c74212e6a1e96bd1bc991631ba7bf9b814f3e4ddca054e4f81b7","last_reissued_at":"2026-05-18T00:47:55.946677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.946677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08658","source_version":1,"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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+ts+xi+01L1XZ1tcMitdY9nVGvSIYRgFEpi86hQfKeHE+AqTBjLXHSEdor5V0jS8DLIqidjU7RN2bVPw1h/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:41:42.700015Z"},"content_sha256":"f1b263ad745422f92204bd0476ff22c77bd6037988fd46f828e42dfc0698ca2b","schema_version":"1.0","event_id":"sha256:f1b263ad745422f92204bd0476ff22c77bd6037988fd46f828e42dfc0698ca2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VEBCMTZUBHDUEEXGUHUWXUN4TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the area of intersection of rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David B.A. Epstein, Mike Paterson","submitted_at":"2017-03-25T07:27:32Z","abstract_excerpt":"This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is to find $r$ of these rectangles, such that, if they are discarded, then the intersection of the remaining $(N-r)$ rectangles has an intersection with as large an area as possible. We will find an upper bound, depending only on $N$ and $r$, and not on the particular data presented, for the number of steps needed to run the algorithm on (a mathematical model o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08658","kind":"arxiv","version":1},"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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9xAPe4PxS8oqw+WObSH9RAE0ukJsNmMZeUEtKDXTUSej1ltT+xcbMW+mWuxcb8wl5qTqjsMCHliuZFroI76Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:41:42.700730Z"},"content_sha256":"58e0e74214a3d3868fe6370b682794d1387db6fdd85d09a8395d3317f8a8de3b","schema_version":"1.0","event_id":"sha256:58e0e74214a3d3868fe6370b682794d1387db6fdd85d09a8395d3317f8a8de3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/bundle.json","state_url":"https://pith.science/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/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-05-24T00:41:42Z","links":{"resolver":"https://pith.science/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE","bundle":"https://pith.science/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/bundle.json","state":"https://pith.science/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEBCMTZUBHDUEEXGUHUWXUN4TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VEBCMTZUBHDUEEXGUHUWXUN4TE","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":"41903c06044f87af3ad453b731182c4d30f3d052890a07cdd41d755bed9cf7ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-25T07:27:32Z","title_canon_sha256":"84d99d73961f4928d8838c17dfc60de29d5dd05aa9e3ef843379a4fc1f13e506"},"schema_version":"1.0","source":{"id":"1703.08658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08658","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08658v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08658","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"VEBCMTZUBHDU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEBCMTZUBHDUEEXG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEBCMTZU","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:58e0e74214a3d3868fe6370b682794d1387db6fdd85d09a8395d3317f8a8de3b","target":"graph","created_at":"2026-05-18T00:47:55Z","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":"This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is to find $r$ of these rectangles, such that, if they are discarded, then the intersection of the remaining $(N-r)$ rectangles has an intersection with as large an area as possible. We will find an upper bound, depending only on $N$ and $r$, and not on the particular data presented, for the number of steps needed to run the algorithm on (a mathematical model o","authors_text":"David B.A. Epstein, Mike Paterson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-25T07:27:32Z","title":"Maximizing the area of intersection of rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08658","kind":"arxiv","version":1},"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:f1b263ad745422f92204bd0476ff22c77bd6037988fd46f828e42dfc0698ca2b","target":"record","created_at":"2026-05-18T00:47:55Z","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":"41903c06044f87af3ad453b731182c4d30f3d052890a07cdd41d755bed9cf7ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-25T07:27:32Z","title_canon_sha256":"84d99d73961f4928d8838c17dfc60de29d5dd05aa9e3ef843379a4fc1f13e506"},"schema_version":"1.0","source":{"id":"1703.08658","kind":"arxiv","version":1}},"canonical_sha256":"a902264f3409c74212e6a1e96bd1bc991631ba7bf9b814f3e4ddca054e4f81b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a902264f3409c74212e6a1e96bd1bc991631ba7bf9b814f3e4ddca054e4f81b7","first_computed_at":"2026-05-18T00:47:55.946677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.946677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rNuKEbntbjRfeTJx2nIycwvupwXYJliR+kUneynz9uLWq92D3+GcKDInULoXZQB7YwUKBSiJtJ+O5SPfsY45Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.947345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1b263ad745422f92204bd0476ff22c77bd6037988fd46f828e42dfc0698ca2b","sha256:58e0e74214a3d3868fe6370b682794d1387db6fdd85d09a8395d3317f8a8de3b"],"state_sha256":"5d13d17e53cef37e4f83643b995ff445ef4dda2b616e20c00b9a458f6567c757"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDZF3gAKJUvCkYss68rWOONJ5cGzdiYwPiH1aJEsNza1IU2BJtxAx8pToSnPf5fY7cKzZsMbzhB+bDqT5LqYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:41:42.704783Z","bundle_sha256":"81fb188bdefe0cfeee7771b14ba77f7bf2f9c444456a70dac95fb1f5721c4353"}}