{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NODEOBXBVNCF2JGYKQ7DZKGEP3","short_pith_number":"pith:NODEOBXB","schema_version":"1.0","canonical_sha256":"6b864706e1ab445d24d8543e3ca8c47ef4b8d99eed898625fb0d04c9ec90f9b3","source":{"kind":"arxiv","id":"1604.05226","version":2},"attestation_state":"computed","paper":{"title":"A constructive characterisation of circuits in the simple $(2,1)$-sparse matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Nixon, Thomas A McCourt","submitted_at":"2016-04-18T16:09:40Z","abstract_excerpt":"A simple graph $G=(V,E)$ is a $(2,1)$-circuit if $|E|=2|V|$ and $|E(H)|\\leq 2|V(H)|-1$ for every proper subgraph $H$ of $G$. Motivated, in part, by ongoing work to understand unique realisations of graphs on surfaces, we derive a constructive characterisation of $(2,1)$-circuits. The characterisation uses the well known 1-extension and $X$-replacement operations as well as several summation moves to glue together $(2,1)$-circuits over small cutsets."},"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":"1604.05226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T16:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"482f5fb030deadbc2490f323816c70899b84e349459b340949fe6c90e8ae6941","abstract_canon_sha256":"232c468e4fb83748804e9bdac21fbaa1e3bbf154bd10cbabd7d1b4921324f55c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.869253Z","signature_b64":"A5BgacuFjwTbJ7gUQP4wBgZ57np5NOo9qYwad8U5K2NwTXqjR8Todf7lfzUpFO4/LMJPrrOCsuOatNHkgCD+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b864706e1ab445d24d8543e3ca8c47ef4b8d99eed898625fb0d04c9ec90f9b3","last_reissued_at":"2026-05-18T00:26:37.868459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.868459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constructive characterisation of circuits in the simple $(2,1)$-sparse matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Nixon, Thomas A McCourt","submitted_at":"2016-04-18T16:09:40Z","abstract_excerpt":"A simple graph $G=(V,E)$ is a $(2,1)$-circuit if $|E|=2|V|$ and $|E(H)|\\leq 2|V(H)|-1$ for every proper subgraph $H$ of $G$. Motivated, in part, by ongoing work to understand unique realisations of graphs on surfaces, we derive a constructive characterisation of $(2,1)$-circuits. The characterisation uses the well known 1-extension and $X$-replacement operations as well as several summation moves to glue together $(2,1)$-circuits over small cutsets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05226","kind":"arxiv","version":2},"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":"1604.05226","created_at":"2026-05-18T00:26:37.868587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05226v2","created_at":"2026-05-18T00:26:37.868587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05226","created_at":"2026-05-18T00:26:37.868587+00:00"},{"alias_kind":"pith_short_12","alias_value":"NODEOBXBVNCF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NODEOBXBVNCF2JGY","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NODEOBXB","created_at":"2026-05-18T12:30:32.724797+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/NODEOBXBVNCF2JGYKQ7DZKGEP3","json":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3.json","graph_json":"https://pith.science/api/pith-number/NODEOBXBVNCF2JGYKQ7DZKGEP3/graph.json","events_json":"https://pith.science/api/pith-number/NODEOBXBVNCF2JGYKQ7DZKGEP3/events.json","paper":"https://pith.science/paper/NODEOBXB"},"agent_actions":{"view_html":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3","download_json":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3.json","view_paper":"https://pith.science/paper/NODEOBXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05226&json=true","fetch_graph":"https://pith.science/api/pith-number/NODEOBXBVNCF2JGYKQ7DZKGEP3/graph.json","fetch_events":"https://pith.science/api/pith-number/NODEOBXBVNCF2JGYKQ7DZKGEP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3/action/storage_attestation","attest_author":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3/action/author_attestation","sign_citation":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3/action/citation_signature","submit_replication":"https://pith.science/pith/NODEOBXBVNCF2JGYKQ7DZKGEP3/action/replication_record"}},"created_at":"2026-05-18T00:26:37.868587+00:00","updated_at":"2026-05-18T00:26:37.868587+00:00"}