{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D62S5CJOLG6Q6A2VV6PEEBLBE5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e0bdc84f043c4ae98981f7bb85569e5ed1f1f33ec54f6e567f935a15bc8f6c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-11-22T16:23:20Z","title_canon_sha256":"9f87a6ac159d650fa66324ae8553f56164a53a8c7f8130039001ed1b07621929"},"schema_version":"1.0","source":{"id":"1411.6138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6138","created_at":"2026-05-18T01:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6138v1","created_at":"2026-05-18T01:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6138","created_at":"2026-05-18T01:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"D62S5CJOLG6Q","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D62S5CJOLG6Q6A2V","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D62S5CJO","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:3d4f39aabc011227373dac40c22608e48d316ceeca167f023115ae2f69339c3c","target":"graph","created_at":"2026-05-18T01:27:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$","authors_text":"Alice Z.-Y. Chan, Allison Theobold, Logan Stokols, Martin S. Copenhaver, Sivaram K. Narayan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-11-22T16:23:20Z","title":"On Structural Decompositions of Finite Frames"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6138","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce9c72ade35fb582e154cace4cc4e5b2b96bba88da2e102cd99eb7b1d7ca5880","target":"record","created_at":"2026-05-18T01:27:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4e0bdc84f043c4ae98981f7bb85569e5ed1f1f33ec54f6e567f935a15bc8f6c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-11-22T16:23:20Z","title_canon_sha256":"9f87a6ac159d650fa66324ae8553f56164a53a8c7f8130039001ed1b07621929"},"schema_version":"1.0","source":{"id":"1411.6138","kind":"arxiv","version":1}},"canonical_sha256":"1fb52e892e59bd0f0355af9e420561276a1981b5b162a845ea0d9e3f80fe95c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fb52e892e59bd0f0355af9e420561276a1981b5b162a845ea0d9e3f80fe95c0","first_computed_at":"2026-05-18T01:27:32.109915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:32.109915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XrV/aErpFnMP1spnEZ/Mkzsq1SsvF+bSHMfxkpjy8kg+Rnk4LdZ5ix2FzS3mAWz0Syxf5ZmChfOdKIbe5Ji3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:32.110413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce9c72ade35fb582e154cace4cc4e5b2b96bba88da2e102cd99eb7b1d7ca5880","sha256:3d4f39aabc011227373dac40c22608e48d316ceeca167f023115ae2f69339c3c"],"state_sha256":"f8efcc80b2bacfd66b5745c3401e4c38396753933a6acde38162c44bb2a7338d"}