{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HMDEOQJLZOK2KGMJBPQCRAANOW","short_pith_number":"pith:HMDEOQJL","schema_version":"1.0","canonical_sha256":"3b0647412bcb95a519890be028800d759308b854a437e82622f2c9909ece61fb","source":{"kind":"arxiv","id":"1507.03248","version":4},"attestation_state":"computed","paper":{"title":"The Relaxation Normal Form of Braids is Regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Vincent Jug\\'e","submitted_at":"2015-07-12T16:46:48Z","abstract_excerpt":"Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.03248","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-12T16:46:48Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"4565d1f1ac40781684f5e2bbe356a0c9f368c9fff63d16d4eea2b048d7d017d0","abstract_canon_sha256":"56c6757322cf950f82578a82a25b61dc662b2c1260bebff1fc07bc68786adfeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:04.441485Z","signature_b64":"OJvRU5Vo+YPEo3E92L4HitrvJ8sVA2mFnADjYMkOdS36OfZMnbSEy/tVsyiEJDUFJYBHjixrG1pIR8NvrJWgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0647412bcb95a519890be028800d759308b854a437e82622f2c9909ece61fb","last_reissued_at":"2026-05-18T00:33:04.440873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:04.440873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Relaxation Normal Form of Braids is Regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Vincent Jug\\'e","submitted_at":"2015-07-12T16:46:48Z","abstract_excerpt":"Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03248","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.03248","created_at":"2026-05-18T00:33:04.440965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03248v4","created_at":"2026-05-18T00:33:04.440965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03248","created_at":"2026-05-18T00:33:04.440965+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMDEOQJLZOK2","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMDEOQJLZOK2KGMJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMDEOQJL","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW","json":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW.json","graph_json":"https://pith.science/api/pith-number/HMDEOQJLZOK2KGMJBPQCRAANOW/graph.json","events_json":"https://pith.science/api/pith-number/HMDEOQJLZOK2KGMJBPQCRAANOW/events.json","paper":"https://pith.science/paper/HMDEOQJL"},"agent_actions":{"view_html":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW","download_json":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW.json","view_paper":"https://pith.science/paper/HMDEOQJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03248&json=true","fetch_graph":"https://pith.science/api/pith-number/HMDEOQJLZOK2KGMJBPQCRAANOW/graph.json","fetch_events":"https://pith.science/api/pith-number/HMDEOQJLZOK2KGMJBPQCRAANOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW/action/storage_attestation","attest_author":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW/action/author_attestation","sign_citation":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW/action/citation_signature","submit_replication":"https://pith.science/pith/HMDEOQJLZOK2KGMJBPQCRAANOW/action/replication_record"}},"created_at":"2026-05-18T00:33:04.440965+00:00","updated_at":"2026-05-18T00:33:04.440965+00:00"}