{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KMLGH5TET4BD6IMTPZQO3USCE3","short_pith_number":"pith:KMLGH5TE","schema_version":"1.0","canonical_sha256":"531663f6649f023f21937e60edd24226e738ebbb26ea1c99eace3d7d7494d4a4","source":{"kind":"arxiv","id":"1502.01442","version":1},"attestation_state":"computed","paper":{"title":"Matching preclusion for vertex-transitive networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Jinghua He, Qiuli Li","submitted_at":"2015-02-05T07:05:35Z","abstract_excerpt":"In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those induced by a single vertex. In this paper, we obtain general results of vertex-transitive graphs including many known networks. A $k$-regular connected vertex-transitive graph has matching preclusio"},"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":"1502.01442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-05T07:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"5f583646c34102823c6b9a3b49921efd57f9246182fa19392839221fcc9dbef0","abstract_canon_sha256":"fc0870ff6e989c37d1f68615c6b1ff418c8cac29fc5eeb5075261df278512e32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:52.045512Z","signature_b64":"IKn/xFo0slhALuXMosSBxDAPeJCUyH2wsN4wc65v8JYEIGBAxsqf0VzWrGw7TQpdkPPahP4RivISpisk4+xHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"531663f6649f023f21937e60edd24226e738ebbb26ea1c99eace3d7d7494d4a4","last_reissued_at":"2026-05-18T02:27:52.044893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:52.044893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching preclusion for vertex-transitive networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Jinghua He, Qiuli Li","submitted_at":"2015-02-05T07:05:35Z","abstract_excerpt":"In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those induced by a single vertex. In this paper, we obtain general results of vertex-transitive graphs including many known networks. A $k$-regular connected vertex-transitive graph has matching preclusio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01442","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":"1502.01442","created_at":"2026-05-18T02:27:52.044975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01442v1","created_at":"2026-05-18T02:27:52.044975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01442","created_at":"2026-05-18T02:27:52.044975+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMLGH5TET4BD","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMLGH5TET4BD6IMT","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMLGH5TE","created_at":"2026-05-18T12:29:29.992203+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/KMLGH5TET4BD6IMTPZQO3USCE3","json":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3.json","graph_json":"https://pith.science/api/pith-number/KMLGH5TET4BD6IMTPZQO3USCE3/graph.json","events_json":"https://pith.science/api/pith-number/KMLGH5TET4BD6IMTPZQO3USCE3/events.json","paper":"https://pith.science/paper/KMLGH5TE"},"agent_actions":{"view_html":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3","download_json":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3.json","view_paper":"https://pith.science/paper/KMLGH5TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01442&json=true","fetch_graph":"https://pith.science/api/pith-number/KMLGH5TET4BD6IMTPZQO3USCE3/graph.json","fetch_events":"https://pith.science/api/pith-number/KMLGH5TET4BD6IMTPZQO3USCE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3/action/storage_attestation","attest_author":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3/action/author_attestation","sign_citation":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3/action/citation_signature","submit_replication":"https://pith.science/pith/KMLGH5TET4BD6IMTPZQO3USCE3/action/replication_record"}},"created_at":"2026-05-18T02:27:52.044975+00:00","updated_at":"2026-05-18T02:27:52.044975+00:00"}