{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XRFU2VYRMUQMCVTDTEY5724XC4","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":"6c6bfdfcaf5201125c9b3d00af448a5683dd94edbd74e6d5eab4bdbc5945bdfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-19T03:41:53Z","title_canon_sha256":"85d3d979d590e8072a3baf0afb1158f8ec3af9380ba229e9fca6c60238480901"},"schema_version":"1.0","source":{"id":"1607.05392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05392","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05392v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05392","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"XRFU2VYRMUQM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XRFU2VYRMUQMCVTD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XRFU2VYR","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:756911ae822742094a11bfbad13c4034d38c196f00a7f817f7af90fff7d63a16","target":"graph","created_at":"2026-05-18T01:10:55Z","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 perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal to make $M$ as a unique perfect matching of the resulting graph. The set of anti-forcing numbers of all perfect matchings of $G$ is the anti-forcing spectrum of $G$. In this paper, we characterize the plane elementary bipartite graph whose minimum anti-forcing number is one. We show that the maximum anti-forcing number of a graph is at most its cyclomatic number. In particular, we characterize the graphs with the maximum anti-forcing number achieving the upper bound, such ex","authors_text":"Heping Zhang, Kai Deng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-19T03:41:53Z","title":"Extremal anti-forcing numbers of perfect matchings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05392","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:fdbab00b8ca62f14694137b2c648210b08f139caad8a8ec57df02167c46cdc4b","target":"record","created_at":"2026-05-18T01:10:55Z","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":"6c6bfdfcaf5201125c9b3d00af448a5683dd94edbd74e6d5eab4bdbc5945bdfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-19T03:41:53Z","title_canon_sha256":"85d3d979d590e8072a3baf0afb1158f8ec3af9380ba229e9fca6c60238480901"},"schema_version":"1.0","source":{"id":"1607.05392","kind":"arxiv","version":1}},"canonical_sha256":"bc4b4d57116520c156639931dfeb9717282aa13e8e3d283ffd9db233e4ef2008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc4b4d57116520c156639931dfeb9717282aa13e8e3d283ffd9db233e4ef2008","first_computed_at":"2026-05-18T01:10:55.105913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:55.105913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6A2AEdkOoRYwncP5lfs7JhDy05rtUq2ZFccNLvoQ6NBpMBH6PgLzw/aqk9G5P7/fTm7j/Em3qAkeCpuJjF/hCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:55.107389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdbab00b8ca62f14694137b2c648210b08f139caad8a8ec57df02167c46cdc4b","sha256:756911ae822742094a11bfbad13c4034d38c196f00a7f817f7af90fff7d63a16"],"state_sha256":"085650aa0f35901c2ca766eef7c2def63134ce614a08c5b2fca8241a2594cf3d"}