{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7P2RRMKWA7BCIWPRRV6AONNW5D","short_pith_number":"pith:7P2RRMKW","schema_version":"1.0","canonical_sha256":"fbf518b15607c22459f18d7c0735b6e8c8cfb21b2a7e7199ebe43f849e022c2b","source":{"kind":"arxiv","id":"1712.06711","version":3},"attestation_state":"computed","paper":{"title":"Graphical virtual links and a polynomial of signed cyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H Kauffman, Qingying Deng, Xian'an Jin","submitted_at":"2017-12-18T22:59:41Z","abstract_excerpt":"For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In the article we shall prove that a virtual link L is graphical if and only if it is checkerboard colorable. On the other hand, we introduce a polynomial F[G] for signed cyclic graphs, which is defined via a deletion-marking recursion. We shall establish the relationship between F[G] of a signed cyclic graph G and the "},"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":"1712.06711","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-18T22:59:41Z","cross_cats_sorted":[],"title_canon_sha256":"7ba38af347d96016c16668088b108f2249fc600e5201b8d320b7daa9dadd6c1a","abstract_canon_sha256":"c205aed07a5cc55b3b001cd6a3b21d81814829034703da8609c504d8e159dd17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.176963Z","signature_b64":"1e9KTCrPesfTun23i4UiFR4G53VZPJGfBeYRSRrOJfEuolE29VL2BYrSrkg2h1o4Zm0OuV06EstXAY0HlLq5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf518b15607c22459f18d7c0735b6e8c8cfb21b2a7e7199ebe43f849e022c2b","last_reissued_at":"2026-05-18T00:14:34.176250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.176250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical virtual links and a polynomial of signed cyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H Kauffman, Qingying Deng, Xian'an Jin","submitted_at":"2017-12-18T22:59:41Z","abstract_excerpt":"For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In the article we shall prove that a virtual link L is graphical if and only if it is checkerboard colorable. On the other hand, we introduce a polynomial F[G] for signed cyclic graphs, which is defined via a deletion-marking recursion. We shall establish the relationship between F[G] of a signed cyclic graph G and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06711","kind":"arxiv","version":3},"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":"1712.06711","created_at":"2026-05-18T00:14:34.176359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06711v3","created_at":"2026-05-18T00:14:34.176359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06711","created_at":"2026-05-18T00:14:34.176359+00:00"},{"alias_kind":"pith_short_12","alias_value":"7P2RRMKWA7BC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7P2RRMKWA7BCIWPR","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7P2RRMKW","created_at":"2026-05-18T12:31:05.417338+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/7P2RRMKWA7BCIWPRRV6AONNW5D","json":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D.json","graph_json":"https://pith.science/api/pith-number/7P2RRMKWA7BCIWPRRV6AONNW5D/graph.json","events_json":"https://pith.science/api/pith-number/7P2RRMKWA7BCIWPRRV6AONNW5D/events.json","paper":"https://pith.science/paper/7P2RRMKW"},"agent_actions":{"view_html":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D","download_json":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D.json","view_paper":"https://pith.science/paper/7P2RRMKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06711&json=true","fetch_graph":"https://pith.science/api/pith-number/7P2RRMKWA7BCIWPRRV6AONNW5D/graph.json","fetch_events":"https://pith.science/api/pith-number/7P2RRMKWA7BCIWPRRV6AONNW5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D/action/storage_attestation","attest_author":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D/action/author_attestation","sign_citation":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D/action/citation_signature","submit_replication":"https://pith.science/pith/7P2RRMKWA7BCIWPRRV6AONNW5D/action/replication_record"}},"created_at":"2026-05-18T00:14:34.176359+00:00","updated_at":"2026-05-18T00:14:34.176359+00:00"}