{"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"}