{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DDVXP3A3C6KNWSMVXUEIYGQBVM","short_pith_number":"pith:DDVXP3A3","schema_version":"1.0","canonical_sha256":"18eb77ec1b1794db4995bd088c1a01ab24023f8abee297cd683f3603ad2c37b7","source":{"kind":"arxiv","id":"1507.00411","version":1},"attestation_state":"computed","paper":{"title":"On Higman's $k(U_n(\\mathbb{F}_q))$ conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andrew Soffer, Igor Pak","submitted_at":"2015-07-02T02:24:30Z","abstract_excerpt":"A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\\times n$ matrices over $\\mathbb{F}_q$, is polynomial in $q$, for all $n$. In this paper we present both positive and negative evidence, verifying the conjecture for $n\\le 16$, and suggesting that it probably fails for $n\\ge 59$. The tools are both theoretical and computational. We introduce a new framework for testing Higman's conjecture, which involves recurrence relations for the number of conjugacy classed of \\emph{pattern groups}. These relations are proved by t"},"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.00411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T02:24:30Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"93ac8b5f6bd98e8569d9cad59939a959de370b8f4b525a90c14e6d9637435151","abstract_canon_sha256":"e5be86fde7d0de2a6c37cdad7f2ab8b4b661c00a805b3419f65c279de28b55f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.851668Z","signature_b64":"CSYJKdqorP0Rui3D+hueGhunSYpVXjQn+mk63VOqIWzPFGoeodlP3UFkSpxz9vk6D/ZMgedwxL8n2xHpOda3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18eb77ec1b1794db4995bd088c1a01ab24023f8abee297cd683f3603ad2c37b7","last_reissued_at":"2026-05-18T01:37:24.850860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.850860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Higman's $k(U_n(\\mathbb{F}_q))$ conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andrew Soffer, Igor Pak","submitted_at":"2015-07-02T02:24:30Z","abstract_excerpt":"A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\\times n$ matrices over $\\mathbb{F}_q$, is polynomial in $q$, for all $n$. In this paper we present both positive and negative evidence, verifying the conjecture for $n\\le 16$, and suggesting that it probably fails for $n\\ge 59$. The tools are both theoretical and computational. We introduce a new framework for testing Higman's conjecture, which involves recurrence relations for the number of conjugacy classed of \\emph{pattern groups}. These relations are proved by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00411","kind":"arxiv","version":1},"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.00411","created_at":"2026-05-18T01:37:24.850989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00411v1","created_at":"2026-05-18T01:37:24.850989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00411","created_at":"2026-05-18T01:37:24.850989+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDVXP3A3C6KN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDVXP3A3C6KNWSMV","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDVXP3A3","created_at":"2026-05-18T12:29:17.054201+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/DDVXP3A3C6KNWSMVXUEIYGQBVM","json":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM.json","graph_json":"https://pith.science/api/pith-number/DDVXP3A3C6KNWSMVXUEIYGQBVM/graph.json","events_json":"https://pith.science/api/pith-number/DDVXP3A3C6KNWSMVXUEIYGQBVM/events.json","paper":"https://pith.science/paper/DDVXP3A3"},"agent_actions":{"view_html":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM","download_json":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM.json","view_paper":"https://pith.science/paper/DDVXP3A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00411&json=true","fetch_graph":"https://pith.science/api/pith-number/DDVXP3A3C6KNWSMVXUEIYGQBVM/graph.json","fetch_events":"https://pith.science/api/pith-number/DDVXP3A3C6KNWSMVXUEIYGQBVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM/action/storage_attestation","attest_author":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM/action/author_attestation","sign_citation":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM/action/citation_signature","submit_replication":"https://pith.science/pith/DDVXP3A3C6KNWSMVXUEIYGQBVM/action/replication_record"}},"created_at":"2026-05-18T01:37:24.850989+00:00","updated_at":"2026-05-18T01:37:24.850989+00:00"}