{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:P2GX7MHENO5DNHYGDEN4E7BCOO","short_pith_number":"pith:P2GX7MHE","schema_version":"1.0","canonical_sha256":"7e8d7fb0e46bba369f06191bc27c2273aa1da5515110c47a422f0a69affff0d4","source":{"kind":"arxiv","id":"2606.06852","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.06852","created_at":"2026-06-08T01:04:31.810287+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06852v1","created_at":"2026-06-08T01:04:31.810287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06852","created_at":"2026-06-08T01:04:31.810287+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2GX7MHENO5D","created_at":"2026-06-08T01:04:31.810287+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2GX7MHENO5DNHYG","created_at":"2026-06-08T01:04:31.810287+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2GX7MHE","created_at":"2026-06-08T01:04:31.810287+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO","json":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO.json","graph_json":"https://pith.science/api/pith-number/P2GX7MHENO5DNHYGDEN4E7BCOO/graph.json","events_json":"https://pith.science/api/pith-number/P2GX7MHENO5DNHYGDEN4E7BCOO/events.json","paper":"https://pith.science/paper/P2GX7MHE"},"agent_actions":{"view_html":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO","download_json":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO.json","view_paper":"https://pith.science/paper/P2GX7MHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06852&json=true","fetch_graph":"https://pith.science/api/pith-number/P2GX7MHENO5DNHYGDEN4E7BCOO/graph.json","fetch_events":"https://pith.science/api/pith-number/P2GX7MHENO5DNHYGDEN4E7BCOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/action/storage_attestation","attest_author":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/action/author_attestation","sign_citation":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/action/citation_signature","submit_replication":"https://pith.science/pith/P2GX7MHENO5DNHYGDEN4E7BCOO/action/replication_record"}},"created_at":"2026-06-08T01:04:31.810287+00:00","updated_at":"2026-06-08T01:04:31.810287+00:00"}