{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H542N23IJWC6QPWWAPDM7VSPKJ","short_pith_number":"pith:H542N23I","schema_version":"1.0","canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","source":{"kind":"arxiv","id":"1503.01900","version":1},"attestation_state":"computed","paper":{"title":"On the anti-forcing number of fullerene graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Qin Yang, Yuqing Lin","submitted_at":"2015-03-06T10:30:16Z","abstract_excerpt":"The anti-forcing number of a connected graph $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the anti-forcing number of every fullerene has at least four. We give a procedure to construct all fullerenes whose anti-forcing numbers achieve the lower bound four. Furthermore, we show that, for every even $n\\geq20$ ($n\\neq22,26$), there exists a fullerene with $n$ vertices that has the anti-forcing number four, and the fullerene with 26 vertices has the anti-forcing number five."},"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":"1503.01900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-06T10:30:16Z","cross_cats_sorted":[],"title_canon_sha256":"c283f21fc0a8cd543a5d93d1dfd0e2758ab2ad20a611b8191edfae1da686ac9e","abstract_canon_sha256":"2ff101537a9f01eb4ae875917e2797655d34235cffbfb0cba4d076fa059fc435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.316923Z","signature_b64":"injlaFLXpDWUaKdz4sErsKXN1xtlQRBiWbso2bXdNBZFbspRMqoXzN37M4/B6NtOCJCTUoJzOQhHKYoVBsiLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","last_reissued_at":"2026-05-18T02:25:27.316540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.316540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the anti-forcing number of fullerene graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Qin Yang, Yuqing Lin","submitted_at":"2015-03-06T10:30:16Z","abstract_excerpt":"The anti-forcing number of a connected graph $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the anti-forcing number of every fullerene has at least four. We give a procedure to construct all fullerenes whose anti-forcing numbers achieve the lower bound four. Furthermore, we show that, for every even $n\\geq20$ ($n\\neq22,26$), there exists a fullerene with $n$ vertices that has the anti-forcing number four, and the fullerene with 26 vertices has the anti-forcing number five."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01900","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":"1503.01900","created_at":"2026-05-18T02:25:27.316594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01900v1","created_at":"2026-05-18T02:25:27.316594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01900","created_at":"2026-05-18T02:25:27.316594+00:00"},{"alias_kind":"pith_short_12","alias_value":"H542N23IJWC6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H542N23IJWC6QPWW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H542N23I","created_at":"2026-05-18T12:29:22.688609+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/H542N23IJWC6QPWWAPDM7VSPKJ","json":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ.json","graph_json":"https://pith.science/api/pith-number/H542N23IJWC6QPWWAPDM7VSPKJ/graph.json","events_json":"https://pith.science/api/pith-number/H542N23IJWC6QPWWAPDM7VSPKJ/events.json","paper":"https://pith.science/paper/H542N23I"},"agent_actions":{"view_html":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ","download_json":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ.json","view_paper":"https://pith.science/paper/H542N23I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01900&json=true","fetch_graph":"https://pith.science/api/pith-number/H542N23IJWC6QPWWAPDM7VSPKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/H542N23IJWC6QPWWAPDM7VSPKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/action/storage_attestation","attest_author":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/action/author_attestation","sign_citation":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/action/citation_signature","submit_replication":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/action/replication_record"}},"created_at":"2026-05-18T02:25:27.316594+00:00","updated_at":"2026-05-18T02:25:27.316594+00:00"}