{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3E2JC5QRYNFKCZG3RM2VWGDFPI","short_pith_number":"pith:3E2JC5QR","schema_version":"1.0","canonical_sha256":"d934917611c34aa164db8b355b18657a241ff128ad5e5dff99b160f06342c84c","source":{"kind":"arxiv","id":"1406.1653","version":1},"attestation_state":"computed","paper":{"title":"Irreducible characters of the symmetric group and exponential growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Antonio Giambruno, Sergey Mishchenko","submitted_at":"2014-06-06T11:48:27Z","abstract_excerpt":"We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound."},"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":"1406.1653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T11:48:27Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"419c439014bac0ef0aee3e2e66814e4fa7bac7611c2e4e101098216fda358092","abstract_canon_sha256":"221cb66e30d8327579342c9ee124f4b450b053113f953bb7cb0245eeba364638"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:14.274690Z","signature_b64":"dTp89DFASs1RJzUZbxj5zvHdBhsEHUUis579jXkVv2bBP10gleffumTUZa5IUXx8eEB1MKoCcMtB9Zhm3U4gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d934917611c34aa164db8b355b18657a241ff128ad5e5dff99b160f06342c84c","last_reissued_at":"2026-05-18T02:50:14.273876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:14.273876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreducible characters of the symmetric group and exponential growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Antonio Giambruno, Sergey Mishchenko","submitted_at":"2014-06-06T11:48:27Z","abstract_excerpt":"We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1653","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":"1406.1653","created_at":"2026-05-18T02:50:14.274017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1653v1","created_at":"2026-05-18T02:50:14.274017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1653","created_at":"2026-05-18T02:50:14.274017+00:00"},{"alias_kind":"pith_short_12","alias_value":"3E2JC5QRYNFK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3E2JC5QRYNFKCZG3","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3E2JC5QR","created_at":"2026-05-18T12:28:11.866339+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/3E2JC5QRYNFKCZG3RM2VWGDFPI","json":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI.json","graph_json":"https://pith.science/api/pith-number/3E2JC5QRYNFKCZG3RM2VWGDFPI/graph.json","events_json":"https://pith.science/api/pith-number/3E2JC5QRYNFKCZG3RM2VWGDFPI/events.json","paper":"https://pith.science/paper/3E2JC5QR"},"agent_actions":{"view_html":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI","download_json":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI.json","view_paper":"https://pith.science/paper/3E2JC5QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1653&json=true","fetch_graph":"https://pith.science/api/pith-number/3E2JC5QRYNFKCZG3RM2VWGDFPI/graph.json","fetch_events":"https://pith.science/api/pith-number/3E2JC5QRYNFKCZG3RM2VWGDFPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI/action/storage_attestation","attest_author":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI/action/author_attestation","sign_citation":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI/action/citation_signature","submit_replication":"https://pith.science/pith/3E2JC5QRYNFKCZG3RM2VWGDFPI/action/replication_record"}},"created_at":"2026-05-18T02:50:14.274017+00:00","updated_at":"2026-05-18T02:50:14.274017+00:00"}