{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CZ3I2NGRMFS3ILTCABXDIVYLET","short_pith_number":"pith:CZ3I2NGR","schema_version":"1.0","canonical_sha256":"16768d34d16165b42e62006e34570b24ffaa7ee570a814fccc9237eff301ac57","source":{"kind":"arxiv","id":"1706.08027","version":1},"attestation_state":"computed","paper":{"title":"A splitter theorem for 3-connected 2-polymatroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Semple, Geoff Whittle, James Oxley","submitted_at":"2017-06-25T02:49:51Z","abstract_excerpt":"Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets of points and lines in a projective space and sets of edges in a graph. A series compression in such a structure is an analogue of contracting an edge of a graph that is in a series pair. A $2$-polymatroid $N$ is an s-minor of a $2$-polymatroid $M$ if $N$ can be obtained from $M$ by a sequence of contractions, series compressions, and dual-contractions, where"},"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":"1706.08027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-25T02:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"d072f59d726ff96709856960f002502d5325444edc8837753cff6b167b6f35bc","abstract_canon_sha256":"942c232a743813d2f0643d8326e299bf1210f3091b571073f4ecbea8c5b426bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:43.827106Z","signature_b64":"0wLIcSyAR6XsIukFh0OVaz3xrkPc6oysfU5XAjrQHnrJVyhEiV9VrI70ONFIcviZE5yl8FSifvaej2sGdoFNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16768d34d16165b42e62006e34570b24ffaa7ee570a814fccc9237eff301ac57","last_reissued_at":"2026-05-18T00:41:43.826512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:43.826512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A splitter theorem for 3-connected 2-polymatroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Semple, Geoff Whittle, James Oxley","submitted_at":"2017-06-25T02:49:51Z","abstract_excerpt":"Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets of points and lines in a projective space and sets of edges in a graph. A series compression in such a structure is an analogue of contracting an edge of a graph that is in a series pair. A $2$-polymatroid $N$ is an s-minor of a $2$-polymatroid $M$ if $N$ can be obtained from $M$ by a sequence of contractions, series compressions, and dual-contractions, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08027","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":""},"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":"1706.08027","created_at":"2026-05-18T00:41:43.826601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08027v1","created_at":"2026-05-18T00:41:43.826601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08027","created_at":"2026-05-18T00:41:43.826601+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ3I2NGRMFS3","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ3I2NGRMFS3ILTC","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ3I2NGR","created_at":"2026-05-18T12:31:10.602751+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/CZ3I2NGRMFS3ILTCABXDIVYLET","json":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET.json","graph_json":"https://pith.science/api/pith-number/CZ3I2NGRMFS3ILTCABXDIVYLET/graph.json","events_json":"https://pith.science/api/pith-number/CZ3I2NGRMFS3ILTCABXDIVYLET/events.json","paper":"https://pith.science/paper/CZ3I2NGR"},"agent_actions":{"view_html":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET","download_json":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET.json","view_paper":"https://pith.science/paper/CZ3I2NGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08027&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ3I2NGRMFS3ILTCABXDIVYLET/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ3I2NGRMFS3ILTCABXDIVYLET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET/action/storage_attestation","attest_author":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET/action/author_attestation","sign_citation":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET/action/citation_signature","submit_replication":"https://pith.science/pith/CZ3I2NGRMFS3ILTCABXDIVYLET/action/replication_record"}},"created_at":"2026-05-18T00:41:43.826601+00:00","updated_at":"2026-05-18T00:41:43.826601+00:00"}