{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z6FGURR5M62CH3OUJTDEBN446D","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":"6ec718818872e2e7788d68614cc168a6213b8ebe3a82953f3b70be1304f856cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-30T15:14:12Z","title_canon_sha256":"a04079fe282050eebbef75121acd2157c3b83cb16e1fb3b28805ce29bcfbcb76"},"schema_version":"1.0","source":{"id":"1808.10443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10443","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10443v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10443","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z6FGURR5M62C","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z6FGURR5M62CH3OU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z6FGURR5","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:7d0c691047daaa11f3a83d4523d930bc574171d82b7fa42385a9a34daf9dfe32","target":"graph","created_at":"2026-05-18T00:06: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"},"paper":{"abstract_excerpt":"The \\emph{matching preclusion number} of a graph $G$, denoted by $\\mpo(G)$, is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we first give some sharp upper and lower bounds of matching preclusion number. Next, graphs with large and small matching preclusion number are characterized, respectively. In the end, we investigate some extremal problems and the Nordhaus-Gaddum-type relations on matching preclusion number.","authors_text":"Eddie Cheng, Jinyu Zou, Yaping Mao, Zhao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-30T15:14:12Z","title":"Matching preclusion number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10443","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:f9846cc64a90ff895aec86891cac7e66ca52db2053408e32251517da72c702ad","target":"record","created_at":"2026-05-18T00:06: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":"6ec718818872e2e7788d68614cc168a6213b8ebe3a82953f3b70be1304f856cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-30T15:14:12Z","title_canon_sha256":"a04079fe282050eebbef75121acd2157c3b83cb16e1fb3b28805ce29bcfbcb76"},"schema_version":"1.0","source":{"id":"1808.10443","kind":"arxiv","version":1}},"canonical_sha256":"cf8a6a463d67b423edd44cc640b79cf0e18346fcc3c675d58d80ca9e5a95a016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf8a6a463d67b423edd44cc640b79cf0e18346fcc3c675d58d80ca9e5a95a016","first_computed_at":"2026-05-18T00:06:45.624579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:45.624579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4gwTQuY3EzuZxZ4N/9pT2OJwCKlB8h3C2TbaxEJmHY/JzgjRwCs4PT3B2sGijdMSUjx5JS/rfcEaEAgHasZbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:45.625150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9846cc64a90ff895aec86891cac7e66ca52db2053408e32251517da72c702ad","sha256:7d0c691047daaa11f3a83d4523d930bc574171d82b7fa42385a9a34daf9dfe32"],"state_sha256":"0e86fa42b7c2d624d6c95f993185d9d31ecba4befa14696fbeed1254b2b49aeb"}