{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QP7BTNROD6AF5DJRHEPKPKIIA6","short_pith_number":"pith:QP7BTNRO","schema_version":"1.0","canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","source":{"kind":"arxiv","id":"1507.06240","version":3},"attestation_state":"computed","paper":{"title":"Sublinear-Space Distance Labeling using Hubs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2015-07-22T16:24:02Z","abstract_excerpt":"A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. We propose a series of new labeling schemes within the framework of so-called hub labeling (HL, also known as landmark labeling or 2-hop-cover labeling), in which each node $u$ stores its distance to all nodes from an appropriately chosen set of hubs $S(u) \\subseteq V$. For a queried pair of nodes $(u,v)$, the length of a shortest $u-v$-path passing through a hub node from $S(u)\\cap S(v)$ is the"},"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":"1507.06240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T16:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"1b295b9cba1e55da1288b3498d7fa93ed10eb849d02b2ed2222c6ad1ff9c2960","abstract_canon_sha256":"6ce634f09f1233fe41b0e74280939646c55e28f63dddd5cf1d4aff94886dbb2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.931891Z","signature_b64":"1q5hTdL2boknd6yxC5SZ5gfsf0wYFsrNZLVufw5RpqcbKwrEdKA9VPgnvukMZ8L5hEVWVqGcToFWPPGlhM9WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","last_reissued_at":"2026-05-18T01:10:45.931506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.931506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear-Space Distance Labeling using Hubs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2015-07-22T16:24:02Z","abstract_excerpt":"A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. We propose a series of new labeling schemes within the framework of so-called hub labeling (HL, also known as landmark labeling or 2-hop-cover labeling), in which each node $u$ stores its distance to all nodes from an appropriately chosen set of hubs $S(u) \\subseteq V$. For a queried pair of nodes $(u,v)$, the length of a shortest $u-v$-path passing through a hub node from $S(u)\\cap S(v)$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06240","kind":"arxiv","version":3},"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":"1507.06240","created_at":"2026-05-18T01:10:45.931572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06240v3","created_at":"2026-05-18T01:10:45.931572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06240","created_at":"2026-05-18T01:10:45.931572+00:00"},{"alias_kind":"pith_short_12","alias_value":"QP7BTNROD6AF","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QP7BTNROD6AF5DJR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QP7BTNRO","created_at":"2026-05-18T12:29:37.295048+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/QP7BTNROD6AF5DJRHEPKPKIIA6","json":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6.json","graph_json":"https://pith.science/api/pith-number/QP7BTNROD6AF5DJRHEPKPKIIA6/graph.json","events_json":"https://pith.science/api/pith-number/QP7BTNROD6AF5DJRHEPKPKIIA6/events.json","paper":"https://pith.science/paper/QP7BTNRO"},"agent_actions":{"view_html":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6","download_json":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6.json","view_paper":"https://pith.science/paper/QP7BTNRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06240&json=true","fetch_graph":"https://pith.science/api/pith-number/QP7BTNROD6AF5DJRHEPKPKIIA6/graph.json","fetch_events":"https://pith.science/api/pith-number/QP7BTNROD6AF5DJRHEPKPKIIA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/action/storage_attestation","attest_author":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/action/author_attestation","sign_citation":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/action/citation_signature","submit_replication":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/action/replication_record"}},"created_at":"2026-05-18T01:10:45.931572+00:00","updated_at":"2026-05-18T01:10:45.931572+00:00"}