{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:M6YZHUPDLZJY75CRZXCRC5JDP4","short_pith_number":"pith:M6YZHUPD","canonical_record":{"source":{"id":"2605.12811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"50c4627a55560581be6c191795d1f318ddab3580204d30577fdc762b39d3764c","abstract_canon_sha256":"dd9776afadfb48a3093e012f437177a058fc8c07cd6f2650fc92d696306e3919"},"schema_version":"1.0"},"canonical_sha256":"67b193d1e35e538ff451cdc51175237f3618b5dfd1d53d7827c15594a7515bc2","source":{"kind":"arxiv","id":"2605.12811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12811","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12811v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12811","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"M6YZHUPDLZJY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"M6YZHUPDLZJY75CR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"M6YZHUPD","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:M6YZHUPDLZJY75CRZXCRC5JDP4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"50c4627a55560581be6c191795d1f318ddab3580204d30577fdc762b39d3764c","abstract_canon_sha256":"dd9776afadfb48a3093e012f437177a058fc8c07cd6f2650fc92d696306e3919"},"schema_version":"1.0"},"canonical_sha256":"67b193d1e35e538ff451cdc51175237f3618b5dfd1d53d7827c15594a7515bc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.458246Z","signature_b64":"Yb/ZlLXtU6rPB9O1N0c9uxoPweLyffO2nwF30fqdZQ7+V9zPFuNKwIZAYNy5AzBYbCcu2ksLypBGtZj1bhSnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b193d1e35e538ff451cdc51175237f3618b5dfd1d53d7827c15594a7515bc2","last_reissued_at":"2026-05-18T03:09:12.457536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.457536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12811","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:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SZwWf1z0gKxA6BMnYBbI0aPIeYsfVLplGJsM7JbK1qR9XYyIuZz8vDbzxTVk2WiPduejA9Pe40Oonm7cATIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:55.259292Z"},"content_sha256":"c93c816dd40e5e14e380a73e57b0860fd43742419309755cbe1fe36d59497193","schema_version":"1.0","event_id":"sha256:c93c816dd40e5e14e380a73e57b0860fd43742419309755cbe1fe36d59497193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:M6YZHUPDLZJY75CRZXCRC5JDP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The unbreakable quasi-graphic matroids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization.","cross_cats":[],"primary_cat":"math.CO","authors_text":"John David Clifton, Sayantani Bhattacharya, Zach Walsh","submitted_at":"2026-05-12T23:11:48Z","abstract_excerpt":"A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected unbreakable frame matroids. We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids. As a special case we obtain a characterization of the 3-connected lifted-graphic matroids."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The matroid is assumed to be 3-connected and quasi-graphic; the characterization relies on the prior structural theory of quasi-graphic matroids developed in the cited literature.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A complete characterization of the 3-connected unbreakable quasi-graphic matroids is provided, with the lifted-graphic case obtained as a corollary.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e397dab498151b2f7f6e161c23929ebae82cab15314b997528b467f9e44f5564"},"source":{"id":"2605.12811","kind":"arxiv","version":1},"verdict":{"id":"97537353-5899-4fdd-892a-9b64fc53c8cb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:44:13.331648Z","strongest_claim":"We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids.","one_line_summary":"A complete characterization of the 3-connected unbreakable quasi-graphic matroids is provided, with the lifted-graphic case obtained as a corollary.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The matroid is assumed to be 3-connected and quasi-graphic; the characterization relies on the prior structural theory of quasi-graphic matroids developed in the cited literature.","pith_extraction_headline":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization."},"references":{"count":15,"sample":[{"doi":"","year":2020,"title":"N. Bowler, D. Funk, and D. Slilaty. Describing quasi-graphic matroids.European J. Combin., 85:103062, 26, 2020","work_id":"dcd33aaa-a354-4d81-a277-5043ca3ff3b4","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Describing quasi-graphic matroids","work_id":"beb3d388-ec4d-4a10-9d17-793416c0ec9a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"R. Chen and J. Geelen. Infinitely many excluded minors for frame matroids and for lifted-graphic matroids.J. Combin. Theory Ser. B, 133:46–53, 2018","work_id":"b10cc09f-c283-4f8f-b60c-3d70d6f88ec8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"R. Chen and G. Whittle. On recognizing frame and lifted-graphic matroids.J. Graph Theory, 87(1):72–76, 2018","work_id":"766dd944-9797-4173-ab15-82f592724392","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"C. Cho, J. Oxley, and S. Wang. The symmetric strong circuit elimination property. Adv. in Appl. Math., 173(part A):Paper No. 102983, 2026","work_id":"5023718f-4a1e-41ff-894c-c1b6b02f21ac","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"7f372ee48e46aa2309636b2ac92b34bc18016970f16a46c573095af767dd9d7d","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":"97537353-5899-4fdd-892a-9b64fc53c8cb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xdyZTcfXT/PCuocHpdnRKftHuNuz8SyBHN7TzLBOy3ozIhjlDUWbxfiJ1U94pce+J0npKHoesVRdKTn+oKGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:55.260385Z"},"content_sha256":"60eb7d338a7ca9c11ca742c5b533841ca7fb19d80e34ca87d19f05c925f990d4","schema_version":"1.0","event_id":"sha256:60eb7d338a7ca9c11ca742c5b533841ca7fb19d80e34ca87d19f05c925f990d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/bundle.json","state_url":"https://pith.science/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/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-06-06T18:56:55Z","links":{"resolver":"https://pith.science/pith/M6YZHUPDLZJY75CRZXCRC5JDP4","bundle":"https://pith.science/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/bundle.json","state":"https://pith.science/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6YZHUPDLZJY75CRZXCRC5JDP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:M6YZHUPDLZJY75CRZXCRC5JDP4","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":"dd9776afadfb48a3093e012f437177a058fc8c07cd6f2650fc92d696306e3919","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:11:48Z","title_canon_sha256":"50c4627a55560581be6c191795d1f318ddab3580204d30577fdc762b39d3764c"},"schema_version":"1.0","source":{"id":"2605.12811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12811","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12811v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12811","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"M6YZHUPDLZJY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"M6YZHUPDLZJY75CR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"M6YZHUPD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:60eb7d338a7ca9c11ca742c5b533841ca7fb19d80e34ca87d19f05c925f990d4","target":"graph","created_at":"2026-05-18T03:09:12Z","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":"We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The matroid is assumed to be 3-connected and quasi-graphic; the characterization relies on the prior structural theory of quasi-graphic matroids developed in the cited literature."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A complete characterization of the 3-connected unbreakable quasi-graphic matroids is provided, with the lifted-graphic case obtained as a corollary."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization."}],"snapshot_sha256":"e397dab498151b2f7f6e161c23929ebae82cab15314b997528b467f9e44f5564"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected unbreakable frame matroids. We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids. As a special case we obtain a characterization of the 3-connected lifted-graphic matroids.","authors_text":"John David Clifton, Sayantani Bhattacharya, Zach Walsh","cross_cats":[],"headline":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:11:48Z","title":"The unbreakable quasi-graphic matroids"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"N. Bowler, D. Funk, and D. Slilaty. Describing quasi-graphic matroids.European J. Combin., 85:103062, 26, 2020","work_id":"dcd33aaa-a354-4d81-a277-5043ca3ff3b4","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Describing quasi-graphic matroids","work_id":"beb3d388-ec4d-4a10-9d17-793416c0ec9a","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"R. Chen and J. Geelen. Infinitely many excluded minors for frame matroids and for lifted-graphic matroids.J. Combin. Theory Ser. B, 133:46–53, 2018","work_id":"b10cc09f-c283-4f8f-b60c-3d70d6f88ec8","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"R. Chen and G. Whittle. On recognizing frame and lifted-graphic matroids.J. Graph Theory, 87(1):72–76, 2018","work_id":"766dd944-9797-4173-ab15-82f592724392","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"C. Cho, J. Oxley, and S. Wang. The symmetric strong circuit elimination property. Adv. in Appl. Math., 173(part A):Paper No. 102983, 2026","work_id":"5023718f-4a1e-41ff-894c-c1b6b02f21ac","year":2026}],"snapshot_sha256":"7f372ee48e46aa2309636b2ac92b34bc18016970f16a46c573095af767dd9d7d"},"source":{"id":"2605.12811","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:44:13.331648Z","id":"97537353-5899-4fdd-892a-9b64fc53c8cb","model_set":{"reader":"grok-4.3"},"one_line_summary":"A complete characterization of the 3-connected unbreakable quasi-graphic matroids is provided, with the lifted-graphic case obtained as a corollary.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"3-connected unbreakable quasi-graphic matroids receive a complete structural characterization.","strongest_claim":"We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids.","weakest_assumption":"The matroid is assumed to be 3-connected and quasi-graphic; the characterization relies on the prior structural theory of quasi-graphic matroids developed in the cited literature."}},"verdict_id":"97537353-5899-4fdd-892a-9b64fc53c8cb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c93c816dd40e5e14e380a73e57b0860fd43742419309755cbe1fe36d59497193","target":"record","created_at":"2026-05-18T03:09:12Z","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":"dd9776afadfb48a3093e012f437177a058fc8c07cd6f2650fc92d696306e3919","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:11:48Z","title_canon_sha256":"50c4627a55560581be6c191795d1f318ddab3580204d30577fdc762b39d3764c"},"schema_version":"1.0","source":{"id":"2605.12811","kind":"arxiv","version":1}},"canonical_sha256":"67b193d1e35e538ff451cdc51175237f3618b5dfd1d53d7827c15594a7515bc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67b193d1e35e538ff451cdc51175237f3618b5dfd1d53d7827c15594a7515bc2","first_computed_at":"2026-05-18T03:09:12.457536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.457536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yb/ZlLXtU6rPB9O1N0c9uxoPweLyffO2nwF30fqdZQ7+V9zPFuNKwIZAYNy5AzBYbCcu2ksLypBGtZj1bhSnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.458246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c93c816dd40e5e14e380a73e57b0860fd43742419309755cbe1fe36d59497193","sha256:60eb7d338a7ca9c11ca742c5b533841ca7fb19d80e34ca87d19f05c925f990d4"],"state_sha256":"8d36f3b417489e4f3d3a84bbd03706b1717a3d19c8d2a0e0a7cc610a9739173d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2jvIeGNVHFPNXAJavSgDekH8Ux61QF3K+oc57JgWqoD2JHqcJpxYe0Bgdz8MqbLZ4YgnWpOvB29AA3cAT6CBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:56:55.264920Z","bundle_sha256":"d3ca205d53b018a9003106429516719cfff0b0379b9b8cbb39597b29357f0169"}}