{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:APWLYFLYNR4E6QBZPQFB6ND7VU","short_pith_number":"pith:APWLYFLY","schema_version":"1.0","canonical_sha256":"03ecbc15786c784f40397c0a1f347fad0cfb1e573d172b8f0154d34f5ce7b3d6","source":{"kind":"arxiv","id":"math/0606319","version":1},"attestation_state":"computed","paper":{"title":"Tight frame completions with prescribed norms","license":"","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"M. Ruiz, P. Massey","submitted_at":"2006-06-13T21:08:21Z","abstract_excerpt":"Let $\\hil$ be a finite dimensional (real or complex) Hilbert space and let $\\{a_i\\}_{i=1}^\\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\\f$ in $\\hil$ we find necessary and sufficient conditions for the existence of\n $r\\in \\NN\\cup\\{\\infty\\}$ and a Bessel sequence $\\g$ in $\\hil$ such that $\\cF\\cup\\cG$ is a tight frame for $\\hil$ and $\\|g_i\\|^2=a_i$ for $1\\leq i\\leq r$. Moreover, in this case we compute the minimum $r\\in \\NN\\cup\\{\\infty\\}$ with this property. Using recent results on the Schur-Horn theorem, we also obtain a not so optimal but algorit"},"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":"math/0606319","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.FA","submitted_at":"2006-06-13T21:08:21Z","cross_cats_sorted":[],"title_canon_sha256":"2925081f9137795db165f63ec5d5218bdd69e30331717eefb599b7da82a83fc0","abstract_canon_sha256":"4aab90a8af1519d289f227948d80a3580dd837ccc8278d5aff60742b2cc15a21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:22.644544Z","signature_b64":"uxYRSJmWJNQEFXvUZtoGliv2rSsHkkz9KEjX2cEou8PxOp8fmeBFfnPzo8+b+nxy5CIaGA1PM9AxSWorWs78Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03ecbc15786c784f40397c0a1f347fad0cfb1e573d172b8f0154d34f5ce7b3d6","last_reissued_at":"2026-05-18T01:05:22.643975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:22.643975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight frame completions with prescribed norms","license":"","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"M. Ruiz, P. Massey","submitted_at":"2006-06-13T21:08:21Z","abstract_excerpt":"Let $\\hil$ be a finite dimensional (real or complex) Hilbert space and let $\\{a_i\\}_{i=1}^\\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\\f$ in $\\hil$ we find necessary and sufficient conditions for the existence of\n $r\\in \\NN\\cup\\{\\infty\\}$ and a Bessel sequence $\\g$ in $\\hil$ such that $\\cF\\cup\\cG$ is a tight frame for $\\hil$ and $\\|g_i\\|^2=a_i$ for $1\\leq i\\leq r$. Moreover, in this case we compute the minimum $r\\in \\NN\\cup\\{\\infty\\}$ with this property. Using recent results on the Schur-Horn theorem, we also obtain a not so optimal but algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606319","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":"math/0606319","created_at":"2026-05-18T01:05:22.644050+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0606319v1","created_at":"2026-05-18T01:05:22.644050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606319","created_at":"2026-05-18T01:05:22.644050+00:00"},{"alias_kind":"pith_short_12","alias_value":"APWLYFLYNR4E","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"APWLYFLYNR4E6QBZ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"APWLYFLY","created_at":"2026-05-18T12:25:53.939244+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/APWLYFLYNR4E6QBZPQFB6ND7VU","json":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU.json","graph_json":"https://pith.science/api/pith-number/APWLYFLYNR4E6QBZPQFB6ND7VU/graph.json","events_json":"https://pith.science/api/pith-number/APWLYFLYNR4E6QBZPQFB6ND7VU/events.json","paper":"https://pith.science/paper/APWLYFLY"},"agent_actions":{"view_html":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU","download_json":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU.json","view_paper":"https://pith.science/paper/APWLYFLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0606319&json=true","fetch_graph":"https://pith.science/api/pith-number/APWLYFLYNR4E6QBZPQFB6ND7VU/graph.json","fetch_events":"https://pith.science/api/pith-number/APWLYFLYNR4E6QBZPQFB6ND7VU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU/action/storage_attestation","attest_author":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU/action/author_attestation","sign_citation":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU/action/citation_signature","submit_replication":"https://pith.science/pith/APWLYFLYNR4E6QBZPQFB6ND7VU/action/replication_record"}},"created_at":"2026-05-18T01:05:22.644050+00:00","updated_at":"2026-05-18T01:05:22.644050+00:00"}