{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NFEYDB3NTA7YXAXQYKU3UUSZFN","short_pith_number":"pith:NFEYDB3N","schema_version":"1.0","canonical_sha256":"694981876d983f8b82f0c2a9ba52592b4b58b6049959b691c796377bc43e7a1e","source":{"kind":"arxiv","id":"1903.03306","version":1},"attestation_state":"computed","paper":{"title":"Cyclic coverings of virtual link diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Naoko Kamada","submitted_at":"2019-03-08T07:11:31Z","abstract_excerpt":"A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost classical virtual link diagram from a given virtual link diagram, which we call an $m$-fold cyclic covering diagram. The main result is that $m$-fold cyclic covering diagrams obtained from two equivalent virtual link diagrams are equivalent. Thus we have a well-defined map from the se"},"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":"1903.03306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-08T07:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"2049516d10bdefbffe521c6d4428fc062ab6a8e1894cd2c2431655ab0642e291","abstract_canon_sha256":"dd87ffaf607e5710d98399ca88a828fdcb3c1ff2c7a384c106407dea00e182bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.884232Z","signature_b64":"IwktBy/UNycAfnEyI3tlbU6Vm9s51f/uqt4KNPRn3UN63fM6Fcfews4cJ1jhEZFTgMuAhsdeC5J3poH3t5YgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"694981876d983f8b82f0c2a9ba52592b4b58b6049959b691c796377bc43e7a1e","last_reissued_at":"2026-05-17T23:51:45.883638Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.883638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic coverings of virtual link diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Naoko Kamada","submitted_at":"2019-03-08T07:11:31Z","abstract_excerpt":"A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost classical virtual link diagram from a given virtual link diagram, which we call an $m$-fold cyclic covering diagram. The main result is that $m$-fold cyclic covering diagrams obtained from two equivalent virtual link diagrams are equivalent. Thus we have a well-defined map from the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03306","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":"1903.03306","created_at":"2026-05-17T23:51:45.883722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03306v1","created_at":"2026-05-17T23:51:45.883722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03306","created_at":"2026-05-17T23:51:45.883722+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFEYDB3NTA7Y","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFEYDB3NTA7YXAXQ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFEYDB3N","created_at":"2026-05-18T12:33:24.271573+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/NFEYDB3NTA7YXAXQYKU3UUSZFN","json":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN.json","graph_json":"https://pith.science/api/pith-number/NFEYDB3NTA7YXAXQYKU3UUSZFN/graph.json","events_json":"https://pith.science/api/pith-number/NFEYDB3NTA7YXAXQYKU3UUSZFN/events.json","paper":"https://pith.science/paper/NFEYDB3N"},"agent_actions":{"view_html":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN","download_json":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN.json","view_paper":"https://pith.science/paper/NFEYDB3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03306&json=true","fetch_graph":"https://pith.science/api/pith-number/NFEYDB3NTA7YXAXQYKU3UUSZFN/graph.json","fetch_events":"https://pith.science/api/pith-number/NFEYDB3NTA7YXAXQYKU3UUSZFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN/action/storage_attestation","attest_author":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN/action/author_attestation","sign_citation":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN/action/citation_signature","submit_replication":"https://pith.science/pith/NFEYDB3NTA7YXAXQYKU3UUSZFN/action/replication_record"}},"created_at":"2026-05-17T23:51:45.883722+00:00","updated_at":"2026-05-17T23:51:45.883722+00:00"}