{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5IRSVADHSK5RJJLIF6TFBSOXJ7","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":"e22d14e3433ee2341d27813f43fef3e332ac6422de72baefff1f9622af2f9acb","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T16:47:42Z","title_canon_sha256":"d2b6a37d2172b6699406a8d189fd78e225bff67c00bc9071db71f7e0b2e0a4a4"},"schema_version":"1.0","source":{"id":"2404.06445","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06445","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06445v3","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06445","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"5IRSVADHSK5R","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"5IRSVADHSK5RJJLI","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"5IRSVADH","created_at":"2026-05-21T02:04:45Z"}],"graph_snapshots":[{"event_id":"sha256:5d284908f4abe824c511f4a413d787c067a4713bd8ab0501a5b9129423835f7b","target":"graph","created_at":"2026-05-21T02:04:45Z","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/2404.06445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipartite matching covered graphs due to Hetyei. From the results and proofs of Lov\\'asz and Plummer, that rely on Hetyei's theorem, one may deduce that any minimal bipartite matching covered graph has at least $2(m-n+2)$ vertices of degree two (where minimal means that deleting any edge results in a graph that is not matching covered); such a graph is said to be extremal if it attains the stated lower bound.\n  In this pa","authors_text":"Ajit A. Diwan, Amit Kumar Mallik, Nishad Kothari","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T16:47:42Z","title":"Extremal minimal bipartite matching covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06445","kind":"arxiv","version":3},"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:c86d312274e56df589479f5f14ba9069cb7e43cf88025c2d0cbdd810185f1650","target":"record","created_at":"2026-05-21T02:04:45Z","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":"e22d14e3433ee2341d27813f43fef3e332ac6422de72baefff1f9622af2f9acb","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T16:47:42Z","title_canon_sha256":"d2b6a37d2172b6699406a8d189fd78e225bff67c00bc9071db71f7e0b2e0a4a4"},"schema_version":"1.0","source":{"id":"2404.06445","kind":"arxiv","version":3}},"canonical_sha256":"ea232a806792bb14a5682fa650c9d74fe6f33a2d4278aa6ab3a8bed9ee023836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea232a806792bb14a5682fa650c9d74fe6f33a2d4278aa6ab3a8bed9ee023836","first_computed_at":"2026-05-21T02:04:45.519586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T02:04:45.519586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a9D0+wddJmCAlvwsgo86fX9IMWvfl4ggrqZvWs4YU1j1v9Y98qdSbb/RCy0huORAdxHuPnJnJHoRMOaks2cSDA==","signature_status":"signed_v1","signed_at":"2026-05-21T02:04:45.520521Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06445","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c86d312274e56df589479f5f14ba9069cb7e43cf88025c2d0cbdd810185f1650","sha256:5d284908f4abe824c511f4a413d787c067a4713bd8ab0501a5b9129423835f7b"],"state_sha256":"9549d144eee8651fc057a6a561d6b66eae953cb9d702e95646acc94b9b2f4e8f"}