{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QP7BTNROD6AF5DJRHEPKPKIIA6","short_pith_number":"pith:QP7BTNRO","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"},"canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","source":{"kind":"arxiv","id":"1507.06240","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06240","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06240v3","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06240","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"QP7BTNROD6AF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QP7BTNROD6AF5DJR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QP7BTNRO","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QP7BTNROD6AF5DJRHEPKPKIIA6","target":"record","payload":{"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"},"canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","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"},"source_kind":"arxiv","source_id":"1507.06240","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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNlk6BOJwGSWutYtyq+0AtjkF6bYUVp1/Tb866R5+yHXuS2flpLL/K0dtVNV/SAxYB8nUbyMmX+mGb1A8unKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:47.790073Z"},"content_sha256":"2e0cd46308f3764fb453ff6121168eca3438171a364ceb10491f2666c9d5c6b0","schema_version":"1.0","event_id":"sha256:2e0cd46308f3764fb453ff6121168eca3438171a364ceb10491f2666c9d5c6b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QP7BTNROD6AF5DJRHEPKPKIIA6","target":"graph","payload":{"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"},"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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8bSiuyqxvRrbFqzKiSaD7soWzfoiaDwg2hSniTvlByYns0MyLM8jv8pGlcMTDL0pBlZZTMbP5KDRQNAroG2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:47.790827Z"},"content_sha256":"e34bf0558536ead516d265c43afacaebf5be567634ae406427e7c4d508deec61","schema_version":"1.0","event_id":"sha256:e34bf0558536ead516d265c43afacaebf5be567634ae406427e7c4d508deec61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/bundle.json","state_url":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/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-05-30T09:21:47Z","links":{"resolver":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6","bundle":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/bundle.json","state":"https://pith.science/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP7BTNROD6AF5DJRHEPKPKIIA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QP7BTNROD6AF5DJRHEPKPKIIA6","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":"6ce634f09f1233fe41b0e74280939646c55e28f63dddd5cf1d4aff94886dbb2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T16:24:02Z","title_canon_sha256":"1b295b9cba1e55da1288b3498d7fa93ed10eb849d02b2ed2222c6ad1ff9c2960"},"schema_version":"1.0","source":{"id":"1507.06240","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06240","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06240v3","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06240","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"QP7BTNROD6AF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QP7BTNROD6AF5DJR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QP7BTNRO","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:e34bf0558536ead516d265c43afacaebf5be567634ae406427e7c4d508deec61","target":"graph","created_at":"2026-05-18T01:10:45Z","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. 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","authors_text":"Adrian Kosowski, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T16:24:02Z","title":"Sublinear-Space Distance Labeling using Hubs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06240","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:2e0cd46308f3764fb453ff6121168eca3438171a364ceb10491f2666c9d5c6b0","target":"record","created_at":"2026-05-18T01:10:45Z","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":"6ce634f09f1233fe41b0e74280939646c55e28f63dddd5cf1d4aff94886dbb2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T16:24:02Z","title_canon_sha256":"1b295b9cba1e55da1288b3498d7fa93ed10eb849d02b2ed2222c6ad1ff9c2960"},"schema_version":"1.0","source":{"id":"1507.06240","kind":"arxiv","version":3}},"canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83fe19b62e1f805e8d31391ea7a90807b8887fa4a100d0c7a0a7cf82592c5803","first_computed_at":"2026-05-18T01:10:45.931506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:45.931506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1q5hTdL2boknd6yxC5SZ5gfsf0wYFsrNZLVufw5RpqcbKwrEdKA9VPgnvukMZ8L5hEVWVqGcToFWPPGlhM9WDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:45.931891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06240","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e0cd46308f3764fb453ff6121168eca3438171a364ceb10491f2666c9d5c6b0","sha256:e34bf0558536ead516d265c43afacaebf5be567634ae406427e7c4d508deec61"],"state_sha256":"1b1109f309836873d52e8172727819be9a82a1cc26ac1f9c57409525438c6d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2z7mOrsOrJR3ZTl6NEAnpsX4CdT2I9NV1Tz2dzCQoQLexbxvg9J5KTmrR+3YKxl0HI07sWyqaiqVVr+J8v55CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:47.794619Z","bundle_sha256":"e6af3e3ea46a93d7d4d11ef45fbc8882061c5210f1d9454ad1eb01dffb797392"}}