{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:TYM4TFFEZYZZCHFJDMVJMUR4K4","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":"ccb0b32c4d6d5dd2f0e0ca6ced2dca52396f1a2692dc63d84010626b53be39e5","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2006-05-30T13:54:26Z","title_canon_sha256":"b7614cfa2231b93221a389bf9995779eeda9f686dc58e5e15e969cd7f842a582"},"schema_version":"1.0","source":{"id":"cs/0605141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605141","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605141v1","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605141","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"TYM4TFFEZYZZ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"TYM4TFFEZYZZCHFJ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"TYM4TFFE","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:079da3cd7ab2886e942eb123f30b252de8ee9c31f4d41bd201588fc40f67cb55","target":"graph","created_at":"2026-05-18T01:06:48Z","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":"Let $F$ be a function on pairs of vertices. An {\\em $F$- labeling scheme} is composed of a {\\em marker} algorithm for labeling the vertices of a graph with short labels, coupled with a {\\em decoder} algorithm allowing one to compute $F(u,v)$ of any two vertices $u$ and $v$ directly from their labels. As applications for labeling schemes concern mainly large and dynamically changing networks, it is of interest to study {\\em distributed dynamic} labeling schemes. This paper investigates labeling schemes for dynamic trees.\n  This paper presents a general method for constructing labeling schemes f","authors_text":"Amos Korman","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DC","submitted_at":"2006-05-30T13:54:26Z","title":"General Compact Labeling Schemes for Dynamic Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605141","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:a5ee96e4b701c22361f81161bc9412a172dd52044902576f99118f3791c4a033","target":"record","created_at":"2026-05-18T01:06:48Z","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":"ccb0b32c4d6d5dd2f0e0ca6ced2dca52396f1a2692dc63d84010626b53be39e5","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2006-05-30T13:54:26Z","title_canon_sha256":"b7614cfa2231b93221a389bf9995779eeda9f686dc58e5e15e969cd7f842a582"},"schema_version":"1.0","source":{"id":"cs/0605141","kind":"arxiv","version":1}},"canonical_sha256":"9e19c994a4ce33911ca91b2a96523c573dbafa61840bca8bb6af2a600c5c7a4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e19c994a4ce33911ca91b2a96523c573dbafa61840bca8bb6af2a600c5c7a4b","first_computed_at":"2026-05-18T01:06:48.952701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:48.952701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTr4LHSYnMO7184AqjOSFo/HD6HsYWMdnNPJ2BMDSAN4GXyEl+bf4hZ1ity01mdE8O82um3AkFhjylqMpdbTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:48.953340Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5ee96e4b701c22361f81161bc9412a172dd52044902576f99118f3791c4a033","sha256:079da3cd7ab2886e942eb123f30b252de8ee9c31f4d41bd201588fc40f67cb55"],"state_sha256":"3e54f1accb306919eb489e990dc05352380b8d84c73a2df1cf5cb45ca0de8b2a"}