{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZTFQ4XCH4GPCILUT6BSR6C4HBC","short_pith_number":"pith:ZTFQ4XCH","schema_version":"1.0","canonical_sha256":"cccb0e5c47e19e242e93f0651f0b8708ae308c8d8e73a0d303a8f5e3ef42cb8b","source":{"kind":"arxiv","id":"2305.11622","version":2},"attestation_state":"computed","paper":{"title":"New Garside structures and applications to Artin groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Jingyin Huang, Thomas Haettel","submitted_at":"2023-05-19T12:02:53Z","abstract_excerpt":"Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\\mathbb{Z}$ into a Garside group, under simple assumptions on $G$. This method gives many new examples of Garside groups, including groups satisfying certain small cancellation condition (including surface groups) and groups with a systolic presentation.\n  Our method also works for a large class of Artin groups, leading to many new group theoretic, geometric and topological "},"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":"2305.11622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2023-05-19T12:02:53Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"bd5a9b741a8dae1fba58ef41630b944c081a71f0c32a038a86a023627ce44b28","abstract_canon_sha256":"ecaefe9754ee36974982fb5f2516018cc59a793fb0c2384afb9a5415d8b049fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:00.551695Z","signature_b64":"Ic2SfmB7txz7TX8EBTBouluMQWVMhHtRZmQawLMeYI/CnDAjwPG4UsZMN1wgaQ5pKsp/279t6IY6RgPcht75AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccb0e5c47e19e242e93f0651f0b8708ae308c8d8e73a0d303a8f5e3ef42cb8b","last_reissued_at":"2026-07-05T09:21:00.551146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:00.551146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Garside structures and applications to Artin groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Jingyin Huang, Thomas Haettel","submitted_at":"2023-05-19T12:02:53Z","abstract_excerpt":"Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\\mathbb{Z}$ into a Garside group, under simple assumptions on $G$. This method gives many new examples of Garside groups, including groups satisfying certain small cancellation condition (including surface groups) and groups with a systolic presentation.\n  Our method also works for a large class of Artin groups, leading to many new group theoretic, geometric and topological "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11622","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/2305.11622/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":"2305.11622","created_at":"2026-07-05T09:21:00.551206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11622v2","created_at":"2026-07-05T09:21:00.551206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11622","created_at":"2026-07-05T09:21:00.551206+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTFQ4XCH4GPC","created_at":"2026-07-05T09:21:00.551206+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTFQ4XCH4GPCILUT","created_at":"2026-07-05T09:21:00.551206+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTFQ4XCH","created_at":"2026-07-05T09:21:00.551206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29837","citing_title":"Weak rank rigidity for groups with a navigable path system","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC","json":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC.json","graph_json":"https://pith.science/api/pith-number/ZTFQ4XCH4GPCILUT6BSR6C4HBC/graph.json","events_json":"https://pith.science/api/pith-number/ZTFQ4XCH4GPCILUT6BSR6C4HBC/events.json","paper":"https://pith.science/paper/ZTFQ4XCH"},"agent_actions":{"view_html":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC","download_json":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC.json","view_paper":"https://pith.science/paper/ZTFQ4XCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11622&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTFQ4XCH4GPCILUT6BSR6C4HBC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTFQ4XCH4GPCILUT6BSR6C4HBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC/action/storage_attestation","attest_author":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC/action/author_attestation","sign_citation":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC/action/citation_signature","submit_replication":"https://pith.science/pith/ZTFQ4XCH4GPCILUT6BSR6C4HBC/action/replication_record"}},"created_at":"2026-07-05T09:21:00.551206+00:00","updated_at":"2026-07-05T09:21:00.551206+00:00"}