{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U3XTGACQOKHH7CJTL5XIR7XGD7","short_pith_number":"pith:U3XTGACQ","canonical_record":{"source":{"id":"1312.1369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-04T22:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"c091cb502a477bb56e8d50727a1ada06e6b2f6e499b232dc03515e4520301633","abstract_canon_sha256":"e3e9e9ca75a4f9ccc199c305b703713e03f5b33536f7626ed77e1a60fcdbb7d8"},"schema_version":"1.0"},"canonical_sha256":"a6ef330050728e7f89335f6e88fee61fcc153699742ad837cd51ede2c986941c","source":{"kind":"arxiv","id":"1312.1369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1369","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1369v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1369","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"U3XTGACQOKHH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U3XTGACQOKHH7CJT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U3XTGACQ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U3XTGACQOKHH7CJTL5XIR7XGD7","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-04T22:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"c091cb502a477bb56e8d50727a1ada06e6b2f6e499b232dc03515e4520301633","abstract_canon_sha256":"e3e9e9ca75a4f9ccc199c305b703713e03f5b33536f7626ed77e1a60fcdbb7d8"},"schema_version":"1.0"},"canonical_sha256":"a6ef330050728e7f89335f6e88fee61fcc153699742ad837cd51ede2c986941c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.521507Z","signature_b64":"QfJ8zvjNXK9qfBN3nBXcU2EHCsQzkJRcaKPVN2A3KEXvcxmLcM5llOMugNsGhLWoUcdTM59atZkr1tXIIREgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ef330050728e7f89335f6e88fee61fcc153699742ad837cd51ede2c986941c","last_reissued_at":"2026-05-18T03:05:27.520605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.520605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1369","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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ch8J1Lyro5Y8Z0UAI+aIJe94u2I1Rch1yr1GLXL1MMHdLGEUhpSHU2JsAyt1P6jXJjUWoiWA6MACt8276lWtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:12:07.378377Z"},"content_sha256":"5e0ddd70b5efe453c76991a9bef04d4648c42e6d9f42294e11016d138930a0d5","schema_version":"1.0","event_id":"sha256:5e0ddd70b5efe453c76991a9bef04d4648c42e6d9f42294e11016d138930a0d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U3XTGACQOKHH7CJTL5XIR7XGD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2013-12-04T22:14:06Z","abstract_excerpt":"We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \\cite{aw-asmwi-13, aw-qmwis-14} to polygons of arbitrary complexity. Surprisingly, the algorithm also works or computing the largest subset of the given set of polygons that has some sparsity condition. For example, we show that one can approximate the largest subset of polygons, such that the intersection graph of the subset does not contain a cycle of length $4$ (i.e., $K_{2,2}$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1369","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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9W3eCMYaSLIQzXtjo3LievKeaIpLHmSmTUTGmZ3p3+dZkJAHr7IuoRHkN+kWmJWZx0VI/M32mbNwrHPh4JacAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:12:07.379004Z"},"content_sha256":"8b9dec2a4fa51ba9147f2db44dcd1636eab296daffea413e25a4b0379263216b","schema_version":"1.0","event_id":"sha256:8b9dec2a4fa51ba9147f2db44dcd1636eab296daffea413e25a4b0379263216b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/bundle.json","state_url":"https://pith.science/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/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-08T20:12:07Z","links":{"resolver":"https://pith.science/pith/U3XTGACQOKHH7CJTL5XIR7XGD7","bundle":"https://pith.science/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/bundle.json","state":"https://pith.science/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3XTGACQOKHH7CJTL5XIR7XGD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U3XTGACQOKHH7CJTL5XIR7XGD7","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":"e3e9e9ca75a4f9ccc199c305b703713e03f5b33536f7626ed77e1a60fcdbb7d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-04T22:14:06Z","title_canon_sha256":"c091cb502a477bb56e8d50727a1ada06e6b2f6e499b232dc03515e4520301633"},"schema_version":"1.0","source":{"id":"1312.1369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1369","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1369v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1369","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"U3XTGACQOKHH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U3XTGACQOKHH7CJT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U3XTGACQ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:8b9dec2a4fa51ba9147f2db44dcd1636eab296daffea413e25a4b0379263216b","target":"graph","created_at":"2026-05-18T03:05:27Z","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 describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \\cite{aw-asmwi-13, aw-qmwis-14} to polygons of arbitrary complexity. Surprisingly, the algorithm also works or computing the largest subset of the given set of polygons that has some sparsity condition. For example, we show that one can approximate the largest subset of polygons, such that the intersection graph of the subset does not contain a cycle of length $4$ (i.e., $K_{2,2}$).","authors_text":"Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-04T22:14:06Z","title":"Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1369","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:5e0ddd70b5efe453c76991a9bef04d4648c42e6d9f42294e11016d138930a0d5","target":"record","created_at":"2026-05-18T03:05:27Z","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":"e3e9e9ca75a4f9ccc199c305b703713e03f5b33536f7626ed77e1a60fcdbb7d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-04T22:14:06Z","title_canon_sha256":"c091cb502a477bb56e8d50727a1ada06e6b2f6e499b232dc03515e4520301633"},"schema_version":"1.0","source":{"id":"1312.1369","kind":"arxiv","version":1}},"canonical_sha256":"a6ef330050728e7f89335f6e88fee61fcc153699742ad837cd51ede2c986941c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6ef330050728e7f89335f6e88fee61fcc153699742ad837cd51ede2c986941c","first_computed_at":"2026-05-18T03:05:27.520605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:27.520605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QfJ8zvjNXK9qfBN3nBXcU2EHCsQzkJRcaKPVN2A3KEXvcxmLcM5llOMugNsGhLWoUcdTM59atZkr1tXIIREgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:27.521507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e0ddd70b5efe453c76991a9bef04d4648c42e6d9f42294e11016d138930a0d5","sha256:8b9dec2a4fa51ba9147f2db44dcd1636eab296daffea413e25a4b0379263216b"],"state_sha256":"54456c2ea36ed41633e57c2f4ac1197c499f1a8ba5618221ace24e2732fe6a7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gF3xWl09HX9M5DCTwCL9fFnyji2rgTcu/OWFbYAqJWbBfm5kNgZXMGDsCSVWmIEkCNIZALe/f3LZQRON/SxnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:12:07.382592Z","bundle_sha256":"e4c6dd9465173b39bd16744f1297d16d86f9db6a0d23971a4ca2a26b7c8d4725"}}