{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TKCSH3K2D73HYTO52EQL6OOAIE","short_pith_number":"pith:TKCSH3K2","schema_version":"1.0","canonical_sha256":"9a8523ed5a1ff67c4dddd120bf39c0411be805f368649e18dffa0a35809e2f78","source":{"kind":"arxiv","id":"2109.02815","version":2},"attestation_state":"computed","paper":{"title":"The planar pure braid group is a diagram group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Daniel S. Farley","submitted_at":"2021-09-07T01:59:03Z","abstract_excerpt":"A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\\ell_{1}$ to a point on a horizontal line $\\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed to cross, but no threefold intersections are allowed. The set $\\Gamma_{n}$ of all planar pure braids on $n$ strands is a group with respect to a natural stacking operation.\n  We show that $\\Gamma_{n}$ is always a diagram group, in the sense of Guba and Sapir. A number of consequences follow, including biautomaticity and bi-orderability of the groups $\\Gamma_{"},"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":"2109.02815","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2021-09-07T01:59:03Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"524be64d063881040b2a516eddbfb3f8669a16efc0cfb1c530e69751f9c3476b","abstract_canon_sha256":"705281b21da3b677501c6ac68fd58c861ea6d06d014acab95a04d3efeb31d1a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:05.904881Z","signature_b64":"GgzepL+i7P3BH+aStOBRsWT1hxc649QvcfFfCovNAJ0tYBQRixkPqQsCa/yaEOCP9Xk2OtuZ7qDcoRFTTZwVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8523ed5a1ff67c4dddd120bf39c0411be805f368649e18dffa0a35809e2f78","last_reissued_at":"2026-07-05T03:13:05.904494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:05.904494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The planar pure braid group is a diagram group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Daniel S. Farley","submitted_at":"2021-09-07T01:59:03Z","abstract_excerpt":"A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\\ell_{1}$ to a point on a horizontal line $\\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed to cross, but no threefold intersections are allowed. The set $\\Gamma_{n}$ of all planar pure braids on $n$ strands is a group with respect to a natural stacking operation.\n  We show that $\\Gamma_{n}$ is always a diagram group, in the sense of Guba and Sapir. A number of consequences follow, including biautomaticity and bi-orderability of the groups $\\Gamma_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02815","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.02815/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.02815","created_at":"2026-07-05T03:13:05.904549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.02815v2","created_at":"2026-07-05T03:13:05.904549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02815","created_at":"2026-07-05T03:13:05.904549+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKCSH3K2D73H","created_at":"2026-07-05T03:13:05.904549+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKCSH3K2D73HYTO5","created_at":"2026-07-05T03:13:05.904549+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKCSH3K2","created_at":"2026-07-05T03:13:05.904549+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16270","citing_title":"Combinatorics of affine cactus groups","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE","json":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE.json","graph_json":"https://pith.science/api/pith-number/TKCSH3K2D73HYTO52EQL6OOAIE/graph.json","events_json":"https://pith.science/api/pith-number/TKCSH3K2D73HYTO52EQL6OOAIE/events.json","paper":"https://pith.science/paper/TKCSH3K2"},"agent_actions":{"view_html":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE","download_json":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE.json","view_paper":"https://pith.science/paper/TKCSH3K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.02815&json=true","fetch_graph":"https://pith.science/api/pith-number/TKCSH3K2D73HYTO52EQL6OOAIE/graph.json","fetch_events":"https://pith.science/api/pith-number/TKCSH3K2D73HYTO52EQL6OOAIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE/action/storage_attestation","attest_author":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE/action/author_attestation","sign_citation":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE/action/citation_signature","submit_replication":"https://pith.science/pith/TKCSH3K2D73HYTO52EQL6OOAIE/action/replication_record"}},"created_at":"2026-07-05T03:13:05.904549+00:00","updated_at":"2026-07-05T03:13:05.904549+00:00"}