{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KZLDROGWRHW4SR6SZJFPS6HGEM","short_pith_number":"pith:KZLDROGW","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"},"canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","source":{"kind":"arxiv","id":"1803.04908","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04908","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04908v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04908","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"KZLDROGWRHW4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KZLDROGWRHW4SR6S","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KZLDROGW","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KZLDROGWRHW4SR6SZJFPS6HGEM","target":"record","payload":{"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"},"canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","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"},"source_kind":"arxiv","source_id":"1803.04908","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKxv1gEEj1Te0OJP6QjbsXvNSJKqEwlFiRinASIRkH+Cqikkd2/a4PwZHVcNNfaH4y+nVj4eodPoM7xdHEmYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:13:00.898163Z"},"content_sha256":"504786c0e633368ea81cdd829a1fdef9d856f295b85a09c0d17d8416f5bd4de7","schema_version":"1.0","event_id":"sha256:504786c0e633368ea81cdd829a1fdef9d856f295b85a09c0d17d8416f5bd4de7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KZLDROGWRHW4SR6SZJFPS6HGEM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GO8MCGCCsm61YIJ9H46kwMZOQLxnDrtMl0mnk9lLUaUjU4+S/dVw7o/mwSTrxfhWMdzyOjg6QkUiKxKW1t01DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:13:00.898524Z"},"content_sha256":"8666dc0ae80c1de566a4c665aee8dc69f1d5e004344c10f2417db247d454044e","schema_version":"1.0","event_id":"sha256:8666dc0ae80c1de566a4c665aee8dc69f1d5e004344c10f2417db247d454044e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/bundle.json","state_url":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T22:13:00Z","links":{"resolver":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM","bundle":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/bundle.json","state":"https://pith.science/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZLDROGWRHW4SR6SZJFPS6HGEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KZLDROGWRHW4SR6SZJFPS6HGEM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ac614592f7a7851517ce0308d2f49197d81785ad45bfe3d57f9a2a51da4efe38","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-03-13T16:07:28Z","title_canon_sha256":"317b6bc5f7efda64aa56d24f35cca7a28ff44e290cb1a135c05248db20e7738f"},"schema_version":"1.0","source":{"id":"1803.04908","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04908","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04908v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04908","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"KZLDROGWRHW4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KZLDROGWRHW4SR6S","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KZLDROGW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:8666dc0ae80c1de566a4c665aee8dc69f1d5e004344c10f2417db247d454044e","target":"graph","created_at":"2026-05-18T00:19:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alina Vdovina, Olga Kharlampovich","cross_cats":["math.CO","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-03-13T16:07:28Z","title":"Low complexity algorithms in knot theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04908","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:504786c0e633368ea81cdd829a1fdef9d856f295b85a09c0d17d8416f5bd4de7","target":"record","created_at":"2026-05-18T00:19:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ac614592f7a7851517ce0308d2f49197d81785ad45bfe3d57f9a2a51da4efe38","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-03-13T16:07:28Z","title_canon_sha256":"317b6bc5f7efda64aa56d24f35cca7a28ff44e290cb1a135c05248db20e7738f"},"schema_version":"1.0","source":{"id":"1803.04908","kind":"arxiv","version":2}},"canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"565638b8d689edc947d2ca4af978e62311ae164f3a12eee1147d138c3151110e","first_computed_at":"2026-05-18T00:19:56.284562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:56.284562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Z9N2dgEy7SUs6O0zBg/6FYbnovIe12aBBdDbooOnqpfulmDILiw/C0pNd8I00yJcRAA6IgBPARAzRf7knAoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:56.285192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04908","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:504786c0e633368ea81cdd829a1fdef9d856f295b85a09c0d17d8416f5bd4de7","sha256:8666dc0ae80c1de566a4c665aee8dc69f1d5e004344c10f2417db247d454044e"],"state_sha256":"cfda39c36640f1dfcc5d0f38ad6a072654707e18151e1586fd06de7f637727ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d/tTFK1GrZBlUFKZiGSor9yOsAH4g3h3Ek69Dc2yve9/utdaN8gyc0jaRX62WEXxNmCzM1cuhTMAUlrorA0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:13:00.900460Z","bundle_sha256":"183115086c769e579eb5ea9c68b9dbd1dadcf24cbba4393b09ded120a334cb23"}}