{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQGWBCL5VQUQ7L3JPM3KCYVVAP","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":"0be85039a10a78e768bfaf0f74966c000f0e2767696664a2d9c6d713f4cecbdc","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-31T08:39:21Z","title_canon_sha256":"c0daf8f8c2102781aa7641084a6e4d58a71172c02b1b8ec548fe76c2892910c5"},"schema_version":"1.0","source":{"id":"2607.29160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29160","created_at":"2026-08-03T01:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29160v1","created_at":"2026-08-03T01:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29160","created_at":"2026-08-03T01:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"LQGWBCL5VQUQ","created_at":"2026-08-03T01:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"LQGWBCL5VQUQ7L3J","created_at":"2026-08-03T01:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"LQGWBCL5","created_at":"2026-08-03T01:20:27Z"}],"graph_snapshots":[{"event_id":"sha256:58b2545fd12937de5889680f53a3eb4fd12b7d9f07aa62c560903b32be399d62","target":"graph","created_at":"2026-08-03T01:20: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.29160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number $k$, select $k$ objects maximizing the number of points inside their union.\n  - We present a polynomial-time approximation algorithm with approximation factor strictly better than $1-1/e$ for any set system with linear 2-shallow cell complexity (or any set system that can be decomposed into a constant number of such set systems). The result also holds for the weighted maximum coverage problem, where objects have weights and we want to select objects with total weight","authors_text":"Pasin Manurangsi, Sujoy Bhore, Timothy M. Chan","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-31T08:39:21Z","title":"Approximation Algorithms for Geometric Maximum Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29160","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:9e6714f62e261b6b5f277cf200dd8b31f477aad36c86bdc19ff469ff56ac0798","target":"record","created_at":"2026-08-03T01:20: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":"0be85039a10a78e768bfaf0f74966c000f0e2767696664a2d9c6d713f4cecbdc","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-31T08:39:21Z","title_canon_sha256":"c0daf8f8c2102781aa7641084a6e4d58a71172c02b1b8ec548fe76c2892910c5"},"schema_version":"1.0","source":{"id":"2607.29160","kind":"arxiv","version":1}},"canonical_sha256":"5c0d60897dac290faf697b36a162b503f5033a003e10d86ec06dadec41bd5d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c0d60897dac290faf697b36a162b503f5033a003e10d86ec06dadec41bd5d68","first_computed_at":"2026-08-03T01:20:27.107695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:20:27.107695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ncG/lfSN1noW7ItByq7LxSVvdtRlEAJRF7AeVl0s91AwusUVpmh0JxQwH4WRaTOVuiUMgGuXyRnqZiZJwkU7CQ==","signature_status":"signed_v1","signed_at":"2026-08-03T01:20:27.109371Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6714f62e261b6b5f277cf200dd8b31f477aad36c86bdc19ff469ff56ac0798","sha256:58b2545fd12937de5889680f53a3eb4fd12b7d9f07aa62c560903b32be399d62"],"state_sha256":"d17454ecc38bb5449941803594495080b6273d13001126bfbeb0bab7d544457a"}