{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TEL4AZOFZJUEVT663NA756ZAD2","short_pith_number":"pith:TEL4AZOF","canonical_record":{"source":{"id":"2506.00272","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T22:13:26Z","cross_cats_sorted":[],"title_canon_sha256":"a9522a16a6035972553837b3aaf935ac72812beee741894137e70485acfd4292","abstract_canon_sha256":"65a675a6853f4d23721c23fc5e77c4dfcf8919a19fd3e8dbac6c6b7e982cba16"},"schema_version":"1.0"},"canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","source":{"kind":"arxiv","id":"2506.00272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00272","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00272v1","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00272","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"TEL4AZOFZJUE","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_16","alias_value":"TEL4AZOFZJUEVT66","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_8","alias_value":"TEL4AZOF","created_at":"2026-07-05T11:13:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TEL4AZOFZJUEVT663NA756ZAD2","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00272","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T22:13:26Z","cross_cats_sorted":[],"title_canon_sha256":"a9522a16a6035972553837b3aaf935ac72812beee741894137e70485acfd4292","abstract_canon_sha256":"65a675a6853f4d23721c23fc5e77c4dfcf8919a19fd3e8dbac6c6b7e982cba16"},"schema_version":"1.0"},"canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:31.827688Z","signature_b64":"QRtzCO7+xT6utR39UeFRzJCvGDfgjXNIvpYPdVmted9gSPUmg0XdOUiWyALP4Qw2fJyEEoSa5W6ETUp3ttoHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","last_reissued_at":"2026-07-05T11:13:31.827264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:31.827264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00272","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-07-05T11:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MBGfSVCiiGoSr1SEF6ixX9FRUEhh8JTHvqZHEPajicDHjOivwoibQJqfYYs3iPnzvCgqDOKB2iWe7bDjdTeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:08:15.519477Z"},"content_sha256":"2195208895595e25e66a908e881b151c1df84eeb1b86f8b69db08f49c9f5fad4","schema_version":"1.0","event_id":"sha256:2195208895595e25e66a908e881b151c1df84eeb1b86f8b69db08f49c9f5fad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TEL4AZOFZJUEVT663NA756ZAD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Membership Geometric Set Cover in the Continuous Setting","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mayuresh Patle, Sathish Govindarajan, Siddhartha Sarkar","submitted_at":"2025-05-30T22:13:26Z","abstract_excerpt":"We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\\mathbb{R}^{2}$, and a geometric object $t$, the goal is to find a set $\\mathcal{S}$ of translated copies of the geometric object $t$ that covers all the points in $P$ while minimizing $\\mathsf{memb}(P, \\mathcal{S})$, where $\\mathsf{memb}(P, \\mathcal{S})=\\max_{p\\in P}|\\{s\\in \\mathcal{S}: p\\in s\\}|$.\n  For unit squares, we present a simple $O(n\\log n)$ time algorithm that outputs a $1$-membership cover. We show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00272","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/2506.00272/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-07-05T11:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UkCRaS4hgzC0vT8eeaL8QZoy7DKNH4pA5foctkYmPhNP7JneNXcBCoe32Q0fFgTlsWr6CUt0CQoRj07WqXNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:08:15.520001Z"},"content_sha256":"8656f3a0f24021b47e93a3a4b9ae221b02f316a091c6a4dc860776bae148bc1d","schema_version":"1.0","event_id":"sha256:8656f3a0f24021b47e93a3a4b9ae221b02f316a091c6a4dc860776bae148bc1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/bundle.json","state_url":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEL4AZOFZJUEVT663NA756ZAD2/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-08T09:08:15Z","links":{"resolver":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2","bundle":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/bundle.json","state":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEL4AZOFZJUEVT663NA756ZAD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TEL4AZOFZJUEVT663NA756ZAD2","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":"65a675a6853f4d23721c23fc5e77c4dfcf8919a19fd3e8dbac6c6b7e982cba16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T22:13:26Z","title_canon_sha256":"a9522a16a6035972553837b3aaf935ac72812beee741894137e70485acfd4292"},"schema_version":"1.0","source":{"id":"2506.00272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00272","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00272v1","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00272","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"TEL4AZOFZJUE","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_16","alias_value":"TEL4AZOFZJUEVT66","created_at":"2026-07-05T11:13:31Z"},{"alias_kind":"pith_short_8","alias_value":"TEL4AZOF","created_at":"2026-07-05T11:13:31Z"}],"graph_snapshots":[{"event_id":"sha256:8656f3a0f24021b47e93a3a4b9ae221b02f316a091c6a4dc860776bae148bc1d","target":"graph","created_at":"2026-07-05T11:13:31Z","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/2506.00272/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\\mathbb{R}^{2}$, and a geometric object $t$, the goal is to find a set $\\mathcal{S}$ of translated copies of the geometric object $t$ that covers all the points in $P$ while minimizing $\\mathsf{memb}(P, \\mathcal{S})$, where $\\mathsf{memb}(P, \\mathcal{S})=\\max_{p\\in P}|\\{s\\in \\mathcal{S}: p\\in s\\}|$.\n  For unit squares, we present a simple $O(n\\log n)$ time algorithm that outputs a $1$-membership cover. We show that t","authors_text":"Mayuresh Patle, Sathish Govindarajan, Siddhartha Sarkar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T22:13:26Z","title":"Minimum Membership Geometric Set Cover in the Continuous Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00272","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:2195208895595e25e66a908e881b151c1df84eeb1b86f8b69db08f49c9f5fad4","target":"record","created_at":"2026-07-05T11:13:31Z","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":"65a675a6853f4d23721c23fc5e77c4dfcf8919a19fd3e8dbac6c6b7e982cba16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T22:13:26Z","title_canon_sha256":"a9522a16a6035972553837b3aaf935ac72812beee741894137e70485acfd4292"},"schema_version":"1.0","source":{"id":"2506.00272","kind":"arxiv","version":1}},"canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","first_computed_at":"2026-07-05T11:13:31.827264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:31.827264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRtzCO7+xT6utR39UeFRzJCvGDfgjXNIvpYPdVmted9gSPUmg0XdOUiWyALP4Qw2fJyEEoSa5W6ETUp3ttoHCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:31.827688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2195208895595e25e66a908e881b151c1df84eeb1b86f8b69db08f49c9f5fad4","sha256:8656f3a0f24021b47e93a3a4b9ae221b02f316a091c6a4dc860776bae148bc1d"],"state_sha256":"4a10258f8fbb755a3c4c8a20197d4960096ff383fef461a3d95799777ddef2b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdaiujf9HZJYkP9rvQ2dsWIi/XM0vqRLt6Os7CHqhs/Jp8uCjCrvGRPEcqJn45HK8CQkNvbOlG4kj7fLju5tAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:08:15.524084Z","bundle_sha256":"4ad542ae9c9d093f64877bd5a1ba3d7cff8b530e3da870eded172f0984a5bc24"}}