{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KFPXEBMMI47ENJDA4UGVKDLKW","short_pith_number":"pith:6KFPXEBM","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"},"canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","source":{"kind":"arxiv","id":"1707.08389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08389","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08389v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08389","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"6KFPXEBMMI47","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KFPXEBMMI47ENJD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KFPXEBM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KFPXEBMMI47ENJDA4UGVKDLKW","target":"record","payload":{"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"},"canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","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"},"source_kind":"arxiv","source_id":"1707.08389","source_version":1,"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daY4t5Up0TvBV9O/sxi4VtVQl3aTsZsMSKd0ri+YqKqiYsA9N6Hzi0MY8i6Pk2czqYiDZ0JILvkVsOXccAwUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:47:58.844029Z"},"content_sha256":"f6c25ecca92884ef0f1d7d231d551e28aee0ce802ab0ebe90515b30088557e9d","schema_version":"1.0","event_id":"sha256:f6c25ecca92884ef0f1d7d231d551e28aee0ce802ab0ebe90515b30088557e9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KFPXEBMMI47ENJDA4UGVKDLKW","target":"graph","payload":{"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"},"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4sitf0a6ZdjLsxKqAxFFmwpOvYXKWf84OAd2AQPrXuN81kTfV/dPC3ssq3vLMTX/koRbvkXqlGXSZ2XNw1GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:47:58.844705Z"},"content_sha256":"ff65af1e218a053afe60cec4b4dae60506544f65cce90013c58ef33f8b9fbcc9","schema_version":"1.0","event_id":"sha256:ff65af1e218a053afe60cec4b4dae60506544f65cce90013c58ef33f8b9fbcc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/bundle.json","state_url":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/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-06-04T22:47:58Z","links":{"resolver":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW","bundle":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/bundle.json","state":"https://pith.science/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KFPXEBMMI47ENJDA4UGVKDLKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KFPXEBMMI47ENJDA4UGVKDLKW","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":"0af68afc785f993bcabdacc04d309b6eeccaec46edef5f0d81730f403227b74c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-26T11:49:46Z","title_canon_sha256":"a897e024d0c6c681af24d28539b49ab7262e6f200454dd8a06e52144eb36a694"},"schema_version":"1.0","source":{"id":"1707.08389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08389","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08389v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08389","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"6KFPXEBMMI47","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KFPXEBMMI47ENJD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KFPXEBM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:ff65af1e218a053afe60cec4b4dae60506544f65cce90013c58ef33f8b9fbcc9","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"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","authors_text":"Igor Potapov, Sang-Ki Ko","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-26T11:49:46Z","title":"Composition problems for braids: Membership, Identity and Freeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08389","kind":"arxiv","version":1},"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:f6c25ecca92884ef0f1d7d231d551e28aee0ce802ab0ebe90515b30088557e9d","target":"record","created_at":"2026-05-18T00:39:24Z","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":"0af68afc785f993bcabdacc04d309b6eeccaec46edef5f0d81730f403227b74c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-26T11:49:46Z","title_canon_sha256":"a897e024d0c6c681af24d28539b49ab7262e6f200454dd8a06e52144eb36a694"},"schema_version":"1.0","source":{"id":"1707.08389","kind":"arxiv","version":1}},"canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28afb902c6239f2352307286aa86b55a0fb571140238e24d17a157bc824c965","first_computed_at":"2026-05-18T00:39:24.334725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.334725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"otZA32v6gN8J25Q0ghoNFJ7wUek1anaoSNVtjVYhlYh6ShtqnBVd/AkT/EnNIy7GMxSZXZl8Meg/jsngxyu2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.335352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6c25ecca92884ef0f1d7d231d551e28aee0ce802ab0ebe90515b30088557e9d","sha256:ff65af1e218a053afe60cec4b4dae60506544f65cce90013c58ef33f8b9fbcc9"],"state_sha256":"42bb94751c223995a5623a805d4116a60f81b5aebaa4652c1d3430669fe42c20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB31GG1Mo+8zNGh5dMmkn1n/ZSQVhSL0p4dFi5pWxdnAU9Yy55vEUci5qKhSDHydhlWGtFsSeq4jhbIFUr/VDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:47:58.848409Z","bundle_sha256":"c396fda607640dfd03b7d9fade1b98f5ccb662f7d68ed4bdfe5b5c3e989da16e"}}