{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YBAOO2GARZEQNETKCB7TMUVU5S","short_pith_number":"pith:YBAOO2GA","schema_version":"1.0","canonical_sha256":"c040e768c08e4906926a107f3652b4ec924cbb14a8704c47ec935fc31988720a","source":{"kind":"arxiv","id":"1707.08861","version":1},"attestation_state":"computed","paper":{"title":"Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges","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-07-27T13:35:13Z","abstract_excerpt":"Computing \\emph{all best swap edges} (ABSE) of a spanning tree $T$ of a given $n$-vertex and $m$-edge undirected and weighted graph $G$ means to select, for each edge $e$ of $T$, a corresponding non-tree edge $f$, in such a way that the tree obtained by replacing $e$ with $f$ enjoys some optimality criterion (which is naturally defined according to some objective function originally addressed by $T$). Solving efficiently an ABSE problem is by now a classic algorithmic issue, since it conveys a very successful way of coping with a (transient) \\emph{edge failure} in tree-based communication netw"},"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":"1707.08861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T13:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"e3c225b91790445f5b5b6dd44bfd6dfaaa86353f93e04458a4eeb77e2a2f8e0f","abstract_canon_sha256":"4a78ad98de4df35078776c2967dfc41a74badafa2ba04e0c43a9dce131eca82c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.270548Z","signature_b64":"CL/GmHgDHvCXpR0dcpPd5FTO9bBt+F1zr9St0e2/Ja+jXDZe6sCzJYSbp7u+hSkWbws2s4YHIfE6mIf4Ck/lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c040e768c08e4906926a107f3652b4ec924cbb14a8704c47ec935fc31988720a","last_reissued_at":"2026-05-18T00:39:19.269887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.269887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges","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-07-27T13:35:13Z","abstract_excerpt":"Computing \\emph{all best swap edges} (ABSE) of a spanning tree $T$ of a given $n$-vertex and $m$-edge undirected and weighted graph $G$ means to select, for each edge $e$ of $T$, a corresponding non-tree edge $f$, in such a way that the tree obtained by replacing $e$ with $f$ enjoys some optimality criterion (which is naturally defined according to some objective function originally addressed by $T$). Solving efficiently an ABSE problem is by now a classic algorithmic issue, since it conveys a very successful way of coping with a (transient) \\emph{edge failure} in tree-based communication netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08861","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":"1707.08861","created_at":"2026-05-18T00:39:19.269997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08861v1","created_at":"2026-05-18T00:39:19.269997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08861","created_at":"2026-05-18T00:39:19.269997+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBAOO2GARZEQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBAOO2GARZEQNETK","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBAOO2GA","created_at":"2026-05-18T12:31:56.362134+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/YBAOO2GARZEQNETKCB7TMUVU5S","json":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S.json","graph_json":"https://pith.science/api/pith-number/YBAOO2GARZEQNETKCB7TMUVU5S/graph.json","events_json":"https://pith.science/api/pith-number/YBAOO2GARZEQNETKCB7TMUVU5S/events.json","paper":"https://pith.science/paper/YBAOO2GA"},"agent_actions":{"view_html":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S","download_json":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S.json","view_paper":"https://pith.science/paper/YBAOO2GA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08861&json=true","fetch_graph":"https://pith.science/api/pith-number/YBAOO2GARZEQNETKCB7TMUVU5S/graph.json","fetch_events":"https://pith.science/api/pith-number/YBAOO2GARZEQNETKCB7TMUVU5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S/action/storage_attestation","attest_author":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S/action/author_attestation","sign_citation":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S/action/citation_signature","submit_replication":"https://pith.science/pith/YBAOO2GARZEQNETKCB7TMUVU5S/action/replication_record"}},"created_at":"2026-05-18T00:39:19.269997+00:00","updated_at":"2026-05-18T00:39:19.269997+00:00"}