{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4RFWRJEUSNZHTO2QH47A34BRXK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"967fb50b0fb0081440805429a2cd97ec2233910c6be06bf3ef8395db5365bb6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-27T10:48:47Z","title_canon_sha256":"abcbed20b8c5dbb7478191123580db66ef343ce715ae9d0db6cd1ceacb08570a"},"schema_version":"1.0","source":{"id":"2405.17040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.17040","created_at":"2026-07-05T08:23:39Z"},{"alias_kind":"arxiv_version","alias_value":"2405.17040v1","created_at":"2026-07-05T08:23:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17040","created_at":"2026-07-05T08:23:39Z"},{"alias_kind":"pith_short_12","alias_value":"4RFWRJEUSNZH","created_at":"2026-07-05T08:23:39Z"},{"alias_kind":"pith_short_16","alias_value":"4RFWRJEUSNZHTO2Q","created_at":"2026-07-05T08:23:39Z"},{"alias_kind":"pith_short_8","alias_value":"4RFWRJEU","created_at":"2026-07-05T08:23:39Z"}],"graph_snapshots":[{"event_id":"sha256:b902b801f6cdc626d5cd5ddb53e1c29f1cac789b75cd2c07cce62ba9f249c7b0","target":"graph","created_at":"2026-07-05T08:23:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.17040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A matching covered graph $G$ is minimal if for each edge $e$ of $G$, $G-e$ is not matching covered. An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Thus a matching covered graph is minimal if and only if it is free of removable edges. For bipartite graphs, Lov\\'{a}sz and Plummer gave a characterization of bipartite minimal matching covered graphs. For bricks, Lov\\'{a}sz showed that the only bricks that are minimal matching covered are $K_4$ and $\\overline{C_6}$. In this paper, we present a complete characterization of minimal matching covered graphs ","authors_text":"C.T. Ng, Jinjiang Yuan, T.C.E. Cheng, Xiumei Wang, Yipei Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-27T10:48:47Z","title":"Claw-free minimal matching covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17040","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b68b05c0a1fd5bf47c12d80b54c4875fa4fec6fe921b5d6681a2be8b1934084c","target":"record","created_at":"2026-07-05T08:23:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"967fb50b0fb0081440805429a2cd97ec2233910c6be06bf3ef8395db5365bb6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-27T10:48:47Z","title_canon_sha256":"abcbed20b8c5dbb7478191123580db66ef343ce715ae9d0db6cd1ceacb08570a"},"schema_version":"1.0","source":{"id":"2405.17040","kind":"arxiv","version":1}},"canonical_sha256":"e44b68a494937279bb503f3e0df031ba908248a6277b5a112e6dbfc0ab8c8566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e44b68a494937279bb503f3e0df031ba908248a6277b5a112e6dbfc0ab8c8566","first_computed_at":"2026-07-05T08:23:39.193902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:23:39.193902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLluQF1z0wQQcaqh8vHSZj6TWL3oaPNEwx4trfpnmrxetANOHO5yplq9RCo/h8OB0hXyLDoskH/zRqdqbst9Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:23:39.194354Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.17040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b68b05c0a1fd5bf47c12d80b54c4875fa4fec6fe921b5d6681a2be8b1934084c","sha256:b902b801f6cdc626d5cd5ddb53e1c29f1cac789b75cd2c07cce62ba9f249c7b0"],"state_sha256":"83baf848d79177b546980bfa1c3b293c735c876ee1043ba3eeab5e0d75cecdc7"}