{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:THFQPBKCPKQLHKJZAECARFPMIX","short_pith_number":"pith:THFQPBKC","schema_version":"1.0","canonical_sha256":"99cb0785427aa0b3a93901040895ec45d110360bc5e1a170abfb6f4ebbd026a0","source":{"kind":"arxiv","id":"1302.3859","version":1},"attestation_state":"computed","paper":{"title":"Optimal frame completions with prescribed norms for majorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Demetrio Stojanoff, Mariano Ruiz, Pedro Massey","submitted_at":"2013-02-15T20:00:17Z","abstract_excerpt":"Given a finite sequence of vectors $\\mathcal F_0$ in $\\C^d$ we characterize in a complete and explicit way the optimal completions of $\\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is measured with respect to majorization (of the eigenvalues of the frame operators of the completed sequence). Indeed, we construct (in terms of a fast algorithm) a vector - that depends on the eigenvalues of the frame operator of the initial sequence $\\cF_0$ and the sequence of prescribed norms - that is a minimum for majorization among all eigenvalues of fra"},"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":"1302.3859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2013-02-15T20:00:17Z","cross_cats_sorted":[],"title_canon_sha256":"237e859c3cfce13a8bbbfe21b23567c07110768ca356976a4e28016355151487","abstract_canon_sha256":"027f8c5fa68942b35aac62017a196ecf8595e36c0146295273abb6cadce740f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:27.246065Z","signature_b64":"KIC47L3R7yun7CzFKY+TQoXZd+pSn3wcXrty3oqhHSCyYip3JsRfVSIZalKgBLzPzhHR6+L6GfkFNgkp9GF/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99cb0785427aa0b3a93901040895ec45d110360bc5e1a170abfb6f4ebbd026a0","last_reissued_at":"2026-05-18T03:33:27.245177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:27.245177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal frame completions with prescribed norms for majorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Demetrio Stojanoff, Mariano Ruiz, Pedro Massey","submitted_at":"2013-02-15T20:00:17Z","abstract_excerpt":"Given a finite sequence of vectors $\\mathcal F_0$ in $\\C^d$ we characterize in a complete and explicit way the optimal completions of $\\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is measured with respect to majorization (of the eigenvalues of the frame operators of the completed sequence). Indeed, we construct (in terms of a fast algorithm) a vector - that depends on the eigenvalues of the frame operator of the initial sequence $\\cF_0$ and the sequence of prescribed norms - that is a minimum for majorization among all eigenvalues of fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3859","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":"1302.3859","created_at":"2026-05-18T03:33:27.245336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3859v1","created_at":"2026-05-18T03:33:27.245336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3859","created_at":"2026-05-18T03:33:27.245336+00:00"},{"alias_kind":"pith_short_12","alias_value":"THFQPBKCPKQL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"THFQPBKCPKQLHKJZ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"THFQPBKC","created_at":"2026-05-18T12:28:02.375192+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/THFQPBKCPKQLHKJZAECARFPMIX","json":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX.json","graph_json":"https://pith.science/api/pith-number/THFQPBKCPKQLHKJZAECARFPMIX/graph.json","events_json":"https://pith.science/api/pith-number/THFQPBKCPKQLHKJZAECARFPMIX/events.json","paper":"https://pith.science/paper/THFQPBKC"},"agent_actions":{"view_html":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX","download_json":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX.json","view_paper":"https://pith.science/paper/THFQPBKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3859&json=true","fetch_graph":"https://pith.science/api/pith-number/THFQPBKCPKQLHKJZAECARFPMIX/graph.json","fetch_events":"https://pith.science/api/pith-number/THFQPBKCPKQLHKJZAECARFPMIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX/action/storage_attestation","attest_author":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX/action/author_attestation","sign_citation":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX/action/citation_signature","submit_replication":"https://pith.science/pith/THFQPBKCPKQLHKJZAECARFPMIX/action/replication_record"}},"created_at":"2026-05-18T03:33:27.245336+00:00","updated_at":"2026-05-18T03:33:27.245336+00:00"}