{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NTBW4CZVIVZ3XAIHDYABXRVZ6D","short_pith_number":"pith:NTBW4CZV","schema_version":"1.0","canonical_sha256":"6cc36e0b354573bb81071e001bc6b9f0e41305db85dd707bf0ce986abae630e2","source":{"kind":"arxiv","id":"1009.5562","version":1},"attestation_state":"computed","paper":{"title":"Auto-tuning unit norm frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Dustin G. Mixon, Matthew Fickus, Peter G. Casazza","submitted_at":"2010-09-28T13:28:22Z","abstract_excerpt":"Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential as encoding schemes. Unfortunately, up to this point, these frames have proven notoriously difficult to construct. Indeed, though the set of all unit norm tight frames, modulo rotations, is known to contain manifolds of nontrivial dimension, we have but a small finite number of known constructions of such frames. In this paper, we present a new iterative al"},"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":"1009.5562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-09-28T13:28:22Z","cross_cats_sorted":[],"title_canon_sha256":"cef2e300b2d2312d13deb07acd61d384ecbca828b45f86f4ad63e2faf0b20839","abstract_canon_sha256":"c582a001bca959152251567afc8d72cf665f43a8092526aaa7b2b02bdaae5d83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.827346Z","signature_b64":"mzGdfZePR1ADLtUUmh6iNAzr5ZmX+BPvIJzbTTVy4zwV1tUlZ7dclKKem9B4GDA30JjsbwA4Yc7mXD2WhoEcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc36e0b354573bb81071e001bc6b9f0e41305db85dd707bf0ce986abae630e2","last_reissued_at":"2026-05-18T04:40:09.826887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.826887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-tuning unit norm frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Dustin G. Mixon, Matthew Fickus, Peter G. Casazza","submitted_at":"2010-09-28T13:28:22Z","abstract_excerpt":"Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential as encoding schemes. Unfortunately, up to this point, these frames have proven notoriously difficult to construct. Indeed, though the set of all unit norm tight frames, modulo rotations, is known to contain manifolds of nontrivial dimension, we have but a small finite number of known constructions of such frames. In this paper, we present a new iterative al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5562","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":"1009.5562","created_at":"2026-05-18T04:40:09.826956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5562v1","created_at":"2026-05-18T04:40:09.826956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5562","created_at":"2026-05-18T04:40:09.826956+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTBW4CZVIVZ3","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTBW4CZVIVZ3XAIH","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTBW4CZV","created_at":"2026-05-18T12:26:10.704358+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/NTBW4CZVIVZ3XAIHDYABXRVZ6D","json":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D.json","graph_json":"https://pith.science/api/pith-number/NTBW4CZVIVZ3XAIHDYABXRVZ6D/graph.json","events_json":"https://pith.science/api/pith-number/NTBW4CZVIVZ3XAIHDYABXRVZ6D/events.json","paper":"https://pith.science/paper/NTBW4CZV"},"agent_actions":{"view_html":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D","download_json":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D.json","view_paper":"https://pith.science/paper/NTBW4CZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5562&json=true","fetch_graph":"https://pith.science/api/pith-number/NTBW4CZVIVZ3XAIHDYABXRVZ6D/graph.json","fetch_events":"https://pith.science/api/pith-number/NTBW4CZVIVZ3XAIHDYABXRVZ6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D/action/storage_attestation","attest_author":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D/action/author_attestation","sign_citation":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D/action/citation_signature","submit_replication":"https://pith.science/pith/NTBW4CZVIVZ3XAIHDYABXRVZ6D/action/replication_record"}},"created_at":"2026-05-18T04:40:09.826956+00:00","updated_at":"2026-05-18T04:40:09.826956+00:00"}