{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D6JRYWNUWOA5QENQAPVS4PT6TZ","short_pith_number":"pith:D6JRYWNU","schema_version":"1.0","canonical_sha256":"1f931c59b4b381d811b003eb2e3e7e9e7109f8bfd7a66473942af73e29e25da1","source":{"kind":"arxiv","id":"1309.3288","version":1},"attestation_state":"computed","paper":{"title":"Links and Planar Diagram Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Matt Mastin","submitted_at":"2013-09-12T20:07:32Z","abstract_excerpt":"In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit algorithm for reconstructing a knot diagram on a surface from a PD-code. We also discuss the intrinsic symmetries of PD-codes (i.e., invertibility and chirality). The moves analogous to the Reidemeister moves are also explored, and we show that the given set of PD-codes modulo th"},"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":"1309.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-09-12T20:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"3d5b28cf083f7fe539366122341f5c953a291f61c318da9f940fd7fcdbb64d40","abstract_canon_sha256":"8ffb23eafc7bc2ed725ff8ab81a72c20457dd1881310e5d1c3c10486340a839f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:23.052255Z","signature_b64":"PK8OTpGCRLq+Ur4/aeUHksvMhnoJKHOqxoNvA1ZndPCe1pKMhYOPqTGOcPEbgQdeyhbE9yCTzNRAl3VEFiP0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f931c59b4b381d811b003eb2e3e7e9e7109f8bfd7a66473942af73e29e25da1","last_reissued_at":"2026-05-18T03:13:23.051298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:23.051298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Links and Planar Diagram Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Matt Mastin","submitted_at":"2013-09-12T20:07:32Z","abstract_excerpt":"In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit algorithm for reconstructing a knot diagram on a surface from a PD-code. We also discuss the intrinsic symmetries of PD-codes (i.e., invertibility and chirality). The moves analogous to the Reidemeister moves are also explored, and we show that the given set of PD-codes modulo th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3288","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":"1309.3288","created_at":"2026-05-18T03:13:23.051455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3288v1","created_at":"2026-05-18T03:13:23.051455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3288","created_at":"2026-05-18T03:13:23.051455+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6JRYWNUWOA5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6JRYWNUWOA5QENQ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6JRYWNU","created_at":"2026-05-18T12:27:40.988391+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/D6JRYWNUWOA5QENQAPVS4PT6TZ","json":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ.json","graph_json":"https://pith.science/api/pith-number/D6JRYWNUWOA5QENQAPVS4PT6TZ/graph.json","events_json":"https://pith.science/api/pith-number/D6JRYWNUWOA5QENQAPVS4PT6TZ/events.json","paper":"https://pith.science/paper/D6JRYWNU"},"agent_actions":{"view_html":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ","download_json":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ.json","view_paper":"https://pith.science/paper/D6JRYWNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3288&json=true","fetch_graph":"https://pith.science/api/pith-number/D6JRYWNUWOA5QENQAPVS4PT6TZ/graph.json","fetch_events":"https://pith.science/api/pith-number/D6JRYWNUWOA5QENQAPVS4PT6TZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ/action/storage_attestation","attest_author":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ/action/author_attestation","sign_citation":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ/action/citation_signature","submit_replication":"https://pith.science/pith/D6JRYWNUWOA5QENQAPVS4PT6TZ/action/replication_record"}},"created_at":"2026-05-18T03:13:23.051455+00:00","updated_at":"2026-05-18T03:13:23.051455+00:00"}