{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RGHNHPH4NQTJ5LDUFGF57FU6CE","short_pith_number":"pith:RGHNHPH4","schema_version":"1.0","canonical_sha256":"898ed3bcfc6c269eac74298bdf969e112fbb5a019b803580a69c732eb081b7fb","source":{"kind":"arxiv","id":"1202.3369","version":5},"attestation_state":"computed","paper":{"title":"On the maximum nilpotent orbit intersecting a centralizer in M(n,K)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Roberta Basili","submitted_at":"2012-02-15T17:02:28Z","abstract_excerpt":"To any pair of commuting n x n nilpotent matrices it is associated a pair of partitions of n. We describe a maximal nilpotent subalgebra of the centralizer of a given nilpotent n x n matrix and prove a conjecture of Polona Oblak which consists in an algorithm for the determination of the maximum partition which forms with a given partition a pair with the previous property."},"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":"1202.3369","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2012-02-15T17:02:28Z","cross_cats_sorted":[],"title_canon_sha256":"31f9813dbcda434f8031b7bfbd6868e05ea77d77b5000aee60d380661cc70037","abstract_canon_sha256":"011a80e182952d8c84b8d5ecd606daff24448f97b680969a9a0b73c5c7863841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:45.287750Z","signature_b64":"KUY14uHpcO1DynO0c9ebGPIwUGmQcY5RvHwSG8HcJxjBTRwYlSw3p1RFmhYyjkJ7aTH0zpqsz1UwRYkR9iYMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898ed3bcfc6c269eac74298bdf969e112fbb5a019b803580a69c732eb081b7fb","last_reissued_at":"2026-05-18T02:59:45.286994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:45.286994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum nilpotent orbit intersecting a centralizer in M(n,K)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Roberta Basili","submitted_at":"2012-02-15T17:02:28Z","abstract_excerpt":"To any pair of commuting n x n nilpotent matrices it is associated a pair of partitions of n. We describe a maximal nilpotent subalgebra of the centralizer of a given nilpotent n x n matrix and prove a conjecture of Polona Oblak which consists in an algorithm for the determination of the maximum partition which forms with a given partition a pair with the previous property."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3369","kind":"arxiv","version":5},"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":"1202.3369","created_at":"2026-05-18T02:59:45.287109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3369v5","created_at":"2026-05-18T02:59:45.287109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3369","created_at":"2026-05-18T02:59:45.287109+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGHNHPH4NQTJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGHNHPH4NQTJ5LDU","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGHNHPH4","created_at":"2026-05-18T12:27:20.899486+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/RGHNHPH4NQTJ5LDUFGF57FU6CE","json":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE.json","graph_json":"https://pith.science/api/pith-number/RGHNHPH4NQTJ5LDUFGF57FU6CE/graph.json","events_json":"https://pith.science/api/pith-number/RGHNHPH4NQTJ5LDUFGF57FU6CE/events.json","paper":"https://pith.science/paper/RGHNHPH4"},"agent_actions":{"view_html":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE","download_json":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE.json","view_paper":"https://pith.science/paper/RGHNHPH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3369&json=true","fetch_graph":"https://pith.science/api/pith-number/RGHNHPH4NQTJ5LDUFGF57FU6CE/graph.json","fetch_events":"https://pith.science/api/pith-number/RGHNHPH4NQTJ5LDUFGF57FU6CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE/action/storage_attestation","attest_author":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE/action/author_attestation","sign_citation":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE/action/citation_signature","submit_replication":"https://pith.science/pith/RGHNHPH4NQTJ5LDUFGF57FU6CE/action/replication_record"}},"created_at":"2026-05-18T02:59:45.287109+00:00","updated_at":"2026-05-18T02:59:45.287109+00:00"}