{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4WO57IHVHPJZ6VHO225AWVL4AS","short_pith_number":"pith:4WO57IHV","canonical_record":{"source":{"id":"1707.08807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T10:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"6f6140af1957f44c845fddf9a9689f877abc9cd6c6cf8d6a3817b3ceffc90fd0","abstract_canon_sha256":"8c229d3b7a15d12fd3a80743bcb92c4d64596f783b730c5787f895dfe0aad1d7"},"schema_version":"1.0"},"canonical_sha256":"e59ddfa0f53bd39f54eed6ba0b557c04bb36077c8bd83ee407f4de976a228a80","source":{"kind":"arxiv","id":"1707.08807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08807","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08807v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08807","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"4WO57IHVHPJZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WO57IHVHPJZ6VHO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WO57IHV","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4WO57IHVHPJZ6VHO225AWVL4AS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T10:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"6f6140af1957f44c845fddf9a9689f877abc9cd6c6cf8d6a3817b3ceffc90fd0","abstract_canon_sha256":"8c229d3b7a15d12fd3a80743bcb92c4d64596f783b730c5787f895dfe0aad1d7"},"schema_version":"1.0"},"canonical_sha256":"e59ddfa0f53bd39f54eed6ba0b557c04bb36077c8bd83ee407f4de976a228a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.426584Z","signature_b64":"s2tpdsMXNO3tIdeMPwob9XJ2/8XTYIQSDPJmJwEUHbTgE5bYLfw/GUNEJjvq97nDPM7WiKTVX7uXCiiSPgHIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59ddfa0f53bd39f54eed6ba0b557c04bb36077c8bd83ee407f4de976a228a80","last_reissued_at":"2026-05-18T00:39:19.425986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.425986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08807","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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8Vk6N8FY0o7Wwi3T+qu2aOmiU+7LIPZfE/o3gUxwNIrcbYnlP44sgF27u7tfUg6W+d2KTIVMtyuEKFo6bDfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:13:30.709448Z"},"content_sha256":"52a0d74df2e5c2f9b294c06ca04f88e311a0385ffca7b036f92b745b8106c0fa","schema_version":"1.0","event_id":"sha256:52a0d74df2e5c2f9b294c06ca04f88e311a0385ffca7b036f92b745b8106c0fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4WO57IHVHPJZ6VHO225AWVL4AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Konstantinos Panagiotou, Pascal Su","submitted_at":"2017-07-27T10:05:33Z","abstract_excerpt":"We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a given family of rooted trees, an NCA-universal tree $S$ is a rooted tree such that any tree $T$ of the family can be embedded into $S$ such that the embedding of the NCA in $T$ of two nodes of $T$ is equal to the NCA in $S$ of the embeddings of the two nodes.\n  As the main technical result we give explicit constructions of NCA-universal trees of size $n^{2.318}$ for the family of rooted $n$-vertex trees and of size $n^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08807","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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7boEyJ/VKs4ob2Rr9ydjPzg3Tgv9X2nKetNH1g7DQYhrvH4t2O9qWjtKbM5F4akh8qS/3kfs0ErIvOOGnA63DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:13:30.710081Z"},"content_sha256":"762ac2c824a3e233378b4ff14c8ab5d3acd82254a4c4dae555ed83902c98a436","schema_version":"1.0","event_id":"sha256:762ac2c824a3e233378b4ff14c8ab5d3acd82254a4c4dae555ed83902c98a436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WO57IHVHPJZ6VHO225AWVL4AS/bundle.json","state_url":"https://pith.science/pith/4WO57IHVHPJZ6VHO225AWVL4AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WO57IHVHPJZ6VHO225AWVL4AS/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-26T11:13:30Z","links":{"resolver":"https://pith.science/pith/4WO57IHVHPJZ6VHO225AWVL4AS","bundle":"https://pith.science/pith/4WO57IHVHPJZ6VHO225AWVL4AS/bundle.json","state":"https://pith.science/pith/4WO57IHVHPJZ6VHO225AWVL4AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WO57IHVHPJZ6VHO225AWVL4AS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4WO57IHVHPJZ6VHO225AWVL4AS","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":"8c229d3b7a15d12fd3a80743bcb92c4d64596f783b730c5787f895dfe0aad1d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T10:05:33Z","title_canon_sha256":"6f6140af1957f44c845fddf9a9689f877abc9cd6c6cf8d6a3817b3ceffc90fd0"},"schema_version":"1.0","source":{"id":"1707.08807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08807","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08807v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08807","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"4WO57IHVHPJZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WO57IHVHPJZ6VHO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WO57IHV","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:762ac2c824a3e233378b4ff14c8ab5d3acd82254a4c4dae555ed83902c98a436","target":"graph","created_at":"2026-05-18T00:39:19Z","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 investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a given family of rooted trees, an NCA-universal tree $S$ is a rooted tree such that any tree $T$ of the family can be embedded into $S$ such that the embedding of the NCA in $T$ of two nodes of $T$ is equal to the NCA in $S$ of the embeddings of the two nodes.\n  As the main technical result we give explicit constructions of NCA-universal trees of size $n^{2.318}$ for the family of rooted $n$-vertex trees and of size $n^{","authors_text":"Fabian Kuhn, Konstantinos Panagiotou, Pascal Su","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T10:05:33Z","title":"Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08807","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:52a0d74df2e5c2f9b294c06ca04f88e311a0385ffca7b036f92b745b8106c0fa","target":"record","created_at":"2026-05-18T00:39:19Z","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":"8c229d3b7a15d12fd3a80743bcb92c4d64596f783b730c5787f895dfe0aad1d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T10:05:33Z","title_canon_sha256":"6f6140af1957f44c845fddf9a9689f877abc9cd6c6cf8d6a3817b3ceffc90fd0"},"schema_version":"1.0","source":{"id":"1707.08807","kind":"arxiv","version":1}},"canonical_sha256":"e59ddfa0f53bd39f54eed6ba0b557c04bb36077c8bd83ee407f4de976a228a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e59ddfa0f53bd39f54eed6ba0b557c04bb36077c8bd83ee407f4de976a228a80","first_computed_at":"2026-05-18T00:39:19.425986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:19.425986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2tpdsMXNO3tIdeMPwob9XJ2/8XTYIQSDPJmJwEUHbTgE5bYLfw/GUNEJjvq97nDPM7WiKTVX7uXCiiSPgHIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:19.426584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52a0d74df2e5c2f9b294c06ca04f88e311a0385ffca7b036f92b745b8106c0fa","sha256:762ac2c824a3e233378b4ff14c8ab5d3acd82254a4c4dae555ed83902c98a436"],"state_sha256":"2712a7ccf2f370c367264165067187a84c9370d5b0434704101b90b1149e5cfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1lfXWriFFjRERmxC0lLt1AzJ6T45X/aFM49NibcvRGXgcREp1QfmpQ45xLLPwtPEMBht6zFvOWPgHVx+X9fDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:13:30.713463Z","bundle_sha256":"e46c49e71b072f75758e7072de8a23df6e2740e0961edf8c873b820c52be3a26"}}