{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SC5EXY7DUG56C5GHFX5AUZ5FMY","short_pith_number":"pith:SC5EXY7D","schema_version":"1.0","canonical_sha256":"90ba4be3e3a1bbe174c72dfa0a67a56608b47c732e3936cc2505987f4bd19bb4","source":{"kind":"arxiv","id":"1809.08822","version":2},"attestation_state":"computed","paper":{"title":"Almost optimal algorithms for diameter-optimally augmenting trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o","submitted_at":"2018-09-24T09:55:06Z","abstract_excerpt":"We consider the problem of augmenting an $n$-vertex tree with one shortcut in order to minimize the diameter of the resulting graph. The tree is embedded in an unknown space and we have access to an oracle that, when queried on a pair of vertices $u$ and $v$, reports the weight of the shortcut $(u,v)$ in constant time. Previously, the problem was solved in $O(n^2 \\log^3 n)$ time for general weights [Oh and Ahn, ISAAC 2016], in $O(n^2 \\log n)$ time for trees embedded in a metric space [Gro{\\ss}e et al., {\\tt arXiv:1607.05547}], and in $O(n \\log n)$ time for paths embedded in a metric space [Wan"},"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":"1809.08822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-24T09:55:06Z","cross_cats_sorted":[],"title_canon_sha256":"95bff8f6d61b36482152b0ff5336737ca3cc9b049264f9a5746658a711ca8a4c","abstract_canon_sha256":"0db0ed1c52b9537a0101d18af83ec85a331dd84e76666c24a6f5c582e20980aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.902089Z","signature_b64":"POFRJOMLVymZTYuI4wgYOHJ1JY48mGsQNudRmvnKRv8sgc6LpnE6T44QSHYLcli5Bmetjaq0WJJ4Yn2a9g3AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ba4be3e3a1bbe174c72dfa0a67a56608b47c732e3936cc2505987f4bd19bb4","last_reissued_at":"2026-05-18T00:04:19.901462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.901462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost optimal algorithms for diameter-optimally augmenting trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o","submitted_at":"2018-09-24T09:55:06Z","abstract_excerpt":"We consider the problem of augmenting an $n$-vertex tree with one shortcut in order to minimize the diameter of the resulting graph. The tree is embedded in an unknown space and we have access to an oracle that, when queried on a pair of vertices $u$ and $v$, reports the weight of the shortcut $(u,v)$ in constant time. Previously, the problem was solved in $O(n^2 \\log^3 n)$ time for general weights [Oh and Ahn, ISAAC 2016], in $O(n^2 \\log n)$ time for trees embedded in a metric space [Gro{\\ss}e et al., {\\tt arXiv:1607.05547}], and in $O(n \\log n)$ time for paths embedded in a metric space [Wan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08822","kind":"arxiv","version":2},"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":"1809.08822","created_at":"2026-05-18T00:04:19.901545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08822v2","created_at":"2026-05-18T00:04:19.901545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08822","created_at":"2026-05-18T00:04:19.901545+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC5EXY7DUG56","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC5EXY7DUG56C5GH","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC5EXY7D","created_at":"2026-05-18T12:32:50.500415+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/SC5EXY7DUG56C5GHFX5AUZ5FMY","json":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY.json","graph_json":"https://pith.science/api/pith-number/SC5EXY7DUG56C5GHFX5AUZ5FMY/graph.json","events_json":"https://pith.science/api/pith-number/SC5EXY7DUG56C5GHFX5AUZ5FMY/events.json","paper":"https://pith.science/paper/SC5EXY7D"},"agent_actions":{"view_html":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY","download_json":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY.json","view_paper":"https://pith.science/paper/SC5EXY7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08822&json=true","fetch_graph":"https://pith.science/api/pith-number/SC5EXY7DUG56C5GHFX5AUZ5FMY/graph.json","fetch_events":"https://pith.science/api/pith-number/SC5EXY7DUG56C5GHFX5AUZ5FMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY/action/storage_attestation","attest_author":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY/action/author_attestation","sign_citation":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY/action/citation_signature","submit_replication":"https://pith.science/pith/SC5EXY7DUG56C5GHFX5AUZ5FMY/action/replication_record"}},"created_at":"2026-05-18T00:04:19.901545+00:00","updated_at":"2026-05-18T00:04:19.901545+00:00"}