{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JKLO3XKQVW3AOLHJYASMGCGW3E","short_pith_number":"pith:JKLO3XKQ","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"},"canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","source":{"kind":"arxiv","id":"1408.0384","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0384","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0384v2","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0384","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"JKLO3XKQVW3A","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JKLO3XKQVW3AOLHJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JKLO3XKQ","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JKLO3XKQVW3AOLHJYASMGCGW3E","target":"record","payload":{"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"},"canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","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"},"source_kind":"arxiv","source_id":"1408.0384","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpkYzUrtw8sNhpIXptdGSKIh2l4YJCaRoZW1afrxP9uBYV4F2kSUKSaz4xyGZh7gila5XFMimwnC5GzxPj7/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:48:54.519053Z"},"content_sha256":"c6c67e17308322c5e901cdd46f70609eabd86936ee3f7efec02f1a9f93066ff6","schema_version":"1.0","event_id":"sha256:c6c67e17308322c5e901cdd46f70609eabd86936ee3f7efec02f1a9f93066ff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JKLO3XKQVW3AOLHJYASMGCGW3E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoUOiR0JOIt20TxG8ycCpabNsfWu1UbnbmNueFiskTNdWpqFNCi4ZLafMctudsV3ziLoGf60Rp7r8aLLBpUGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:48:54.519415Z"},"content_sha256":"bc77bf638cd37301aedef9e40fc67cdd6dd33eb05e32370d84fc6c8ba9668919","schema_version":"1.0","event_id":"sha256:bc77bf638cd37301aedef9e40fc67cdd6dd33eb05e32370d84fc6c8ba9668919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/bundle.json","state_url":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T20:48:54Z","links":{"resolver":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E","bundle":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/bundle.json","state":"https://pith.science/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKLO3XKQVW3AOLHJYASMGCGW3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JKLO3XKQVW3AOLHJYASMGCGW3E","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":"df77cc6660569751151e4b43bf39e66835936626842b39671900086907ee1d8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-02T15:19:46Z","title_canon_sha256":"30e8ddb6d9a973df78226003e404fdcf7c4202bc6e13b708a0d1969dd9a0f928"},"schema_version":"1.0","source":{"id":"1408.0384","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0384","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0384v2","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0384","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"JKLO3XKQVW3A","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JKLO3XKQVW3AOLHJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JKLO3XKQ","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:bc77bf638cd37301aedef9e40fc67cdd6dd33eb05e32370d84fc6c8ba9668919","target":"graph","created_at":"2026-05-18T02:31:02Z","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":"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","authors_text":"Chhaya Trehan, Shay Kutten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-02T15:19:46Z","title":"Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0384","kind":"arxiv","version":2},"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:c6c67e17308322c5e901cdd46f70609eabd86936ee3f7efec02f1a9f93066ff6","target":"record","created_at":"2026-05-18T02:31:02Z","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":"df77cc6660569751151e4b43bf39e66835936626842b39671900086907ee1d8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-02T15:19:46Z","title_canon_sha256":"30e8ddb6d9a973df78226003e404fdcf7c4202bc6e13b708a0d1969dd9a0f928"},"schema_version":"1.0","source":{"id":"1408.0384","kind":"arxiv","version":2}},"canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a96eddd50adb6072ce9c024c308d6d9091e0dc5f3b0abb360f7abb74e5b1229","first_computed_at":"2026-05-18T02:31:02.146909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:02.146909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VieMnJTa3ruTn/tGkMrsEaY9ELUl+2v87C4w4Glpzskxy2KIJnFjYq8375Mgye7pzgF59OseRUb1d5TOuOWlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:02.147341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0384","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6c67e17308322c5e901cdd46f70609eabd86936ee3f7efec02f1a9f93066ff6","sha256:bc77bf638cd37301aedef9e40fc67cdd6dd33eb05e32370d84fc6c8ba9668919"],"state_sha256":"a301a98859971683a99b385518c3eb73d60e8aceb73b75ebce63bffe2f167913"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNC9CJ/ExXfAekavf3yp/KDcb/Dm5q7ORJH4VMSFOE4X1tmHbbelyiPjjqQ25jfNZtKrWI/+ruxonuSPWVT/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:48:54.521424Z","bundle_sha256":"5606570b258fafb6d281926a8e47a3c0a4d6b858bb3a3ec1d9b6d786cfb484d5"}}