{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P2GX7MHENO5DNHYGDEN4E7BCOO","short_pith_number":"pith:P2GX7MHE","canonical_record":{"source":{"id":"2606.06852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T02:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"268f2c4abcdd1b54338742616a0f1ce6939c415029e002089339d352fe0bc3e9","abstract_canon_sha256":"4a114201140dba7e6f55ad9e4ee07c61e6d6d4a56a18fc24db8bdff5894195e7"},"schema_version":"1.0"},"canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","source":{"kind":"arxiv","id":"2606.06852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06852","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06852v1","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06852","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"P2GX7MHENO5D","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"P2GX7MHENO5DNHYG","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"P2GX7MHE","created_at":"2026-06-08T01:04:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P2GX7MHENO5DNHYGDEN4E7BCOO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.06852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T02:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"268f2c4abcdd1b54338742616a0f1ce6939c415029e002089339d352fe0bc3e9","abstract_canon_sha256":"4a114201140dba7e6f55ad9e4ee07c61e6d6d4a56a18fc24db8bdff5894195e7"},"schema_version":"1.0"},"canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:31.810951Z","signature_b64":"B5Juop/dVfY9w2LbjPtfsKZAPYZvUQuxk5EwHw+b126Kx2QWkWva+VsMR8MHF+CzavXXaoJHLcO1YBHJcXycCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","last_reissued_at":"2026-06-08T01:04:31.810147Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:31.810147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.06852","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-06-08T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1vn/46SoRqth92Z7tfw/XjOnIvJGihm5EhlA8TKClI4/RM5LPh9sc9EtjbZIPm6ZKd5N2yce0tSnl2Zq8GnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:45:44.006421Z"},"content_sha256":"83c25b92247132e6073314e037c7546bd0b3bda23ad122100edea868e119385c","schema_version":"1.0","event_id":"sha256:83c25b92247132e6073314e037c7546bd0b3bda23ad122100edea868e119385c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P2GX7MHENO5DNHYGDEN4E7BCOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The connected binary matroids with a pair of elements in no non-spanning circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jagdeep Singh, James Oxley, Wayne Ge","submitted_at":"2026-06-05T02:52:19Z","abstract_excerpt":"Let $M$ be a simple connected binary matroid, and let $e$ and $f$ be distinct elements of $M$. It is well known that, when the only circuits containing $e$ are spanning, $M$ is a circuit with at least three elements. This paper proves that if every circuit containing $\\{e,f\\}$ is spanning, then the canonical tree decomposition of $M$ is a path in which each vertex is labeled by a circuit, a copy of $U_{1,3}$, or a binary spike having one non-tip element deleted."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06852","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/2606.06852/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-06-08T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvrMm53vHLIwV8jHvcEMce9GgzkHNH/fA8h8hnQlR2at8O24CqQul/AdA7oRWn/FhoZfZKk0+wd+S5RwwzALAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:45:44.006801Z"},"content_sha256":"60c8b06bf08be0035d20e4d4faf63c1abb048067bf8fc0c4d66b3dcb7e353341","schema_version":"1.0","event_id":"sha256:60c8b06bf08be0035d20e4d4faf63c1abb048067bf8fc0c4d66b3dcb7e353341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/bundle.json","state_url":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/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-23T00:45:44Z","links":{"resolver":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO","bundle":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/bundle.json","state":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P2GX7MHENO5DNHYGDEN4E7BCOO","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":"4a114201140dba7e6f55ad9e4ee07c61e6d6d4a56a18fc24db8bdff5894195e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T02:52:19Z","title_canon_sha256":"268f2c4abcdd1b54338742616a0f1ce6939c415029e002089339d352fe0bc3e9"},"schema_version":"1.0","source":{"id":"2606.06852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06852","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06852v1","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06852","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"P2GX7MHENO5D","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"P2GX7MHENO5DNHYG","created_at":"2026-06-08T01:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"P2GX7MHE","created_at":"2026-06-08T01:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:60c8b06bf08be0035d20e4d4faf63c1abb048067bf8fc0c4d66b3dcb7e353341","target":"graph","created_at":"2026-06-08T01:04:31Z","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/2606.06852/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $M$ be a simple connected binary matroid, and let $e$ and $f$ be distinct elements of $M$. It is well known that, when the only circuits containing $e$ are spanning, $M$ is a circuit with at least three elements. This paper proves that if every circuit containing $\\{e,f\\}$ is spanning, then the canonical tree decomposition of $M$ is a path in which each vertex is labeled by a circuit, a copy of $U_{1,3}$, or a binary spike having one non-tip element deleted.","authors_text":"Jagdeep Singh, James Oxley, Wayne Ge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T02:52:19Z","title":"The connected binary matroids with a pair of elements in no non-spanning circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06852","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:83c25b92247132e6073314e037c7546bd0b3bda23ad122100edea868e119385c","target":"record","created_at":"2026-06-08T01:04:31Z","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":"4a114201140dba7e6f55ad9e4ee07c61e6d6d4a56a18fc24db8bdff5894195e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T02:52:19Z","title_canon_sha256":"268f2c4abcdd1b54338742616a0f1ce6939c415029e002089339d352fe0bc3e9"},"schema_version":"1.0","source":{"id":"2606.06852","kind":"arxiv","version":1}},"canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","first_computed_at":"2026-06-08T01:04:31.810147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:31.810147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5Juop/dVfY9w2LbjPtfsKZAPYZvUQuxk5EwHw+b126Kx2QWkWva+VsMR8MHF+CzavXXaoJHLcO1YBHJcXycCA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:31.810951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83c25b92247132e6073314e037c7546bd0b3bda23ad122100edea868e119385c","sha256:60c8b06bf08be0035d20e4d4faf63c1abb048067bf8fc0c4d66b3dcb7e353341"],"state_sha256":"ffb28e0185229c3aacfc43b1365b61d63b6762444ed24decbe672e646465ec47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1qLKHryl70r8zHLdkgG3XcKkvKGe0jEaQenP+zx3+tGIc9ZdKfTYoMpsgjBXAUqOp2BPzMLURvGEF2fACx+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:45:44.008753Z","bundle_sha256":"8873e98f1d23d60b6b74a76832a05380b85b044f7277ec8baa52af173daa2dd6"}}