{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OXGW46SZPZNUJCMMS4M2CXRSB3","short_pith_number":"pith:OXGW46SZ","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"},"canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","source":{"kind":"arxiv","id":"1402.4722","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4722","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4722v5","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4722","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"OXGW46SZPZNU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXGW46SZPZNUJCMM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXGW46SZ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OXGW46SZPZNUJCMMS4M2CXRSB3","target":"record","payload":{"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"},"canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","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"},"source_kind":"arxiv","source_id":"1402.4722","source_version":5,"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-05-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZIAwJQ+T91Je4HCd6eqKHK8oAQqrQwnwyhsj9hfCGykT2AI70AFlm8gZOpzUaiJ7xwBhPUK+W/No2TbJZpGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:53:24.749697Z"},"content_sha256":"8c254720fcd9c7ea172419c8ab448d2ee93510991902e6131e0ba7ba51aa94d4","schema_version":"1.0","event_id":"sha256:8c254720fcd9c7ea172419c8ab448d2ee93510991902e6131e0ba7ba51aa94d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OXGW46SZPZNUJCMMS4M2CXRSB3","target":"graph","payload":{"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"},"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-05-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwLfR/gq00O77Zv7ckaKOiA6uNSJrd7OsR3ZQdsi9LV/K4lwI2eIkVRD7dM65rbZRJJQDoznfRNt/4hd+jA3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:53:24.750048Z"},"content_sha256":"8589ecd5ba7596928af9a93989fa55ecb6353f1b3584fcb33d33fade5edbcb61","schema_version":"1.0","event_id":"sha256:8589ecd5ba7596928af9a93989fa55ecb6353f1b3584fcb33d33fade5edbcb61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/bundle.json","state_url":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/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-06-24T16:53:24Z","links":{"resolver":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3","bundle":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/bundle.json","state":"https://pith.science/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXGW46SZPZNUJCMMS4M2CXRSB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OXGW46SZPZNUJCMMS4M2CXRSB3","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":"d01c3ca0d0d120e0871cb32ecc56f1df3e9b9125ebde00fcf0cd2007607080fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-19T16:30:04Z","title_canon_sha256":"0492f5603fd228c5d46d66f895c3288f138d85c85606332ba8ca45f5f965e26f"},"schema_version":"1.0","source":{"id":"1402.4722","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4722","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4722v5","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4722","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"OXGW46SZPZNU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXGW46SZPZNUJCMM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXGW46SZ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:8589ecd5ba7596928af9a93989fa55ecb6353f1b3584fcb33d33fade5edbcb61","target":"graph","created_at":"2026-05-18T01:00:10Z","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"},"paper":{"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","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vin\\'icius G. Pereira de S\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-19T16:30:04Z","title":"Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4722","kind":"arxiv","version":5},"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:8c254720fcd9c7ea172419c8ab448d2ee93510991902e6131e0ba7ba51aa94d4","target":"record","created_at":"2026-05-18T01:00:10Z","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":"d01c3ca0d0d120e0871cb32ecc56f1df3e9b9125ebde00fcf0cd2007607080fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-19T16:30:04Z","title_canon_sha256":"0492f5603fd228c5d46d66f895c3288f138d85c85606332ba8ca45f5f965e26f"},"schema_version":"1.0","source":{"id":"1402.4722","kind":"arxiv","version":5}},"canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75cd6e7a597e5b44898c9719a15e320ef7a76934f9850418737691040d8832c4","first_computed_at":"2026-05-18T01:00:10.534479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:10.534479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5ZsfszAcFodLuDQoeHt7+tyuGTpkWsZVQ4l5zpUBGNDqOlwql590BJbe6ByrjVtxGnwQQKpxLNdw3IfMp5qBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:10.535184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4722","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c254720fcd9c7ea172419c8ab448d2ee93510991902e6131e0ba7ba51aa94d4","sha256:8589ecd5ba7596928af9a93989fa55ecb6353f1b3584fcb33d33fade5edbcb61"],"state_sha256":"00fc6ca4ada8f1f946ff6174baad3bc265a1af3bf6581704e8168024f7532685"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fm/dI0D8oiAFSNjdhMYuflvt48OANoE2XPxCmOJxubl5KbVoeUR4mI0+8KZ6QFT8e8X8pKdqM1yhDXpfmI1MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:53:24.752010Z","bundle_sha256":"d00d44128c06c9726c042ce0ff547161a28cfeeb4cbdf23ccc5f0a233ae2a3f3"}}