{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZDHQNN2MTPF33N2S4MT4KS2GGY","short_pith_number":"pith:ZDHQNN2M","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"},"canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","source":{"kind":"arxiv","id":"1104.1668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1668","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1668v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1668","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZDHQNN2MTPF3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZDHQNN2MTPF33N2S","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZDHQNN2M","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZDHQNN2MTPF33N2S4MT4KS2GGY","target":"record","payload":{"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"},"canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","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"},"source_kind":"arxiv","source_id":"1104.1668","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAU06c8/7UKYGkS5bCePfBTViW2iCvWl0MtzNOhZ5Mp6/DxDGAz7jNxbuYr6IAD2T0KiQxfWHKsojTlDfcdjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:17.014773Z"},"content_sha256":"4c2b5bc556ffb071735e587bc4435a19d1a3dc5ad64a6f787fd0fb3699405a4f","schema_version":"1.0","event_id":"sha256:4c2b5bc556ffb071735e587bc4435a19d1a3dc5ad64a6f787fd0fb3699405a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZDHQNN2MTPF33N2S4MT4KS2GGY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7XMhGc96kWb5qVlsUP/8oN4Zmv5VN0LpFRGC6+UsfRUyi8bAIjMqAQ9Nqx9q1FWG/HtyGPsLsQ+6TKDY58GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:17.015571Z"},"content_sha256":"bb6b23ad8db532f35d1b68df8d7efa922cac591ac0e15a137d8d37c93a3e9063","schema_version":"1.0","event_id":"sha256:bb6b23ad8db532f35d1b68df8d7efa922cac591ac0e15a137d8d37c93a3e9063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/bundle.json","state_url":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T07:32:17Z","links":{"resolver":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY","bundle":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/bundle.json","state":"https://pith.science/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDHQNN2MTPF33N2S4MT4KS2GGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZDHQNN2MTPF33N2S4MT4KS2GGY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1fcd117700161f24c7890f285a08512a63ee0f2e930cbcc4182b4dac28425f45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-04-09T03:25:42Z","title_canon_sha256":"55888c6a58bdb3d6fd23cb78844131d27a37bab2f0d2c40d59ab628d512bdb07"},"schema_version":"1.0","source":{"id":"1104.1668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1668","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1668v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1668","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZDHQNN2MTPF3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZDHQNN2MTPF33N2S","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZDHQNN2M","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:bb6b23ad8db532f35d1b68df8d7efa922cac591ac0e15a137d8d37c93a3e9063","target":"graph","created_at":"2026-05-18T04:24:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ian M. Musson, Vera V. Serganova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-04-09T03:25:42Z","title":"Combinatorics of Character Formulas for the Lie Superalgebra $\\fgl(m,n).$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1668","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4c2b5bc556ffb071735e587bc4435a19d1a3dc5ad64a6f787fd0fb3699405a4f","target":"record","created_at":"2026-05-18T04:24:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1fcd117700161f24c7890f285a08512a63ee0f2e930cbcc4182b4dac28425f45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-04-09T03:25:42Z","title_canon_sha256":"55888c6a58bdb3d6fd23cb78844131d27a37bab2f0d2c40d59ab628d512bdb07"},"schema_version":"1.0","source":{"id":"1104.1668","kind":"arxiv","version":1}},"canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8cf06b74c9bcbbdb752e327c54b46362419eadb5f65adaa63c6d90426987fb0","first_computed_at":"2026-05-18T04:24:43.393299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:43.393299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yw19WvZ51wI2RmYj6iyEJvsZRSdaxcX6IHilJB81TqQBGYdtI9zjzHkiL7jAVsNxcWPLELlrDv8iU/dxHKfxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:43.393675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c2b5bc556ffb071735e587bc4435a19d1a3dc5ad64a6f787fd0fb3699405a4f","sha256:bb6b23ad8db532f35d1b68df8d7efa922cac591ac0e15a137d8d37c93a3e9063"],"state_sha256":"8f51531b30f5ee9b6f72a33d6cffb95dd79a14dc6ba933df796d4eed2cabd767"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTyuQPx6PBJoaPZgkmhaLoXbDoY22rR8f9QYhKZM1PecWK3BzMYXTJxyPuwkspcwoKJT1Wio00O5qDgs5SmvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:32:17.019872Z","bundle_sha256":"507f0513235a6ca475e9778a4ed76d4be68e731c910af054859543c42c23b695"}}