{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D4VBOAA2JEF73C3DBZ4JW6FLKU","short_pith_number":"pith:D4VBOAA2","schema_version":"1.0","canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","source":{"kind":"arxiv","id":"2412.16465","version":2},"attestation_state":"computed","paper":{"title":"Wheel-like bricks and minimal matching covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue, Xiaoling He","submitted_at":"2024-12-21T03:42:44Z","abstract_excerpt":"A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a matching covered graph G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A 3-connected graph is a brick if the removal of any two distinct vertices, the left "},"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":"2412.16465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"f4b197101213b1540ce51158aff2c8d13de01dc94821f19b63cf72a38b38a3a7","abstract_canon_sha256":"27b689a561c64e39dfe014fa5dbc87e6834b282a6f326fea35a8e9297e21ea4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:17.428017Z","signature_b64":"X8jgNAFVZHHZJhJF/r5Y7MGZji+2SzK0OHhwvynZFj0KuP2/BqKt1vm5vuYM4gnVu4XTf4MRPL0zbATVdpalDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","last_reissued_at":"2026-07-05T11:13:17.427534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:17.427534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wheel-like bricks and minimal matching covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue, Xiaoling He","submitted_at":"2024-12-21T03:42:44Z","abstract_excerpt":"A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a matching covered graph G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A 3-connected graph is a brick if the removal of any two distinct vertices, the left "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.16465/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":"2412.16465","created_at":"2026-07-05T11:13:17.427588+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16465v2","created_at":"2026-07-05T11:13:17.427588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16465","created_at":"2026-07-05T11:13:17.427588+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4VBOAA2JEF7","created_at":"2026-07-05T11:13:17.427588+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4VBOAA2JEF73C3D","created_at":"2026-07-05T11:13:17.427588+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4VBOAA2","created_at":"2026-07-05T11:13:17.427588+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/D4VBOAA2JEF73C3DBZ4JW6FLKU","json":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU.json","graph_json":"https://pith.science/api/pith-number/D4VBOAA2JEF73C3DBZ4JW6FLKU/graph.json","events_json":"https://pith.science/api/pith-number/D4VBOAA2JEF73C3DBZ4JW6FLKU/events.json","paper":"https://pith.science/paper/D4VBOAA2"},"agent_actions":{"view_html":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU","download_json":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU.json","view_paper":"https://pith.science/paper/D4VBOAA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16465&json=true","fetch_graph":"https://pith.science/api/pith-number/D4VBOAA2JEF73C3DBZ4JW6FLKU/graph.json","fetch_events":"https://pith.science/api/pith-number/D4VBOAA2JEF73C3DBZ4JW6FLKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/action/storage_attestation","attest_author":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/action/author_attestation","sign_citation":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/action/citation_signature","submit_replication":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/action/replication_record"}},"created_at":"2026-07-05T11:13:17.427588+00:00","updated_at":"2026-07-05T11:13:17.427588+00:00"}