{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QPUGCT6FXMR63DPSD6M2M6EDUK","short_pith_number":"pith:QPUGCT6F","schema_version":"1.0","canonical_sha256":"83e8614fc5bb23ed8df21f99a67883a28e964623fd31bdea42581881f0349879","source":{"kind":"arxiv","id":"0905.3252","version":3},"attestation_state":"computed","paper":{"title":"An obstacle to a decomposition theorem for near-regular matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam","submitted_at":"2009-05-20T09:14:16Z","abstract_excerpt":"Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obtained from matroids that belong to a few basic classes through k-sums. Also suppose that these basic classes are such that, whenever a class contains all graphic matroids, it does not contain all cographi"},"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":"0905.3252","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-20T09:14:16Z","cross_cats_sorted":[],"title_canon_sha256":"e489163aeaf6933100b0380907e75696daef65f05282ded7cdacb3dcc7eb2c2d","abstract_canon_sha256":"fcbdf63c4345e226b868de3beb007a1d20fe8f78b1aba6cc0e711c2c3aec88f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:55.695854Z","signature_b64":"eiCtw86sRIFIQKqUP8u3L+BGikEhtHfhmLOeCNPbnflcAUfL0f+bNEUP/dkfNQoaRTJAsNAaaJwJzbqV3uTuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83e8614fc5bb23ed8df21f99a67883a28e964623fd31bdea42581881f0349879","last_reissued_at":"2026-05-18T02:24:55.695024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:55.695024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An obstacle to a decomposition theorem for near-regular matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam","submitted_at":"2009-05-20T09:14:16Z","abstract_excerpt":"Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obtained from matroids that belong to a few basic classes through k-sums. Also suppose that these basic classes are such that, whenever a class contains all graphic matroids, it does not contain all cographi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3252","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"0905.3252","created_at":"2026-05-18T02:24:55.695156+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.3252v3","created_at":"2026-05-18T02:24:55.695156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3252","created_at":"2026-05-18T02:24:55.695156+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPUGCT6FXMR6","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPUGCT6FXMR63DPS","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPUGCT6F","created_at":"2026-05-18T12:26:01.383474+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/QPUGCT6FXMR63DPSD6M2M6EDUK","json":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK.json","graph_json":"https://pith.science/api/pith-number/QPUGCT6FXMR63DPSD6M2M6EDUK/graph.json","events_json":"https://pith.science/api/pith-number/QPUGCT6FXMR63DPSD6M2M6EDUK/events.json","paper":"https://pith.science/paper/QPUGCT6F"},"agent_actions":{"view_html":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK","download_json":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK.json","view_paper":"https://pith.science/paper/QPUGCT6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.3252&json=true","fetch_graph":"https://pith.science/api/pith-number/QPUGCT6FXMR63DPSD6M2M6EDUK/graph.json","fetch_events":"https://pith.science/api/pith-number/QPUGCT6FXMR63DPSD6M2M6EDUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK/action/storage_attestation","attest_author":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK/action/author_attestation","sign_citation":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK/action/citation_signature","submit_replication":"https://pith.science/pith/QPUGCT6FXMR63DPSD6M2M6EDUK/action/replication_record"}},"created_at":"2026-05-18T02:24:55.695156+00:00","updated_at":"2026-05-18T02:24:55.695156+00:00"}