{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LQGWBCL5VQUQ7L3JPM3KCYVVAP","short_pith_number":"pith:LQGWBCL5","canonical_record":{"source":{"id":"2607.29160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-31T08:39:21Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"c0daf8f8c2102781aa7641084a6e4d58a71172c02b1b8ec548fe76c2892910c5","abstract_canon_sha256":"0be85039a10a78e768bfaf0f74966c000f0e2767696664a2d9c6d713f4cecbdc"},"schema_version":"1.0"},"canonical_sha256":"5c0d60897dac290faf697b36a162b503f5033a003e10d86ec06dadec41bd5d68","source":{"kind":"arxiv","id":"2607.29160","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LQGWBCL5VQUQ7L3JPM3KCYVVAP","target":"record","payload":{"canonical_record":{"source":{"id":"2607.29160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-31T08:39:21Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"c0daf8f8c2102781aa7641084a6e4d58a71172c02b1b8ec548fe76c2892910c5","abstract_canon_sha256":"0be85039a10a78e768bfaf0f74966c000f0e2767696664a2d9c6d713f4cecbdc"},"schema_version":"1.0"},"canonical_sha256":"5c0d60897dac290faf697b36a162b503f5033a003e10d86ec06dadec41bd5d68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:20:27.109371Z","signature_b64":"ncG/lfSN1noW7ItByq7LxSVvdtRlEAJRF7AeVl0s91AwusUVpmh0JxQwH4WRaTOVuiUMgGuXyRnqZiZJwkU7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c0d60897dac290faf697b36a162b503f5033a003e10d86ec06dadec41bd5d68","last_reissued_at":"2026-08-03T01:20:27.107695Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:20:27.107695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.29160","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-08-03T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGhvcLpb7+YYeIQte0tqzpmdSKcepGaYScwWN1mMKr20a32UGx/Qer+sppB9nNLD1aktLFMAvUyDHeAcQxDdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:56:40.471596Z"},"content_sha256":"9e6714f62e261b6b5f277cf200dd8b31f477aad36c86bdc19ff469ff56ac0798","schema_version":"1.0","event_id":"sha256:9e6714f62e261b6b5f277cf200dd8b31f477aad36c86bdc19ff469ff56ac0798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LQGWBCL5VQUQ7L3JPM3KCYVVAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Geometric Maximum Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Pasin Manurangsi, Sujoy Bhore, Timothy M. Chan","submitted_at":"2026-07-31T08:39:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29160","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.29160/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-03T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rw03v49zrpmJWkR/pVzVtif8k1psJbbPB9JW00qUsR+GNsvk7+A+xVY8w4Pb9Fpzkfi6Is1LE7uMUHTY9EOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:56:40.472136Z"},"content_sha256":"58b2545fd12937de5889680f53a3eb4fd12b7d9f07aa62c560903b32be399d62","schema_version":"1.0","event_id":"sha256:58b2545fd12937de5889680f53a3eb4fd12b7d9f07aa62c560903b32be399d62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/bundle.json","state_url":"https://pith.science/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/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-08-04T12:56:40Z","links":{"resolver":"https://pith.science/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP","bundle":"https://pith.science/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/bundle.json","state":"https://pith.science/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQGWBCL5VQUQ7L3JPM3KCYVVAP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUwjbe3czTaUe2VQZE3dYDZ0WxCh0tUIPECmXotJD1H5YxvmnQrqsZADnqMm0arEce410CUbvfqmG8slpP7xBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:56:40.478268Z","bundle_sha256":"17612d23102886b6b56de2b74a55e4d4319038f6e530bf48494b78fffe2598e5"}}