{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:ZPSPW3BSLJXRZYK3GLMHSOYTXE","short_pith_number":"pith:ZPSPW3BS","schema_version":"1.0","canonical_sha256":"cbe4fb6c325a6f1ce15b32d8793b13b91daf492cde78f055c950062ae7c6b8ce","source":{"kind":"arxiv","id":"math/0501075","version":3},"attestation_state":"computed","paper":{"title":"Matching theorems for systems of a finitely generated Coxeter group","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"John Ratcliffe, Michael Mihalik, Steven Tschantz","submitted_at":"2005-01-06T17:21:49Z","abstract_excerpt":"In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for finding a set of Coxeter generators of maximum rank for a finitely generated Coxeter group."},"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":"math/0501075","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2005-01-06T17:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"500463dc6c1e8d17dc33fc822623400afcac43ef1d453625bd9575d27171094a","abstract_canon_sha256":"7facaf7548154b245aceb55179d77e3aa7e4aba04db6a7680104a4154632119e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:32.129808Z","signature_b64":"yMzcEZPSwZJY5Hj0u2SzgxmmiS9TPVQfMnkj9nYxIsYcFINpjVucD8FUJX5Gmxt4wN9CN+P+5kk7eDwnIs5nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe4fb6c325a6f1ce15b32d8793b13b91daf492cde78f055c950062ae7c6b8ce","last_reissued_at":"2026-05-18T02:41:32.129444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:32.129444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching theorems for systems of a finitely generated Coxeter group","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"John Ratcliffe, Michael Mihalik, Steven Tschantz","submitted_at":"2005-01-06T17:21:49Z","abstract_excerpt":"In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for finding a set of Coxeter generators of maximum rank for a finitely generated Coxeter group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0501075","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0501075","created_at":"2026-05-18T02:41:32.129501+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0501075v3","created_at":"2026-05-18T02:41:32.129501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0501075","created_at":"2026-05-18T02:41:32.129501+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPSPW3BSLJXR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPSPW3BSLJXRZYK3","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPSPW3BS","created_at":"2026-05-18T12:25:53.939244+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/ZPSPW3BSLJXRZYK3GLMHSOYTXE","json":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE.json","graph_json":"https://pith.science/api/pith-number/ZPSPW3BSLJXRZYK3GLMHSOYTXE/graph.json","events_json":"https://pith.science/api/pith-number/ZPSPW3BSLJXRZYK3GLMHSOYTXE/events.json","paper":"https://pith.science/paper/ZPSPW3BS"},"agent_actions":{"view_html":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE","download_json":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE.json","view_paper":"https://pith.science/paper/ZPSPW3BS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0501075&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPSPW3BSLJXRZYK3GLMHSOYTXE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPSPW3BSLJXRZYK3GLMHSOYTXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE/action/storage_attestation","attest_author":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE/action/author_attestation","sign_citation":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE/action/citation_signature","submit_replication":"https://pith.science/pith/ZPSPW3BSLJXRZYK3GLMHSOYTXE/action/replication_record"}},"created_at":"2026-05-18T02:41:32.129501+00:00","updated_at":"2026-05-18T02:41:32.129501+00:00"}