{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TLTRBCWL5SEI7OSPFHBFG2FPMB","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":"5d8e5b7db3dd90322ea49b402ef2d9fa927a682eb6ae08097aeb226508e5e189","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2020-02-15T17:33:05Z","title_canon_sha256":"ebdddaf09257cf7312ce945685975d9a9386fa43491c63400e15b29bf4719410"},"schema_version":"1.0","source":{"id":"2002.07152","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07152","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07152v5","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07152","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"TLTRBCWL5SEI","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_16","alias_value":"TLTRBCWL5SEI7OSP","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_8","alias_value":"TLTRBCWL","created_at":"2026-07-05T02:52:56Z"}],"graph_snapshots":[{"event_id":"sha256:e14a3ae5c35ec3d0090b53f35e3b17c9ea201bf377980044b6c82488df05537b","target":"graph","created_at":"2026-07-05T02:52:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.07152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Faryad Darabi Sahneh, Greg Bodwin, Reyan Ahmed, Richard Spence, Stephen Kobourov","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2020-02-15T17:33:05Z","title":"Weighted Additive Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07152","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:7797a4f94c5fd9bec79002e026f9936d2e60b9ac855a90224da961f5974ff112","target":"record","created_at":"2026-07-05T02:52:56Z","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":"5d8e5b7db3dd90322ea49b402ef2d9fa927a682eb6ae08097aeb226508e5e189","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2020-02-15T17:33:05Z","title_canon_sha256":"ebdddaf09257cf7312ce945685975d9a9386fa43491c63400e15b29bf4719410"},"schema_version":"1.0","source":{"id":"2002.07152","kind":"arxiv","version":5}},"canonical_sha256":"9ae7108acbec888fba4f29c25368af6057392095a8bbc1bd63fd51f2829fd887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae7108acbec888fba4f29c25368af6057392095a8bbc1bd63fd51f2829fd887","first_computed_at":"2026-07-05T02:52:56.572019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:56.572019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IMUqdfeD36EmbJxWNPxHTMbQ3v1UqZqrjY062jA1nyo2PJvbFvRbORgl5Pegojii9sUg8BKw1oPIsSYxAOipAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:56.572519Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07152","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7797a4f94c5fd9bec79002e026f9936d2e60b9ac855a90224da961f5974ff112","sha256:e14a3ae5c35ec3d0090b53f35e3b17c9ea201bf377980044b6c82488df05537b"],"state_sha256":"fe89b4be5cb89f0e7aaf1e0b2bb9f814b4f5791089aad985ce3c8a176c07e2fd"}