{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JGKVCK7JGI5ZCZMRX2EBW3RQ3K","short_pith_number":"pith:JGKVCK7J","schema_version":"1.0","canonical_sha256":"4995512be9323b916591be881b6e30da9f376f5865d1ef0a49c5190e92c025db","source":{"kind":"arxiv","id":"1709.04188","version":1},"attestation_state":"computed","paper":{"title":"Fractional matching preclusion number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Ruizhi Lin","submitted_at":"2017-09-13T08:40:52Z","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 "},"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":"1709.04188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T08:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"8763ef935732991099811c15f1b2f2e684b67eb58e13498d506b90119ebebe6b","abstract_canon_sha256":"4fa74d92219534d4df985ef50650202cc1c2d8337e2a2f6f3307028f05368c1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.165829Z","signature_b64":"+Z2z0u11SOhj2pX+Bh5P6dcm3OD1qb0OVCRCGzZPCq/aRR0VFVZ7l+QpCOfOFPt3FBh24FJG8RiLer0RVP22CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4995512be9323b916591be881b6e30da9f376f5865d1ef0a49c5190e92c025db","last_reissued_at":"2026-05-18T00:35:15.165256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.165256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional matching preclusion number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Ruizhi Lin","submitted_at":"2017-09-13T08:40:52Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04188","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1709.04188","created_at":"2026-05-18T00:35:15.165365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04188v1","created_at":"2026-05-18T00:35:15.165365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04188","created_at":"2026-05-18T00:35:15.165365+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGKVCK7JGI5Z","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGKVCK7JGI5ZCZMR","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGKVCK7J","created_at":"2026-05-18T12:31:24.725408+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/JGKVCK7JGI5ZCZMRX2EBW3RQ3K","json":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K.json","graph_json":"https://pith.science/api/pith-number/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/graph.json","events_json":"https://pith.science/api/pith-number/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/events.json","paper":"https://pith.science/paper/JGKVCK7J"},"agent_actions":{"view_html":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K","download_json":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K.json","view_paper":"https://pith.science/paper/JGKVCK7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04188&json=true","fetch_graph":"https://pith.science/api/pith-number/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/graph.json","fetch_events":"https://pith.science/api/pith-number/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/action/storage_attestation","attest_author":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/action/author_attestation","sign_citation":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/action/citation_signature","submit_replication":"https://pith.science/pith/JGKVCK7JGI5ZCZMRX2EBW3RQ3K/action/replication_record"}},"created_at":"2026-05-18T00:35:15.165365+00:00","updated_at":"2026-05-18T00:35:15.165365+00:00"}