{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N2N545MVBEOJ5W23EMU7TBM6JS","short_pith_number":"pith:N2N545MV","schema_version":"1.0","canonical_sha256":"6e9bde7595091c9edb5b2329f9859e4ca8dff9960f0f5dbf7bf5000f32c01451","source":{"kind":"arxiv","id":"1812.03750","version":1},"attestation_state":"computed","paper":{"title":"Characterizing the fullerene graphs with the minimum forcing number 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Lingjuan Shi, Ruizhi Lin","submitted_at":"2018-12-10T12:03:47Z","abstract_excerpt":"The minimum forcing number of a graph $G$ is the smallest number of edges simultaneously contained in a unique perfect matching of $G$. Zhang, Ye and Shiu \\cite{HDW} showed that the minimum forcing number of any fullerene graph was bounded below by $3$. However, we find that there exists exactly one excepted fullerene $F_{24}$ with the minimum forcing number $2$. In this paper, we characterize all fullerenes with the minimum forcing number $3$ by a construction approach. This also solves an open problem proposed by Zhang et al. We also find that except for $F_{24}$, all fullerenes with anti-fo"},"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":"1812.03750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T12:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"30a97fd18f3c9c28503a470d5dbd6d78e616633591dbe20a3bf4ff0679d5e650","abstract_canon_sha256":"d99fc3ce1a8821dd7d0a12b1cfb2d9cc4e8ee28dcfdcf81265b69ab42c8e84ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.955971Z","signature_b64":"bD/9MwAbXgBaP5Xp/PR+tidgvXofDMH8SpNd1ugss7rBmZKNIbRqFo4T7zlWE8oRjWWprGYvo2utPndrUWmiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e9bde7595091c9edb5b2329f9859e4ca8dff9960f0f5dbf7bf5000f32c01451","last_reissued_at":"2026-05-17T23:58:43.955465Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.955465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing the fullerene graphs with the minimum forcing number 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Lingjuan Shi, Ruizhi Lin","submitted_at":"2018-12-10T12:03:47Z","abstract_excerpt":"The minimum forcing number of a graph $G$ is the smallest number of edges simultaneously contained in a unique perfect matching of $G$. Zhang, Ye and Shiu \\cite{HDW} showed that the minimum forcing number of any fullerene graph was bounded below by $3$. However, we find that there exists exactly one excepted fullerene $F_{24}$ with the minimum forcing number $2$. In this paper, we characterize all fullerenes with the minimum forcing number $3$ by a construction approach. This also solves an open problem proposed by Zhang et al. We also find that except for $F_{24}$, all fullerenes with anti-fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03750","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":"1812.03750","created_at":"2026-05-17T23:58:43.955543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03750v1","created_at":"2026-05-17T23:58:43.955543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03750","created_at":"2026-05-17T23:58:43.955543+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2N545MVBEOJ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2N545MVBEOJ5W23","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2N545MV","created_at":"2026-05-18T12:32:40.477152+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/N2N545MVBEOJ5W23EMU7TBM6JS","json":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS.json","graph_json":"https://pith.science/api/pith-number/N2N545MVBEOJ5W23EMU7TBM6JS/graph.json","events_json":"https://pith.science/api/pith-number/N2N545MVBEOJ5W23EMU7TBM6JS/events.json","paper":"https://pith.science/paper/N2N545MV"},"agent_actions":{"view_html":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS","download_json":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS.json","view_paper":"https://pith.science/paper/N2N545MV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03750&json=true","fetch_graph":"https://pith.science/api/pith-number/N2N545MVBEOJ5W23EMU7TBM6JS/graph.json","fetch_events":"https://pith.science/api/pith-number/N2N545MVBEOJ5W23EMU7TBM6JS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS/action/storage_attestation","attest_author":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS/action/author_attestation","sign_citation":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS/action/citation_signature","submit_replication":"https://pith.science/pith/N2N545MVBEOJ5W23EMU7TBM6JS/action/replication_record"}},"created_at":"2026-05-17T23:58:43.955543+00:00","updated_at":"2026-05-17T23:58:43.955543+00:00"}