{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:A6ZCPO4QAA4DH5THGFIWUZBJ3T","short_pith_number":"pith:A6ZCPO4Q","canonical_record":{"source":{"id":"2410.22186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-10-29T16:24:39Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"64f6fa488aea695fd434b6d0858a9f3f01bc7434f91b023e55bb18c0b0bcb045","abstract_canon_sha256":"9b36ed8815f2f380a3c16caeecc742a89943a1136ad15d9ee464bb1eca7910a3"},"schema_version":"1.0"},"canonical_sha256":"07b227bb90003833f66731516a6429dcfdd6677a88b4e5ae85c2ffe5ff707d4f","source":{"kind":"arxiv","id":"2410.22186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22186","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22186v1","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22186","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"A6ZCPO4QAA4D","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6ZCPO4QAA4DH5TH","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6ZCPO4Q","created_at":"2026-07-05T09:28:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:A6ZCPO4QAA4DH5THGFIWUZBJ3T","target":"record","payload":{"canonical_record":{"source":{"id":"2410.22186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-10-29T16:24:39Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"64f6fa488aea695fd434b6d0858a9f3f01bc7434f91b023e55bb18c0b0bcb045","abstract_canon_sha256":"9b36ed8815f2f380a3c16caeecc742a89943a1136ad15d9ee464bb1eca7910a3"},"schema_version":"1.0"},"canonical_sha256":"07b227bb90003833f66731516a6429dcfdd6677a88b4e5ae85c2ffe5ff707d4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:05.268470Z","signature_b64":"R65Sua8yw9e4nXhYmJ95UEA2ivztFaIQjektvrSUI0QEbN1HkOoYX9EL3tSsOl9yLMY1tVytzocU9Mi/0+J3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07b227bb90003833f66731516a6429dcfdd6677a88b4e5ae85c2ffe5ff707d4f","last_reissued_at":"2026-07-05T09:28:05.268010Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:05.268010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.22186","source_version":1,"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-05T09:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7qI1XeAgpvNka+4l31DE504I/SlxJ6UcSPpu4VEUmwAUnSzMrdLeWVQ0gehKZrcN17bCDOeCj5jP8ki51+EAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:52:56.890201Z"},"content_sha256":"780ac9a3ef87c7708a7f339f6732ef1799fc54186ebf868dc89786a19ac1df01","schema_version":"1.0","event_id":"sha256:780ac9a3ef87c7708a7f339f6732ef1799fc54186ebf868dc89786a19ac1df01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:A6ZCPO4QAA4DH5THGFIWUZBJ3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced Bidirectional Breadth-First Search on Scale-Free Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.SI","authors_text":"Benjamin Dayan, Johannes Lengler, Marc Kaufmann, Sacha Cerf, Ulysse Schaller, Umberto De Ambroggio","submitted_at":"2024-10-29T16:24:39Z","abstract_excerpt":"To find a shortest path between two nodes $s_0$ and $s_1$ in a given graph, a classical approach is to start a Breadth-First Search (BFS) from $s_0$ and run it until the search discovers $s_1$. Alternatively, one can start two Breadth-First Searches, one from $s_0$ and one from $s_1$, and alternate their layer expansions until they meet. This bidirectional BFS can be balanced by always expanding a layer on the side that has discovered fewer vertices so far. This usually results in significant speedups in real-world networks, and it has been shown that this indeed yields sublinear running time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22186","kind":"arxiv","version":1},"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/2410.22186/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-05T09:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gl7T9S0j1gkePap/ZVa2nKsqOctJJIZg0Ehc7K8mgp5FiR/Nlsi8PIoDy8TmHwKjfr53TiozFP6R/GVAIK6RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:52:56.890756Z"},"content_sha256":"de9992e0175aa16ddc665d8a9f1a7eb57872ccfe6ff29927add9ac5f743a3a64","schema_version":"1.0","event_id":"sha256:de9992e0175aa16ddc665d8a9f1a7eb57872ccfe6ff29927add9ac5f743a3a64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/bundle.json","state_url":"https://pith.science/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/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-08-13T19:52:56Z","links":{"resolver":"https://pith.science/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T","bundle":"https://pith.science/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/bundle.json","state":"https://pith.science/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6ZCPO4QAA4DH5THGFIWUZBJ3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:A6ZCPO4QAA4DH5THGFIWUZBJ3T","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":"9b36ed8815f2f380a3c16caeecc742a89943a1136ad15d9ee464bb1eca7910a3","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-10-29T16:24:39Z","title_canon_sha256":"64f6fa488aea695fd434b6d0858a9f3f01bc7434f91b023e55bb18c0b0bcb045"},"schema_version":"1.0","source":{"id":"2410.22186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22186","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22186v1","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22186","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"A6ZCPO4QAA4D","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6ZCPO4QAA4DH5TH","created_at":"2026-07-05T09:28:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6ZCPO4Q","created_at":"2026-07-05T09:28:05Z"}],"graph_snapshots":[{"event_id":"sha256:de9992e0175aa16ddc665d8a9f1a7eb57872ccfe6ff29927add9ac5f743a3a64","target":"graph","created_at":"2026-07-05T09:28:05Z","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/2410.22186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To find a shortest path between two nodes $s_0$ and $s_1$ in a given graph, a classical approach is to start a Breadth-First Search (BFS) from $s_0$ and run it until the search discovers $s_1$. Alternatively, one can start two Breadth-First Searches, one from $s_0$ and one from $s_1$, and alternate their layer expansions until they meet. This bidirectional BFS can be balanced by always expanding a layer on the side that has discovered fewer vertices so far. This usually results in significant speedups in real-world networks, and it has been shown that this indeed yields sublinear running time ","authors_text":"Benjamin Dayan, Johannes Lengler, Marc Kaufmann, Sacha Cerf, Ulysse Schaller, Umberto De Ambroggio","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-10-29T16:24:39Z","title":"Balanced Bidirectional Breadth-First Search on Scale-Free Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22186","kind":"arxiv","version":1},"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:780ac9a3ef87c7708a7f339f6732ef1799fc54186ebf868dc89786a19ac1df01","target":"record","created_at":"2026-07-05T09:28:05Z","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":"9b36ed8815f2f380a3c16caeecc742a89943a1136ad15d9ee464bb1eca7910a3","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-10-29T16:24:39Z","title_canon_sha256":"64f6fa488aea695fd434b6d0858a9f3f01bc7434f91b023e55bb18c0b0bcb045"},"schema_version":"1.0","source":{"id":"2410.22186","kind":"arxiv","version":1}},"canonical_sha256":"07b227bb90003833f66731516a6429dcfdd6677a88b4e5ae85c2ffe5ff707d4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07b227bb90003833f66731516a6429dcfdd6677a88b4e5ae85c2ffe5ff707d4f","first_computed_at":"2026-07-05T09:28:05.268010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:05.268010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R65Sua8yw9e4nXhYmJ95UEA2ivztFaIQjektvrSUI0QEbN1HkOoYX9EL3tSsOl9yLMY1tVytzocU9Mi/0+J3Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:05.268470Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.22186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:780ac9a3ef87c7708a7f339f6732ef1799fc54186ebf868dc89786a19ac1df01","sha256:de9992e0175aa16ddc665d8a9f1a7eb57872ccfe6ff29927add9ac5f743a3a64"],"state_sha256":"ce03d9cebead9a6236f93666e5d024326594fa01189e1b056ed8181fe8c0b3e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBLocPGBePXDC6hFgjr2VteyGLpuYpgPSZ7jH8wBV4wzbtPPm7HgIHI1LTJ4LkJ06k4lWuTiPc+HvCfh7CNjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T19:52:56.895990Z","bundle_sha256":"a366a255a8860ab621ceb6a625374782b9244684cf33e6eaf81633627f21c4e2"}}