{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","short_pith_number":"pith:WBLK45CE","canonical_record":{"source":{"id":"2605.13074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T06:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"199473e09793f356aebc14277c16b2b1c75812b3741865bb7959a07ffc462c70","abstract_canon_sha256":"873162b63dee08dd8527f9a0779d0600443382127f01097c6f88f533e08cad91"},"schema_version":"1.0"},"canonical_sha256":"b056ae7444f10d36b12cce79f513d67c7226e00742ee95090a576547b61c40c5","source":{"kind":"arxiv","id":"2605.13074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13074","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13074v1","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13074","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"WBLK45CE6EGT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WBLK45CE6EGTNMJM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WBLK45CE","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T06:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"199473e09793f356aebc14277c16b2b1c75812b3741865bb7959a07ffc462c70","abstract_canon_sha256":"873162b63dee08dd8527f9a0779d0600443382127f01097c6f88f533e08cad91"},"schema_version":"1.0"},"canonical_sha256":"b056ae7444f10d36b12cce79f513d67c7226e00742ee95090a576547b61c40c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:58.817103Z","signature_b64":"XeOrKUsQx3HWuXkkxDmRIhQ3aXmm4GmuvVCST7gdhX1rCYvM7T/I0P4yYpZBmNzxHGmYXWtVFgHYWKtO3BwUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b056ae7444f10d36b12cce79f513d67c7226e00742ee95090a576547b61c40c5","last_reissued_at":"2026-05-18T03:08:58.816495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:58.816495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13074","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-05-18T03:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IDCLOO0agVXD3iCkIJYh36ml3CvgHdZerCwWVv1GfcQaHoHrMt2Bqy47ln/xwLzj6Yg8+9uR2St8QL8mZTfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:33:28.828365Z"},"content_sha256":"23753bf08fd38acfa5af8b7121460e25a19fa23f050f8aa1232e4e98c4da45f7","schema_version":"1.0","event_id":"sha256:23753bf08fd38acfa5af8b7121460e25a19fa23f050f8aa1232e4e98c4da45f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandr Politov, Alexandru I. Tomescu, Corentin Moumard, Francisco Sena, Juha Harviainen, Sebastian Schmidt","submitted_at":"2026-05-13T06:47:46Z","abstract_excerpt":"Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can easily be adapted from directed graphs to bidirected graphs, such as shortest path algorithms. These adaptions are already used in practice, and implicitly use the graph doubling technique to apply an algorithm for directed graphs to bidirected graphs.\n  In other cases, the applicability of graph doubling is not that obvious. For example, superbubbles and their g"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Graph doubling maintains connectivity and allows a direct connection between ultrabubbles and weak superbubbles. This results in the first linear-time reduction-based algorithm for computing ultrabubbles on any bidirected graph.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the correspondence between ultrabubbles in the original bidirected graph and weak superbubbles in the doubled directed graph holds for every possible bidirected graph and that existing superbubble algorithms transfer without correctness loss.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"70d56390995ca57eaca5516df3cfbd0a7b2f9fb15a3282dede29c0dd7ba6a9f1"},"source":{"id":"2605.13074","kind":"arxiv","version":1},"verdict":{"id":"a06a5efe-9a36-448e-82b8-6457705fc332","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T02:04:00.505346Z","strongest_claim":"Graph doubling maintains connectivity and allows a direct connection between ultrabubbles and weak superbubbles. This results in the first linear-time reduction-based algorithm for computing ultrabubbles on any bidirected graph.","one_line_summary":"Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the correspondence between ultrabubbles in the original bidirected graph and weak superbubbles in the doubled directed graph holds for every possible bidirected graph and that existing superbubble algorithms transfer without correctness loss.","pith_extraction_headline":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph."},"references":{"count":12,"sample":[{"doi":"10.1089/cmb.2012.0021","year":2012,"title":"14 The Power of Graph Doubling: Reducing Ultrabubbles to Weak Superbubbles 2 Ouahiba Bessouf, Abdelkader Khelladi, and Thomas Zaslavsky","work_id":"e72ff851-1920-4707-97b4-7e64ddf1a080","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1101/2025.09.29.678807","year":2025,"title":"URL: https://www.biorxiv.org/content/early/2025/10/01/2025. 09.29.678807, arXiv:https://www.biorxiv.org/content/early/2025/10/01/2025.09.29. 678807.full.pdf,doi:10.1101/2025.09.29.678807. 6 Fawaz Dabb","work_id":"02dedc2f-68fa-4164-951d-f0c91405da2b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1307/mmj/1028989917","year":1953,"title":"On the notion of balance of a signed graph.Michigan Mathematical Journal, 2(2):143–146, 1953.doi:10.1307/mmj/1028989917","work_id":"ef59e079-84e2-42f4-84ae-32f62518b5a2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1093/nar/gkab1053","year":2022,"title":"The sequence read archive: a decade more of explosive growth.Nucleic Acids Research, 50(D1):D387–D390, 01 2022.doi:10.1093/nar/gkab1053","work_id":"49bdec77-6161-495e-9267-4d32a0e10be1","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"15 20 Taku Onodera, Kunihiko Sadakane, and Tetsuo Shibuya","work_id":"84b07019-19c0-4bbb-806b-98b3310c7b2e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"95d3d46c46b3aba1e07c2d3d0d660efc97af4df4bad7725184f326dae71d79ca","internal_anchors":1},"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":"a06a5efe-9a36-448e-82b8-6457705fc332"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3BRpWOmNx2l9K1eZHoXGg2amXwumpe/MZyJBLYLgHNuZlOcunxkIhsenpX+R9wXNrKCeXftx3fq2JmHbvH4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:33:28.829519Z"},"content_sha256":"c04c9f5295de1e35ae8b292a45602f9bfc040be495730c2a767168acba9ed12e","schema_version":"1.0","event_id":"sha256:c04c9f5295de1e35ae8b292a45602f9bfc040be495730c2a767168acba9ed12e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1371/journal.pbio.1002195.29) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"28 Zachary D. Stephens, Skylar Y. Lee, Faraz Faghri, Roy H. Campbell, Chengxiang Zhai, Miles J. Efron, Ravishankar Iyer, Michael C. Schatz, Saurabh Sinha, and Gene E. Robinson. Big data: Astronomical or genomical?PLOS Biology, 13(7):1–11, 0","arxiv_id":"2605.13074","detector":"doi_compliance","evidence":{"ref_index":10,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"28 Zachary D. Stephens, Skylar Y. Lee, Faraz Faghri, Roy H. Campbell, Chengxiang Zhai, Miles J. Efron, Ravishankar Iyer, Michael C. Schatz, Saurabh Sinha, and Gene E. Robinson. Big data: Astronomical or genomical?PLOS Biology, 13(7):1–11, 0","reconstructed_doi":"10.1371/journal.pbio.1002195.29"},"severity":"advisory","ref_index":10,"audited_at":"2026-05-19T06:49:27.540141Z","event_type":"pith.integrity.v1","detected_doi":"10.1371/journal.pbio.1002195.29","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f1970bd56cf1c37bc6b98b06baa3fe00c1448f0e3708c79b37bfee68d422ae69","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":212,"payload_sha256":"3f0f408bc4091b7ca71e01ffa08a009fa3af1b09b3f73bd5c292b8260ecaafc0","signature_b64":"tWZ83QBNA/Ny2yjvJxAZMi2ebuORGUNZh7CHJeN1oXKaC8K7t/tZAPXxWUsPi9gHYqWUYC+tCifePVSZQo3MDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPbNeTqZibvcRbFkCbplG3wmPATuHpBKb47hWt8Lz057eL/mdoHD1xsyZ5g1jjEwVDLPLOxN3aYkMmPdtzsBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:33:28.830848Z"},"content_sha256":"cc06810fcc12caa54f813d50570727939aac6a5738cf77dd1dec4912f3376ed7","schema_version":"1.0","event_id":"sha256:cc06810fcc12caa54f813d50570727939aac6a5738cf77dd1dec4912f3376ed7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arXiv.2604.08071.26) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"25 Francisco Sena, Aleksandr Politov, Corentin Moumard, Massimo Cairo, Romeo Rizzi, Manuel Cáceres, Sebastian Schmidt, Juha Harviainen, and Alexandru I. Tomescu. Identifying bubble- like subgraphs in linear-time via a unified spqr-tree fram","arxiv_id":"2605.13074","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"25 Francisco Sena, Aleksandr Politov, Corentin Moumard, Massimo Cairo, Romeo Rizzi, Manuel Cáceres, Sebastian Schmidt, Juha Harviainen, and Alexandru I. Tomescu. Identifying bubble- like subgraphs in linear-time via a unified spqr-tree fram","reconstructed_doi":"10.48550/arXiv.2604.08071.26"},"severity":"advisory","ref_index":8,"audited_at":"2026-05-19T06:49:27.540141Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arXiv.2604.08071.26","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d52fae4ced7f680a71eddef3208d9aaf8f75de502e6c925ef08ae250d0e574a5","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":211,"payload_sha256":"2d4269df2c5f67aa3fa7f91e8077b4f846310517284ec8ee3df5bfd756f0e6c9","signature_b64":"fXIqCZf/4hTW060xwXNG4bO3dlvC+EHjS7s9/+54vhCITVo3OkByzZEVUSR6ifYPlglGWuQm2y/Nx/uEg1rdCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hmk5k9IILuxdsSqxafgbjhMb0ZC/MSC4fam6ZjFq8QW0aswrh9e2fG366H2PNHQa+Dy1C2q0MkiptbGU1x7QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:33:28.831411Z"},"content_sha256":"4cd64782ebf7835d5cae155b022c7099410696b8e051449fde1ff86d09999922","schema_version":"1.0","event_id":"sha256:4cd64782ebf7835d5cae155b022c7099410696b8e051449fde1ff86d09999922"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/bundle.json","state_url":"https://pith.science/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/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-22T08:33:28Z","links":{"resolver":"https://pith.science/pith/WBLK45CE6EGTNMJMZZ47KE6WPR","bundle":"https://pith.science/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/bundle.json","state":"https://pith.science/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBLK45CE6EGTNMJMZZ47KE6WPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WBLK45CE6EGTNMJMZZ47KE6WPR","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"873162b63dee08dd8527f9a0779d0600443382127f01097c6f88f533e08cad91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T06:47:46Z","title_canon_sha256":"199473e09793f356aebc14277c16b2b1c75812b3741865bb7959a07ffc462c70"},"schema_version":"1.0","source":{"id":"2605.13074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13074","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13074v1","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13074","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"WBLK45CE6EGT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WBLK45CE6EGTNMJM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WBLK45CE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c04c9f5295de1e35ae8b292a45602f9bfc040be495730c2a767168acba9ed12e","target":"graph","created_at":"2026-05-18T03:08:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Graph doubling maintains connectivity and allows a direct connection between ultrabubbles and weak superbubbles. This results in the first linear-time reduction-based algorithm for computing ultrabubbles on any bidirected graph."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the correspondence between ultrabubbles in the original bidirected graph and weak superbubbles in the doubled directed graph holds for every possible bidirected graph and that existing superbubble algorithms transfer without correctness loss."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph."}],"snapshot_sha256":"70d56390995ca57eaca5516df3cfbd0a7b2f9fb15a3282dede29c0dd7ba6a9f1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can easily be adapted from directed graphs to bidirected graphs, such as shortest path algorithms. These adaptions are already used in practice, and implicitly use the graph doubling technique to apply an algorithm for directed graphs to bidirected graphs.\n  In other cases, the applicability of graph doubling is not that obvious. For example, superbubbles and their g","authors_text":"Aleksandr Politov, Alexandru I. Tomescu, Corentin Moumard, Francisco Sena, Juha Harviainen, Sebastian Schmidt","cross_cats":[],"headline":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T06:47:46Z","title":"The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles"},"references":{"count":12,"internal_anchors":1,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"10.1089/cmb.2012.0021","is_internal_anchor":false,"ref_index":1,"title":"14 The Power of Graph Doubling: Reducing Ultrabubbles to Weak Superbubbles 2 Ouahiba Bessouf, Abdelkader Khelladi, and Thomas Zaslavsky","work_id":"e72ff851-1920-4707-97b4-7e64ddf1a080","year":2012},{"cited_arxiv_id":"","doi":"10.1101/2025.09.29.678807","is_internal_anchor":false,"ref_index":2,"title":"URL: https://www.biorxiv.org/content/early/2025/10/01/2025. 09.29.678807, arXiv:https://www.biorxiv.org/content/early/2025/10/01/2025.09.29. 678807.full.pdf,doi:10.1101/2025.09.29.678807. 6 Fawaz Dabb","work_id":"02dedc2f-68fa-4164-951d-f0c91405da2b","year":2025},{"cited_arxiv_id":"","doi":"10.1307/mmj/1028989917","is_internal_anchor":false,"ref_index":3,"title":"On the notion of balance of a signed graph.Michigan Mathematical Journal, 2(2):143–146, 1953.doi:10.1307/mmj/1028989917","work_id":"ef59e079-84e2-42f4-84ae-32f62518b5a2","year":1953},{"cited_arxiv_id":"","doi":"10.1093/nar/gkab1053","is_internal_anchor":false,"ref_index":4,"title":"The sequence read archive: a decade more of explosive growth.Nucleic Acids Research, 50(D1):D387–D390, 01 2022.doi:10.1093/nar/gkab1053","work_id":"49bdec77-6161-495e-9267-4d32a0e10be1","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"15 20 Taku Onodera, Kunihiko Sadakane, and Tetsuo Shibuya","work_id":"84b07019-19c0-4bbb-806b-98b3310c7b2e","year":2013}],"snapshot_sha256":"95d3d46c46b3aba1e07c2d3d0d660efc97af4df4bad7725184f326dae71d79ca"},"source":{"id":"2605.13074","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T02:04:00.505346Z","id":"a06a5efe-9a36-448e-82b8-6457705fc332","model_set":{"reader":"grok-4.3"},"one_line_summary":"Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Doubling a bidirected graph maps its ultrabubbles exactly onto weak superbubbles in the resulting directed graph.","strongest_claim":"Graph doubling maintains connectivity and allows a direct connection between ultrabubbles and weak superbubbles. This results in the first linear-time reduction-based algorithm for computing ultrabubbles on any bidirected graph.","weakest_assumption":"That the correspondence between ultrabubbles in the original bidirected graph and weak superbubbles in the doubled directed graph holds for every possible bidirected graph and that existing superbubble algorithms transfer without correctness loss."}},"verdict_id":"a06a5efe-9a36-448e-82b8-6457705fc332"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23753bf08fd38acfa5af8b7121460e25a19fa23f050f8aa1232e4e98c4da45f7","target":"record","created_at":"2026-05-18T03:08:58Z","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":"873162b63dee08dd8527f9a0779d0600443382127f01097c6f88f533e08cad91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T06:47:46Z","title_canon_sha256":"199473e09793f356aebc14277c16b2b1c75812b3741865bb7959a07ffc462c70"},"schema_version":"1.0","source":{"id":"2605.13074","kind":"arxiv","version":1}},"canonical_sha256":"b056ae7444f10d36b12cce79f513d67c7226e00742ee95090a576547b61c40c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b056ae7444f10d36b12cce79f513d67c7226e00742ee95090a576547b61c40c5","first_computed_at":"2026-05-18T03:08:58.816495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:58.816495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XeOrKUsQx3HWuXkkxDmRIhQ3aXmm4GmuvVCST7gdhX1rCYvM7T/I0P4yYpZBmNzxHGmYXWtVFgHYWKtO3BwUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:58.817103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13074","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:4cd64782ebf7835d5cae155b022c7099410696b8e051449fde1ff86d09999922","sha256:cc06810fcc12caa54f813d50570727939aac6a5738cf77dd1dec4912f3376ed7"]}],"invalid_events":[],"applied_event_ids":["sha256:23753bf08fd38acfa5af8b7121460e25a19fa23f050f8aa1232e4e98c4da45f7","sha256:c04c9f5295de1e35ae8b292a45602f9bfc040be495730c2a767168acba9ed12e"],"state_sha256":"5bee50e17dc87163e8f560939b47a313b2b931a9388753012c99721438cae0d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rgn2742D0A4qtUt/ERMPdvt5WkOww+bUBffKp55zSCDEHzhpJ6mduURo8Cd8uZ8j0SLJtQVw9Yh3opl7V2G4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:33:28.836091Z","bundle_sha256":"8a2c4b5e4527bd128e5752fb98999f94d12541aaa9e4c93a037c664cbf6f93f4"}}