{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T7OFDYDKQ6PKJNJDVYPDGOUSBL","short_pith_number":"pith:T7OFDYDK","schema_version":"1.0","canonical_sha256":"9fdc51e06a879ea4b523ae1e333a920ac803b6989ccbe7035e3a82a08d248654","source":{"kind":"arxiv","id":"1904.03117","version":2},"attestation_state":"computed","paper":{"title":"Knot Diagrams of Treewidth Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Grigoriev, Benjamin Burton, Fedor V. Fomin, Hans L. Bodlaender","submitted_at":"2019-04-05T15:20:32Z","abstract_excerpt":"In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most $n$ (un)twist and (un)poke Reidemeister moves."},"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":"1904.03117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T15:20:32Z","cross_cats_sorted":[],"title_canon_sha256":"08a255fbc6878953b00738f55d5d5b97421433f1fb2dd559e250f128eb049fee","abstract_canon_sha256":"de24f5c5362a1bbf33f0f6ed1298ea3b361634e49dadb7c9ca75ca77a3c1193c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.500629Z","signature_b64":"p59euXRqQBS/AVAazVlB68YGdr63gqHMUFJOX8b28I3P0PBadfOknbTLPwW5qAeTK5sWalZv5AK4oY4acHeRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fdc51e06a879ea4b523ae1e333a920ac803b6989ccbe7035e3a82a08d248654","last_reissued_at":"2026-05-17T23:49:08.499990Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.499990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knot Diagrams of Treewidth Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Grigoriev, Benjamin Burton, Fedor V. Fomin, Hans L. Bodlaender","submitted_at":"2019-04-05T15:20:32Z","abstract_excerpt":"In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most $n$ (un)twist and (un)poke Reidemeister moves."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03117","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":"1904.03117","created_at":"2026-05-17T23:49:08.500098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03117v2","created_at":"2026-05-17T23:49:08.500098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03117","created_at":"2026-05-17T23:49:08.500098+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7OFDYDKQ6PK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7OFDYDKQ6PKJNJD","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7OFDYDK","created_at":"2026-05-18T12:33:27.125529+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/T7OFDYDKQ6PKJNJDVYPDGOUSBL","json":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL.json","graph_json":"https://pith.science/api/pith-number/T7OFDYDKQ6PKJNJDVYPDGOUSBL/graph.json","events_json":"https://pith.science/api/pith-number/T7OFDYDKQ6PKJNJDVYPDGOUSBL/events.json","paper":"https://pith.science/paper/T7OFDYDK"},"agent_actions":{"view_html":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL","download_json":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL.json","view_paper":"https://pith.science/paper/T7OFDYDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03117&json=true","fetch_graph":"https://pith.science/api/pith-number/T7OFDYDKQ6PKJNJDVYPDGOUSBL/graph.json","fetch_events":"https://pith.science/api/pith-number/T7OFDYDKQ6PKJNJDVYPDGOUSBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL/action/storage_attestation","attest_author":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL/action/author_attestation","sign_citation":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL/action/citation_signature","submit_replication":"https://pith.science/pith/T7OFDYDKQ6PKJNJDVYPDGOUSBL/action/replication_record"}},"created_at":"2026-05-17T23:49:08.500098+00:00","updated_at":"2026-05-17T23:49:08.500098+00:00"}