{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YBCQJ7L6JNEQLVUV65BWZQHHW7","short_pith_number":"pith:YBCQJ7L6","schema_version":"1.0","canonical_sha256":"c04504fd7e4b4905d695f7436cc0e7b7e0b950a0d47f1c7ed65832a952dd77e4","source":{"kind":"arxiv","id":"1108.3128","version":1},"attestation_state":"computed","paper":{"title":"The complexity of the Lie module","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Kai Meng Tan, Karin Erdmann, Kay Jin Lim","submitted_at":"2011-08-16T00:24:26Z","abstract_excerpt":"We show that the complexity of the Lie module $\\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $p^m$ is the largest $p$-power dividing $n$ and, if $n$ is not a $p$-power, is equal to the maximum of the complexities of $\\Lie(p^i)$ for $1 \\leq i \\leq m$."},"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":"1108.3128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-08-16T00:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a0e7d3bd15475ff196d11e6f3e7e7de4c146289e05220ff22aa46c5210d6f3e","abstract_canon_sha256":"b7fb172c45033ab52d8cef38cd0b22d942a2e59f95b9fc6175e6973554fb9b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:27.901723Z","signature_b64":"ZLu5bYD+DnZhRx3DxHJBW0kSvXWPCDdXReQVqs3OQXH8KKGPiC2Z4dvgNxLQlw5ESnWV+teb121w05Mssj+eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c04504fd7e4b4905d695f7436cc0e7b7e0b950a0d47f1c7ed65832a952dd77e4","last_reissued_at":"2026-05-18T04:15:27.901301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:27.901301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of the Lie module","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Kai Meng Tan, Karin Erdmann, Kay Jin Lim","submitted_at":"2011-08-16T00:24:26Z","abstract_excerpt":"We show that the complexity of the Lie module $\\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $p^m$ is the largest $p$-power dividing $n$ and, if $n$ is not a $p$-power, is equal to the maximum of the complexities of $\\Lie(p^i)$ for $1 \\leq i \\leq m$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3128","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":"1108.3128","created_at":"2026-05-18T04:15:27.901387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3128v1","created_at":"2026-05-18T04:15:27.901387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3128","created_at":"2026-05-18T04:15:27.901387+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBCQJ7L6JNEQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBCQJ7L6JNEQLVUV","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBCQJ7L6","created_at":"2026-05-18T12:26:47.523578+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/YBCQJ7L6JNEQLVUV65BWZQHHW7","json":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7.json","graph_json":"https://pith.science/api/pith-number/YBCQJ7L6JNEQLVUV65BWZQHHW7/graph.json","events_json":"https://pith.science/api/pith-number/YBCQJ7L6JNEQLVUV65BWZQHHW7/events.json","paper":"https://pith.science/paper/YBCQJ7L6"},"agent_actions":{"view_html":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7","download_json":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7.json","view_paper":"https://pith.science/paper/YBCQJ7L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3128&json=true","fetch_graph":"https://pith.science/api/pith-number/YBCQJ7L6JNEQLVUV65BWZQHHW7/graph.json","fetch_events":"https://pith.science/api/pith-number/YBCQJ7L6JNEQLVUV65BWZQHHW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7/action/storage_attestation","attest_author":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7/action/author_attestation","sign_citation":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7/action/citation_signature","submit_replication":"https://pith.science/pith/YBCQJ7L6JNEQLVUV65BWZQHHW7/action/replication_record"}},"created_at":"2026-05-18T04:15:27.901387+00:00","updated_at":"2026-05-18T04:15:27.901387+00:00"}