{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NGIOPX3D2BRWWVAI3VDEMVNV4H","short_pith_number":"pith:NGIOPX3D","schema_version":"1.0","canonical_sha256":"6990e7df63d0636b5408dd464655b5e1deb0d4616fbb15211fb12b3f7556f41d","source":{"kind":"arxiv","id":"1804.10943","version":1},"attestation_state":"computed","paper":{"title":"Simplicity of augmentation submodules for transformation monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RA","math.RT"],"primary_cat":"math.CO","authors_text":"B. Steinberg, M.H. Shahzamanian","submitted_at":"2018-04-29T14:35:56Z","abstract_excerpt":"For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite transformation monoids whose augmentation submodules are simple for a field $\\mathbb{F}$ (assuming the answer is known for groups, which is the case for $\\mathbb C$, $\\mathbb R$, and $\\mathbb Q$) and provide many interesting and natural examples such as endomorphism monoids of connected simplicial complexes, posets, and graphs (the latter with simplicial mappings)."},"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":"1804.10943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-29T14:35:56Z","cross_cats_sorted":["math.GR","math.RA","math.RT"],"title_canon_sha256":"1b84b19be4f1fe568029bd8defbee439582bf33bc42d21769dd24d5242d363b7","abstract_canon_sha256":"807c7568e3394e681e2c5b824d0a039d0641aa7afd9be27027f49926c6d2103d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.102192Z","signature_b64":"SSG/+VN+/hA6wrk7PXmv8ICYj+P20eJ4JFIR312pMpxL9yPNI3IyZROOx9Ypzgg7gn8egMrimsUv8shP7RUFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6990e7df63d0636b5408dd464655b5e1deb0d4616fbb15211fb12b3f7556f41d","last_reissued_at":"2026-05-18T00:17:15.101605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.101605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicity of augmentation submodules for transformation monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RA","math.RT"],"primary_cat":"math.CO","authors_text":"B. Steinberg, M.H. Shahzamanian","submitted_at":"2018-04-29T14:35:56Z","abstract_excerpt":"For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite transformation monoids whose augmentation submodules are simple for a field $\\mathbb{F}$ (assuming the answer is known for groups, which is the case for $\\mathbb C$, $\\mathbb R$, and $\\mathbb Q$) and provide many interesting and natural examples such as endomorphism monoids of connected simplicial complexes, posets, and graphs (the latter with simplicial mappings)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10943","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":"1804.10943","created_at":"2026-05-18T00:17:15.101718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10943v1","created_at":"2026-05-18T00:17:15.101718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10943","created_at":"2026-05-18T00:17:15.101718+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGIOPX3D2BRW","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGIOPX3D2BRWWVAI","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGIOPX3D","created_at":"2026-05-18T12:32:40.477152+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/NGIOPX3D2BRWWVAI3VDEMVNV4H","json":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H.json","graph_json":"https://pith.science/api/pith-number/NGIOPX3D2BRWWVAI3VDEMVNV4H/graph.json","events_json":"https://pith.science/api/pith-number/NGIOPX3D2BRWWVAI3VDEMVNV4H/events.json","paper":"https://pith.science/paper/NGIOPX3D"},"agent_actions":{"view_html":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H","download_json":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H.json","view_paper":"https://pith.science/paper/NGIOPX3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10943&json=true","fetch_graph":"https://pith.science/api/pith-number/NGIOPX3D2BRWWVAI3VDEMVNV4H/graph.json","fetch_events":"https://pith.science/api/pith-number/NGIOPX3D2BRWWVAI3VDEMVNV4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H/action/storage_attestation","attest_author":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H/action/author_attestation","sign_citation":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H/action/citation_signature","submit_replication":"https://pith.science/pith/NGIOPX3D2BRWWVAI3VDEMVNV4H/action/replication_record"}},"created_at":"2026-05-18T00:17:15.101718+00:00","updated_at":"2026-05-18T00:17:15.101718+00:00"}