{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JKLO3XKQVW3AOLHJYASMGCGW3E","short_pith_number":"pith:JKLO3XKQ","schema_version":"1.0","canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","source":{"kind":"arxiv","id":"1408.0384","version":2},"attestation_state":"computed","paper":{"title":"Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chhaya Trehan, Shay Kutten","submitted_at":"2014-08-02T15:19:46Z","abstract_excerpt":"We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of $O(n\\log \\Delta)$ bits per node and $O(nD)$ respectively, where $\\Delta$ is the highest degree of a node, $n$ is the number of nodes and $D$ is the diameter of the network. In contrast, our algorithm has a space complexity o"},"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":"1408.0384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-02T15:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"30e8ddb6d9a973df78226003e404fdcf7c4202bc6e13b708a0d1969dd9a0f928","abstract_canon_sha256":"df77cc6660569751151e4b43bf39e66835936626842b39671900086907ee1d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:02.147341Z","signature_b64":"VieMnJTa3ruTn/tGkMrsEaY9ELUl+2v87C4w4Glpzskxy2KIJnFjYq8375Mgye7pzgF59OseRUb1d5TOuOWlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","last_reissued_at":"2026-05-18T02:31:02.146909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:02.146909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chhaya Trehan, Shay Kutten","submitted_at":"2014-08-02T15:19:46Z","abstract_excerpt":"We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of $O(n\\log \\Delta)$ bits per node and $O(nD)$ respectively, where $\\Delta$ is the highest degree of a node, $n$ is the number of nodes and $D$ is the diameter of the network. In contrast, our algorithm has a space complexity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0384","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":"1408.0384","created_at":"2026-05-18T02:31:02.146966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0384v2","created_at":"2026-05-18T02:31:02.146966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0384","created_at":"2026-05-18T02:31:02.146966+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKLO3XKQVW3A","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKLO3XKQVW3AOLHJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKLO3XKQ","created_at":"2026-05-18T12:28:33.132498+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/JKLO3XKQVW3AOLHJYASMGCGW3E","json":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E.json","graph_json":"https://pith.science/api/pith-number/JKLO3XKQVW3AOLHJYASMGCGW3E/graph.json","events_json":"https://pith.science/api/pith-number/JKLO3XKQVW3AOLHJYASMGCGW3E/events.json","paper":"https://pith.science/paper/JKLO3XKQ"},"agent_actions":{"view_html":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E","download_json":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E.json","view_paper":"https://pith.science/paper/JKLO3XKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0384&json=true","fetch_graph":"https://pith.science/api/pith-number/JKLO3XKQVW3AOLHJYASMGCGW3E/graph.json","fetch_events":"https://pith.science/api/pith-number/JKLO3XKQVW3AOLHJYASMGCGW3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/action/storage_attestation","attest_author":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/action/author_attestation","sign_citation":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/action/citation_signature","submit_replication":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/action/replication_record"}},"created_at":"2026-05-18T02:31:02.146966+00:00","updated_at":"2026-05-18T02:31:02.146966+00:00"}