{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MNZPJ6KDYXLVPJDQMYIMB7XRSK","short_pith_number":"pith:MNZPJ6KD","schema_version":"1.0","canonical_sha256":"6372f4f943c5d757a4706610c0fef192b16808fc96f84b2763912f5d5e218718","source":{"kind":"arxiv","id":"1501.07233","version":1},"attestation_state":"computed","paper":{"title":"Generalized Gramians: Creating frame vectors in maximal subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Feng Tian, Palle Jorgensen","submitted_at":"2015-01-28T18:58:38Z","abstract_excerpt":"A frame is a system of vectors $S$ in Hilbert space $\\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\\mathscr{H}$; expressed in norm-convergent series. Traditionally, frame properties are expressed in terms of an $S$-Gramian, $G_{S}$ (an infinite matrix with entries equal to the inner product of pairs of vectors in $S$); but still with strong restrictions on the given system of vectors in $S$, in order to guarantee frame-bounds. In this paper we remove these restrictions on $G_{S}$, and we obt"},"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":"1501.07233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-01-28T18:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"945d10729a2b14bb44a83ee7d4b80d16f17b415a1e31c3ad060aa3df85d89ed1","abstract_canon_sha256":"fd4c6cdb6167438f52ffd61db2067bd6863ea7915c7f2aa72b7b0bd8e5312a6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:29.824565Z","signature_b64":"qLH7qM8odwMIk5ofn2vpOifsUHmminHTQtPPfGT0vI1Lht+RF9GfPJJIDC9i4PnLOoBP0lAC8VxdXiSc/f4lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6372f4f943c5d757a4706610c0fef192b16808fc96f84b2763912f5d5e218718","last_reissued_at":"2026-05-18T02:28:29.824107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:29.824107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Gramians: Creating frame vectors in maximal subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Feng Tian, Palle Jorgensen","submitted_at":"2015-01-28T18:58:38Z","abstract_excerpt":"A frame is a system of vectors $S$ in Hilbert space $\\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\\mathscr{H}$; expressed in norm-convergent series. Traditionally, frame properties are expressed in terms of an $S$-Gramian, $G_{S}$ (an infinite matrix with entries equal to the inner product of pairs of vectors in $S$); but still with strong restrictions on the given system of vectors in $S$, in order to guarantee frame-bounds. In this paper we remove these restrictions on $G_{S}$, and we obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07233","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":"1501.07233","created_at":"2026-05-18T02:28:29.824178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07233v1","created_at":"2026-05-18T02:28:29.824178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07233","created_at":"2026-05-18T02:28:29.824178+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNZPJ6KDYXLV","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNZPJ6KDYXLVPJDQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNZPJ6KD","created_at":"2026-05-18T12:29:32.376354+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/MNZPJ6KDYXLVPJDQMYIMB7XRSK","json":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK.json","graph_json":"https://pith.science/api/pith-number/MNZPJ6KDYXLVPJDQMYIMB7XRSK/graph.json","events_json":"https://pith.science/api/pith-number/MNZPJ6KDYXLVPJDQMYIMB7XRSK/events.json","paper":"https://pith.science/paper/MNZPJ6KD"},"agent_actions":{"view_html":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK","download_json":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK.json","view_paper":"https://pith.science/paper/MNZPJ6KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07233&json=true","fetch_graph":"https://pith.science/api/pith-number/MNZPJ6KDYXLVPJDQMYIMB7XRSK/graph.json","fetch_events":"https://pith.science/api/pith-number/MNZPJ6KDYXLVPJDQMYIMB7XRSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK/action/storage_attestation","attest_author":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK/action/author_attestation","sign_citation":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK/action/citation_signature","submit_replication":"https://pith.science/pith/MNZPJ6KDYXLVPJDQMYIMB7XRSK/action/replication_record"}},"created_at":"2026-05-18T02:28:29.824178+00:00","updated_at":"2026-05-18T02:28:29.824178+00:00"}