{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CD5WMLRF7OPCKUOSOJLFSO4JHL","short_pith_number":"pith:CD5WMLRF","canonical_record":{"source":{"id":"1112.5485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-22T22:51:52Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1b13d7fed7dce655edd2d8ed07781982ccf31d76d03e8ebe31bbf977223814d6","abstract_canon_sha256":"8cd28694463780aea1e04c9b0c496f492ce0dda103030dc773951331ef247e48"},"schema_version":"1.0"},"canonical_sha256":"10fb662e25fb9e2551d27256593b893aca6b5c259bc1956e415d8ba86172b9b1","source":{"kind":"arxiv","id":"1112.5485","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5485","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5485v3","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5485","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"CD5WMLRF7OPC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CD5WMLRF7OPCKUOS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CD5WMLRF","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CD5WMLRF7OPCKUOSOJLFSO4JHL","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-22T22:51:52Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1b13d7fed7dce655edd2d8ed07781982ccf31d76d03e8ebe31bbf977223814d6","abstract_canon_sha256":"8cd28694463780aea1e04c9b0c496f492ce0dda103030dc773951331ef247e48"},"schema_version":"1.0"},"canonical_sha256":"10fb662e25fb9e2551d27256593b893aca6b5c259bc1956e415d8ba86172b9b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:25.565474Z","signature_b64":"wXvlcBplYftXy9YSPM7iSRaBjauxq02qjKuvc8tuL0U6zcCC4bd1Xr1XQAr8M/idzTag8tCgkwOXfEqkaZJBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10fb662e25fb9e2551d27256593b893aca6b5c259bc1956e415d8ba86172b9b1","last_reissued_at":"2026-05-18T03:50:25.564525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:25.564525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5485","source_version":3,"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-18T03:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4Y6HkB6ODECIPuz1nVN3FVii3spHK0gaFUC3KLMGVdhQc7Ew7bqDvS6ubMNGEl6Th6YxRYoVuW0Lxc7V97MBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:51:05.419818Z"},"content_sha256":"7785cdb38d55444835f9daa8473d99228299bd5cac0529eff1e3005093867332","schema_version":"1.0","event_id":"sha256:7785cdb38d55444835f9daa8473d99228299bd5cac0529eff1e3005093867332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CD5WMLRF7OPCKUOSOJLFSO4JHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating random braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.GR","authors_text":"Juan Gonz\\'alez-Meneses, Volker Gebhardt","submitted_at":"2011-12-22T22:51:52Z","abstract_excerpt":"We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids.\n  As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the minimal possible number of states, and we prove that its number of states is exponential in the number of strands."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5485","kind":"arxiv","version":3},"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-18T03:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ie+6zJ18wYY0Ti72uY4duTujK+5lU2yQL3ccWEsdm4GEnWrdVQdLouoJ+veFbudjo9vIbJlLOEY8QrMfRfcGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:51:05.420184Z"},"content_sha256":"5c008477da0127bc4502926e7682249e8ccf759e77a505489534d8ec2e76d5db","schema_version":"1.0","event_id":"sha256:5c008477da0127bc4502926e7682249e8ccf759e77a505489534d8ec2e76d5db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/bundle.json","state_url":"https://pith.science/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/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-02T04:51:05Z","links":{"resolver":"https://pith.science/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL","bundle":"https://pith.science/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/bundle.json","state":"https://pith.science/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CD5WMLRF7OPCKUOSOJLFSO4JHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CD5WMLRF7OPCKUOSOJLFSO4JHL","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":"8cd28694463780aea1e04c9b0c496f492ce0dda103030dc773951331ef247e48","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-22T22:51:52Z","title_canon_sha256":"1b13d7fed7dce655edd2d8ed07781982ccf31d76d03e8ebe31bbf977223814d6"},"schema_version":"1.0","source":{"id":"1112.5485","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5485","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5485v3","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5485","created_at":"2026-05-18T03:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"CD5WMLRF7OPC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CD5WMLRF7OPCKUOS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CD5WMLRF","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:5c008477da0127bc4502926e7682249e8ccf759e77a505489534d8ec2e76d5db","target":"graph","created_at":"2026-05-18T03:50:25Z","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 present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids.\n  As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the minimal possible number of states, and we prove that its number of states is exponential in the number of strands.","authors_text":"Juan Gonz\\'alez-Meneses, Volker Gebhardt","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-22T22:51:52Z","title":"Generating random braids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5485","kind":"arxiv","version":3},"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:7785cdb38d55444835f9daa8473d99228299bd5cac0529eff1e3005093867332","target":"record","created_at":"2026-05-18T03:50:25Z","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":"8cd28694463780aea1e04c9b0c496f492ce0dda103030dc773951331ef247e48","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-22T22:51:52Z","title_canon_sha256":"1b13d7fed7dce655edd2d8ed07781982ccf31d76d03e8ebe31bbf977223814d6"},"schema_version":"1.0","source":{"id":"1112.5485","kind":"arxiv","version":3}},"canonical_sha256":"10fb662e25fb9e2551d27256593b893aca6b5c259bc1956e415d8ba86172b9b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10fb662e25fb9e2551d27256593b893aca6b5c259bc1956e415d8ba86172b9b1","first_computed_at":"2026-05-18T03:50:25.564525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:25.564525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXvlcBplYftXy9YSPM7iSRaBjauxq02qjKuvc8tuL0U6zcCC4bd1Xr1XQAr8M/idzTag8tCgkwOXfEqkaZJBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:25.565474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5485","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7785cdb38d55444835f9daa8473d99228299bd5cac0529eff1e3005093867332","sha256:5c008477da0127bc4502926e7682249e8ccf759e77a505489534d8ec2e76d5db"],"state_sha256":"92bdb9fd9e76843e8ff1c6a2bcef5baf33397a825213d657c304187c9ccd0c16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XStLG8+JwRsXWxAKq7fr5z8IyrmkHTQMgQ0+RtJkwnV0hu0hKNUvCxcNf9mt3VjRhVsfy5EO3OagvN8Ydh/eAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:51:05.422154Z","bundle_sha256":"bfffb1770d2218cb7fbbf33eda22850f419deafc347c123eaf5e54ceda75eec2"}}