{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TZNOWM7SVPVFX7W4XUI3CS5AFE","short_pith_number":"pith:TZNOWM7S","schema_version":"1.0","canonical_sha256":"9e5aeb33f2abea5bfedcbd11b14ba029003958e2eb863f14b3ce2cd1d3b2a17b","source":{"kind":"arxiv","id":"2506.04246","version":1},"attestation_state":"computed","paper":{"title":"Improving the average dilation of a metric graph by adding edges","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eliot W. Robson, Sariel Har-Peled","submitted_at":"2025-05-30T21:58:20Z","abstract_excerpt":"For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to augment $G$ with $k$ additional edges to reduce the maximum dilation.\n  In this note, we consider a variant of this problem where the goal is to reduce the average dilation for pairs of points in $G$. We provide an $O(k)$ approximation algorithm for this problem, matching the approximation ratio given by prior work for the maximum dilation variant."},"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":"2506.04246","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CG","submitted_at":"2025-05-30T21:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"896b84c80093b0176402c8174d1a8ec29959be1db5ec1d33b801e3d285d82da3","abstract_canon_sha256":"e3b01360cf3b75416c30be8e182f54e372960f6d941c3cdfd6beb6e3ff7c01e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:11.000240Z","signature_b64":"Ic8m471WClZ0gBpovUvJvCfWytJ68bu9vThKuZt2JInj2sx1qrfizHOG+75VgIr/1XxAZ3XJUiwZCr96gm66CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5aeb33f2abea5bfedcbd11b14ba029003958e2eb863f14b3ce2cd1d3b2a17b","last_reissued_at":"2026-07-05T11:16:10.999779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:10.999779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the average dilation of a metric graph by adding edges","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eliot W. Robson, Sariel Har-Peled","submitted_at":"2025-05-30T21:58:20Z","abstract_excerpt":"For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to augment $G$ with $k$ additional edges to reduce the maximum dilation.\n  In this note, we consider a variant of this problem where the goal is to reduce the average dilation for pairs of points in $G$. We provide an $O(k)$ approximation algorithm for this problem, matching the approximation ratio given by prior work for the maximum dilation variant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04246","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/2506.04246/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":"2506.04246","created_at":"2026-07-05T11:16:10.999844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04246v1","created_at":"2026-07-05T11:16:10.999844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04246","created_at":"2026-07-05T11:16:10.999844+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZNOWM7SVPVF","created_at":"2026-07-05T11:16:10.999844+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZNOWM7SVPVFX7W4","created_at":"2026-07-05T11:16:10.999844+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZNOWM7S","created_at":"2026-07-05T11:16:10.999844+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/TZNOWM7SVPVFX7W4XUI3CS5AFE","json":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE.json","graph_json":"https://pith.science/api/pith-number/TZNOWM7SVPVFX7W4XUI3CS5AFE/graph.json","events_json":"https://pith.science/api/pith-number/TZNOWM7SVPVFX7W4XUI3CS5AFE/events.json","paper":"https://pith.science/paper/TZNOWM7S"},"agent_actions":{"view_html":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE","download_json":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE.json","view_paper":"https://pith.science/paper/TZNOWM7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04246&json=true","fetch_graph":"https://pith.science/api/pith-number/TZNOWM7SVPVFX7W4XUI3CS5AFE/graph.json","fetch_events":"https://pith.science/api/pith-number/TZNOWM7SVPVFX7W4XUI3CS5AFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE/action/storage_attestation","attest_author":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE/action/author_attestation","sign_citation":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE/action/citation_signature","submit_replication":"https://pith.science/pith/TZNOWM7SVPVFX7W4XUI3CS5AFE/action/replication_record"}},"created_at":"2026-07-05T11:16:10.999844+00:00","updated_at":"2026-07-05T11:16:10.999844+00:00"}