{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HNSMDWKBX6D2EN5MS2FXV24JET","short_pith_number":"pith:HNSMDWKB","canonical_record":{"source":{"id":"1407.5011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T14:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"e928af0492554a80a8cd1074d4608c116ae76f967d536090d7e75a17bbaafb5a","abstract_canon_sha256":"cabbcadf6db9e818c446244f25b848b1859ac2300c7737f4cd98fa7c6b7b0c63"},"schema_version":"1.0"},"canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","source":{"kind":"arxiv","id":"1407.5011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5011","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5011v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5011","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNSMDWKBX6D2","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HNSMDWKBX6D2EN5M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HNSMDWKB","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HNSMDWKBX6D2EN5MS2FXV24JET","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T14:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"e928af0492554a80a8cd1074d4608c116ae76f967d536090d7e75a17bbaafb5a","abstract_canon_sha256":"cabbcadf6db9e818c446244f25b848b1859ac2300c7737f4cd98fa7c6b7b0c63"},"schema_version":"1.0"},"canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:52.044374Z","signature_b64":"4pOuTiX2QKIhgCGBG2U+53KF3C9h3DaicQaGmftt6jm6DMBTisbW7d0PLgCA7Ahn5HVpNiRE+nrhySImalH+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","last_reissued_at":"2026-05-18T02:17:52.043654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:52.043654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5011","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:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"See2+hiLLkop9rkmN+xArIvGp08Hb3/mJ1oBY72Wd1Aaz20UNMzZy5dKCijCOEW1h3KJDAD1/KuqX1Z0aO2oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:27.037256Z"},"content_sha256":"31321c8dce485a80ce6c21cb421922d3c2505871265f0191398a02980e147b7d","schema_version":"1.0","event_id":"sha256:31321c8dce485a80ce6c21cb421922d3c2505871265f0191398a02980e147b7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HNSMDWKBX6D2EN5MS2FXV24JET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple and optimal ancestry labeling scheme for trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Noy Rotbart, S{\\o}ren Dahlgaard","submitted_at":"2014-07-18T14:36:13Z","abstract_excerpt":"We present a $\\lg n + 2 \\lg \\lg n+3$ ancestry labeling scheme for trees. The problem was first presented by Kannan et al. [STOC 88'] along with a simple $2 \\lg n$ solution. Motivated by applications to XML files, the label size was improved incrementally over the course of more than 20 years by a series of papers. The last, due to Fraigniaud and Korman [STOC 10'], presented an asymptotically optimal $\\lg n + 4 \\lg \\lg n+O(1)$ labeling scheme using non-trivial tree-decomposition techniques. By providing a framework generalizing interval based labeling schemes, we obtain a simple, yet asymptotic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5011","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:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEmMjJaiVVRm3tgzXjgUu9JKeLPF3bc10d2gNxKpmL4pVZvpInV6rVyFIRe1oIcgj295fe6WQ3XkkFrGKTyZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:27.037625Z"},"content_sha256":"fca2de8aceea9747a232802295b3e79b5bfedd0f9ebc0596f8308437f17988e3","schema_version":"1.0","event_id":"sha256:fca2de8aceea9747a232802295b3e79b5bfedd0f9ebc0596f8308437f17988e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/bundle.json","state_url":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNSMDWKBX6D2EN5MS2FXV24JET/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-30T17:41:27Z","links":{"resolver":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET","bundle":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/bundle.json","state":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNSMDWKBX6D2EN5MS2FXV24JET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HNSMDWKBX6D2EN5MS2FXV24JET","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":"cabbcadf6db9e818c446244f25b848b1859ac2300c7737f4cd98fa7c6b7b0c63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T14:36:13Z","title_canon_sha256":"e928af0492554a80a8cd1074d4608c116ae76f967d536090d7e75a17bbaafb5a"},"schema_version":"1.0","source":{"id":"1407.5011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5011","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5011v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5011","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNSMDWKBX6D2","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HNSMDWKBX6D2EN5M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HNSMDWKB","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:fca2de8aceea9747a232802295b3e79b5bfedd0f9ebc0596f8308437f17988e3","target":"graph","created_at":"2026-05-18T02:17:52Z","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 a $\\lg n + 2 \\lg \\lg n+3$ ancestry labeling scheme for trees. The problem was first presented by Kannan et al. [STOC 88'] along with a simple $2 \\lg n$ solution. Motivated by applications to XML files, the label size was improved incrementally over the course of more than 20 years by a series of papers. The last, due to Fraigniaud and Korman [STOC 10'], presented an asymptotically optimal $\\lg n + 4 \\lg \\lg n+O(1)$ labeling scheme using non-trivial tree-decomposition techniques. By providing a framework generalizing interval based labeling schemes, we obtain a simple, yet asymptotic","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Noy Rotbart, S{\\o}ren Dahlgaard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T14:36:13Z","title":"A simple and optimal ancestry labeling scheme for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5011","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:31321c8dce485a80ce6c21cb421922d3c2505871265f0191398a02980e147b7d","target":"record","created_at":"2026-05-18T02:17:52Z","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":"cabbcadf6db9e818c446244f25b848b1859ac2300c7737f4cd98fa7c6b7b0c63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T14:36:13Z","title_canon_sha256":"e928af0492554a80a8cd1074d4608c116ae76f967d536090d7e75a17bbaafb5a"},"schema_version":"1.0","source":{"id":"1407.5011","kind":"arxiv","version":2}},"canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","first_computed_at":"2026-05-18T02:17:52.043654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:52.043654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4pOuTiX2QKIhgCGBG2U+53KF3C9h3DaicQaGmftt6jm6DMBTisbW7d0PLgCA7Ahn5HVpNiRE+nrhySImalH+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:52.044374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31321c8dce485a80ce6c21cb421922d3c2505871265f0191398a02980e147b7d","sha256:fca2de8aceea9747a232802295b3e79b5bfedd0f9ebc0596f8308437f17988e3"],"state_sha256":"3ff77878cf570ae3c9244cfc86c157df7ee176c23d4e2d39374b9e545ec3edd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQi8OrTShrN290VvdJUkfIzelBFNYWofpPu6KqQdUMQB1WR4pIhVmqXUomRAOwX/Vhxcr7ZlVgYtuzGdMm8qDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:41:27.039715Z","bundle_sha256":"aab0030ea612fb95ebf50f49655c313029b7d0e6c7489248bd81d096b3e74fa9"}}