{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TEL4AZOFZJUEVT663NA756ZAD2","short_pith_number":"pith:TEL4AZOF","schema_version":"1.0","canonical_sha256":"9917c065c5ca684acfdedb41fefb201e91973243938cb5fbd7dc548c00f8d00e","source":{"kind":"arxiv","id":"2506.00272","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.00272","created_at":"2026-07-05T11:13:31.827321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00272v1","created_at":"2026-07-05T11:13:31.827321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00272","created_at":"2026-07-05T11:13:31.827321+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEL4AZOFZJUE","created_at":"2026-07-05T11:13:31.827321+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEL4AZOFZJUEVT66","created_at":"2026-07-05T11:13:31.827321+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEL4AZOF","created_at":"2026-07-05T11:13:31.827321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2","json":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2.json","graph_json":"https://pith.science/api/pith-number/TEL4AZOFZJUEVT663NA756ZAD2/graph.json","events_json":"https://pith.science/api/pith-number/TEL4AZOFZJUEVT663NA756ZAD2/events.json","paper":"https://pith.science/paper/TEL4AZOF"},"agent_actions":{"view_html":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2","download_json":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2.json","view_paper":"https://pith.science/paper/TEL4AZOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00272&json=true","fetch_graph":"https://pith.science/api/pith-number/TEL4AZOFZJUEVT663NA756ZAD2/graph.json","fetch_events":"https://pith.science/api/pith-number/TEL4AZOFZJUEVT663NA756ZAD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/action/storage_attestation","attest_author":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/action/author_attestation","sign_citation":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/action/citation_signature","submit_replication":"https://pith.science/pith/TEL4AZOFZJUEVT663NA756ZAD2/action/replication_record"}},"created_at":"2026-07-05T11:13:31.827321+00:00","updated_at":"2026-07-05T11:13:31.827321+00:00"}