{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JJIFXDTY5GPS65GTYXKZB6VOAE","short_pith_number":"pith:JJIFXDTY","canonical_record":{"source":{"id":"1808.02755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-08-08T13:17:19Z","cross_cats_sorted":["math.CO","math.GT"],"title_canon_sha256":"f7bca1ee1d915dbf8e4410afcb909f4e8d03e410e3e8e40f2d1d47d401ad063c","abstract_canon_sha256":"a40bc4d69a76571f2143543f59cbf3c78ed9fe09617b246884ab5aa427cc7a24"},"schema_version":"1.0"},"canonical_sha256":"4a505b8e78e99f2f74d3c5d590faae0123253a923b6792166761d49df891f8dc","source":{"kind":"arxiv","id":"1808.02755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02755","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02755v2","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02755","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"JJIFXDTY5GPS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJIFXDTY5GPS65GT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJIFXDTY","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JJIFXDTY5GPS65GTYXKZB6VOAE","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-08-08T13:17:19Z","cross_cats_sorted":["math.CO","math.GT"],"title_canon_sha256":"f7bca1ee1d915dbf8e4410afcb909f4e8d03e410e3e8e40f2d1d47d401ad063c","abstract_canon_sha256":"a40bc4d69a76571f2143543f59cbf3c78ed9fe09617b246884ab5aa427cc7a24"},"schema_version":"1.0"},"canonical_sha256":"4a505b8e78e99f2f74d3c5d590faae0123253a923b6792166761d49df891f8dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:25.310865Z","signature_b64":"XRdjjThltvAiJXra7IHRudjTNVTUQMvkC4T7a3NTk5OGh3xWVfE6WIBPTDGgTKujxp1bOWd2BuAsD34ikxOSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a505b8e78e99f2f74d3c5d590faae0123253a923b6792166761d49df891f8dc","last_reissued_at":"2026-05-18T00:08:25.310458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:25.310458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02755","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-18T00:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmnpvXn8u37IfEQeDyAEgeD33JfAlafxnmPGsme/K709b9JnSzv7xsueverlcbhqlCJfTFuuGU6+zBsjRSzBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:16:49.265362Z"},"content_sha256":"2ae20111305b08008bada686df8f060386407a3cd9389ec2e3b4ea3bd9dc54cc","schema_version":"1.0","event_id":"sha256:2ae20111305b08008bada686df8f060386407a3cd9389ec2e3b4ea3bd9dc54cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JJIFXDTY5GPS65GTYXKZB6VOAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On lexicographic representatives in braid monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GT"],"primary_cat":"math.GR","authors_text":"Juan Gonz\\'alez-Meneses, Ram\\'on Flores","submitted_at":"2018-08-08T13:17:19Z","abstract_excerpt":"The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic representative finishes with the first generator. This proportion tends to some number $P_{n,1}$, as $k$ tends to infinity, and we show that $P_{n,1}\\geq \\frac{1}{8}$ for every $n\\geq 1$. We also provide an explicit formula, based on the Fibonacci numbers, for the number of states of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02755","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-18T00:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZyjvHL7csHVLg9QSFuw4epRuS1nJtDw5Oprgvh9ijBmNcOoNASMjisS/kakwaNXDLa1fuIhg5mTtE7FsOFiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:16:49.265803Z"},"content_sha256":"13835770d345b42d78462540c5fdfc3e3400d755a2b06993551d73df0e696d1b","schema_version":"1.0","event_id":"sha256:13835770d345b42d78462540c5fdfc3e3400d755a2b06993551d73df0e696d1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/bundle.json","state_url":"https://pith.science/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/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-01T16:16:49Z","links":{"resolver":"https://pith.science/pith/JJIFXDTY5GPS65GTYXKZB6VOAE","bundle":"https://pith.science/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/bundle.json","state":"https://pith.science/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJIFXDTY5GPS65GTYXKZB6VOAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JJIFXDTY5GPS65GTYXKZB6VOAE","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":"a40bc4d69a76571f2143543f59cbf3c78ed9fe09617b246884ab5aa427cc7a24","cross_cats_sorted":["math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-08-08T13:17:19Z","title_canon_sha256":"f7bca1ee1d915dbf8e4410afcb909f4e8d03e410e3e8e40f2d1d47d401ad063c"},"schema_version":"1.0","source":{"id":"1808.02755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02755","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02755v2","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02755","created_at":"2026-05-18T00:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"JJIFXDTY5GPS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJIFXDTY5GPS65GT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJIFXDTY","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:13835770d345b42d78462540c5fdfc3e3400d755a2b06993551d73df0e696d1b","target":"graph","created_at":"2026-05-18T00:08: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":"The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic representative finishes with the first generator. This proportion tends to some number $P_{n,1}$, as $k$ tends to infinity, and we show that $P_{n,1}\\geq \\frac{1}{8}$ for every $n\\geq 1$. We also provide an explicit formula, based on the Fibonacci numbers, for the number of states of t","authors_text":"Juan Gonz\\'alez-Meneses, Ram\\'on Flores","cross_cats":["math.CO","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-08-08T13:17:19Z","title":"On lexicographic representatives in braid monoids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02755","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:2ae20111305b08008bada686df8f060386407a3cd9389ec2e3b4ea3bd9dc54cc","target":"record","created_at":"2026-05-18T00:08: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":"a40bc4d69a76571f2143543f59cbf3c78ed9fe09617b246884ab5aa427cc7a24","cross_cats_sorted":["math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-08-08T13:17:19Z","title_canon_sha256":"f7bca1ee1d915dbf8e4410afcb909f4e8d03e410e3e8e40f2d1d47d401ad063c"},"schema_version":"1.0","source":{"id":"1808.02755","kind":"arxiv","version":2}},"canonical_sha256":"4a505b8e78e99f2f74d3c5d590faae0123253a923b6792166761d49df891f8dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a505b8e78e99f2f74d3c5d590faae0123253a923b6792166761d49df891f8dc","first_computed_at":"2026-05-18T00:08:25.310458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:25.310458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XRdjjThltvAiJXra7IHRudjTNVTUQMvkC4T7a3NTk5OGh3xWVfE6WIBPTDGgTKujxp1bOWd2BuAsD34ikxOSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:25.310865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ae20111305b08008bada686df8f060386407a3cd9389ec2e3b4ea3bd9dc54cc","sha256:13835770d345b42d78462540c5fdfc3e3400d755a2b06993551d73df0e696d1b"],"state_sha256":"81e2aaaded0e153751c50fb012e0dd847627759c561313ad50fbd1f23ae723eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUfrvMeD5HG7fdthzBD4bZOOLe+b2AQO6fJLbHFI1vnDm7UreOSfURS3HHz3FAuJzYce+ePzf+HiyQT+Idq6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:16:49.267755Z","bundle_sha256":"f0927620e31b5f78a1daa17bd6915e3e87b1c7f1d5395a568d3c641f3285fedd"}}