{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5O4KRS7OHWCBGSY7HDEHTESY32","short_pith_number":"pith:5O4KRS7O","canonical_record":{"source":{"id":"1607.04830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-07-17T06:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"0f48b7bbadddcdc50351b0619e8d5d47a3c406b7b96019f17fc0c1e3fa9cd6aa","abstract_canon_sha256":"52c957d84c5160aec361861ed067aabbef05173ef4ea647b382320846f9d1ada"},"schema_version":"1.0"},"canonical_sha256":"ebb8a8cbee3d84134b1f38c8799258de8aef84fc6b60b7fe93ffea6723d86db9","source":{"kind":"arxiv","id":"1607.04830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04830","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04830v2","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04830","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"5O4KRS7OHWCB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5O4KRS7OHWCBGSY7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5O4KRS7O","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5O4KRS7OHWCBGSY7HDEHTESY32","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-07-17T06:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"0f48b7bbadddcdc50351b0619e8d5d47a3c406b7b96019f17fc0c1e3fa9cd6aa","abstract_canon_sha256":"52c957d84c5160aec361861ed067aabbef05173ef4ea647b382320846f9d1ada"},"schema_version":"1.0"},"canonical_sha256":"ebb8a8cbee3d84134b1f38c8799258de8aef84fc6b60b7fe93ffea6723d86db9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.593589Z","signature_b64":"d2bb3xm/M8pQOUUAEY7XwimFc6U3uDFq6ddqtAdD1HbNNBu8vWMmV38TqQztQDJZYckrJ34kNRhwOd7h37LIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb8a8cbee3d84134b1f38c8799258de8aef84fc6b60b7fe93ffea6723d86db9","last_reissued_at":"2026-05-18T01:09:11.592934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.592934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04830","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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6PrzmTkdR1DOeNt0lIzQBP3K4pHHzfndr42W60j5TUkIPBpbS29n7LPCkrMnhZI+Avm34sNq8H88n4ERTCTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:04:48.686061Z"},"content_sha256":"bcffde1c9b4b954c97a77f0be0d60cefbad4be45fdc307e1c86247cb86435940","schema_version":"1.0","event_id":"sha256:bcffde1c9b4b954c97a77f0be0d60cefbad4be45fdc307e1c86247cb86435940"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5O4KRS7OHWCBGSY7HDEHTESY32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological complexity of subgroups of Artin's braid groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"David Recio-Mitter, Mark Grant","submitted_at":"2016-07-17T06:48:56Z","abstract_excerpt":"We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological complexity of such mixed braid groups. In particular we show that the topological complexity of any subgroup of the n-strand braid group which fixes any two strands is 2n-3, extending a result of Farber and Yuzvinsky in the pure braid case. In addition, we generalise our results to the setting of higher topological complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04830","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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+csbeY8Jc9DObotbsWe8uhfO/C5y0eHSqes8KOZTQpGArl6NtoCTY04USoWVjAmJePTLZKPnQ2Es++X13wZBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:04:48.686413Z"},"content_sha256":"68f9b8f875cfdc683e1c44d5b50438fb3524c24b5158668309d6115a8ecc0d06","schema_version":"1.0","event_id":"sha256:68f9b8f875cfdc683e1c44d5b50438fb3524c24b5158668309d6115a8ecc0d06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5O4KRS7OHWCBGSY7HDEHTESY32/bundle.json","state_url":"https://pith.science/pith/5O4KRS7OHWCBGSY7HDEHTESY32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5O4KRS7OHWCBGSY7HDEHTESY32/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-02T07:04:48Z","links":{"resolver":"https://pith.science/pith/5O4KRS7OHWCBGSY7HDEHTESY32","bundle":"https://pith.science/pith/5O4KRS7OHWCBGSY7HDEHTESY32/bundle.json","state":"https://pith.science/pith/5O4KRS7OHWCBGSY7HDEHTESY32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5O4KRS7OHWCBGSY7HDEHTESY32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5O4KRS7OHWCBGSY7HDEHTESY32","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":"52c957d84c5160aec361861ed067aabbef05173ef4ea647b382320846f9d1ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-07-17T06:48:56Z","title_canon_sha256":"0f48b7bbadddcdc50351b0619e8d5d47a3c406b7b96019f17fc0c1e3fa9cd6aa"},"schema_version":"1.0","source":{"id":"1607.04830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04830","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04830v2","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04830","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"5O4KRS7OHWCB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5O4KRS7OHWCBGSY7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5O4KRS7O","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:68f9b8f875cfdc683e1c44d5b50438fb3524c24b5158668309d6115a8ecc0d06","target":"graph","created_at":"2026-05-18T01:09:11Z","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 consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological complexity of such mixed braid groups. In particular we show that the topological complexity of any subgroup of the n-strand braid group which fixes any two strands is 2n-3, extending a result of Farber and Yuzvinsky in the pure braid case. In addition, we generalise our results to the setting of higher topological complexity.","authors_text":"David Recio-Mitter, Mark Grant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-07-17T06:48:56Z","title":"Topological complexity of subgroups of Artin's braid groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04830","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:bcffde1c9b4b954c97a77f0be0d60cefbad4be45fdc307e1c86247cb86435940","target":"record","created_at":"2026-05-18T01:09:11Z","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":"52c957d84c5160aec361861ed067aabbef05173ef4ea647b382320846f9d1ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-07-17T06:48:56Z","title_canon_sha256":"0f48b7bbadddcdc50351b0619e8d5d47a3c406b7b96019f17fc0c1e3fa9cd6aa"},"schema_version":"1.0","source":{"id":"1607.04830","kind":"arxiv","version":2}},"canonical_sha256":"ebb8a8cbee3d84134b1f38c8799258de8aef84fc6b60b7fe93ffea6723d86db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb8a8cbee3d84134b1f38c8799258de8aef84fc6b60b7fe93ffea6723d86db9","first_computed_at":"2026-05-18T01:09:11.592934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.592934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2bb3xm/M8pQOUUAEY7XwimFc6U3uDFq6ddqtAdD1HbNNBu8vWMmV38TqQztQDJZYckrJ34kNRhwOd7h37LIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.593589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcffde1c9b4b954c97a77f0be0d60cefbad4be45fdc307e1c86247cb86435940","sha256:68f9b8f875cfdc683e1c44d5b50438fb3524c24b5158668309d6115a8ecc0d06"],"state_sha256":"1bc55cd660fda2ec54a78c4f70022ea9be684b1290401ed4ceb72cce25dc1cd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwdG/mJGU+Zzc7uk2wI+R5aGE3IZNEw+TBZJ+H3pssrmSvH3zPeqEQhSLThJPhocdo/ctN+cl153LfpH2ldLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:04:48.688212Z","bundle_sha256":"fa2b071fb4e0ec45cf56c915d54929e2b427a992b87fae9713b4be9abd62d111"}}