{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HNSMDWKBX6D2EN5MS2FXV24JET","short_pith_number":"pith:HNSMDWKB","schema_version":"1.0","canonical_sha256":"3b64c1d941bf87a237ac968b7aeb8924f54768353dee3f710e4a6de2b51e6ebd","source":{"kind":"arxiv","id":"1407.5011","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.5011","created_at":"2026-05-18T02:17:52.043763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5011v2","created_at":"2026-05-18T02:17:52.043763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5011","created_at":"2026-05-18T02:17:52.043763+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNSMDWKBX6D2","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNSMDWKBX6D2EN5M","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNSMDWKB","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/HNSMDWKBX6D2EN5MS2FXV24JET","json":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET.json","graph_json":"https://pith.science/api/pith-number/HNSMDWKBX6D2EN5MS2FXV24JET/graph.json","events_json":"https://pith.science/api/pith-number/HNSMDWKBX6D2EN5MS2FXV24JET/events.json","paper":"https://pith.science/paper/HNSMDWKB"},"agent_actions":{"view_html":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET","download_json":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET.json","view_paper":"https://pith.science/paper/HNSMDWKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5011&json=true","fetch_graph":"https://pith.science/api/pith-number/HNSMDWKBX6D2EN5MS2FXV24JET/graph.json","fetch_events":"https://pith.science/api/pith-number/HNSMDWKBX6D2EN5MS2FXV24JET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/action/storage_attestation","attest_author":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/action/author_attestation","sign_citation":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/action/citation_signature","submit_replication":"https://pith.science/pith/HNSMDWKBX6D2EN5MS2FXV24JET/action/replication_record"}},"created_at":"2026-05-18T02:17:52.043763+00:00","updated_at":"2026-05-18T02:17:52.043763+00:00"}