{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GGM3PIWQGAWVZTVDYFDIGTTTXC","short_pith_number":"pith:GGM3PIWQ","schema_version":"1.0","canonical_sha256":"3199b7a2d0302d5ccea3c146834e73b8a0178e17949f2dfa8d65507d6573759f","source":{"kind":"arxiv","id":"1501.03246","version":1},"attestation_state":"computed","paper":{"title":"Tighter Estimates for epsilon-nets for Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nabil H. Mustafa, Norbert Bus, Saurabh Ray, Shashwat Garg","submitted_at":"2015-01-14T04:56:50Z","abstract_excerpt":"The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set $P$ of points, and a set $\\mathcal{D}$ of geometric objects in the plane, the goal is to compute a small-sized subset of $P$ that hits all objects in $\\mathcal{D}$. In 1994, Bronniman and Goodrich made an important connection of this problem to the size of fundamental combinatorial structures called $\\epsilon$-nets, showing that small-sized $\\epsilon$-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan showed that their"},"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":"1501.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-14T04:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"19fd3ba42f29750f81a0cde6f9db288287ef5de6301d7eaa4033e8655f828dbe","abstract_canon_sha256":"67acf7e36a19cc64d6c12dac8a1714f055d0566f4418f8ab27ce62399f3aac8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:24.402935Z","signature_b64":"Jye68hXMbB7rzUCR29el2FNyy4JHLCzTnIvphRxI+cNyN3ykXXOrpWjv3IajjIiA/LF0a74/GPVnycOj1iTlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3199b7a2d0302d5ccea3c146834e73b8a0178e17949f2dfa8d65507d6573759f","last_reissued_at":"2026-05-18T02:29:24.402549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:24.402549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Estimates for epsilon-nets for Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nabil H. Mustafa, Norbert Bus, Saurabh Ray, Shashwat Garg","submitted_at":"2015-01-14T04:56:50Z","abstract_excerpt":"The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set $P$ of points, and a set $\\mathcal{D}$ of geometric objects in the plane, the goal is to compute a small-sized subset of $P$ that hits all objects in $\\mathcal{D}$. In 1994, Bronniman and Goodrich made an important connection of this problem to the size of fundamental combinatorial structures called $\\epsilon$-nets, showing that small-sized $\\epsilon$-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan showed that their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03246","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":""},"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":"1501.03246","created_at":"2026-05-18T02:29:24.402605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03246v1","created_at":"2026-05-18T02:29:24.402605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03246","created_at":"2026-05-18T02:29:24.402605+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGM3PIWQGAWV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGM3PIWQGAWVZTVD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGM3PIWQ","created_at":"2026-05-18T12:29:22.688609+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/GGM3PIWQGAWVZTVDYFDIGTTTXC","json":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC.json","graph_json":"https://pith.science/api/pith-number/GGM3PIWQGAWVZTVDYFDIGTTTXC/graph.json","events_json":"https://pith.science/api/pith-number/GGM3PIWQGAWVZTVDYFDIGTTTXC/events.json","paper":"https://pith.science/paper/GGM3PIWQ"},"agent_actions":{"view_html":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC","download_json":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC.json","view_paper":"https://pith.science/paper/GGM3PIWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03246&json=true","fetch_graph":"https://pith.science/api/pith-number/GGM3PIWQGAWVZTVDYFDIGTTTXC/graph.json","fetch_events":"https://pith.science/api/pith-number/GGM3PIWQGAWVZTVDYFDIGTTTXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC/action/storage_attestation","attest_author":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC/action/author_attestation","sign_citation":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC/action/citation_signature","submit_replication":"https://pith.science/pith/GGM3PIWQGAWVZTVDYFDIGTTTXC/action/replication_record"}},"created_at":"2026-05-18T02:29:24.402605+00:00","updated_at":"2026-05-18T02:29:24.402605+00:00"}