{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OXGW46SZPZNUJCMMS4M2CXRSB3","short_pith_number":"pith:OXGW46SZ","schema_version":"1.0","canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","source":{"kind":"arxiv","id":"1402.4722","version":5},"attestation_state":"computed","paper":{"title":"Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vin\\'icius G. Pereira de S\\'a","submitted_at":"2014-02-19T16:30:04Z","abstract_excerpt":"Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy that allows us to obtain linear-time constant-factor approximation algorithms for such problems. To illustrate the applicability of the proposed variation, we obtain results for three well-known optimization problems. Among such results, the proposed method yields linear-time (4+eps)-approximation for the maximum-weight independent set and the minimum dominati"},"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":"1402.4722","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-19T16:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"0492f5603fd228c5d46d66f895c3288f138d85c85606332ba8ca45f5f965e26f","abstract_canon_sha256":"d01c3ca0d0d120e0871cb32ecc56f1df3e9b9125ebde00fcf0cd2007607080fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.535184Z","signature_b64":"V5ZsfszAcFodLuDQoeHt7+tyuGTpkWsZVQ4l5zpUBGNDqOlwql590BJbe6ByrjVtxGnwQQKpxLNdw3IfMp5qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","last_reissued_at":"2026-05-18T01:00:10.534479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.534479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vin\\'icius G. Pereira de S\\'a","submitted_at":"2014-02-19T16:30:04Z","abstract_excerpt":"Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy that allows us to obtain linear-time constant-factor approximation algorithms for such problems. To illustrate the applicability of the proposed variation, we obtain results for three well-known optimization problems. Among such results, the proposed method yields linear-time (4+eps)-approximation for the maximum-weight independent set and the minimum dominati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4722","kind":"arxiv","version":5},"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":"1402.4722","created_at":"2026-05-18T01:00:10.534592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4722v5","created_at":"2026-05-18T01:00:10.534592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4722","created_at":"2026-05-18T01:00:10.534592+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXGW46SZPZNU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXGW46SZPZNUJCMM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXGW46SZ","created_at":"2026-05-18T12:28:43.426989+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/OXGW46SZPZNUJCMMS4M2CXRSB3","json":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3.json","graph_json":"https://pith.science/api/pith-number/OXGW46SZPZNUJCMMS4M2CXRSB3/graph.json","events_json":"https://pith.science/api/pith-number/OXGW46SZPZNUJCMMS4M2CXRSB3/events.json","paper":"https://pith.science/paper/OXGW46SZ"},"agent_actions":{"view_html":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3","download_json":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3.json","view_paper":"https://pith.science/paper/OXGW46SZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4722&json=true","fetch_graph":"https://pith.science/api/pith-number/OXGW46SZPZNUJCMMS4M2CXRSB3/graph.json","fetch_events":"https://pith.science/api/pith-number/OXGW46SZPZNUJCMMS4M2CXRSB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/action/storage_attestation","attest_author":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/action/author_attestation","sign_citation":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/action/citation_signature","submit_replication":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/action/replication_record"}},"created_at":"2026-05-18T01:00:10.534592+00:00","updated_at":"2026-05-18T01:00:10.534592+00:00"}