{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BMNQBMBAACOD7O7J3UDGNNKF37","short_pith_number":"pith:BMNQBMBA","canonical_record":{"source":{"id":"2304.07107","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-14T12:57:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ff9143f1dcccf0b253194087b37eb87466f045e44e2c83464aaca4e4cc7fde4c","abstract_canon_sha256":"d95d21f49606b18e946d1dd1c5ebf5d8b3ddacd32d05c7153946ee29d20bccbe"},"schema_version":"1.0"},"canonical_sha256":"0b1b00b020009c3fbbe9dd0666b545dfee40bc5a778eb707f87ca063b995ac7f","source":{"kind":"arxiv","id":"2304.07107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.07107","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"2304.07107v2","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07107","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"BMNQBMBAACOD","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_16","alias_value":"BMNQBMBAACOD7O7J","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_8","alias_value":"BMNQBMBA","created_at":"2026-07-05T06:26:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BMNQBMBAACOD7O7J3UDGNNKF37","target":"record","payload":{"canonical_record":{"source":{"id":"2304.07107","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-14T12:57:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ff9143f1dcccf0b253194087b37eb87466f045e44e2c83464aaca4e4cc7fde4c","abstract_canon_sha256":"d95d21f49606b18e946d1dd1c5ebf5d8b3ddacd32d05c7153946ee29d20bccbe"},"schema_version":"1.0"},"canonical_sha256":"0b1b00b020009c3fbbe9dd0666b545dfee40bc5a778eb707f87ca063b995ac7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:21.049988Z","signature_b64":"4ES91mgLFz8dylamxmQDN7FQR4+wEecqWvFRPGj7EQ4G74zL/qyahzzr5pA01bFgQ6SOAy/9I/u5RanM1jjSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1b00b020009c3fbbe9dd0666b545dfee40bc5a778eb707f87ca063b995ac7f","last_reissued_at":"2026-07-05T06:26:21.049498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:21.049498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.07107","source_version":2,"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-07-05T06:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8makmVORwrD8rZ0P5IcJvLF1rSnYco5zF7cm+ul0QuJXt7ZcwihksPar2Lh04jIGZGc9sUZ96As6KrpWkEmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T09:45:47.888623Z"},"content_sha256":"882f2d40ecdf798031d3cde9d527b1515c15a4f4d7501229055de70205141213","schema_version":"1.0","event_id":"sha256:882f2d40ecdf798031d3cde9d527b1515c15a4f4d7501229055de70205141213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BMNQBMBAACOD7O7J3UDGNNKF37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Tight Shortest Paths in the Hybrid Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Philipp Schneider","submitted_at":"2023-04-14T12:57:03Z","abstract_excerpt":"Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in order to determine shortest paths in a distributed input graph. This article focuses on shortest paths problems in the HYBRID model, which combines local communication along edges of the input graph with global communication between arbitrary pairs of nodes that is restricted in terms of bandwidth.\n  Previous work showed that it takes $\\tilde \\Omega(\\!\\sqrt{k})$ rounds in the \\hybrid model for each node to learn its di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07107","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.07107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1hAeRB2+781TYSuuG841JhQOHNwP3EuW+Agtb5z6OLuSQwZJOgCs7dNuJDmsmNsQpIltQvnQG5u+gI1WD9qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T09:45:47.889544Z"},"content_sha256":"ba2277dfca117695b3e8a540f866f4d6c74c3cc0cc43ddd61e57909074835805","schema_version":"1.0","event_id":"sha256:ba2277dfca117695b3e8a540f866f4d6c74c3cc0cc43ddd61e57909074835805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMNQBMBAACOD7O7J3UDGNNKF37/bundle.json","state_url":"https://pith.science/pith/BMNQBMBAACOD7O7J3UDGNNKF37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMNQBMBAACOD7O7J3UDGNNKF37/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-07-26T09:45:47Z","links":{"resolver":"https://pith.science/pith/BMNQBMBAACOD7O7J3UDGNNKF37","bundle":"https://pith.science/pith/BMNQBMBAACOD7O7J3UDGNNKF37/bundle.json","state":"https://pith.science/pith/BMNQBMBAACOD7O7J3UDGNNKF37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMNQBMBAACOD7O7J3UDGNNKF37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BMNQBMBAACOD7O7J3UDGNNKF37","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":"d95d21f49606b18e946d1dd1c5ebf5d8b3ddacd32d05c7153946ee29d20bccbe","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-14T12:57:03Z","title_canon_sha256":"ff9143f1dcccf0b253194087b37eb87466f045e44e2c83464aaca4e4cc7fde4c"},"schema_version":"1.0","source":{"id":"2304.07107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.07107","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"2304.07107v2","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07107","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"BMNQBMBAACOD","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_16","alias_value":"BMNQBMBAACOD7O7J","created_at":"2026-07-05T06:26:21Z"},{"alias_kind":"pith_short_8","alias_value":"BMNQBMBA","created_at":"2026-07-05T06:26:21Z"}],"graph_snapshots":[{"event_id":"sha256:ba2277dfca117695b3e8a540f866f4d6c74c3cc0cc43ddd61e57909074835805","target":"graph","created_at":"2026-07-05T06:26:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2304.07107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in order to determine shortest paths in a distributed input graph. This article focuses on shortest paths problems in the HYBRID model, which combines local communication along edges of the input graph with global communication between arbitrary pairs of nodes that is restricted in terms of bandwidth.\n  Previous work showed that it takes $\\tilde \\Omega(\\!\\sqrt{k})$ rounds in the \\hybrid model for each node to learn its di","authors_text":"Philipp Schneider","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-14T12:57:03Z","title":"Near Tight Shortest Paths in the Hybrid Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07107","kind":"arxiv","version":2},"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:882f2d40ecdf798031d3cde9d527b1515c15a4f4d7501229055de70205141213","target":"record","created_at":"2026-07-05T06:26:21Z","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":"d95d21f49606b18e946d1dd1c5ebf5d8b3ddacd32d05c7153946ee29d20bccbe","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-14T12:57:03Z","title_canon_sha256":"ff9143f1dcccf0b253194087b37eb87466f045e44e2c83464aaca4e4cc7fde4c"},"schema_version":"1.0","source":{"id":"2304.07107","kind":"arxiv","version":2}},"canonical_sha256":"0b1b00b020009c3fbbe9dd0666b545dfee40bc5a778eb707f87ca063b995ac7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b1b00b020009c3fbbe9dd0666b545dfee40bc5a778eb707f87ca063b995ac7f","first_computed_at":"2026-07-05T06:26:21.049498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:26:21.049498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ES91mgLFz8dylamxmQDN7FQR4+wEecqWvFRPGj7EQ4G74zL/qyahzzr5pA01bFgQ6SOAy/9I/u5RanM1jjSCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:26:21.049988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.07107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:882f2d40ecdf798031d3cde9d527b1515c15a4f4d7501229055de70205141213","sha256:ba2277dfca117695b3e8a540f866f4d6c74c3cc0cc43ddd61e57909074835805"],"state_sha256":"406ce9fda3596e2cee16c078f035177183679c9a10b6c33760311f5eb39494df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XoPn+5sDHgRznw8YDbxBxaGWo5FJOAPyTM8UAcfyosnzI3qUeGdsuwr7p40dFq35u5nnp1IQDx6PeAxxu1EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T09:45:47.894032Z","bundle_sha256":"e66c3c25e446a87741c22e4473d3a4b605db9ef73daa7e811db3d03fc73f294a"}}