{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z35USXOTJSLJOONBIACAJ565A5","short_pith_number":"pith:Z35USXOT","canonical_record":{"source":{"id":"1703.04758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-14T22:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"e1ee1c50c96ec39a0cd2bf21f3137f5a8b664422a44d9dbaf9acc8fa07038a5a","abstract_canon_sha256":"17d8da09655a48cd515167565b594623e064270f2bf998a6e52a1ac25ba96df3"},"schema_version":"1.0"},"canonical_sha256":"cefb495dd34c969739a1400404f7dd0750f0d17672304122d157b0602594f47d","source":{"kind":"arxiv","id":"1703.04758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04758","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04758v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04758","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z35USXOTJSLJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z35USXOTJSLJOONB","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z35USXOT","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z35USXOTJSLJOONBIACAJ565A5","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-14T22:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"e1ee1c50c96ec39a0cd2bf21f3137f5a8b664422a44d9dbaf9acc8fa07038a5a","abstract_canon_sha256":"17d8da09655a48cd515167565b594623e064270f2bf998a6e52a1ac25ba96df3"},"schema_version":"1.0"},"canonical_sha256":"cefb495dd34c969739a1400404f7dd0750f0d17672304122d157b0602594f47d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:39.316581Z","signature_b64":"QqqeQfuNsDCtOZ8qJbk9P3xJO5QTXLAKe5xEOPtx+dVYlDTRtqcxIAQOtaaD98lnNJ5smJbIViMW6cARbhOwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cefb495dd34c969739a1400404f7dd0750f0d17672304122d157b0602594f47d","last_reissued_at":"2026-05-18T00:48:39.316014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:39.316014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04758","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qazp3LgdI1zU35S4dPJ3cYN9grry3Ryyh+ol3bQn+SDiQvc/B22lKKnm+sFIL4qrjasuq+Vp/RJTGYqFGyURCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:27:43.122019Z"},"content_sha256":"6ea20678d396def638c9657f64680eb5f6beb3837354d0fc7219da6bbc65d12a","schema_version":"1.0","event_id":"sha256:6ea20678d396def638c9657f64680eb5f6beb3837354d0fc7219da6bbc65d12a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z35USXOTJSLJOONBIACAJ565A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Schemes for Independent Set and Sparse Subsets of Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Wiese, Anna Adamaszek, Sariel Har-Peled","submitted_at":"2017-03-14T22:13:58Z","abstract_excerpt":"We present an $(1+\\varepsilon)$-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is $n^{O( \\mathrm{poly}( \\log n, 1/\\varepsilon))}$). Contrasting this, the best known polynomial time algorithm for the problem has an approximation ratio of~$n^{\\varepsilon}$. Surprisingly, we can extend the algorithm to the problem of computing the maximum weight subset of the given set of polygons whose intersection graph fulfills some sparsity condition. For example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04758","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lsXAdM8vXdTv3Pw27Hqo0TfuqzIPNbc27Dt1ot9FJoNPtBgFQE4iJ1lN9671RtJcpg/4JRA5N3CoUHp3TV+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:27:43.122716Z"},"content_sha256":"a5642cec181490f5b82b5fb67e313356d96f129bc5a23f7beb2be5f3808dabcd","schema_version":"1.0","event_id":"sha256:a5642cec181490f5b82b5fb67e313356d96f129bc5a23f7beb2be5f3808dabcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z35USXOTJSLJOONBIACAJ565A5/bundle.json","state_url":"https://pith.science/pith/Z35USXOTJSLJOONBIACAJ565A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z35USXOTJSLJOONBIACAJ565A5/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-29T22:27:43Z","links":{"resolver":"https://pith.science/pith/Z35USXOTJSLJOONBIACAJ565A5","bundle":"https://pith.science/pith/Z35USXOTJSLJOONBIACAJ565A5/bundle.json","state":"https://pith.science/pith/Z35USXOTJSLJOONBIACAJ565A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z35USXOTJSLJOONBIACAJ565A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z35USXOTJSLJOONBIACAJ565A5","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":"17d8da09655a48cd515167565b594623e064270f2bf998a6e52a1ac25ba96df3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-14T22:13:58Z","title_canon_sha256":"e1ee1c50c96ec39a0cd2bf21f3137f5a8b664422a44d9dbaf9acc8fa07038a5a"},"schema_version":"1.0","source":{"id":"1703.04758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04758","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04758v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04758","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z35USXOTJSLJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z35USXOTJSLJOONB","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z35USXOT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a5642cec181490f5b82b5fb67e313356d96f129bc5a23f7beb2be5f3808dabcd","target":"graph","created_at":"2026-05-18T00:48:39Z","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 present an $(1+\\varepsilon)$-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is $n^{O( \\mathrm{poly}( \\log n, 1/\\varepsilon))}$). Contrasting this, the best known polynomial time algorithm for the problem has an approximation ratio of~$n^{\\varepsilon}$. Surprisingly, we can extend the algorithm to the problem of computing the maximum weight subset of the given set of polygons whose intersection graph fulfills some sparsity condition. For example","authors_text":"Andreas Wiese, Anna Adamaszek, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-14T22:13:58Z","title":"Approximation Schemes for Independent Set and Sparse Subsets of Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04758","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:6ea20678d396def638c9657f64680eb5f6beb3837354d0fc7219da6bbc65d12a","target":"record","created_at":"2026-05-18T00:48:39Z","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":"17d8da09655a48cd515167565b594623e064270f2bf998a6e52a1ac25ba96df3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-14T22:13:58Z","title_canon_sha256":"e1ee1c50c96ec39a0cd2bf21f3137f5a8b664422a44d9dbaf9acc8fa07038a5a"},"schema_version":"1.0","source":{"id":"1703.04758","kind":"arxiv","version":1}},"canonical_sha256":"cefb495dd34c969739a1400404f7dd0750f0d17672304122d157b0602594f47d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cefb495dd34c969739a1400404f7dd0750f0d17672304122d157b0602594f47d","first_computed_at":"2026-05-18T00:48:39.316014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:39.316014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QqqeQfuNsDCtOZ8qJbk9P3xJO5QTXLAKe5xEOPtx+dVYlDTRtqcxIAQOtaaD98lnNJ5smJbIViMW6cARbhOwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:39.316581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ea20678d396def638c9657f64680eb5f6beb3837354d0fc7219da6bbc65d12a","sha256:a5642cec181490f5b82b5fb67e313356d96f129bc5a23f7beb2be5f3808dabcd"],"state_sha256":"6d74869f70efa8e8b0667a7e8a1466ea0be92f617c981efabf94e73d7a9fd8ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zN21GYngzSBbxki6DjasGfzg3GFKzi9AjtmaQnamlPdvQepgBfAMC1Dd/+LGAk3KZs0rYNsOIQ440SUHeraCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:27:43.126432Z","bundle_sha256":"2494fc460e03497df14b4803a49c0d7d7147a6b596a585e02e45f62c5b5ac0f1"}}