{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RG7TUDT3UUZTFCJDC3QK75O5FL","short_pith_number":"pith:RG7TUDT3","schema_version":"1.0","canonical_sha256":"89bf3a0e7ba53332892316e0aff5dd2aef6f3d70cda633b891bebcc5964305a4","source":{"kind":"arxiv","id":"1403.0835","version":2},"attestation_state":"computed","paper":{"title":"QPTAS for Geometric Set-Cover Problems via Optimal Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nabil H. Mustafa, Rajiv Raman, Saurabh Ray","submitted_at":"2014-03-04T16:38:13Z","abstract_excerpt":"Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover). More than two decades of research has succeeded in settling the $(1+\\epsilon)$-approximability status for most geometric set-cover problems, except for four basic scenarios which are still lacking. One is that of weighted disks in the plane for which, after a series of papers, Varadarajan (STOC 2010) presented a clever \\emph{quasi-sampling} technique, which 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":"1403.0835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-04T16:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"00c015bfb0be8f8fea2f56e1e9e5867124e086da91fec87331de9c88ca82af64","abstract_canon_sha256":"6ef09b465e9275e045a51bf5e044e244baa06ee7a1a24280ab81a5542a4f9265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:46.471527Z","signature_b64":"t3poevJ9UB07rz8c8716nO9NnO8tKbttye41m0VOzvzhB35vdCE8Ksk44e/yrl7Om8xx6sMXdU2qzL4LCGpBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89bf3a0e7ba53332892316e0aff5dd2aef6f3d70cda633b891bebcc5964305a4","last_reissued_at":"2026-05-18T02:54:46.471138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:46.471138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QPTAS for Geometric Set-Cover Problems via Optimal Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nabil H. Mustafa, Rajiv Raman, Saurabh Ray","submitted_at":"2014-03-04T16:38:13Z","abstract_excerpt":"Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover). More than two decades of research has succeeded in settling the $(1+\\epsilon)$-approximability status for most geometric set-cover problems, except for four basic scenarios which are still lacking. One is that of weighted disks in the plane for which, after a series of papers, Varadarajan (STOC 2010) presented a clever \\emph{quasi-sampling} technique, which t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0835","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.0835","created_at":"2026-05-18T02:54:46.471196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0835v2","created_at":"2026-05-18T02:54:46.471196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0835","created_at":"2026-05-18T02:54:46.471196+00:00"},{"alias_kind":"pith_short_12","alias_value":"RG7TUDT3UUZT","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RG7TUDT3UUZTFCJD","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RG7TUDT3","created_at":"2026-05-18T12:28:46.137349+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/RG7TUDT3UUZTFCJDC3QK75O5FL","json":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL.json","graph_json":"https://pith.science/api/pith-number/RG7TUDT3UUZTFCJDC3QK75O5FL/graph.json","events_json":"https://pith.science/api/pith-number/RG7TUDT3UUZTFCJDC3QK75O5FL/events.json","paper":"https://pith.science/paper/RG7TUDT3"},"agent_actions":{"view_html":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL","download_json":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL.json","view_paper":"https://pith.science/paper/RG7TUDT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0835&json=true","fetch_graph":"https://pith.science/api/pith-number/RG7TUDT3UUZTFCJDC3QK75O5FL/graph.json","fetch_events":"https://pith.science/api/pith-number/RG7TUDT3UUZTFCJDC3QK75O5FL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL/action/storage_attestation","attest_author":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL/action/author_attestation","sign_citation":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL/action/citation_signature","submit_replication":"https://pith.science/pith/RG7TUDT3UUZTFCJDC3QK75O5FL/action/replication_record"}},"created_at":"2026-05-18T02:54:46.471196+00:00","updated_at":"2026-05-18T02:54:46.471196+00:00"}