{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5PDKFDE5JPPGR3LBONADGBWBYT","short_pith_number":"pith:5PDKFDE5","schema_version":"1.0","canonical_sha256":"ebc6a28c9d4bde68ed6173403306c1c4caf559d8fede87fdef34a3beca53eef0","source":{"kind":"arxiv","id":"2607.06069","version":1},"attestation_state":"computed","paper":{"title":"Shifting is Optimal under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Manuel C\\'aceres, Saeed Odak, S\\'andor Kisfaludi-Bak","submitted_at":"2026-07-07T09:40:33Z","abstract_excerpt":"The shifting technique of Hochbaum and Maass [J.ACM'85] produces PTASes with the fastest known running times $n^{O(1/\\varepsilon^{d-1})}$ for several $d$-dimensional geometric problems. However, it is only known, due to Marx [FOCS'07], that these algorithms are indeed optimal for dimension $d=2$.\n  We show that these running times are optimal under Gap-ETH for every constant dimension. More precisely, we develop a framework that enables us to prove the conditional optimality of the shifting algorithms for several problems on unit ball graphs, such as maximum independent set, maximum induced fo"},"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":"2607.06069","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-07T09:40:33Z","cross_cats_sorted":[],"title_canon_sha256":"843c404579d3f6abee5db3f42a89a6942aa84da803857fe403597b7c511db787","abstract_canon_sha256":"20d839340a0e4138eaaedf178b4fc40eedcef4e9f19c536969d01d3e686607cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:55.526802Z","signature_b64":"8pnoPC92ku4UkKTkQt+PoU8b6HOgLXBzA4f+9YEQEecJuwdRDtW54hBgBSpUNo01pla3Fotp1EZA1ku/NBMdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc6a28c9d4bde68ed6173403306c1c4caf559d8fede87fdef34a3beca53eef0","last_reissued_at":"2026-07-08T01:18:55.526377Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:55.526377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shifting is Optimal under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Manuel C\\'aceres, Saeed Odak, S\\'andor Kisfaludi-Bak","submitted_at":"2026-07-07T09:40:33Z","abstract_excerpt":"The shifting technique of Hochbaum and Maass [J.ACM'85] produces PTASes with the fastest known running times $n^{O(1/\\varepsilon^{d-1})}$ for several $d$-dimensional geometric problems. However, it is only known, due to Marx [FOCS'07], that these algorithms are indeed optimal for dimension $d=2$.\n  We show that these running times are optimal under Gap-ETH for every constant dimension. More precisely, we develop a framework that enables us to prove the conditional optimality of the shifting algorithms for several problems on unit ball graphs, such as maximum independent set, maximum induced fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06069","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/2607.06069/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":"2607.06069","created_at":"2026-07-08T01:18:55.526445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06069v1","created_at":"2026-07-08T01:18:55.526445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06069","created_at":"2026-07-08T01:18:55.526445+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PDKFDE5JPPG","created_at":"2026-07-08T01:18:55.526445+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PDKFDE5JPPGR3LB","created_at":"2026-07-08T01:18:55.526445+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PDKFDE5","created_at":"2026-07-08T01:18:55.526445+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/5PDKFDE5JPPGR3LBONADGBWBYT","json":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT.json","graph_json":"https://pith.science/api/pith-number/5PDKFDE5JPPGR3LBONADGBWBYT/graph.json","events_json":"https://pith.science/api/pith-number/5PDKFDE5JPPGR3LBONADGBWBYT/events.json","paper":"https://pith.science/paper/5PDKFDE5"},"agent_actions":{"view_html":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT","download_json":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT.json","view_paper":"https://pith.science/paper/5PDKFDE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06069&json=true","fetch_graph":"https://pith.science/api/pith-number/5PDKFDE5JPPGR3LBONADGBWBYT/graph.json","fetch_events":"https://pith.science/api/pith-number/5PDKFDE5JPPGR3LBONADGBWBYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT/action/storage_attestation","attest_author":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT/action/author_attestation","sign_citation":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT/action/citation_signature","submit_replication":"https://pith.science/pith/5PDKFDE5JPPGR3LBONADGBWBYT/action/replication_record"}},"created_at":"2026-07-08T01:18:55.526445+00:00","updated_at":"2026-07-08T01:18:55.526445+00:00"}