{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QD3DPMCURU2VJFZDUFLYP4MXT2","short_pith_number":"pith:QD3DPMCU","schema_version":"1.0","canonical_sha256":"80f637b0548d35549723a15787f1979e98355ddf26b3cbe4a2cae48629d4bb03","source":{"kind":"arxiv","id":"1703.03573","version":1},"attestation_state":"computed","paper":{"title":"Up-down colorings of virtual-link diagrams and the necessity of Reidemeister moves of type II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ayaka Shimizu, Kanako Oshiro, Yoshiro Yaguchi","submitted_at":"2017-03-10T08:28:30Z","abstract_excerpt":"We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of a quandle cocycle invariant, we determine the necessity of Reidemeister moves of type II for a pair of diagrams of the trivial virtual-knot. This implies that for any virtual-knot diagram $D$, there exists a diagram $D'$ representing the same virtual-knot such that any sequence of generalized Reidemeister moves between them includes at least one Reidemeister"},"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":"1703.03573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-10T08:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"abf2d5dc8e81a3cabb852b7ae51a14bd3cd7d6ced2e50efd887aa4c20f7c0d03","abstract_canon_sha256":"c945d568efa5bf7cf2dae21461e7a7c8c851d8d5273c09185b5dceb4ae382a17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:58.708863Z","signature_b64":"PpBzDcQcS/lwAcV0BLadD3O6w6RWz2QxBoYxsMWvgw6msJ7RK4Pwqu1Z6+BcYGj0dJ3X96ctRaIfuFL6ftg4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f637b0548d35549723a15787f1979e98355ddf26b3cbe4a2cae48629d4bb03","last_reissued_at":"2026-05-18T00:48:58.708214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:58.708214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Up-down colorings of virtual-link diagrams and the necessity of Reidemeister moves of type II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ayaka Shimizu, Kanako Oshiro, Yoshiro Yaguchi","submitted_at":"2017-03-10T08:28:30Z","abstract_excerpt":"We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of a quandle cocycle invariant, we determine the necessity of Reidemeister moves of type II for a pair of diagrams of the trivial virtual-knot. This implies that for any virtual-knot diagram $D$, there exists a diagram $D'$ representing the same virtual-knot such that any sequence of generalized Reidemeister moves between them includes at least one Reidemeister"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03573","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":"1703.03573","created_at":"2026-05-18T00:48:58.708329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03573v1","created_at":"2026-05-18T00:48:58.708329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03573","created_at":"2026-05-18T00:48:58.708329+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD3DPMCURU2V","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD3DPMCURU2VJFZD","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD3DPMCU","created_at":"2026-05-18T12:31:37.085036+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/QD3DPMCURU2VJFZDUFLYP4MXT2","json":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2.json","graph_json":"https://pith.science/api/pith-number/QD3DPMCURU2VJFZDUFLYP4MXT2/graph.json","events_json":"https://pith.science/api/pith-number/QD3DPMCURU2VJFZDUFLYP4MXT2/events.json","paper":"https://pith.science/paper/QD3DPMCU"},"agent_actions":{"view_html":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2","download_json":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2.json","view_paper":"https://pith.science/paper/QD3DPMCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03573&json=true","fetch_graph":"https://pith.science/api/pith-number/QD3DPMCURU2VJFZDUFLYP4MXT2/graph.json","fetch_events":"https://pith.science/api/pith-number/QD3DPMCURU2VJFZDUFLYP4MXT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2/action/storage_attestation","attest_author":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2/action/author_attestation","sign_citation":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2/action/citation_signature","submit_replication":"https://pith.science/pith/QD3DPMCURU2VJFZDUFLYP4MXT2/action/replication_record"}},"created_at":"2026-05-18T00:48:58.708329+00:00","updated_at":"2026-05-18T00:48:58.708329+00:00"}