{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GEYW7EO46B5COCBNVMYCJIDRHQ","short_pith_number":"pith:GEYW7EO4","schema_version":"1.0","canonical_sha256":"31316f91dcf07a27082dab3024a0713c0cc5b856b6f0911fcfd7cd0fa8c579be","source":{"kind":"arxiv","id":"1405.3739","version":1},"attestation_state":"computed","paper":{"title":"Fast Dynamic Pointer Following via Link-Cut Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Demaine, Jon Schneider, Nathan Pinsker","submitted_at":"2014-05-15T04:37:03Z","abstract_excerpt":"In this paper, we study the problem of fast dynamic pointer following: given a directed graph $G$ where each vertex has outdegree $1$, efficiently support the operations of i) changing the outgoing edge of any vertex, and ii) find the vertex $k$ vertices `after' a given vertex. We exhibit a solution to this problem based on link-cut trees that requires $O(\\lg n)$ time per operation, and prove that this is optimal in the cell-probe complexity model."},"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":"1405.3739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-15T04:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"2541e3b3134713401cb4535f7648d6899358492943d68d35b1eaaa9fedf424e1","abstract_canon_sha256":"566aba6fb22a55474a71e9b5cb248721001f7585e55c6e60a1345193ba04e401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.923541Z","signature_b64":"ztjQo2sxvrRcnxNcARQRj3a+nffu+Sgsgl8oGnwMt238IjB6bgVtABdwKo98APuLWI7J872YyCXL8O8Jj1rQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31316f91dcf07a27082dab3024a0713c0cc5b856b6f0911fcfd7cd0fa8c579be","last_reissued_at":"2026-05-18T02:51:49.923013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.923013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Dynamic Pointer Following via Link-Cut Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Demaine, Jon Schneider, Nathan Pinsker","submitted_at":"2014-05-15T04:37:03Z","abstract_excerpt":"In this paper, we study the problem of fast dynamic pointer following: given a directed graph $G$ where each vertex has outdegree $1$, efficiently support the operations of i) changing the outgoing edge of any vertex, and ii) find the vertex $k$ vertices `after' a given vertex. We exhibit a solution to this problem based on link-cut trees that requires $O(\\lg n)$ time per operation, and prove that this is optimal in the cell-probe complexity model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3739","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":"1405.3739","created_at":"2026-05-18T02:51:49.923092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3739v1","created_at":"2026-05-18T02:51:49.923092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3739","created_at":"2026-05-18T02:51:49.923092+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEYW7EO46B5C","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEYW7EO46B5COCBN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEYW7EO4","created_at":"2026-05-18T12:28:30.664211+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/GEYW7EO46B5COCBNVMYCJIDRHQ","json":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ.json","graph_json":"https://pith.science/api/pith-number/GEYW7EO46B5COCBNVMYCJIDRHQ/graph.json","events_json":"https://pith.science/api/pith-number/GEYW7EO46B5COCBNVMYCJIDRHQ/events.json","paper":"https://pith.science/paper/GEYW7EO4"},"agent_actions":{"view_html":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ","download_json":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ.json","view_paper":"https://pith.science/paper/GEYW7EO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3739&json=true","fetch_graph":"https://pith.science/api/pith-number/GEYW7EO46B5COCBNVMYCJIDRHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GEYW7EO46B5COCBNVMYCJIDRHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ/action/storage_attestation","attest_author":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ/action/author_attestation","sign_citation":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ/action/citation_signature","submit_replication":"https://pith.science/pith/GEYW7EO46B5COCBNVMYCJIDRHQ/action/replication_record"}},"created_at":"2026-05-18T02:51:49.923092+00:00","updated_at":"2026-05-18T02:51:49.923092+00:00"}