{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TLTRBCWL5SEI7OSPFHBFG2FPMB","short_pith_number":"pith:TLTRBCWL","schema_version":"1.0","canonical_sha256":"9ae7108acbec888fba4f29c25368af6057392095a8bbc1bd63fd51f2829fd887","source":{"kind":"arxiv","id":"2002.07152","version":5},"attestation_state":"computed","paper":{"title":"Weighted Additive Spanners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Faryad Darabi Sahneh, Greg Bodwin, Reyan Ahmed, Richard Spence, Stephen Kobourov","submitted_at":"2020-02-15T17:33:05Z","abstract_excerpt":"A \\emph{spanner} of a graph $G$ is a subgraph $H$ that approximately preserves shortest path distances in $G$. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner constructions can seamlessly handle edge weights, so long as error is measured \\emph{multiplicatively}. In this work, we investigate whether one can similarly extend constructions of spanners with purely \\emph{additive} error to weighted graphs. These extensions are not immediate, due to a key lemma about the size of shortest path neighborhoods that fails for "},"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":"2002.07152","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2020-02-15T17:33:05Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"ebdddaf09257cf7312ce945685975d9a9386fa43491c63400e15b29bf4719410","abstract_canon_sha256":"5d8e5b7db3dd90322ea49b402ef2d9fa927a682eb6ae08097aeb226508e5e189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:56.572519Z","signature_b64":"IMUqdfeD36EmbJxWNPxHTMbQ3v1UqZqrjY062jA1nyo2PJvbFvRbORgl5Pegojii9sUg8BKw1oPIsSYxAOipAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae7108acbec888fba4f29c25368af6057392095a8bbc1bd63fd51f2829fd887","last_reissued_at":"2026-07-05T02:52:56.572019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:56.572019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Additive Spanners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Faryad Darabi Sahneh, Greg Bodwin, Reyan Ahmed, Richard Spence, Stephen Kobourov","submitted_at":"2020-02-15T17:33:05Z","abstract_excerpt":"A \\emph{spanner} of a graph $G$ is a subgraph $H$ that approximately preserves shortest path distances in $G$. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner constructions can seamlessly handle edge weights, so long as error is measured \\emph{multiplicatively}. In this work, we investigate whether one can similarly extend constructions of spanners with purely \\emph{additive} error to weighted graphs. These extensions are not immediate, due to a key lemma about the size of shortest path neighborhoods that fails for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07152","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.07152/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":"2002.07152","created_at":"2026-07-05T02:52:56.572088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.07152v5","created_at":"2026-07-05T02:52:56.572088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07152","created_at":"2026-07-05T02:52:56.572088+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLTRBCWL5SEI","created_at":"2026-07-05T02:52:56.572088+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLTRBCWL5SEI7OSP","created_at":"2026-07-05T02:52:56.572088+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLTRBCWL","created_at":"2026-07-05T02:52:56.572088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26831","citing_title":"Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB","json":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB.json","graph_json":"https://pith.science/api/pith-number/TLTRBCWL5SEI7OSPFHBFG2FPMB/graph.json","events_json":"https://pith.science/api/pith-number/TLTRBCWL5SEI7OSPFHBFG2FPMB/events.json","paper":"https://pith.science/paper/TLTRBCWL"},"agent_actions":{"view_html":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB","download_json":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB.json","view_paper":"https://pith.science/paper/TLTRBCWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.07152&json=true","fetch_graph":"https://pith.science/api/pith-number/TLTRBCWL5SEI7OSPFHBFG2FPMB/graph.json","fetch_events":"https://pith.science/api/pith-number/TLTRBCWL5SEI7OSPFHBFG2FPMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB/action/storage_attestation","attest_author":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB/action/author_attestation","sign_citation":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB/action/citation_signature","submit_replication":"https://pith.science/pith/TLTRBCWL5SEI7OSPFHBFG2FPMB/action/replication_record"}},"created_at":"2026-07-05T02:52:56.572088+00:00","updated_at":"2026-07-05T02:52:56.572088+00:00"}