{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H6FWVHDAJKGWWZMFMLOTII6VFX","short_pith_number":"pith:H6FWVHDA","schema_version":"1.0","canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","source":{"kind":"arxiv","id":"1704.04473","version":1},"attestation_state":"computed","paper":{"title":"Additive Spanners and Distance Oracles in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen","submitted_at":"2017-04-14T16:36:22Z","abstract_excerpt":"Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \\le d_G(u,v)+k$ for all nodes $u,v$, where $d$ is the shortest path distance. We give a deterministic algorithm that constructs an additive $O\\!\\left(1\\right)$-spanner with $O\\!\\left(n^{4/3}\\right)$ edges in $O\\!\\left(n^2\\right)$ time. This should be compared with the randomized Monte Carlo algorithm by Woodruff [ICALP 2010] giving an additive $6$-spanner with $O\\!\\left(n^{4/3}\\log^3 "},"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":"1704.04473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e4908e948c5a7be9d9b260311155c63f8bbfce001d95a77e82da4646dd05536","abstract_canon_sha256":"676c51dfe515f1ee49a09b2d55dc9bb3da3189231f058bcb011adbeb6b0f68a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.610630Z","signature_b64":"LRcew1ihVCiQT9swGkr0SkdZAYH5NxWlk8T4DTccWvuMq7FE4Fk5fZSah/wFrYvsvZfAs1rT/+emuY6L8UlyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","last_reissued_at":"2026-05-18T00:46:21.610204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.610204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Additive Spanners and Distance Oracles in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen","submitted_at":"2017-04-14T16:36:22Z","abstract_excerpt":"Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \\le d_G(u,v)+k$ for all nodes $u,v$, where $d$ is the shortest path distance. We give a deterministic algorithm that constructs an additive $O\\!\\left(1\\right)$-spanner with $O\\!\\left(n^{4/3}\\right)$ edges in $O\\!\\left(n^2\\right)$ time. This should be compared with the randomized Monte Carlo algorithm by Woodruff [ICALP 2010] giving an additive $6$-spanner with $O\\!\\left(n^{4/3}\\log^3 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04473","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":"1704.04473","created_at":"2026-05-18T00:46:21.610276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04473v1","created_at":"2026-05-18T00:46:21.610276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04473","created_at":"2026-05-18T00:46:21.610276+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6FWVHDAJKGW","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6FWVHDAJKGWWZMF","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6FWVHDA","created_at":"2026-05-18T12:31:18.294218+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/H6FWVHDAJKGWWZMFMLOTII6VFX","json":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX.json","graph_json":"https://pith.science/api/pith-number/H6FWVHDAJKGWWZMFMLOTII6VFX/graph.json","events_json":"https://pith.science/api/pith-number/H6FWVHDAJKGWWZMFMLOTII6VFX/events.json","paper":"https://pith.science/paper/H6FWVHDA"},"agent_actions":{"view_html":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX","download_json":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX.json","view_paper":"https://pith.science/paper/H6FWVHDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04473&json=true","fetch_graph":"https://pith.science/api/pith-number/H6FWVHDAJKGWWZMFMLOTII6VFX/graph.json","fetch_events":"https://pith.science/api/pith-number/H6FWVHDAJKGWWZMFMLOTII6VFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/action/storage_attestation","attest_author":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/action/author_attestation","sign_citation":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/action/citation_signature","submit_replication":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/action/replication_record"}},"created_at":"2026-05-18T00:46:21.610276+00:00","updated_at":"2026-05-18T00:46:21.610276+00:00"}