{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DUQLPTTZQE5IH4TBOAXR574TWA","short_pith_number":"pith:DUQLPTTZ","canonical_record":{"source":{"id":"1712.01552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-05T10:06:50Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"01bfd3d0669b06af0a8e943dbcb6b83718b716ae6aea4a9afa72340a6740d060","abstract_canon_sha256":"d88a90b0c234a17ace625734e8f1df2bb638f26f9f1d4a24c10842042165d037"},"schema_version":"1.0"},"canonical_sha256":"1d20b7ce79813a83f261702f1eff93b03fad060d558547cf22f3ffd782221bb7","source":{"kind":"arxiv","id":"1712.01552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01552","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01552v1","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01552","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"DUQLPTTZQE5I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUQLPTTZQE5IH4TB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUQLPTTZ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DUQLPTTZQE5IH4TBOAXR574TWA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-05T10:06:50Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"01bfd3d0669b06af0a8e943dbcb6b83718b716ae6aea4a9afa72340a6740d060","abstract_canon_sha256":"d88a90b0c234a17ace625734e8f1df2bb638f26f9f1d4a24c10842042165d037"},"schema_version":"1.0"},"canonical_sha256":"1d20b7ce79813a83f261702f1eff93b03fad060d558547cf22f3ffd782221bb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:50.362797Z","signature_b64":"Dv9W6cxJGxNQ2W+c69RScZvGOcWDaDEvZKNSyc5gl8WGo8m4aBnhv0Zz94/M+xKAyEz5VQkNrxTkpEtaaq56DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d20b7ce79813a83f261702f1eff93b03fad060d558547cf22f3ffd782221bb7","last_reissued_at":"2026-05-18T00:28:50.362101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:50.362101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01552","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:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrrDqJI+Ff7InE+mNJLmebzeF5cZW4RdOb6piBd3TPXONrUmNFzIw7tXEqayL4TQjSnGP10VcE79z3hYQgOzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:12.480619Z"},"content_sha256":"6b9b16ec001e9563200fbddeb96bfceab537be5dd76bb6216bfca356ac82d359","schema_version":"1.0","event_id":"sha256:6b9b16ec001e9563200fbddeb96bfceab537be5dd76bb6216bfca356ac82d359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DUQLPTTZQE5IH4TBOAXR574TWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial braid combing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.GT","authors_text":"Juan Gonz\\'alez-Meneses, Marithania Silvero","submitted_at":"2017-12-05T10:06:50Z","abstract_excerpt":"Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a polynomial algorithm which performs braid combing. This procedure can be applied to braids on surfaces, providing the first algorithm (to our knowledge) which solves the word problem for braid groups on surfaces with boundary in polynomial time and space.\n  In the case of surfaces without boundary, braid combing needs to use a section from the fundamental group of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01552","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:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7dA56InkiWWJIU58LcxfeNQFhc8BUh3AtMqteN1aKTei8+Uq+Rh48N70BjD4dV2MDlNeUWwvq7NCxciT1iuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:12.480958Z"},"content_sha256":"27b5c67281eba3c07a81684639e352e059016f6689ad5e71091872b468c40eb1","schema_version":"1.0","event_id":"sha256:27b5c67281eba3c07a81684639e352e059016f6689ad5e71091872b468c40eb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUQLPTTZQE5IH4TBOAXR574TWA/bundle.json","state_url":"https://pith.science/pith/DUQLPTTZQE5IH4TBOAXR574TWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUQLPTTZQE5IH4TBOAXR574TWA/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-01T17:55:12Z","links":{"resolver":"https://pith.science/pith/DUQLPTTZQE5IH4TBOAXR574TWA","bundle":"https://pith.science/pith/DUQLPTTZQE5IH4TBOAXR574TWA/bundle.json","state":"https://pith.science/pith/DUQLPTTZQE5IH4TBOAXR574TWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUQLPTTZQE5IH4TBOAXR574TWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DUQLPTTZQE5IH4TBOAXR574TWA","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":"d88a90b0c234a17ace625734e8f1df2bb638f26f9f1d4a24c10842042165d037","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-05T10:06:50Z","title_canon_sha256":"01bfd3d0669b06af0a8e943dbcb6b83718b716ae6aea4a9afa72340a6740d060"},"schema_version":"1.0","source":{"id":"1712.01552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01552","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01552v1","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01552","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"DUQLPTTZQE5I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUQLPTTZQE5IH4TB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUQLPTTZ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:27b5c67281eba3c07a81684639e352e059016f6689ad5e71091872b468c40eb1","target":"graph","created_at":"2026-05-18T00:28:50Z","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":"Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a polynomial algorithm which performs braid combing. This procedure can be applied to braids on surfaces, providing the first algorithm (to our knowledge) which solves the word problem for braid groups on surfaces with boundary in polynomial time and space.\n  In the case of surfaces without boundary, braid combing needs to use a section from the fundamental group of th","authors_text":"Juan Gonz\\'alez-Meneses, Marithania Silvero","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-05T10:06:50Z","title":"Polynomial braid combing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01552","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:6b9b16ec001e9563200fbddeb96bfceab537be5dd76bb6216bfca356ac82d359","target":"record","created_at":"2026-05-18T00:28:50Z","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":"d88a90b0c234a17ace625734e8f1df2bb638f26f9f1d4a24c10842042165d037","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-12-05T10:06:50Z","title_canon_sha256":"01bfd3d0669b06af0a8e943dbcb6b83718b716ae6aea4a9afa72340a6740d060"},"schema_version":"1.0","source":{"id":"1712.01552","kind":"arxiv","version":1}},"canonical_sha256":"1d20b7ce79813a83f261702f1eff93b03fad060d558547cf22f3ffd782221bb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d20b7ce79813a83f261702f1eff93b03fad060d558547cf22f3ffd782221bb7","first_computed_at":"2026-05-18T00:28:50.362101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:50.362101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dv9W6cxJGxNQ2W+c69RScZvGOcWDaDEvZKNSyc5gl8WGo8m4aBnhv0Zz94/M+xKAyEz5VQkNrxTkpEtaaq56DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:50.362797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b9b16ec001e9563200fbddeb96bfceab537be5dd76bb6216bfca356ac82d359","sha256:27b5c67281eba3c07a81684639e352e059016f6689ad5e71091872b468c40eb1"],"state_sha256":"103eca375762f2117e28a42cd937f266d5ef4ea84248b5bcc5818ee447ce1eb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBnc8dLSBBZNgznZxku865EP6RXTcg+m/oFnknU6IAvNdKmCs36fvEOu71DbNp9JU7aeHSXHNYlulvDLw+SKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:55:12.482774Z","bundle_sha256":"178721d563c25ef452affdb5ec034e3e249ce6b5eef40275d7d274d5322412dc"}}