{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZDHQNN2MTPF33N2S4MT4KS2GGY","short_pith_number":"pith:ZDHQNN2M","schema_version":"1.0","canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","source":{"kind":"arxiv","id":"1104.1668","version":1},"attestation_state":"computed","paper":{"title":"Combinatorics of Character Formulas for the Lie Superalgebra $\\fgl(m,n).$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Ian M. Musson, Vera V. Serganova","submitted_at":"2011-04-09T03:25:42Z","abstract_excerpt":"Let $\\fg$ be the Lie superalgebra $\\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\\fg$ were given by the second author in 1996, and by J. Brundan in 2003.\n  We give a combinatorial proof of the equivalence between the two algorithms. The proof uses weight and cap diagrams introduced by Brundan and C. Stroppel, and cancelations between paths in a graph $\\mathcal{G}$ defined using these diagrams. Each vertex of $\\mathcal{G}$ corresponds to a highest weight of a finite dimensional simple module, and each edge is weighted by a nonnegative intege"},"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":"1104.1668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-04-09T03:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"55888c6a58bdb3d6fd23cb78844131d27a37bab2f0d2c40d59ab628d512bdb07","abstract_canon_sha256":"1fcd117700161f24c7890f285a08512a63ee0f2e930cbcc4182b4dac28425f45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:43.393675Z","signature_b64":"Yw19WvZ51wI2RmYj6iyEJvsZRSdaxcX6IHilJB81TqQBGYdtI9zjzHkiL7jAVsNxcWPLELlrDv8iU/dxHKfxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","last_reissued_at":"2026-05-18T04:24:43.393299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:43.393299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorics of Character Formulas for the Lie Superalgebra $\\fgl(m,n).$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Ian M. Musson, Vera V. Serganova","submitted_at":"2011-04-09T03:25:42Z","abstract_excerpt":"Let $\\fg$ be the Lie superalgebra $\\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\\fg$ were given by the second author in 1996, and by J. Brundan in 2003.\n  We give a combinatorial proof of the equivalence between the two algorithms. The proof uses weight and cap diagrams introduced by Brundan and C. Stroppel, and cancelations between paths in a graph $\\mathcal{G}$ defined using these diagrams. Each vertex of $\\mathcal{G}$ corresponds to a highest weight of a finite dimensional simple module, and each edge is weighted by a nonnegative intege"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1668","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":"1104.1668","created_at":"2026-05-18T04:24:43.393362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1668v1","created_at":"2026-05-18T04:24:43.393362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1668","created_at":"2026-05-18T04:24:43.393362+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDHQNN2MTPF3","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDHQNN2MTPF33N2S","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDHQNN2M","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/ZDHQNN2MTPF33N2S4MT4KS2GGY","json":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY.json","graph_json":"https://pith.science/api/pith-number/ZDHQNN2MTPF33N2S4MT4KS2GGY/graph.json","events_json":"https://pith.science/api/pith-number/ZDHQNN2MTPF33N2S4MT4KS2GGY/events.json","paper":"https://pith.science/paper/ZDHQNN2M"},"agent_actions":{"view_html":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY","download_json":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY.json","view_paper":"https://pith.science/paper/ZDHQNN2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1668&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDHQNN2MTPF33N2S4MT4KS2GGY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDHQNN2MTPF33N2S4MT4KS2GGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/action/storage_attestation","attest_author":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/action/author_attestation","sign_citation":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/action/citation_signature","submit_replication":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/action/replication_record"}},"created_at":"2026-05-18T04:24:43.393362+00:00","updated_at":"2026-05-18T04:24:43.393362+00:00"}