{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RWICOTMGZAL77I2JMBIEI2KCP6","short_pith_number":"pith:RWICOTMG","schema_version":"1.0","canonical_sha256":"8d90274d86c817ffa34960504469427fb807babdac66dc2e6c459fa188da44dd","source":{"kind":"arxiv","id":"1406.3796","version":1},"attestation_state":"computed","paper":{"title":"Anti-forcing numbers of perfect matchings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Hongchuan Lei, Yeong-Nan Yeh","submitted_at":"2014-06-15T06:39:30Z","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"},"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":"1406.3796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-15T06:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"442ffc0f41dd96ab1ef1c6a6fe104e281d02c6e5d3c0ac10a986a1f0c6c3a13e","abstract_canon_sha256":"46052ad6a22046a38552a3df8ea0e7aa58e5adf10cc7bc92560f59f18ca0f4f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.707990Z","signature_b64":"Wza3t+XmMB6a6YP3YboUrFRykGF8dnw5ijbUFM3+Nxp6hl/yrTAhDVZCn72Gtufl7ZXi3dM0kQ4/B/jrQkZbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d90274d86c817ffa34960504469427fb807babdac66dc2e6c459fa188da44dd","last_reissued_at":"2026-05-18T02:49:39.707668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.707668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anti-forcing numbers of perfect matchings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Hongchuan Lei, Yeong-Nan Yeh","submitted_at":"2014-06-15T06:39:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3796","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":"1406.3796","created_at":"2026-05-18T02:49:39.707720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3796v1","created_at":"2026-05-18T02:49:39.707720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3796","created_at":"2026-05-18T02:49:39.707720+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWICOTMGZAL7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWICOTMGZAL77I2J","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWICOTMG","created_at":"2026-05-18T12:28:46.137349+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/RWICOTMGZAL77I2JMBIEI2KCP6","json":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6.json","graph_json":"https://pith.science/api/pith-number/RWICOTMGZAL77I2JMBIEI2KCP6/graph.json","events_json":"https://pith.science/api/pith-number/RWICOTMGZAL77I2JMBIEI2KCP6/events.json","paper":"https://pith.science/paper/RWICOTMG"},"agent_actions":{"view_html":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6","download_json":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6.json","view_paper":"https://pith.science/paper/RWICOTMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3796&json=true","fetch_graph":"https://pith.science/api/pith-number/RWICOTMGZAL77I2JMBIEI2KCP6/graph.json","fetch_events":"https://pith.science/api/pith-number/RWICOTMGZAL77I2JMBIEI2KCP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6/action/storage_attestation","attest_author":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6/action/author_attestation","sign_citation":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6/action/citation_signature","submit_replication":"https://pith.science/pith/RWICOTMGZAL77I2JMBIEI2KCP6/action/replication_record"}},"created_at":"2026-05-18T02:49:39.707720+00:00","updated_at":"2026-05-18T02:49:39.707720+00:00"}