{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ADQT76MS3E6Q7ONB6ICCGD3CCR","short_pith_number":"pith:ADQT76MS","schema_version":"1.0","canonical_sha256":"00e13ff992d93d0fb9a1f204230f62144a750fb47d93dc3d867e654244b027da","source":{"kind":"arxiv","id":"1710.01516","version":1},"attestation_state":"computed","paper":{"title":"An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Feliciano Colella, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2017-10-04T09:30:06Z","abstract_excerpt":"A tree $\\sigma$-spanner of a positively real-weighted $n$-vertex and $m$-edge undirected graph $G$ is a spanning tree $T$ of $G$ which approximately preserves (i.e., up to a multiplicative stretch factor $\\sigma$) distances in $G$. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in $T$, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., comp"},"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":"1710.01516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-04T09:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"45844377d538d7d41d894318b458a9a9e677c20fa49e24dd406f7de802e83849","abstract_canon_sha256":"18db862b79a4278d3b431d081bfcf92f8e46a95fc9d2965e18961d2b738a455c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.520504Z","signature_b64":"NlmkATamb9wdvjG3NYdl/zBavQK+JCiG+re0ygbEjJUVFWW1uwSXPAgYl5c+fCmNTZjNcyej8eho5aRWltkGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00e13ff992d93d0fb9a1f204230f62144a750fb47d93dc3d867e654244b027da","last_reissued_at":"2026-05-18T00:33:42.519847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.519847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Feliciano Colella, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2017-10-04T09:30:06Z","abstract_excerpt":"A tree $\\sigma$-spanner of a positively real-weighted $n$-vertex and $m$-edge undirected graph $G$ is a spanning tree $T$ of $G$ which approximately preserves (i.e., up to a multiplicative stretch factor $\\sigma$) distances in $G$. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in $T$, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01516","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":"1710.01516","created_at":"2026-05-18T00:33:42.519947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01516v1","created_at":"2026-05-18T00:33:42.519947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01516","created_at":"2026-05-18T00:33:42.519947+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADQT76MS3E6Q","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADQT76MS3E6Q7ONB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADQT76MS","created_at":"2026-05-18T12:31:05.417338+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/ADQT76MS3E6Q7ONB6ICCGD3CCR","json":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR.json","graph_json":"https://pith.science/api/pith-number/ADQT76MS3E6Q7ONB6ICCGD3CCR/graph.json","events_json":"https://pith.science/api/pith-number/ADQT76MS3E6Q7ONB6ICCGD3CCR/events.json","paper":"https://pith.science/paper/ADQT76MS"},"agent_actions":{"view_html":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR","download_json":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR.json","view_paper":"https://pith.science/paper/ADQT76MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01516&json=true","fetch_graph":"https://pith.science/api/pith-number/ADQT76MS3E6Q7ONB6ICCGD3CCR/graph.json","fetch_events":"https://pith.science/api/pith-number/ADQT76MS3E6Q7ONB6ICCGD3CCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR/action/storage_attestation","attest_author":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR/action/author_attestation","sign_citation":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR/action/citation_signature","submit_replication":"https://pith.science/pith/ADQT76MS3E6Q7ONB6ICCGD3CCR/action/replication_record"}},"created_at":"2026-05-18T00:33:42.519947+00:00","updated_at":"2026-05-18T00:33:42.519947+00:00"}