{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JGKVCK7JGI5ZCZMRX2EBW3RQ3K","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":"4fa74d92219534d4df985ef50650202cc1c2d8337e2a2f6f3307028f05368c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T08:40:52Z","title_canon_sha256":"8763ef935732991099811c15f1b2f2e684b67eb58e13498d506b90119ebebe6b"},"schema_version":"1.0","source":{"id":"1709.04188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04188","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04188v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04188","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"JGKVCK7JGI5Z","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JGKVCK7JGI5ZCZMR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JGKVCK7J","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:0b127a319276e478f8ac333e30bb6316a766a93785398d3d738166dc4f4bb6c9","target":"graph","created_at":"2026-05-18T00:35:15Z","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":"Let $G$ be a graph with an even number of vertices. The matching preclusion number of $G$, denoted by $mp(G)$, is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. We introduced a $0$-$1$ linear programming which can be used to find matching preclusion number of graphs. In this paper, by relaxing of the $0$-$1$ linear programming we obtain a linear programming and call its optimal objective value as fractional matching preclusion number of graph $G$, denoted by $mp_f(G)$. We show $mp_f(G)$ can be computed in polynomial time for any graph $G$. By ","authors_text":"Heping Zhang, Ruizhi Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T08:40:52Z","title":"Fractional matching preclusion number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04188","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:37494c45ee8aaa5babc72d0a0e10223980aa1d2c7ce0f59d14743754d0207036","target":"record","created_at":"2026-05-18T00:35:15Z","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":"4fa74d92219534d4df985ef50650202cc1c2d8337e2a2f6f3307028f05368c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T08:40:52Z","title_canon_sha256":"8763ef935732991099811c15f1b2f2e684b67eb58e13498d506b90119ebebe6b"},"schema_version":"1.0","source":{"id":"1709.04188","kind":"arxiv","version":1}},"canonical_sha256":"4995512be9323b916591be881b6e30da9f376f5865d1ef0a49c5190e92c025db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4995512be9323b916591be881b6e30da9f376f5865d1ef0a49c5190e92c025db","first_computed_at":"2026-05-18T00:35:15.165256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:15.165256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Z2z0u11SOhj2pX+Bh5P6dcm3OD1qb0OVCRCGzZPCq/aRR0VFVZ7l+QpCOfOFPt3FBh24FJG8RiLer0RVP22CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:15.165829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37494c45ee8aaa5babc72d0a0e10223980aa1d2c7ce0f59d14743754d0207036","sha256:0b127a319276e478f8ac333e30bb6316a766a93785398d3d738166dc4f4bb6c9"],"state_sha256":"5849d2ff4c51cd34a85e64a4198a995ee1a9584f5983241f9851d586bdf04c20"}