{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XZDELQSULIQZD2B7QAWRZZ672I","short_pith_number":"pith:XZDELQSU","schema_version":"1.0","canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","source":{"kind":"arxiv","id":"1404.4982","version":1},"attestation_state":"computed","paper":{"title":"Dynamic and Multi-functional Labeling Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Noy Rotbart, S{\\o}ren Dahlgaard","submitted_at":"2014-04-19T18:44:57Z","abstract_excerpt":"We investigate labeling schemes supporting adjacency, ancestry, sibling, and connectivity queries in forests. In the course of more than 20 years, the existence of $\\log n + O(\\log \\log)$ labeling schemes supporting each of these functions was proven, with the most recent being ancestry [Fraigniaud and Korman, STOC '10]. Several multi-functional labeling schemes also enjoy lower or upper bounds of $\\log n + \\Omega(\\log \\log n)$ or $\\log n + O(\\log \\log n)$ respectively. Notably an upper bound of $\\log n + 5\\log \\log n$ for adjacency+siblings and a lower bound of $\\log n + \\log \\log n$ for each"},"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":"1404.4982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-19T18:44:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5592da7277eada297a0109518ffd8bfff37fc2b280b76ac0cf5a7d2f36938a80","abstract_canon_sha256":"49ad65b3932e95487841c13f543476b0f9ebe96974965392d1619b91e4347483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:52.360593Z","signature_b64":"BLkUzRDRHigvpKW5l90HWAYizWWbHiIz0/t7qk2eYXgMlSDkzBbNMO4xeTHGhhsNrbaJy6aZ65YQFjXGzcELDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","last_reissued_at":"2026-05-18T02:53:52.358969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:52.358969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic and Multi-functional Labeling Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Noy Rotbart, S{\\o}ren Dahlgaard","submitted_at":"2014-04-19T18:44:57Z","abstract_excerpt":"We investigate labeling schemes supporting adjacency, ancestry, sibling, and connectivity queries in forests. In the course of more than 20 years, the existence of $\\log n + O(\\log \\log)$ labeling schemes supporting each of these functions was proven, with the most recent being ancestry [Fraigniaud and Korman, STOC '10]. Several multi-functional labeling schemes also enjoy lower or upper bounds of $\\log n + \\Omega(\\log \\log n)$ or $\\log n + O(\\log \\log n)$ respectively. Notably an upper bound of $\\log n + 5\\log \\log n$ for adjacency+siblings and a lower bound of $\\log n + \\log \\log n$ for each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4982","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":"1404.4982","created_at":"2026-05-18T02:53:52.359080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4982v1","created_at":"2026-05-18T02:53:52.359080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4982","created_at":"2026-05-18T02:53:52.359080+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZDELQSULIQZ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZDELQSULIQZD2B7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZDELQSU","created_at":"2026-05-18T12:28:57.508820+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/XZDELQSULIQZD2B7QAWRZZ672I","json":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I.json","graph_json":"https://pith.science/api/pith-number/XZDELQSULIQZD2B7QAWRZZ672I/graph.json","events_json":"https://pith.science/api/pith-number/XZDELQSULIQZD2B7QAWRZZ672I/events.json","paper":"https://pith.science/paper/XZDELQSU"},"agent_actions":{"view_html":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I","download_json":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I.json","view_paper":"https://pith.science/paper/XZDELQSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4982&json=true","fetch_graph":"https://pith.science/api/pith-number/XZDELQSULIQZD2B7QAWRZZ672I/graph.json","fetch_events":"https://pith.science/api/pith-number/XZDELQSULIQZD2B7QAWRZZ672I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/action/storage_attestation","attest_author":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/action/author_attestation","sign_citation":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/action/citation_signature","submit_replication":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/action/replication_record"}},"created_at":"2026-05-18T02:53:52.359080+00:00","updated_at":"2026-05-18T02:53:52.359080+00:00"}