{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TM2N5ZDGZUQ32Z7ZJMOJLRW3X5","short_pith_number":"pith:TM2N5ZDG","canonical_record":{"source":{"id":"1607.04913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T20:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"3eab539c502416959a1904dcc8fca9e062b88f7706b8e46b0cdee49bee5a4c69","abstract_canon_sha256":"94c4c532d9b2084d02de958823ad854702e99e817498f3d960a7a4af33fb07d3"},"schema_version":"1.0"},"canonical_sha256":"9b34dee466cd21bd67f94b1c95c6dbbf497c99b4928a5eac968d00523a4136f5","source":{"kind":"arxiv","id":"1607.04913","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04913","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04913v3","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04913","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"TM2N5ZDGZUQ3","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TM2N5ZDGZUQ32Z7Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TM2N5ZDG","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TM2N5ZDGZUQ32Z7ZJMOJLRW3X5","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T20:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"3eab539c502416959a1904dcc8fca9e062b88f7706b8e46b0cdee49bee5a4c69","abstract_canon_sha256":"94c4c532d9b2084d02de958823ad854702e99e817498f3d960a7a4af33fb07d3"},"schema_version":"1.0"},"canonical_sha256":"9b34dee466cd21bd67f94b1c95c6dbbf497c99b4928a5eac968d00523a4136f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:01.753461Z","signature_b64":"YjXLCZiTal+SFVaJADYgpx7QaGxFSDwKaR1xSuivZs+WMkfTY6afg3ZGhFbWR5hDL8B96kq4ssI3B91GzbOZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b34dee466cd21bd67f94b1c95c6dbbf497c99b4928a5eac968d00523a4136f5","last_reissued_at":"2026-05-18T00:23:01.752740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:01.752740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04913","source_version":3,"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-18T00:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbvAIHndl/0KgZyfz72Ee+kO/QLD7h7R0VrQzDw2L84SWNp8nYbtJkwwWUpM+kTRXYc5yx299teafL6cZM83DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:54:51.018635Z"},"content_sha256":"98ae3094c4d417784b14e13014f69977f01deececa5d9ce087e0a445a28dfbeb","schema_version":"1.0","event_id":"sha256:98ae3094c4d417784b14e13014f69977f01deececa5d9ce087e0a445a28dfbeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TM2N5ZDGZUQ32Z7ZJMOJLRW3X5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Algorithm for Incremental DFS Tree in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanrui Zhang, Lijie Chen, Ran Duan, Ruosong Wang, Tianyi Zhang","submitted_at":"2016-07-17T20:15:31Z","abstract_excerpt":"Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph $G=(V,E)$ with $n$ vertices and $m$ edges, the textbook algorithm takes $O(n+m)$ time to construct a DFS tree. In this paper, we study the problem of maintaining a DFS tree when the graph is undergoing incremental updates. Formally, we show: Given an arbitrary online sequence of edge or vertex insertions, there is an algorithm that reports a DFS tree in $O(n)$ worst case time per operation, and requires $O\\left(\\min\\{m \\log n, n^2\\}\\right)$ preprocessi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04913","kind":"arxiv","version":3},"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-18T00:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La4bvOrqZnF/1DqFn3qcu+VXwqupDDDSgBZrq9fmeVpydpg+OfCTgCNBBxDhu7id17r/VjzcPAr3vqItJIGsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:54:51.018965Z"},"content_sha256":"f7c36aeba5a89a61462fcf4f0d97d3d0d46a49b3d64a540e4538b3f2207a3de3","schema_version":"1.0","event_id":"sha256:f7c36aeba5a89a61462fcf4f0d97d3d0d46a49b3d64a540e4538b3f2207a3de3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/bundle.json","state_url":"https://pith.science/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/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-06-01T21:54:51Z","links":{"resolver":"https://pith.science/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5","bundle":"https://pith.science/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/bundle.json","state":"https://pith.science/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM2N5ZDGZUQ32Z7ZJMOJLRW3X5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TM2N5ZDGZUQ32Z7ZJMOJLRW3X5","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":"94c4c532d9b2084d02de958823ad854702e99e817498f3d960a7a4af33fb07d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T20:15:31Z","title_canon_sha256":"3eab539c502416959a1904dcc8fca9e062b88f7706b8e46b0cdee49bee5a4c69"},"schema_version":"1.0","source":{"id":"1607.04913","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04913","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04913v3","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04913","created_at":"2026-05-18T00:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"TM2N5ZDGZUQ3","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TM2N5ZDGZUQ32Z7Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TM2N5ZDG","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:f7c36aeba5a89a61462fcf4f0d97d3d0d46a49b3d64a540e4538b3f2207a3de3","target":"graph","created_at":"2026-05-18T00:23:01Z","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":"Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph $G=(V,E)$ with $n$ vertices and $m$ edges, the textbook algorithm takes $O(n+m)$ time to construct a DFS tree. In this paper, we study the problem of maintaining a DFS tree when the graph is undergoing incremental updates. Formally, we show: Given an arbitrary online sequence of edge or vertex insertions, there is an algorithm that reports a DFS tree in $O(n)$ worst case time per operation, and requires $O\\left(\\min\\{m \\log n, n^2\\}\\right)$ preprocessi","authors_text":"Hanrui Zhang, Lijie Chen, Ran Duan, Ruosong Wang, Tianyi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T20:15:31Z","title":"An Improved Algorithm for Incremental DFS Tree in Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04913","kind":"arxiv","version":3},"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:98ae3094c4d417784b14e13014f69977f01deececa5d9ce087e0a445a28dfbeb","target":"record","created_at":"2026-05-18T00:23:01Z","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":"94c4c532d9b2084d02de958823ad854702e99e817498f3d960a7a4af33fb07d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T20:15:31Z","title_canon_sha256":"3eab539c502416959a1904dcc8fca9e062b88f7706b8e46b0cdee49bee5a4c69"},"schema_version":"1.0","source":{"id":"1607.04913","kind":"arxiv","version":3}},"canonical_sha256":"9b34dee466cd21bd67f94b1c95c6dbbf497c99b4928a5eac968d00523a4136f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b34dee466cd21bd67f94b1c95c6dbbf497c99b4928a5eac968d00523a4136f5","first_computed_at":"2026-05-18T00:23:01.752740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:01.752740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YjXLCZiTal+SFVaJADYgpx7QaGxFSDwKaR1xSuivZs+WMkfTY6afg3ZGhFbWR5hDL8B96kq4ssI3B91GzbOZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:01.753461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04913","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98ae3094c4d417784b14e13014f69977f01deececa5d9ce087e0a445a28dfbeb","sha256:f7c36aeba5a89a61462fcf4f0d97d3d0d46a49b3d64a540e4538b3f2207a3de3"],"state_sha256":"17d4b998abe7939a24171cd214d0c8759c172df60dcd4d388f0ab6dbdea76988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJIYDxh2ETAEc8VVX3j6VQJFy9JMawLq994RoN0buJVjptIP/N1JJIFha5vBZ6dL30hErEt+6kjrp0y6cTgNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:54:51.020997Z","bundle_sha256":"c5796d000bfbd3cc886aefb1307ff1ac0ee5e2e4f788242b7bdc657473875ae0"}}