{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DVIZ3KWWN32NEFVWUWSZO5FEKV","short_pith_number":"pith:DVIZ3KWW","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"},"canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","source":{"kind":"arxiv","id":"1902.07055","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07055","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07055v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07055","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"DVIZ3KWWN32N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DVIZ3KWWN32NEFVW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DVIZ3KWW","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DVIZ3KWWN32NEFVWUWSZO5FEKV","target":"record","payload":{"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"},"canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","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"},"source_kind":"arxiv","source_id":"1902.07055","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvSFcRq5ryRqj+OI4Km5/kO59j9AE+TgZpiX/QbSGc+pljQ/pH7ciqkp55yS/VmBThLKrYQO9moWNcTJvZHEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:13:14.869155Z"},"content_sha256":"ac905ebe6c9a11531419f72f7ce56d3a9e91f7a296f7efb25344c3c4bed4a634","schema_version":"1.0","event_id":"sha256:ac905ebe6c9a11531419f72f7ce56d3a9e91f7a296f7efb25344c3c4bed4a634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DVIZ3KWWN32NEFVWUWSZO5FEKV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BC1rlxHzDVHVhthLcSMNBPy9Qm40YlQjm/D7j+mHfHs4RYDH79gM6ygSP+z7SUTmQUoPXAgAYYAk9ETXHbMeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:13:14.869523Z"},"content_sha256":"e34e6165ffa74294eba45b6d58b0c04e7827ea670e7475e723cfe40c43640825","schema_version":"1.0","event_id":"sha256:e34e6165ffa74294eba45b6d58b0c04e7827ea670e7475e723cfe40c43640825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/bundle.json","state_url":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T21:13:14Z","links":{"resolver":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV","bundle":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/bundle.json","state":"https://pith.science/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVIZ3KWWN32NEFVWUWSZO5FEKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DVIZ3KWWN32NEFVWUWSZO5FEKV","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":"a0233c0606f11db39547724f0c12e756b1d9607436cfee4cf31d3f177c3b6bb6","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T13:57:29Z","title_canon_sha256":"aab9120949e92550d457faffee212fec251ab672af999dc9f92f6eb17baa0ad3"},"schema_version":"1.0","source":{"id":"1902.07055","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07055","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07055v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07055","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"DVIZ3KWWN32N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DVIZ3KWWN32NEFVW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DVIZ3KWW","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e34e6165ffa74294eba45b6d58b0c04e7827ea670e7475e723cfe40c43640825","target":"graph","created_at":"2026-05-17T23:42:42Z","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":"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","authors_text":"Adrian Kosowski, Laurent Viennot, Przemys{\\l}aw Uzna\\'nski","cross_cats":["cs.CC","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T13:57:29Z","title":"Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07055","kind":"arxiv","version":3},"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:ac905ebe6c9a11531419f72f7ce56d3a9e91f7a296f7efb25344c3c4bed4a634","target":"record","created_at":"2026-05-17T23:42:42Z","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":"a0233c0606f11db39547724f0c12e756b1d9607436cfee4cf31d3f177c3b6bb6","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T13:57:29Z","title_canon_sha256":"aab9120949e92550d457faffee212fec251ab672af999dc9f92f6eb17baa0ad3"},"schema_version":"1.0","source":{"id":"1902.07055","kind":"arxiv","version":3}},"canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d519daad66ef4d216b6a5a59774a4557e958f8be20989e6fdb6129467896a26","first_computed_at":"2026-05-17T23:42:42.324558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:42.324558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1jgiWuNBvwSLqfIM2nh9Gs1pEW1ZTeKJ8sY/FFQXm03Vr+gi6u6o0Fv4KJJ8SUUVKLXbFE8bxkYSk8bCvDEoCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:42.325296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07055","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac905ebe6c9a11531419f72f7ce56d3a9e91f7a296f7efb25344c3c4bed4a634","sha256:e34e6165ffa74294eba45b6d58b0c04e7827ea670e7475e723cfe40c43640825"],"state_sha256":"a4dd4465b36139b4025c3a611057cc07caf8d4c7997bede8916183c32fd33a60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zp9H6Xg+kpHnlNfHn0klyEYLhk6xpAW27eNY2Jy3xlaSwspUnj2louO7EjpV0Zlr5Y4orxY+29ZiADx9l6nRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:13:14.871405Z","bundle_sha256":"47fab8eac101c82bc41f85d80e00a58676e5858d28c373dfb6ef503acbe9f665"}}