{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JCENWOXGRVV6GH4UWZ45Q4VZ7F","short_pith_number":"pith:JCENWOXG","schema_version":"1.0","canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","source":{"kind":"arxiv","id":"1704.08796","version":4},"attestation_state":"computed","paper":{"title":"Generating simple near-bipartite bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcelo H. de Carvalho, Nishad Kothari","submitted_at":"2017-04-28T03:23:33Z","abstract_excerpt":"A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\\alpha$ and $\\beta$ such that $G-\\{\\alpha,\\beta\\}$ is bipartite and matching covered; examples are $K_4$ and the triangular prism $\\overline{C_6}$. The significance of near-bipartite bricks arises from the theory of ear decompositions of matching covered graphs.\n  The object of this paper is to establish a generation procedure which is specific to the class of simple near-bipartite bricks. In particular, we "},"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":"1704.08796","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"27652a928bdd0a58ee7c6be621274b645ce694a5216136425beca7550c30f662","abstract_canon_sha256":"146190698a67d9d3fa347253c34c3541fbf4d51c95ae502bf25191e155555765"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:13.042904Z","signature_b64":"wFQSfWqqPInPAWY7aR8jxVVO47s4X+1E3jwAkLEZiSd0TAZ5Cq0VEv7jfQp2pB8ZRePS0WGbGp4+dLkUTwaSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","last_reissued_at":"2026-05-22T01:03:13.040107Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:13.040107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating simple near-bipartite bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcelo H. de Carvalho, Nishad Kothari","submitted_at":"2017-04-28T03:23:33Z","abstract_excerpt":"A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\\alpha$ and $\\beta$ such that $G-\\{\\alpha,\\beta\\}$ is bipartite and matching covered; examples are $K_4$ and the triangular prism $\\overline{C_6}$. The significance of near-bipartite bricks arises from the theory of ear decompositions of matching covered graphs.\n  The object of this paper is to establish a generation procedure which is specific to the class of simple near-bipartite bricks. In particular, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08796","kind":"arxiv","version":4},"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/1704.08796/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":"1704.08796","created_at":"2026-05-22T01:03:13.040218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08796v4","created_at":"2026-05-22T01:03:13.040218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08796","created_at":"2026-05-22T01:03:13.040218+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCENWOXGRVV6","created_at":"2026-05-22T01:03:13.040218+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCENWOXGRVV6GH4U","created_at":"2026-05-22T01:03:13.040218+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCENWOXG","created_at":"2026-05-22T01:03:13.040218+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/JCENWOXGRVV6GH4UWZ45Q4VZ7F","json":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F.json","graph_json":"https://pith.science/api/pith-number/JCENWOXGRVV6GH4UWZ45Q4VZ7F/graph.json","events_json":"https://pith.science/api/pith-number/JCENWOXGRVV6GH4UWZ45Q4VZ7F/events.json","paper":"https://pith.science/paper/JCENWOXG"},"agent_actions":{"view_html":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F","download_json":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F.json","view_paper":"https://pith.science/paper/JCENWOXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08796&json=true","fetch_graph":"https://pith.science/api/pith-number/JCENWOXGRVV6GH4UWZ45Q4VZ7F/graph.json","fetch_events":"https://pith.science/api/pith-number/JCENWOXGRVV6GH4UWZ45Q4VZ7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/action/storage_attestation","attest_author":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/action/author_attestation","sign_citation":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/action/citation_signature","submit_replication":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/action/replication_record"}},"created_at":"2026-05-22T01:03:13.040218+00:00","updated_at":"2026-05-22T01:03:13.040218+00:00"}