{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H542N23IJWC6QPWWAPDM7VSPKJ","short_pith_number":"pith:H542N23I","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"},"canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","source":{"kind":"arxiv","id":"1503.01900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01900","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01900v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01900","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"H542N23IJWC6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H542N23IJWC6QPWW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H542N23I","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H542N23IJWC6QPWWAPDM7VSPKJ","target":"record","payload":{"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"},"canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","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"},"source_kind":"arxiv","source_id":"1503.01900","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWhv9R9kyhGkStAYJ/LSVLN1Ff31+bRypkNzferciRbhWdWFszAAVfAuBA3NAdkAdAP7IUupqk80Fh6PaF3VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:28:07.788004Z"},"content_sha256":"3e932ee42d9ecbbd5bb4e8155cb5c6efdf369bb580902d9f65e92a6fc451f409","schema_version":"1.0","event_id":"sha256:3e932ee42d9ecbbd5bb4e8155cb5c6efdf369bb580902d9f65e92a6fc451f409"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H542N23IJWC6QPWWAPDM7VSPKJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+oyvEFwd8ruGXtBavdT0sHcWa4YB+2qWWT5dfZsV/SSz16PhJqjGA5LOzXxefmLjozAy2NqbwhZbILHh+/KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:28:07.788657Z"},"content_sha256":"46495f32c92e1a6e959ac882b7857b694e1cfe6c6b8778b3bfda721abc58f4da","schema_version":"1.0","event_id":"sha256:46495f32c92e1a6e959ac882b7857b694e1cfe6c6b8778b3bfda721abc58f4da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/bundle.json","state_url":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H542N23IJWC6QPWWAPDM7VSPKJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T07:28:07Z","links":{"resolver":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ","bundle":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/bundle.json","state":"https://pith.science/pith/H542N23IJWC6QPWWAPDM7VSPKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H542N23IJWC6QPWWAPDM7VSPKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H542N23IJWC6QPWWAPDM7VSPKJ","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":"2ff101537a9f01eb4ae875917e2797655d34235cffbfb0cba4d076fa059fc435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-06T10:30:16Z","title_canon_sha256":"c283f21fc0a8cd543a5d93d1dfd0e2758ab2ad20a611b8191edfae1da686ac9e"},"schema_version":"1.0","source":{"id":"1503.01900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01900","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01900v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01900","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"H542N23IJWC6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H542N23IJWC6QPWW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H542N23I","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:46495f32c92e1a6e959ac882b7857b694e1cfe6c6b8778b3bfda721abc58f4da","target":"graph","created_at":"2026-05-18T02:25:27Z","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":"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.","authors_text":"Heping Zhang, Qin Yang, Yuqing Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-06T10:30:16Z","title":"On the anti-forcing number of fullerene graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01900","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:3e932ee42d9ecbbd5bb4e8155cb5c6efdf369bb580902d9f65e92a6fc451f409","target":"record","created_at":"2026-05-18T02:25:27Z","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":"2ff101537a9f01eb4ae875917e2797655d34235cffbfb0cba4d076fa059fc435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-06T10:30:16Z","title_canon_sha256":"c283f21fc0a8cd543a5d93d1dfd0e2758ab2ad20a611b8191edfae1da686ac9e"},"schema_version":"1.0","source":{"id":"1503.01900","kind":"arxiv","version":1}},"canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f79a6eb684d85e83ed603c6cfd64f52713416977c2dbf426e9bd4a3310a908d","first_computed_at":"2026-05-18T02:25:27.316540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:27.316540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"injlaFLXpDWUaKdz4sErsKXN1xtlQRBiWbso2bXdNBZFbspRMqoXzN37M4/B6NtOCJCTUoJzOQhHKYoVBsiLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:27.316923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e932ee42d9ecbbd5bb4e8155cb5c6efdf369bb580902d9f65e92a6fc451f409","sha256:46495f32c92e1a6e959ac882b7857b694e1cfe6c6b8778b3bfda721abc58f4da"],"state_sha256":"1e23b801f30efbaf66f8347b56fc1c8df5e9368620d0bc0758eb16b2a065cf7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/DzSyM/4UPgEZEb52YCubJEWYD2N1OGN7U9W9m3cjNAp3AO4CD5VGpHLclrLmtWR8+1OcHPBzY5GeG4lhalCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:28:07.791663Z","bundle_sha256":"76134514dd8da49ea14c841167f9e78754f9925d656c6493b660d46d4f48c71d"}}