{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F6DQXBYPU5AUC3YAXUXX4EBWOG","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":"0ce17b9bbd2306b71d73acbfb3408c3dc86a8d9af91999dff24c596ea7ff8e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T23:18:17Z","title_canon_sha256":"606e3729ebd856d2c622933babf67816a927451e85fd22c2522f12992448cc18"},"schema_version":"1.0","source":{"id":"1507.04046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04046","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04046v1","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04046","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"F6DQXBYPU5AU","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6DQXBYPU5AUC3YA","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6DQXBYP","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:cbb27e5f3dc81481f4f28dcc3e53b0752a974d145dbc3701f1ae7769e1ea9953","target":"graph","created_at":"2026-05-18T01:36:49Z","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 consider distance labeling schemes for trees: given a tree with $n$ nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes.\n  A lower bound by Gavoille et. al. (J. Alg. 2004) and an upper bound by Peleg (J. Graph Theory 2000) establish that labels must use $\\Theta(\\log^2 n)$ bits\\footnote{Throughout this paper we use $\\log$ for $\\log_2$.}. Gavoille et. al. (ESA 2001) show that for very small approximate stretch, labels use $\\Theta(\\log n \\log \\log n)$ bits. Seve","authors_text":"Ely Porat, Esben Bistrup Halvorsen, Inge Li G{\\o}rtz, Stephen Alstrup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T23:18:17Z","title":"Distance labeling schemes for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04046","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:f1c11a59913826b5686373cc3e009dffbde9e083e668b2b9bb318eae74994482","target":"record","created_at":"2026-05-18T01:36:49Z","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":"0ce17b9bbd2306b71d73acbfb3408c3dc86a8d9af91999dff24c596ea7ff8e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T23:18:17Z","title_canon_sha256":"606e3729ebd856d2c622933babf67816a927451e85fd22c2522f12992448cc18"},"schema_version":"1.0","source":{"id":"1507.04046","kind":"arxiv","version":1}},"canonical_sha256":"2f870b870fa741416f00bd2f7e103671a0b570acff89aeeac0930b0c3ce6ef30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f870b870fa741416f00bd2f7e103671a0b570acff89aeeac0930b0c3ce6ef30","first_computed_at":"2026-05-18T01:36:49.248135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:49.248135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9K4dDOwuF1iYNS5rpqAAgJ0fvDVq+d8zVrQlmTCDPzIk6x1+LoFG0VQGJqedg8KDnFR8DxhoCXfNMs2FBYwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:49.248633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1c11a59913826b5686373cc3e009dffbde9e083e668b2b9bb318eae74994482","sha256:cbb27e5f3dc81481f4f28dcc3e53b0752a974d145dbc3701f1ae7769e1ea9953"],"state_sha256":"cefe37511ac65466a3200d508a0dbdc9e804f1bc9f0a23453dacb6d7ea9fd802"}