{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:TYM4TFFEZYZZCHFJDMVJMUR4K4","short_pith_number":"pith:TYM4TFFE","schema_version":"1.0","canonical_sha256":"9e19c994a4ce33911ca91b2a96523c573dbafa61840bca8bb6af2a600c5c7a4b","source":{"kind":"arxiv","id":"cs/0605141","version":1},"attestation_state":"computed","paper":{"title":"General Compact Labeling Schemes for Dynamic Trees","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman","submitted_at":"2006-05-30T13:54:26Z","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"},"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":"cs/0605141","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2006-05-30T13:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"b7614cfa2231b93221a389bf9995779eeda9f686dc58e5e15e969cd7f842a582","abstract_canon_sha256":"ccb0b32c4d6d5dd2f0e0ca6ced2dca52396f1a2692dc63d84010626b53be39e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:48.953340Z","signature_b64":"hTr4LHSYnMO7184AqjOSFo/HD6HsYWMdnNPJ2BMDSAN4GXyEl+bf4hZ1ity01mdE8O82um3AkFhjylqMpdbTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e19c994a4ce33911ca91b2a96523c573dbafa61840bca8bb6af2a600c5c7a4b","last_reissued_at":"2026-05-18T01:06:48.952701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:48.952701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Compact Labeling Schemes for Dynamic Trees","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman","submitted_at":"2006-05-30T13:54:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605141","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":"cs/0605141","created_at":"2026-05-18T01:06:48.952839+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0605141v1","created_at":"2026-05-18T01:06:48.952839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605141","created_at":"2026-05-18T01:06:48.952839+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYM4TFFEZYZZ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYM4TFFEZYZZCHFJ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYM4TFFE","created_at":"2026-05-18T12:25:54.717736+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/TYM4TFFEZYZZCHFJDMVJMUR4K4","json":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4.json","graph_json":"https://pith.science/api/pith-number/TYM4TFFEZYZZCHFJDMVJMUR4K4/graph.json","events_json":"https://pith.science/api/pith-number/TYM4TFFEZYZZCHFJDMVJMUR4K4/events.json","paper":"https://pith.science/paper/TYM4TFFE"},"agent_actions":{"view_html":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4","download_json":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4.json","view_paper":"https://pith.science/paper/TYM4TFFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0605141&json=true","fetch_graph":"https://pith.science/api/pith-number/TYM4TFFEZYZZCHFJDMVJMUR4K4/graph.json","fetch_events":"https://pith.science/api/pith-number/TYM4TFFEZYZZCHFJDMVJMUR4K4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4/action/storage_attestation","attest_author":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4/action/author_attestation","sign_citation":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4/action/citation_signature","submit_replication":"https://pith.science/pith/TYM4TFFEZYZZCHFJDMVJMUR4K4/action/replication_record"}},"created_at":"2026-05-18T01:06:48.952839+00:00","updated_at":"2026-05-18T01:06:48.952839+00:00"}