{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KZLDROGWRHW4SR6SZJFPS6HGEM","short_pith_number":"pith:KZLDROGW","schema_version":"1.0","canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","source":{"kind":"arxiv","id":"1803.04908","version":2},"attestation_state":"computed","paper":{"title":"Low complexity algorithms in knot theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.GT","authors_text":"Alina Vdovina, Olga Kharlampovich","submitted_at":"2018-03-13T16:07:28Z","abstract_excerpt":"We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We show that the genus problem for these knots belongs to $TC^0$ circuit complexity class. We also show, that the equivalence problem for such knots with $n$ crossings has time complexity $n\\log (n)$ and is in Logspace$(n)$ and $TC^{0}$ complexity classes."},"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":"1803.04908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-03-13T16:07:28Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"317b6bc5f7efda64aa56d24f35cca7a28ff44e290cb1a135c05248db20e7738f","abstract_canon_sha256":"ac614592f7a7851517ce0308d2f49197d81785ad45bfe3d57f9a2a51da4efe38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.285192Z","signature_b64":"1Z9N2dgEy7SUs6O0zBg/6FYbnovIe12aBBdDbooOnqpfulmDILiw/C0pNd8I00yJcRAA6IgBPARAzRf7knAoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","last_reissued_at":"2026-05-18T00:19:56.284562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.284562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low complexity algorithms in knot theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.GT","authors_text":"Alina Vdovina, Olga Kharlampovich","submitted_at":"2018-03-13T16:07:28Z","abstract_excerpt":"We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We show that the genus problem for these knots belongs to $TC^0$ circuit complexity class. We also show, that the equivalence problem for such knots with $n$ crossings has time complexity $n\\log (n)$ and is in Logspace$(n)$ and $TC^{0}$ complexity classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04908","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":"1803.04908","created_at":"2026-05-18T00:19:56.284647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04908v2","created_at":"2026-05-18T00:19:56.284647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04908","created_at":"2026-05-18T00:19:56.284647+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZLDROGWRHW4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZLDROGWRHW4SR6S","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZLDROGW","created_at":"2026-05-18T12:32:33.847187+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/KZLDROGWRHW4SR6SZJFPS6HGEM","json":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM.json","graph_json":"https://pith.science/api/pith-number/KZLDROGWRHW4SR6SZJFPS6HGEM/graph.json","events_json":"https://pith.science/api/pith-number/KZLDROGWRHW4SR6SZJFPS6HGEM/events.json","paper":"https://pith.science/paper/KZLDROGW"},"agent_actions":{"view_html":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM","download_json":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM.json","view_paper":"https://pith.science/paper/KZLDROGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04908&json=true","fetch_graph":"https://pith.science/api/pith-number/KZLDROGWRHW4SR6SZJFPS6HGEM/graph.json","fetch_events":"https://pith.science/api/pith-number/KZLDROGWRHW4SR6SZJFPS6HGEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/action/storage_attestation","attest_author":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/action/author_attestation","sign_citation":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/action/citation_signature","submit_replication":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/action/replication_record"}},"created_at":"2026-05-18T00:19:56.284647+00:00","updated_at":"2026-05-18T00:19:56.284647+00:00"}