{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5FOR4SCR3SQF3D6E6PA64PRIA5","short_pith_number":"pith:5FOR4SCR","schema_version":"1.0","canonical_sha256":"e95d1e4851dca05d8fc4f3c1ee3e28076b94160893ce8951fb2826730b145157","source":{"kind":"arxiv","id":"1203.3908","version":2},"attestation_state":"computed","paper":{"title":"Normal matrix compressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"John Holbrook, Nishan Mudalige, Rajesh Pereira","submitted_at":"2012-03-18T01:05:26Z","abstract_excerpt":"The recently developed theory of higher--rank numerical ranges originated in problems of error correction in quantum information theory but its mathematical implications now include a quite satisfactory understanding of \\emph{scalar} compressions of complex matrices. Here our aim is to make some first steps in the more general program of understanding \\emph{normal} compressions. We establish some general principles for the program and make a detailed study of rank--two normal compressions."},"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":"1203.3908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-03-18T01:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"4c49afec82645ef469cfadd64d1ee594fb30b93e1a7bd1e867534ae198158a94","abstract_canon_sha256":"fb2aff76097c73880e02a0582450ba6c236911664ef64861042569ef443c3fc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:15.407926Z","signature_b64":"kramJsStJSgS6a8Zvftfakn6rfM3NQie99WQoObzPHQVgoneN60seOeBoBZ1+n2UEWYDd6sUJZ2mcogzwes7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e95d1e4851dca05d8fc4f3c1ee3e28076b94160893ce8951fb2826730b145157","last_reissued_at":"2026-05-18T03:59:15.407354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:15.407354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Normal matrix compressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"John Holbrook, Nishan Mudalige, Rajesh Pereira","submitted_at":"2012-03-18T01:05:26Z","abstract_excerpt":"The recently developed theory of higher--rank numerical ranges originated in problems of error correction in quantum information theory but its mathematical implications now include a quite satisfactory understanding of \\emph{scalar} compressions of complex matrices. Here our aim is to make some first steps in the more general program of understanding \\emph{normal} compressions. We establish some general principles for the program and make a detailed study of rank--two normal compressions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3908","kind":"arxiv","version":2},"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":"1203.3908","created_at":"2026-05-18T03:59:15.407431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3908v2","created_at":"2026-05-18T03:59:15.407431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3908","created_at":"2026-05-18T03:59:15.407431+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FOR4SCR3SQF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FOR4SCR3SQF3D6E","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FOR4SCR","created_at":"2026-05-18T12:26:53.410803+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/5FOR4SCR3SQF3D6E6PA64PRIA5","json":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5.json","graph_json":"https://pith.science/api/pith-number/5FOR4SCR3SQF3D6E6PA64PRIA5/graph.json","events_json":"https://pith.science/api/pith-number/5FOR4SCR3SQF3D6E6PA64PRIA5/events.json","paper":"https://pith.science/paper/5FOR4SCR"},"agent_actions":{"view_html":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5","download_json":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5.json","view_paper":"https://pith.science/paper/5FOR4SCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3908&json=true","fetch_graph":"https://pith.science/api/pith-number/5FOR4SCR3SQF3D6E6PA64PRIA5/graph.json","fetch_events":"https://pith.science/api/pith-number/5FOR4SCR3SQF3D6E6PA64PRIA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5/action/storage_attestation","attest_author":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5/action/author_attestation","sign_citation":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5/action/citation_signature","submit_replication":"https://pith.science/pith/5FOR4SCR3SQF3D6E6PA64PRIA5/action/replication_record"}},"created_at":"2026-05-18T03:59:15.407431+00:00","updated_at":"2026-05-18T03:59:15.407431+00:00"}