{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5ZDS256JFRTE5OSXV42C3ZPIV3","short_pith_number":"pith:5ZDS256J","schema_version":"1.0","canonical_sha256":"ee472d77c92c664eba57af342de5e8aedf8a7bf4fedc3c893fadfc1118e07b7b","source":{"kind":"arxiv","id":"1305.5200","version":2},"attestation_state":"computed","paper":{"title":"The forbidden number of a knot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alissa Crans, Blake Mellor, Sandy Ganzell","submitted_at":"2013-05-22T17:09:00Z","abstract_excerpt":"Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the {\\it forbidden number}. We relate the forbidden number to several known invariants, and calculate bounds for some classes of virtual knots."},"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":"1305.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-05-22T17:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"5afe9dc7a5ffd0d50fada484b99556bb60ca583d60f3fabca77882535cb4a4af","abstract_canon_sha256":"650c3fe2b80561d88de8f83eebd814222b1ff0be99d8e80b22886fe1029334de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.422330Z","signature_b64":"RtsmmNuwVvaKevvqcV1Xp8oh0Cp40cbld1JtTcW0rdXX8j6JCki5hWQBvPZCUz/JZpd6iKgfSEAyPUnT0fXZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee472d77c92c664eba57af342de5e8aedf8a7bf4fedc3c893fadfc1118e07b7b","last_reissued_at":"2026-05-18T00:08:24.421771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.421771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The forbidden number of a knot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alissa Crans, Blake Mellor, Sandy Ganzell","submitted_at":"2013-05-22T17:09:00Z","abstract_excerpt":"Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the {\\it forbidden number}. We relate the forbidden number to several known invariants, and calculate bounds for some classes of virtual knots."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5200","kind":"arxiv","version":2},"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":"1305.5200","created_at":"2026-05-18T00:08:24.421858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5200v2","created_at":"2026-05-18T00:08:24.421858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5200","created_at":"2026-05-18T00:08:24.421858+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZDS256JFRTE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZDS256JFRTE5OSX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZDS256J","created_at":"2026-05-18T12:27:34.582898+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/5ZDS256JFRTE5OSXV42C3ZPIV3","json":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3.json","graph_json":"https://pith.science/api/pith-number/5ZDS256JFRTE5OSXV42C3ZPIV3/graph.json","events_json":"https://pith.science/api/pith-number/5ZDS256JFRTE5OSXV42C3ZPIV3/events.json","paper":"https://pith.science/paper/5ZDS256J"},"agent_actions":{"view_html":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3","download_json":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3.json","view_paper":"https://pith.science/paper/5ZDS256J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5200&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZDS256JFRTE5OSXV42C3ZPIV3/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZDS256JFRTE5OSXV42C3ZPIV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3/action/storage_attestation","attest_author":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3/action/author_attestation","sign_citation":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3/action/citation_signature","submit_replication":"https://pith.science/pith/5ZDS256JFRTE5OSXV42C3ZPIV3/action/replication_record"}},"created_at":"2026-05-18T00:08:24.421858+00:00","updated_at":"2026-05-18T00:08:24.421858+00:00"}