{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6R7QBASWSB2ZIGGRWQNYBO6YF7","short_pith_number":"pith:6R7QBASW","schema_version":"1.0","canonical_sha256":"f47f00825690759418d1b41b80bbd82fdb153fe7a355ef661080b28adcaf80d9","source":{"kind":"arxiv","id":"1807.01260","version":2},"attestation_state":"computed","paper":{"title":"A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Kleitos Papadopoulos","submitted_at":"2018-07-03T16:10:46Z","abstract_excerpt":"Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\\sigma$-tree spanner is a spanning tree $T$ of $G$ in which the ratio between the distance in $T$ of any pair of vertices and the corresponding distance in $G$ is upper bounded by $\\sigma$. The minimum value of $\\sigma$ for which $T$ is a $\\sigma$-tree spanner of $G$ is also called the {\\em stretch factor} of $T$. We address the fault-tolerant scenario in which each edge $e$ of a given tree spanner may temporarily fail and has to be replaced by a {\\em best swap edge}, i.e. an edge that reconnects"},"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":"1807.01260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T16:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"9a1c7e83a4660b733d60fdf4e778cdc20885dee9a407b4d991b9def2275922a8","abstract_canon_sha256":"b1b6fb5b3e161f1ae47363ae163514352eb1a50d7f78893fade923614fd59e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:22.631813Z","signature_b64":"ZDDk0sfYDO5HAIdr0LbT/MwQDFRslFp8qY3IrNVUpUISjHCMs5f/8AhSw3NXbccW82+UG2XUjibfqmJ9ZUnMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47f00825690759418d1b41b80bbd82fdb153fe7a355ef661080b28adcaf80d9","last_reissued_at":"2026-05-18T00:04:22.631248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:22.631248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Kleitos Papadopoulos","submitted_at":"2018-07-03T16:10:46Z","abstract_excerpt":"Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\\sigma$-tree spanner is a spanning tree $T$ of $G$ in which the ratio between the distance in $T$ of any pair of vertices and the corresponding distance in $G$ is upper bounded by $\\sigma$. The minimum value of $\\sigma$ for which $T$ is a $\\sigma$-tree spanner of $G$ is also called the {\\em stretch factor} of $T$. We address the fault-tolerant scenario in which each edge $e$ of a given tree spanner may temporarily fail and has to be replaced by a {\\em best swap edge}, i.e. an edge that reconnects"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01260","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":"1807.01260","created_at":"2026-05-18T00:04:22.631356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01260v2","created_at":"2026-05-18T00:04:22.631356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01260","created_at":"2026-05-18T00:04:22.631356+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R7QBASWSB2Z","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R7QBASWSB2ZIGGR","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R7QBASW","created_at":"2026-05-18T12:32:11.075285+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/6R7QBASWSB2ZIGGRWQNYBO6YF7","json":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7.json","graph_json":"https://pith.science/api/pith-number/6R7QBASWSB2ZIGGRWQNYBO6YF7/graph.json","events_json":"https://pith.science/api/pith-number/6R7QBASWSB2ZIGGRWQNYBO6YF7/events.json","paper":"https://pith.science/paper/6R7QBASW"},"agent_actions":{"view_html":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7","download_json":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7.json","view_paper":"https://pith.science/paper/6R7QBASW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01260&json=true","fetch_graph":"https://pith.science/api/pith-number/6R7QBASWSB2ZIGGRWQNYBO6YF7/graph.json","fetch_events":"https://pith.science/api/pith-number/6R7QBASWSB2ZIGGRWQNYBO6YF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7/action/storage_attestation","attest_author":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7/action/author_attestation","sign_citation":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7/action/citation_signature","submit_replication":"https://pith.science/pith/6R7QBASWSB2ZIGGRWQNYBO6YF7/action/replication_record"}},"created_at":"2026-05-18T00:04:22.631356+00:00","updated_at":"2026-05-18T00:04:22.631356+00:00"}