{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HI5VDK3DXN3WTWKNIK7GNROEY4","short_pith_number":"pith:HI5VDK3D","canonical_record":{"source":{"id":"1608.00271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-31T22:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"7890295f3015e6eacb2b43d00661f4abe94f6495e1eefc925447ce409be1740a","abstract_canon_sha256":"c8c92a645c33883fbff403d25c0e7bfff2096ffd863a8ac0056629deb0353167"},"schema_version":"1.0"},"canonical_sha256":"3a3b51ab63bb7769d94d42be66c5c4c71cfc0155e8215141a6b311d23bf94168","source":{"kind":"arxiv","id":"1608.00271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00271","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00271v1","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00271","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"HI5VDK3DXN3W","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HI5VDK3DXN3WTWKN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HI5VDK3D","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HI5VDK3DXN3WTWKNIK7GNROEY4","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-31T22:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"7890295f3015e6eacb2b43d00661f4abe94f6495e1eefc925447ce409be1740a","abstract_canon_sha256":"c8c92a645c33883fbff403d25c0e7bfff2096ffd863a8ac0056629deb0353167"},"schema_version":"1.0"},"canonical_sha256":"3a3b51ab63bb7769d94d42be66c5c4c71cfc0155e8215141a6b311d23bf94168","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:12.086443Z","signature_b64":"UZTOPhWo82Gz6B30grsenawyDIt9diTd5r2r4n+jVmLjTjt4HTAIqYZRJ/1xtBhX2MWeM597sCsjSC1poisaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3b51ab63bb7769d94d42be66c5c4c71cfc0155e8215141a6b311d23bf94168","last_reissued_at":"2026-05-18T01:10:12.085807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:12.085807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00271","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-18T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkL3C17jFzvFSLtAevFGHRuuPYNv0e2SMHdNPggLdEX6mzoVyQAKyLCcQqPtlOu9GjK0zpwXJsr/8kdD5jEcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:57:11.484046Z"},"content_sha256":"a34f4ca58c99726f41500bf7de9b9ec412ae34f8f96d96934aed210469d56b15","schema_version":"1.0","event_id":"sha256:a34f4ca58c99726f41500bf7de9b9ec412ae34f8f96d96934aed210469d56b15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HI5VDK3DXN3WTWKNIK7GNROEY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Maximum Independent Set of Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Julia Chuzhoy","submitted_at":"2016-07-31T22:15:31Z","abstract_excerpt":"We study the Maximum Independent Set of Rectangles (MISR) problem: given a set of $n$ axis-parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of them overlap. MISR is a basic geometric optimization problem with many applications, that has been studied extensively. Until recently, the best approximation algorithm for it achieved an $O(\\log \\log n)$-approximation factor. In a recent breakthrough, Adamaszek and Wiese provided a quasi-polynomial time approximation scheme: a $(1-\\epsilon)$-approximation algorithm with running time $n^{O(\\operatorname{poly}(\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00271","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-18T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wD/U8I6jwBGD4dTsFSGK84Ez3geQT2yYDcDIYoTkWb+RMy6QrpAhyvgueMi6OvvHU0JKf/dlGQOZK/j7fjiBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:57:11.484783Z"},"content_sha256":"356c08297590dc4a72314672933d503b827c6c2510694a2aa450ea7668701308","schema_version":"1.0","event_id":"sha256:356c08297590dc4a72314672933d503b827c6c2510694a2aa450ea7668701308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/bundle.json","state_url":"https://pith.science/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/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-11T19:57:11Z","links":{"resolver":"https://pith.science/pith/HI5VDK3DXN3WTWKNIK7GNROEY4","bundle":"https://pith.science/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/bundle.json","state":"https://pith.science/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI5VDK3DXN3WTWKNIK7GNROEY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HI5VDK3DXN3WTWKNIK7GNROEY4","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":"c8c92a645c33883fbff403d25c0e7bfff2096ffd863a8ac0056629deb0353167","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-31T22:15:31Z","title_canon_sha256":"7890295f3015e6eacb2b43d00661f4abe94f6495e1eefc925447ce409be1740a"},"schema_version":"1.0","source":{"id":"1608.00271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00271","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00271v1","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00271","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"HI5VDK3DXN3W","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HI5VDK3DXN3WTWKN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HI5VDK3D","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:356c08297590dc4a72314672933d503b827c6c2510694a2aa450ea7668701308","target":"graph","created_at":"2026-05-18T01:10:12Z","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":"We study the Maximum Independent Set of Rectangles (MISR) problem: given a set of $n$ axis-parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of them overlap. MISR is a basic geometric optimization problem with many applications, that has been studied extensively. Until recently, the best approximation algorithm for it achieved an $O(\\log \\log n)$-approximation factor. In a recent breakthrough, Adamaszek and Wiese provided a quasi-polynomial time approximation scheme: a $(1-\\epsilon)$-approximation algorithm with running time $n^{O(\\operatorname{poly}(\\l","authors_text":"Alina Ene, Julia Chuzhoy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-31T22:15:31Z","title":"On Approximating Maximum Independent Set of Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00271","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:a34f4ca58c99726f41500bf7de9b9ec412ae34f8f96d96934aed210469d56b15","target":"record","created_at":"2026-05-18T01:10:12Z","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":"c8c92a645c33883fbff403d25c0e7bfff2096ffd863a8ac0056629deb0353167","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-31T22:15:31Z","title_canon_sha256":"7890295f3015e6eacb2b43d00661f4abe94f6495e1eefc925447ce409be1740a"},"schema_version":"1.0","source":{"id":"1608.00271","kind":"arxiv","version":1}},"canonical_sha256":"3a3b51ab63bb7769d94d42be66c5c4c71cfc0155e8215141a6b311d23bf94168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3b51ab63bb7769d94d42be66c5c4c71cfc0155e8215141a6b311d23bf94168","first_computed_at":"2026-05-18T01:10:12.085807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:12.085807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZTOPhWo82Gz6B30grsenawyDIt9diTd5r2r4n+jVmLjTjt4HTAIqYZRJ/1xtBhX2MWeM597sCsjSC1poisaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:12.086443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a34f4ca58c99726f41500bf7de9b9ec412ae34f8f96d96934aed210469d56b15","sha256:356c08297590dc4a72314672933d503b827c6c2510694a2aa450ea7668701308"],"state_sha256":"95eb8c4994279735824a521a79c6fa3dc3ac3fca18cdaf9b9d5657fb95cccafe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puL/Hfez/iQtWrpHs0bUVBA3kX0Ir6JU2FkBma/QYnLaOxBUSjTLSArl35KO3Hw3Vww4GUMfDBscPtm4CQqmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:57:11.489538Z","bundle_sha256":"a24805873853021663f03f416c7b23308a5e1b3d05829703780f665b84e9f763"}}