{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RWICOTMGZAL77I2JMBIEI2KCP6","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":"46052ad6a22046a38552a3df8ea0e7aa58e5adf10cc7bc92560f59f18ca0f4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-15T06:39:30Z","title_canon_sha256":"442ffc0f41dd96ab1ef1c6a6fe104e281d02c6e5d3c0ac10a986a1f0c6c3a13e"},"schema_version":"1.0","source":{"id":"1406.3796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3796","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3796v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3796","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"RWICOTMGZAL7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RWICOTMGZAL77I2J","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RWICOTMG","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:92d3ebc879036faebdd30eea0ec0c75659ac84ac4194871971d340c2e871b0bd","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"We define the anti-forcing number of a perfect matching $M$ of a graph $G$ as the minimal number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching $M$, denoted by $af(G,M)$. The anti-forcing number of a graph proposed by Vuki\\v{c}evi\\'{c} and Trinajsti\\'c in Kekul\\'e structures of molecular graphs is in fact the minimum anti-forcing number of perfect matchings. For plane bipartite graph $G$ with a perfect matching $M$, we obtain a minimax result: $af(G,M)$ equals the maximal number of $M$-alternating cycles of $G$ where any two either are disjoint or intersect","authors_text":"Heping Zhang, Hongchuan Lei, Yeong-Nan Yeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-15T06:39:30Z","title":"Anti-forcing numbers of perfect matchings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3796","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:74234ba9c33cc39ce366627767728a3c2ff01ad12f42d64d70560fed8badabc7","target":"record","created_at":"2026-05-18T02:49:39Z","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":"46052ad6a22046a38552a3df8ea0e7aa58e5adf10cc7bc92560f59f18ca0f4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-15T06:39:30Z","title_canon_sha256":"442ffc0f41dd96ab1ef1c6a6fe104e281d02c6e5d3c0ac10a986a1f0c6c3a13e"},"schema_version":"1.0","source":{"id":"1406.3796","kind":"arxiv","version":1}},"canonical_sha256":"8d90274d86c817ffa34960504469427fb807babdac66dc2e6c459fa188da44dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d90274d86c817ffa34960504469427fb807babdac66dc2e6c459fa188da44dd","first_computed_at":"2026-05-18T02:49:39.707668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.707668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wza3t+XmMB6a6YP3YboUrFRykGF8dnw5ijbUFM3+Nxp6hl/yrTAhDVZCn72Gtufl7ZXi3dM0kQ4/B/jrQkZbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.707990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74234ba9c33cc39ce366627767728a3c2ff01ad12f42d64d70560fed8badabc7","sha256:92d3ebc879036faebdd30eea0ec0c75659ac84ac4194871971d340c2e871b0bd"],"state_sha256":"4c8e690138c7301163f0910a9a9bdfaa0f843ebbf55eb34c249706ef895f4998"}