{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DVIZ3KWWN32NEFVWUWSZO5FEKV","short_pith_number":"pith:DVIZ3KWW","schema_version":"1.0","canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","source":{"kind":"arxiv","id":"1902.07055","version":3},"attestation_state":"computed","paper":{"title":"Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski, Laurent Viennot, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2019-02-19T13:57:29Z","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. An important class of distance labeling schemes is that of hub labelings, where a node $v \\in G$ stores its distance to the so-called hubs $S_v \\subseteq V$, chosen so that for any $u,v \\in V$ there is $w \\in S_u \\cap S_v$ belonging to some shortest $uv$ path. Notice that for most existing graph classes, the best distance labelling constructions existing use at some point a hub labeling scheme a"},"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":"1902.07055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T13:57:29Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"aab9120949e92550d457faffee212fec251ab672af999dc9f92f6eb17baa0ad3","abstract_canon_sha256":"a0233c0606f11db39547724f0c12e756b1d9607436cfee4cf31d3f177c3b6bb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.325296Z","signature_b64":"1jgiWuNBvwSLqfIM2nh9Gs1pEW1ZTeKJ8sY/FFQXm03Vr+gi6u6o0Fv4KJJ8SUUVKLXbFE8bxkYSk8bCvDEoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","last_reissued_at":"2026-05-17T23:42:42.324558Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.324558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski, Laurent Viennot, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2019-02-19T13:57:29Z","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. An important class of distance labeling schemes is that of hub labelings, where a node $v \\in G$ stores its distance to the so-called hubs $S_v \\subseteq V$, chosen so that for any $u,v \\in V$ there is $w \\in S_u \\cap S_v$ belonging to some shortest $uv$ path. Notice that for most existing graph classes, the best distance labelling constructions existing use at some point a hub labeling scheme a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07055","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":"1902.07055","created_at":"2026-05-17T23:42:42.324677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07055v3","created_at":"2026-05-17T23:42:42.324677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07055","created_at":"2026-05-17T23:42:42.324677+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVIZ3KWWN32N","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVIZ3KWWN32NEFVW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVIZ3KWW","created_at":"2026-05-18T12:33:15.570797+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/DVIZ3KWWN32NEFVWUWSZO5FEKV","json":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV.json","graph_json":"https://pith.science/api/pith-number/DVIZ3KWWN32NEFVWUWSZO5FEKV/graph.json","events_json":"https://pith.science/api/pith-number/DVIZ3KWWN32NEFVWUWSZO5FEKV/events.json","paper":"https://pith.science/paper/DVIZ3KWW"},"agent_actions":{"view_html":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV","download_json":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV.json","view_paper":"https://pith.science/paper/DVIZ3KWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07055&json=true","fetch_graph":"https://pith.science/api/pith-number/DVIZ3KWWN32NEFVWUWSZO5FEKV/graph.json","fetch_events":"https://pith.science/api/pith-number/DVIZ3KWWN32NEFVWUWSZO5FEKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/action/storage_attestation","attest_author":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/action/author_attestation","sign_citation":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/action/citation_signature","submit_replication":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/action/replication_record"}},"created_at":"2026-05-17T23:42:42.324677+00:00","updated_at":"2026-05-17T23:42:42.324677+00:00"}