{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B2P47LDH3BPTF7JYH5GLONINO3","short_pith_number":"pith:B2P47LDH","schema_version":"1.0","canonical_sha256":"0e9fcfac67d85f32fd383f4cb7350d76d9bbaacdb3ac379f8a95dd2deb2fa7af","source":{"kind":"arxiv","id":"1801.06692","version":1},"attestation_state":"computed","paper":{"title":"Primitive ideals of ${\\rm U}(\\frak{sl}(\\infty))$ and the Robinson-Schensted algorithm at infinity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.RA"],"primary_cat":"math.RT","authors_text":"Alexey Petukhov, Ivan Penkov","submitted_at":"2018-01-20T15:57:17Z","abstract_excerpt":"We present an algorithm which computes the annihilator in ${\\rm U}(\\frak{sl}(\\infty))$ of any simple highest weight $\\frak{sl}(\\infty)$-module $L_\\frak b(\\lambda)$. This algorithm is based on an infinite version of the Robinson-Schensted algorithm."},"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":"1801.06692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2018-01-20T15:57:17Z","cross_cats_sorted":["math.CO","math.RA"],"title_canon_sha256":"0ee3cb8535ba4d23993251d6ad0be54a72f9b9b01cd43fb7de109cc7ee34684d","abstract_canon_sha256":"3390d5db782e79da3369758dfc991c598406fc0cc4ea1360b7a25be91c7ef5a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:03.676504Z","signature_b64":"a99r8X7+8KFEgLZlzSBDXfa2FLbHttYNZK5ISvlQiAic/Ev/PsyheFZyZl4MLWYBe2IJAvxKDBHSeiG88p7VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9fcfac67d85f32fd383f4cb7350d76d9bbaacdb3ac379f8a95dd2deb2fa7af","last_reissued_at":"2026-05-18T00:25:03.676041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:03.676041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitive ideals of ${\\rm U}(\\frak{sl}(\\infty))$ and the Robinson-Schensted algorithm at infinity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.RA"],"primary_cat":"math.RT","authors_text":"Alexey Petukhov, Ivan Penkov","submitted_at":"2018-01-20T15:57:17Z","abstract_excerpt":"We present an algorithm which computes the annihilator in ${\\rm U}(\\frak{sl}(\\infty))$ of any simple highest weight $\\frak{sl}(\\infty)$-module $L_\\frak b(\\lambda)$. This algorithm is based on an infinite version of the Robinson-Schensted algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06692","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":"1801.06692","created_at":"2026-05-18T00:25:03.676113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06692v1","created_at":"2026-05-18T00:25:03.676113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06692","created_at":"2026-05-18T00:25:03.676113+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2P47LDH3BPT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2P47LDH3BPTF7JY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2P47LDH","created_at":"2026-05-18T12:32:13.499390+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/B2P47LDH3BPTF7JYH5GLONINO3","json":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3.json","graph_json":"https://pith.science/api/pith-number/B2P47LDH3BPTF7JYH5GLONINO3/graph.json","events_json":"https://pith.science/api/pith-number/B2P47LDH3BPTF7JYH5GLONINO3/events.json","paper":"https://pith.science/paper/B2P47LDH"},"agent_actions":{"view_html":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3","download_json":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3.json","view_paper":"https://pith.science/paper/B2P47LDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06692&json=true","fetch_graph":"https://pith.science/api/pith-number/B2P47LDH3BPTF7JYH5GLONINO3/graph.json","fetch_events":"https://pith.science/api/pith-number/B2P47LDH3BPTF7JYH5GLONINO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3/action/storage_attestation","attest_author":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3/action/author_attestation","sign_citation":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3/action/citation_signature","submit_replication":"https://pith.science/pith/B2P47LDH3BPTF7JYH5GLONINO3/action/replication_record"}},"created_at":"2026-05-18T00:25:03.676113+00:00","updated_at":"2026-05-18T00:25:03.676113+00:00"}