{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q3EUTPIW3DM64EB7RGWYJSDFJ5","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":"32a5837d37c02da0e6c98484bf6bf0c8c34a2a9bac90bcdf857d4c82ecface46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-23T02:13:47Z","title_canon_sha256":"a068b0d73bee24481987ce07ad46c0ca76a486d77d0a38b12f80c7773e5dc3db"},"schema_version":"1.0","source":{"id":"1609.07207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07207","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07207v1","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07207","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"pith_short_12","alias_value":"Q3EUTPIW3DM6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q3EUTPIW3DM64EB7","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q3EUTPIW","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:cf339915556d09a3e345058a9dd3ea9ead9038d0d223c64cfae7026e59b5388a","target":"graph","created_at":"2026-05-18T00:02:55Z","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":"A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of $n$ paths is called an $n$-grid graph. In this paper, we study the matching preclusion problems for $n$-grid graphs and obtain the following results. If an $n$-grid graph has an even order, then it has the matching preclusion number $n$, and every optimal matching preclusion set is trivial. If the $n$-grid graph has an odd order, then it has the matching preclusion number $n+1$, and all the optimal matching preclusion sets are chara","authors_text":"Heping Zhang, Hui Zhou, Qi Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-23T02:13:47Z","title":"Matching preclusion for $n$-grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07207","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:598f2b42fb49d9235b8ec20a6800c71e50b8d0b8d9137a649564c3cc536adc34","target":"record","created_at":"2026-05-18T00:02:55Z","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":"32a5837d37c02da0e6c98484bf6bf0c8c34a2a9bac90bcdf857d4c82ecface46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-23T02:13:47Z","title_canon_sha256":"a068b0d73bee24481987ce07ad46c0ca76a486d77d0a38b12f80c7773e5dc3db"},"schema_version":"1.0","source":{"id":"1609.07207","kind":"arxiv","version":1}},"canonical_sha256":"86c949bd16d8d9ee103f89ad84c8654f4fabd06721929a8bc23e296686efa112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86c949bd16d8d9ee103f89ad84c8654f4fabd06721929a8bc23e296686efa112","first_computed_at":"2026-05-18T00:02:55.314556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:55.314556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0a7zjxi8IJVG9kaoc5Bhan6toGSz62eXit2z5uFDjsI3l2vHyDiexZ7QoT0lARhmwM3o8sq6M8GkSJTASDcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:55.315273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:598f2b42fb49d9235b8ec20a6800c71e50b8d0b8d9137a649564c3cc536adc34","sha256:cf339915556d09a3e345058a9dd3ea9ead9038d0d223c64cfae7026e59b5388a"],"state_sha256":"52e461eecbd8cfc4d800ecd2c1793733548510de9c26f9b650bd882669c249fc"}