{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4EYCBFREBAULXPWSL4E3DKJTOS","short_pith_number":"pith:4EYCBFRE","schema_version":"1.0","canonical_sha256":"e1302096240828bbbed25f09b1a93374b5f0ae6a6ba95e5dd8aef92bb69209ee","source":{"kind":"arxiv","id":"0712.1228","version":1},"attestation_state":"computed","paper":{"title":"Superinduction for pattern groups","license":"","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.RT","authors_text":"Eric Marberg, Nathaniel Thiem","submitted_at":"2007-12-07T21:57:29Z","abstract_excerpt":"It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one obtains a rich combinatorial theory analogous to that of the symmetric group, where we replace partition combinatorics with set-partitions. This paper studies Diaconis--Isaacs' concept of superinduction in pattern groups. While superinduction shares many desirable properties with usual induction, it no longer takes characters to characters. We begin by findi"},"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":"0712.1228","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.RT","submitted_at":"2007-12-07T21:57:29Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"72c9cc088a818d2cdb77b05c29aab2059d2a11e5fcb504202a4c92bc155a71c3","abstract_canon_sha256":"92aa4030703e4998265f36a6c87d629f023ef291c0f7a6a75c6a7171a38dd386"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:39.386187Z","signature_b64":"NpN2ocj4mv1x5IPbIK/Q2ozRXs6q2EDqdTwAPsRKt/hVwpzkKYmxNGnxKT1qRWP1iO3T6ADT30GmNHTUiGxbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1302096240828bbbed25f09b1a93374b5f0ae6a6ba95e5dd8aef92bb69209ee","last_reissued_at":"2026-05-18T04:25:39.385566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:39.385566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superinduction for pattern groups","license":"","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.RT","authors_text":"Eric Marberg, Nathaniel Thiem","submitted_at":"2007-12-07T21:57:29Z","abstract_excerpt":"It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one obtains a rich combinatorial theory analogous to that of the symmetric group, where we replace partition combinatorics with set-partitions. This paper studies Diaconis--Isaacs' concept of superinduction in pattern groups. While superinduction shares many desirable properties with usual induction, it no longer takes characters to characters. We begin by findi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1228","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":"0712.1228","created_at":"2026-05-18T04:25:39.385658+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.1228v1","created_at":"2026-05-18T04:25:39.385658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.1228","created_at":"2026-05-18T04:25:39.385658+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EYCBFREBAUL","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EYCBFREBAULXPWS","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EYCBFRE","created_at":"2026-05-18T12:25:54.717736+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/4EYCBFREBAULXPWSL4E3DKJTOS","json":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS.json","graph_json":"https://pith.science/api/pith-number/4EYCBFREBAULXPWSL4E3DKJTOS/graph.json","events_json":"https://pith.science/api/pith-number/4EYCBFREBAULXPWSL4E3DKJTOS/events.json","paper":"https://pith.science/paper/4EYCBFRE"},"agent_actions":{"view_html":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS","download_json":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS.json","view_paper":"https://pith.science/paper/4EYCBFRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.1228&json=true","fetch_graph":"https://pith.science/api/pith-number/4EYCBFREBAULXPWSL4E3DKJTOS/graph.json","fetch_events":"https://pith.science/api/pith-number/4EYCBFREBAULXPWSL4E3DKJTOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS/action/storage_attestation","attest_author":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS/action/author_attestation","sign_citation":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS/action/citation_signature","submit_replication":"https://pith.science/pith/4EYCBFREBAULXPWSL4E3DKJTOS/action/replication_record"}},"created_at":"2026-05-18T04:25:39.385658+00:00","updated_at":"2026-05-18T04:25:39.385658+00:00"}