{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D62S5CJOLG6Q6A2VV6PEEBLBE5","short_pith_number":"pith:D62S5CJO","schema_version":"1.0","canonical_sha256":"1fb52e892e59bd0f0355af9e420561276a1981b5b162a845ea0d9e3f80fe95c0","source":{"kind":"arxiv","id":"1411.6138","version":1},"attestation_state":"computed","paper":{"title":"On Structural Decompositions of Finite Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.FA","authors_text":"Alice Z.-Y. Chan, Allison Theobold, Logan Stokols, Martin S. Copenhaver, Sivaram K. Narayan","submitted_at":"2014-11-22T16:23:20Z","abstract_excerpt":"A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\\{f_i\\}_{i\\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\\{f_i\\}_{i\\in I}$ is said to be scalable if there exist nonnegative scalars $\\{c_i\\}_{i\\in I}$ such that $\\{c_if_i\\}_{i\\in I}$ is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame $\\{f_i\\}_{i\\in I}$ to be a collection of subsets of $I$"},"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":"1411.6138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-11-22T16:23:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9f87a6ac159d650fa66324ae8553f56164a53a8c7f8130039001ed1b07621929","abstract_canon_sha256":"4e0bdc84f043c4ae98981f7bb85569e5ed1f1f33ec54f6e567f935a15bc8f6c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:32.110413Z","signature_b64":"XrV/aErpFnMP1spnEZ/Mkzsq1SsvF+bSHMfxkpjy8kg+Rnk4LdZ5ix2FzS3mAWz0Syxf5ZmChfOdKIbe5Ji3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb52e892e59bd0f0355af9e420561276a1981b5b162a845ea0d9e3f80fe95c0","last_reissued_at":"2026-05-18T01:27:32.109915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:32.109915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Structural Decompositions of Finite Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.FA","authors_text":"Alice Z.-Y. Chan, Allison Theobold, Logan Stokols, Martin S. Copenhaver, Sivaram K. Narayan","submitted_at":"2014-11-22T16:23:20Z","abstract_excerpt":"A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\\{f_i\\}_{i\\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\\{f_i\\}_{i\\in I}$ is said to be scalable if there exist nonnegative scalars $\\{c_i\\}_{i\\in I}$ such that $\\{c_if_i\\}_{i\\in I}$ is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame $\\{f_i\\}_{i\\in I}$ to be a collection of subsets of $I$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6138","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":"1411.6138","created_at":"2026-05-18T01:27:32.109984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6138v1","created_at":"2026-05-18T01:27:32.109984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6138","created_at":"2026-05-18T01:27:32.109984+00:00"},{"alias_kind":"pith_short_12","alias_value":"D62S5CJOLG6Q","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D62S5CJOLG6Q6A2V","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D62S5CJO","created_at":"2026-05-18T12:28:25.294606+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/D62S5CJOLG6Q6A2VV6PEEBLBE5","json":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5.json","graph_json":"https://pith.science/api/pith-number/D62S5CJOLG6Q6A2VV6PEEBLBE5/graph.json","events_json":"https://pith.science/api/pith-number/D62S5CJOLG6Q6A2VV6PEEBLBE5/events.json","paper":"https://pith.science/paper/D62S5CJO"},"agent_actions":{"view_html":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5","download_json":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5.json","view_paper":"https://pith.science/paper/D62S5CJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6138&json=true","fetch_graph":"https://pith.science/api/pith-number/D62S5CJOLG6Q6A2VV6PEEBLBE5/graph.json","fetch_events":"https://pith.science/api/pith-number/D62S5CJOLG6Q6A2VV6PEEBLBE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5/action/storage_attestation","attest_author":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5/action/author_attestation","sign_citation":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5/action/citation_signature","submit_replication":"https://pith.science/pith/D62S5CJOLG6Q6A2VV6PEEBLBE5/action/replication_record"}},"created_at":"2026-05-18T01:27:32.109984+00:00","updated_at":"2026-05-18T01:27:32.109984+00:00"}