{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XZDELQSULIQZD2B7QAWRZZ672I","short_pith_number":"pith:XZDELQSU","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"},"canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","source":{"kind":"arxiv","id":"1404.4982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4982","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4982v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4982","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"XZDELQSULIQZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XZDELQSULIQZD2B7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XZDELQSU","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XZDELQSULIQZD2B7QAWRZZ672I","target":"record","payload":{"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"},"canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","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"},"source_kind":"arxiv","source_id":"1404.4982","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-18T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4F0KES0sOWJHUFvLffb2M/lQ9XL+obMiVC4Xe3CT+/IAKxJnjVaMxP/AJ6oCHmm/0STGccURya48FRQuqGNBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:11:52.056609Z"},"content_sha256":"28175478e03bca8e31a22570800ee947a7c5cce068d9179f5b53a570af6febfb","schema_version":"1.0","event_id":"sha256:28175478e03bca8e31a22570800ee947a7c5cce068d9179f5b53a570af6febfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XZDELQSULIQZD2B7QAWRZZ672I","target":"graph","payload":{"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"},"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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5lk+bWv5S3cif84vtsXRCBVP+MjmVfYRTRLFFlvZ/CYzOGaxf8imUqdh0Nh6bZWtbwZt4l1pTCh706PTpbOXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:11:52.057026Z"},"content_sha256":"ab45a36eae78b1b3362e37ab51129200e83969987ff8b27b6a5068a3240a51ad","schema_version":"1.0","event_id":"sha256:ab45a36eae78b1b3362e37ab51129200e83969987ff8b27b6a5068a3240a51ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/bundle.json","state_url":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZDELQSULIQZD2B7QAWRZZ672I/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-30T11:11:52Z","links":{"resolver":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I","bundle":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/bundle.json","state":"https://pith.science/pith/XZDELQSULIQZD2B7QAWRZZ672I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZDELQSULIQZD2B7QAWRZZ672I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XZDELQSULIQZD2B7QAWRZZ672I","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":"49ad65b3932e95487841c13f543476b0f9ebe96974965392d1619b91e4347483","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-19T18:44:57Z","title_canon_sha256":"5592da7277eada297a0109518ffd8bfff37fc2b280b76ac0cf5a7d2f36938a80"},"schema_version":"1.0","source":{"id":"1404.4982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4982","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4982v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4982","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"XZDELQSULIQZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XZDELQSULIQZD2B7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XZDELQSU","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:ab45a36eae78b1b3362e37ab51129200e83969987ff8b27b6a5068a3240a51ad","target":"graph","created_at":"2026-05-18T02:53: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 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","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Noy Rotbart, S{\\o}ren Dahlgaard","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-19T18:44:57Z","title":"Dynamic and Multi-functional Labeling Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4982","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:28175478e03bca8e31a22570800ee947a7c5cce068d9179f5b53a570af6febfb","target":"record","created_at":"2026-05-18T02:53: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":"49ad65b3932e95487841c13f543476b0f9ebe96974965392d1619b91e4347483","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-19T18:44:57Z","title_canon_sha256":"5592da7277eada297a0109518ffd8bfff37fc2b280b76ac0cf5a7d2f36938a80"},"schema_version":"1.0","source":{"id":"1404.4982","kind":"arxiv","version":1}},"canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be4645c2545a2191e83f802d1ce7dfd2121aa73e8740df52154166e27c28c7fc","first_computed_at":"2026-05-18T02:53:52.358969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:52.358969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BLkUzRDRHigvpKW5l90HWAYizWWbHiIz0/t7qk2eYXgMlSDkzBbNMO4xeTHGhhsNrbaJy6aZ65YQFjXGzcELDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:52.360593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28175478e03bca8e31a22570800ee947a7c5cce068d9179f5b53a570af6febfb","sha256:ab45a36eae78b1b3362e37ab51129200e83969987ff8b27b6a5068a3240a51ad"],"state_sha256":"d751490b8ea975c15421ca294bfcd21ebd52d8d51a87f830c9ce79a657902b9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWzb/sSFHwxhg3gY14U46TNso1atjRu1k3bKR4ekUuHgWDGNUiOWs6le6zBWwKgxWWRJ836NcSWlH4pCc4eKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:11:52.060142Z","bundle_sha256":"0c4e543075aebcc5fe7278db2b5be52a40ed0aebfeba9aaf602102fb690e5b0d"}}