{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TXWLJPZWNYPT67YRT5PP6IQ4H5","short_pith_number":"pith:TXWLJPZW","canonical_record":{"source":{"id":"1611.07055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T21:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"1d2151c81ff4047ac7ea38f0aa6b72090159c1eb94b072e570c92b81bcf5861e","abstract_canon_sha256":"aed37b2893dd4b07d45a98447ad2aa1a0dd4abefe3ed73636d720ce4e34d61e7"},"schema_version":"1.0"},"canonical_sha256":"9decb4bf366e1f3f7f119f5eff221c3f61d40636d3ebc5f04337603fb900d131","source":{"kind":"arxiv","id":"1611.07055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07055","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07055v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07055","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"TXWLJPZWNYPT","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXWLJPZWNYPT67YR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXWLJPZW","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TXWLJPZWNYPT67YRT5PP6IQ4H5","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T21:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"1d2151c81ff4047ac7ea38f0aa6b72090159c1eb94b072e570c92b81bcf5861e","abstract_canon_sha256":"aed37b2893dd4b07d45a98447ad2aa1a0dd4abefe3ed73636d720ce4e34d61e7"},"schema_version":"1.0"},"canonical_sha256":"9decb4bf366e1f3f7f119f5eff221c3f61d40636d3ebc5f04337603fb900d131","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.983961Z","signature_b64":"CbNHrFiTsa5hu2y1zEG1esu6vgznDl5uINDiEMyo5+Uz73G1j3DFdjf+WeDwIO+5knZJrHPEsHNxsu4c5rNYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9decb4bf366e1f3f7f119f5eff221c3f61d40636d3ebc5f04337603fb900d131","last_reissued_at":"2026-05-18T00:57:24.983236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.983236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07055","source_version":1,"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2VRTlGCXwJCJ2zpzibShjs8+dFehKZ7eIEGeEsHoSS3LOmCCF5tELxOsfvvuXSvaBpd8O+kOw8FW1JwHw+4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:32:42.064869Z"},"content_sha256":"d44aa1c6d3774d5f66b59ba4d7c07bd91020c8fb838fa4b4532992828a29877d","schema_version":"1.0","event_id":"sha256:d44aa1c6d3774d5f66b59ba4d7c07bd91020c8fb838fa4b4532992828a29877d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TXWLJPZWNYPT67YRT5PP6IQ4H5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Data Structure for Nearest Common Ancestors with Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harold N. Gabow","submitted_at":"2016-11-21T21:10:43Z","abstract_excerpt":"Consider a forest that evolves via $link$ operations that make the root of one tree the child of a node in another tree. Intermixed with $link$ operations are $nca$ operations, which return the nearest common ancestor of two given nodes when such exists. This paper shows that a sequence of $m$ such $nca$ and $link$ operations on a forest of $n$ nodes can be processed on-line in time $O(m\\alpha(m,n)+n)$. This was previously known only for a restricted type of $link$ operation. The special case where a $link$ only extends a tree by adding a new leaf occurs in Edmonds' algorithm for finding a max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07055","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"},"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1vc6OwImS/FcbhnOSu5YI4XqDseGFLX7QLjyIlv0NSqBgt+ZgzguXPs3dH3GOQrh7VFXSRK+/jresc8q3jmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:32:42.065697Z"},"content_sha256":"2d8e1e0fffd116b41bffc067061b966d41e0ac7f69c1536569cef3ff175a701f","schema_version":"1.0","event_id":"sha256:2d8e1e0fffd116b41bffc067061b966d41e0ac7f69c1536569cef3ff175a701f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/bundle.json","state_url":"https://pith.science/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/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-05-31T12:32:42Z","links":{"resolver":"https://pith.science/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5","bundle":"https://pith.science/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/bundle.json","state":"https://pith.science/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXWLJPZWNYPT67YRT5PP6IQ4H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TXWLJPZWNYPT67YRT5PP6IQ4H5","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":"aed37b2893dd4b07d45a98447ad2aa1a0dd4abefe3ed73636d720ce4e34d61e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T21:10:43Z","title_canon_sha256":"1d2151c81ff4047ac7ea38f0aa6b72090159c1eb94b072e570c92b81bcf5861e"},"schema_version":"1.0","source":{"id":"1611.07055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07055","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07055v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07055","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"TXWLJPZWNYPT","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXWLJPZWNYPT67YR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXWLJPZW","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:2d8e1e0fffd116b41bffc067061b966d41e0ac7f69c1536569cef3ff175a701f","target":"graph","created_at":"2026-05-18T00:57:24Z","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":"Consider a forest that evolves via $link$ operations that make the root of one tree the child of a node in another tree. Intermixed with $link$ operations are $nca$ operations, which return the nearest common ancestor of two given nodes when such exists. This paper shows that a sequence of $m$ such $nca$ and $link$ operations on a forest of $n$ nodes can be processed on-line in time $O(m\\alpha(m,n)+n)$. This was previously known only for a restricted type of $link$ operation. The special case where a $link$ only extends a tree by adding a new leaf occurs in Edmonds' algorithm for finding a max","authors_text":"Harold N. Gabow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T21:10:43Z","title":"A Data Structure for Nearest Common Ancestors with Linking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07055","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:d44aa1c6d3774d5f66b59ba4d7c07bd91020c8fb838fa4b4532992828a29877d","target":"record","created_at":"2026-05-18T00:57:24Z","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":"aed37b2893dd4b07d45a98447ad2aa1a0dd4abefe3ed73636d720ce4e34d61e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T21:10:43Z","title_canon_sha256":"1d2151c81ff4047ac7ea38f0aa6b72090159c1eb94b072e570c92b81bcf5861e"},"schema_version":"1.0","source":{"id":"1611.07055","kind":"arxiv","version":1}},"canonical_sha256":"9decb4bf366e1f3f7f119f5eff221c3f61d40636d3ebc5f04337603fb900d131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9decb4bf366e1f3f7f119f5eff221c3f61d40636d3ebc5f04337603fb900d131","first_computed_at":"2026-05-18T00:57:24.983236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:24.983236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CbNHrFiTsa5hu2y1zEG1esu6vgznDl5uINDiEMyo5+Uz73G1j3DFdjf+WeDwIO+5knZJrHPEsHNxsu4c5rNYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:24.983961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d44aa1c6d3774d5f66b59ba4d7c07bd91020c8fb838fa4b4532992828a29877d","sha256:2d8e1e0fffd116b41bffc067061b966d41e0ac7f69c1536569cef3ff175a701f"],"state_sha256":"ab877d92945126342781f971b57061c4d7b5f9555868b076f40b4d19c9a7e318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qQvS1PHIa+i48NBQwARF9fS9Wqg6N8DMR0P9GeC/8KK/pycg12cMvIhWD+H3xAkVys7+f6gn7nuQS37iexuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:32:42.070055Z","bundle_sha256":"62e4b101135c23c19be722f2183e2f32029124ec11751861d9e0c4f4909cbce9"}}