{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KFPXEBMMI47ENJDA4UGVKDLKW","short_pith_number":"pith:6KFPXEBM","schema_version":"1.0","canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","source":{"kind":"arxiv","id":"1707.08389","version":1},"attestation_state":"computed","paper":{"title":"Composition problems for braids: Membership, Identity and Freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Igor Potapov, Sang-Ki Ko","submitted_at":"2017-07-26T11:49:46Z","abstract_excerpt":"In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for $B_3$, but it becomes harder for a class of braids with more strands. In particular we show that fundamental problems about braid compositions are undecidable for braids with at least five strands, but decidabi"},"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":"1707.08389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-26T11:49:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a897e024d0c6c681af24d28539b49ab7262e6f200454dd8a06e52144eb36a694","abstract_canon_sha256":"0af68afc785f993bcabdacc04d309b6eeccaec46edef5f0d81730f403227b74c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.335352Z","signature_b64":"otZA32v6gN8J25Q0ghoNFJ7wUek1anaoSNVtjVYhlYh6ShtqnBVd/AkT/EnNIy7GMxSZXZl8Meg/jsngxyu2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","last_reissued_at":"2026-05-18T00:39:24.334725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.334725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composition problems for braids: Membership, Identity and Freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Igor Potapov, Sang-Ki Ko","submitted_at":"2017-07-26T11:49:46Z","abstract_excerpt":"In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for $B_3$, but it becomes harder for a class of braids with more strands. In particular we show that fundamental problems about braid compositions are undecidable for braids with at least five strands, but decidabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08389","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":"1707.08389","created_at":"2026-05-18T00:39:24.334839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08389v1","created_at":"2026-05-18T00:39:24.334839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08389","created_at":"2026-05-18T00:39:24.334839+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KFPXEBMMI47","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KFPXEBMMI47ENJD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KFPXEBM","created_at":"2026-05-18T12:31:03.183658+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/6KFPXEBMMI47ENJDA4UGVKDLKW","json":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW.json","graph_json":"https://pith.science/api/pith-number/6KFPXEBMMI47ENJDA4UGVKDLKW/graph.json","events_json":"https://pith.science/api/pith-number/6KFPXEBMMI47ENJDA4UGVKDLKW/events.json","paper":"https://pith.science/paper/6KFPXEBM"},"agent_actions":{"view_html":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW","download_json":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW.json","view_paper":"https://pith.science/paper/6KFPXEBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08389&json=true","fetch_graph":"https://pith.science/api/pith-number/6KFPXEBMMI47ENJDA4UGVKDLKW/graph.json","fetch_events":"https://pith.science/api/pith-number/6KFPXEBMMI47ENJDA4UGVKDLKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/action/storage_attestation","attest_author":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/action/author_attestation","sign_citation":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/action/citation_signature","submit_replication":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/action/replication_record"}},"created_at":"2026-05-18T00:39:24.334839+00:00","updated_at":"2026-05-18T00:39:24.334839+00:00"}