{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YBAOO2GARZEQNETKCB7TMUVU5S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a78ad98de4df35078776c2967dfc41a74badafa2ba04e0c43a9dce131eca82c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T13:35:13Z","title_canon_sha256":"e3c225b91790445f5b5b6dd44bfd6dfaaa86353f93e04458a4eeb77e2a2f8e0f"},"schema_version":"1.0","source":{"id":"1707.08861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08861","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08861v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08861","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"YBAOO2GARZEQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YBAOO2GARZEQNETK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YBAOO2GA","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e9837c0dd04ffffb18411f469d9ba85f1dfcb3b40e2b6239684539391465af81","target":"graph","created_at":"2026-05-18T00:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Davide Bil\\`o, Feliciano Colella, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T13:35:13Z","title":"Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08861","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:100dd22379d8a5823d469571f6d297d2710309bceb05f38ea93f0474cb2efa74","target":"record","created_at":"2026-05-18T00:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a78ad98de4df35078776c2967dfc41a74badafa2ba04e0c43a9dce131eca82c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T13:35:13Z","title_canon_sha256":"e3c225b91790445f5b5b6dd44bfd6dfaaa86353f93e04458a4eeb77e2a2f8e0f"},"schema_version":"1.0","source":{"id":"1707.08861","kind":"arxiv","version":1}},"canonical_sha256":"c040e768c08e4906926a107f3652b4ec924cbb14a8704c47ec935fc31988720a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c040e768c08e4906926a107f3652b4ec924cbb14a8704c47ec935fc31988720a","first_computed_at":"2026-05-18T00:39:19.269887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:19.269887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CL/GmHgDHvCXpR0dcpPd5FTO9bBt+F1zr9St0e2/Ja+jXDZe6sCzJYSbp7u+hSkWbws2s4YHIfE6mIf4Ck/lBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:19.270548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:100dd22379d8a5823d469571f6d297d2710309bceb05f38ea93f0474cb2efa74","sha256:e9837c0dd04ffffb18411f469d9ba85f1dfcb3b40e2b6239684539391465af81"],"state_sha256":"c2478a915055d8cf2e2906d345736fbb0492039a1255dc17b80fa1942479b2f2"}