{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BWLNG4ARCNPYQ32Z6CWJKOLN7B","short_pith_number":"pith:BWLNG4AR","schema_version":"1.0","canonical_sha256":"0d96d37011135f886f59f0ac95396df84d73e0d41b058b8deaa53e566cd3255c","source":{"kind":"arxiv","id":"2410.21625","version":1},"attestation_state":"computed","paper":{"title":"The convex algebraic geometry of higher-rank numerical ranges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.FA","authors_text":"Cynthia Vinzant, Jonathan Nino-Cortes","submitted_at":"2024-10-29T00:15:36Z","abstract_excerpt":"The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex geometry of these sets, including a generalization of Kippenhahn's theorem, and describe an algorithm to explicitly calculate the higher-rank numerical range of a given matrix."},"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":"2410.21625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-10-29T00:15:36Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"e4de9496429268ff8be1ac8f7e222d3b157914a7716c390637a234670c4da6c6","abstract_canon_sha256":"98b9c55757257487cb3a6899e449dec096170b47fd5082e7bb0ad41f1eba8318"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:30.944062Z","signature_b64":"Cawq8mOnCrjnSFRfHl1iV8+H5iy7CPaeSdXTMmNF4I8sQsZbxz42U4BGzYg8eJiWjDo0CtqVpWp46c83stYaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d96d37011135f886f59f0ac95396df84d73e0d41b058b8deaa53e566cd3255c","last_reissued_at":"2026-07-05T09:27:30.943612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:30.943612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The convex algebraic geometry of higher-rank numerical ranges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.FA","authors_text":"Cynthia Vinzant, Jonathan Nino-Cortes","submitted_at":"2024-10-29T00:15:36Z","abstract_excerpt":"The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex geometry of these sets, including a generalization of Kippenhahn's theorem, and describe an algorithm to explicitly calculate the higher-rank numerical range of a given matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21625","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21625/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.21625","created_at":"2026-07-05T09:27:30.943673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21625v1","created_at":"2026-07-05T09:27:30.943673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21625","created_at":"2026-07-05T09:27:30.943673+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWLNG4ARCNPY","created_at":"2026-07-05T09:27:30.943673+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWLNG4ARCNPYQ32Z","created_at":"2026-07-05T09:27:30.943673+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWLNG4AR","created_at":"2026-07-05T09:27:30.943673+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02461","citing_title":"Maximal entropy in the moment body","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B","json":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B.json","graph_json":"https://pith.science/api/pith-number/BWLNG4ARCNPYQ32Z6CWJKOLN7B/graph.json","events_json":"https://pith.science/api/pith-number/BWLNG4ARCNPYQ32Z6CWJKOLN7B/events.json","paper":"https://pith.science/paper/BWLNG4AR"},"agent_actions":{"view_html":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B","download_json":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B.json","view_paper":"https://pith.science/paper/BWLNG4AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21625&json=true","fetch_graph":"https://pith.science/api/pith-number/BWLNG4ARCNPYQ32Z6CWJKOLN7B/graph.json","fetch_events":"https://pith.science/api/pith-number/BWLNG4ARCNPYQ32Z6CWJKOLN7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B/action/storage_attestation","attest_author":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B/action/author_attestation","sign_citation":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B/action/citation_signature","submit_replication":"https://pith.science/pith/BWLNG4ARCNPYQ32Z6CWJKOLN7B/action/replication_record"}},"created_at":"2026-07-05T09:27:30.943673+00:00","updated_at":"2026-07-05T09:27:30.943673+00:00"}