{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KMAEWDCBSDDIEVULKJLMBCPITV","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":"30cc98c20b604a4dfdefd3bd22ed286abb3f7ea54b8d4185f0b64de122835606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T18:56:21Z","title_canon_sha256":"e97c9b87a771790041e85c4b948b76c3c94082ea747b99510e5817ed89230fe9"},"schema_version":"1.0","source":{"id":"1710.06470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06470","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06470v1","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06470","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"KMAEWDCBSDDI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KMAEWDCBSDDIEVUL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KMAEWDCB","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:36838afbe43362467b6649613d83b1e1d7229540184e081cbf93acd8cd628569","target":"graph","created_at":"2026-05-18T00:32:33Z","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":"Let $D$ be a knot diagram, and let ${\\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at least one of these $2^n$ diagrams is unknot, from which it follows that every diagram has finite unknotting number. It is easy to see that this argument can be used to show that actually ${\\mathcal D}$ has more than one unknot diagram, but it cannot yield more than $4n$ unknot diagrams. We improve this linear bound to a superpolynomial bound, by showing that a","authors_text":"Carolina Medina, Gelasio Salazar, Jorge Ram\\'irez-Alfons\\'in","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T18:56:21Z","title":"On the number of unknot diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06470","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:515570c2b89ebe91db2f25d15deaf968a154f0a90e9ca74e00c3bde542306e0c","target":"record","created_at":"2026-05-18T00:32:33Z","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":"30cc98c20b604a4dfdefd3bd22ed286abb3f7ea54b8d4185f0b64de122835606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T18:56:21Z","title_canon_sha256":"e97c9b87a771790041e85c4b948b76c3c94082ea747b99510e5817ed89230fe9"},"schema_version":"1.0","source":{"id":"1710.06470","kind":"arxiv","version":1}},"canonical_sha256":"53004b0c4190c682568b5256c089e89d5d8f9e229edadadc12f4830886eb9cc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53004b0c4190c682568b5256c089e89d5d8f9e229edadadc12f4830886eb9cc2","first_computed_at":"2026-05-18T00:32:33.600544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:33.600544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZBFZJssEO60rfMCYafE+aahJFLBzNe3CCh6jL4OrS1o6xKhBDs6HflU9KI2k2YnqYZNxEgCXppz0H4b3Md9jDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:33.601175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:515570c2b89ebe91db2f25d15deaf968a154f0a90e9ca74e00c3bde542306e0c","sha256:36838afbe43362467b6649613d83b1e1d7229540184e081cbf93acd8cd628569"],"state_sha256":"3dd521c83f80865a819e4327b9c2550945d5227c835eb6775c97f326a1cd1ac9"}