{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TSCFBSC6BISLX52SMYPPSYAX44","short_pith_number":"pith:TSCFBSC6","canonical_record":{"source":{"id":"1508.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-08-10T14:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"fd6e340626d7ff64de0e622118ef89d661e08377f683197227e3c8e25dfb72f8","abstract_canon_sha256":"ebc84bcaa4f2b6ae28b784e125c2d3a99eb817598173f8d3b8cc6d581af64c1b"},"schema_version":"1.0"},"canonical_sha256":"9c8450c85e0a24bbf752661ef96017e7391ce6fe600e0538e42fa433ca7052a0","source":{"kind":"arxiv","id":"1508.02266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02266","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02266v2","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02266","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"TSCFBSC6BISL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TSCFBSC6BISLX52S","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TSCFBSC6","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TSCFBSC6BISLX52SMYPPSYAX44","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-08-10T14:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"fd6e340626d7ff64de0e622118ef89d661e08377f683197227e3c8e25dfb72f8","abstract_canon_sha256":"ebc84bcaa4f2b6ae28b784e125c2d3a99eb817598173f8d3b8cc6d581af64c1b"},"schema_version":"1.0"},"canonical_sha256":"9c8450c85e0a24bbf752661ef96017e7391ce6fe600e0538e42fa433ca7052a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:49.902756Z","signature_b64":"fmYEfUEcNlINTtgMY4MJW3PJb0A3jZ5Iz62mKza9elGcypqQzEP9BmM2kSm1+IjCAYq7yY8pJaFSvzDqFUMpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8450c85e0a24bbf752661ef96017e7391ce6fe600e0538e42fa433ca7052a0","last_reissued_at":"2026-05-18T01:02:49.902189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:49.902189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02266","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6Ysv3Jkm/W+pXkyJa24XSGOWa208/8aHGk3xpufgjgZDglZL8CAoWmeziJTz6GyhJh8xDe6tEvNAHs2svPxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:59:39.665026Z"},"content_sha256":"fa59af2eadc2f6e3ef6c5fde33f5124dc9822bb7e2e9842bfd9961a55e0a1610","schema_version":"1.0","event_id":"sha256:fa59af2eadc2f6e3ef6c5fde33f5124dc9822bb7e2e9842bfd9961a55e0a1610"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TSCFBSC6BISLX52SMYPPSYAX44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal scalings and structural properties of scalable frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Alice Chan, Hong Suh, Rachel Domagalski, Sivaram K. Narayan, Xingyu Zhang, Yeon Hyang Kim","submitted_at":"2015-08-10T14:48:37Z","abstract_excerpt":"For a unit-norm frame $F = \\{f_i\\}_{i=1}^k$ in $\\R^n$, a scaling is a vector $c=(c(1),\\dots,c(k))\\in \\R_{\\geq 0}^k$ such that $\\{\\sqrt{c(i)}f_i\\}_{i =1}^k$ is a Parseval frame in $\\R^n$. If such a scaling exists, $F$ is said to be scalable. A scaling $c$ is a minimal scaling if $\\{f_i : c(i)>0\\}$ has no proper scalable subframe. It is known that the set of all scalings of $F$ is a convex polytope whose vertices correspond to minimal scalings. In this paper, we provide an estimation of the number of minimal scalings of a scalable frame and a characterization of when minimal scalings are affinel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02266","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96azZXNmQC2n1yrDcx/+DtuZGbgsvWcQXty48bL+EJtuVDZC/br7qSLlfz8exytGo+miXVEMJubqrqBmmyRiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:59:39.665386Z"},"content_sha256":"6115ecf1ff7369dab41414e988a6914f6fd620ed06c34b9e7e5c1f0a4bfb5947","schema_version":"1.0","event_id":"sha256:6115ecf1ff7369dab41414e988a6914f6fd620ed06c34b9e7e5c1f0a4bfb5947"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSCFBSC6BISLX52SMYPPSYAX44/bundle.json","state_url":"https://pith.science/pith/TSCFBSC6BISLX52SMYPPSYAX44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSCFBSC6BISLX52SMYPPSYAX44/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T20:59:39Z","links":{"resolver":"https://pith.science/pith/TSCFBSC6BISLX52SMYPPSYAX44","bundle":"https://pith.science/pith/TSCFBSC6BISLX52SMYPPSYAX44/bundle.json","state":"https://pith.science/pith/TSCFBSC6BISLX52SMYPPSYAX44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSCFBSC6BISLX52SMYPPSYAX44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TSCFBSC6BISLX52SMYPPSYAX44","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":"ebc84bcaa4f2b6ae28b784e125c2d3a99eb817598173f8d3b8cc6d581af64c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-08-10T14:48:37Z","title_canon_sha256":"fd6e340626d7ff64de0e622118ef89d661e08377f683197227e3c8e25dfb72f8"},"schema_version":"1.0","source":{"id":"1508.02266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02266","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02266v2","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02266","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"TSCFBSC6BISL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TSCFBSC6BISLX52S","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TSCFBSC6","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6115ecf1ff7369dab41414e988a6914f6fd620ed06c34b9e7e5c1f0a4bfb5947","target":"graph","created_at":"2026-05-18T01:02:49Z","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":"For a unit-norm frame $F = \\{f_i\\}_{i=1}^k$ in $\\R^n$, a scaling is a vector $c=(c(1),\\dots,c(k))\\in \\R_{\\geq 0}^k$ such that $\\{\\sqrt{c(i)}f_i\\}_{i =1}^k$ is a Parseval frame in $\\R^n$. If such a scaling exists, $F$ is said to be scalable. A scaling $c$ is a minimal scaling if $\\{f_i : c(i)>0\\}$ has no proper scalable subframe. It is known that the set of all scalings of $F$ is a convex polytope whose vertices correspond to minimal scalings. In this paper, we provide an estimation of the number of minimal scalings of a scalable frame and a characterization of when minimal scalings are affinel","authors_text":"Alice Chan, Hong Suh, Rachel Domagalski, Sivaram K. Narayan, Xingyu Zhang, Yeon Hyang Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-08-10T14:48:37Z","title":"Minimal scalings and structural properties of scalable frames"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02266","kind":"arxiv","version":2},"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:fa59af2eadc2f6e3ef6c5fde33f5124dc9822bb7e2e9842bfd9961a55e0a1610","target":"record","created_at":"2026-05-18T01:02:49Z","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":"ebc84bcaa4f2b6ae28b784e125c2d3a99eb817598173f8d3b8cc6d581af64c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-08-10T14:48:37Z","title_canon_sha256":"fd6e340626d7ff64de0e622118ef89d661e08377f683197227e3c8e25dfb72f8"},"schema_version":"1.0","source":{"id":"1508.02266","kind":"arxiv","version":2}},"canonical_sha256":"9c8450c85e0a24bbf752661ef96017e7391ce6fe600e0538e42fa433ca7052a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c8450c85e0a24bbf752661ef96017e7391ce6fe600e0538e42fa433ca7052a0","first_computed_at":"2026-05-18T01:02:49.902189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:49.902189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmYEfUEcNlINTtgMY4MJW3PJb0A3jZ5Iz62mKza9elGcypqQzEP9BmM2kSm1+IjCAYq7yY8pJaFSvzDqFUMpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:49.902756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa59af2eadc2f6e3ef6c5fde33f5124dc9822bb7e2e9842bfd9961a55e0a1610","sha256:6115ecf1ff7369dab41414e988a6914f6fd620ed06c34b9e7e5c1f0a4bfb5947"],"state_sha256":"53c67ef5c72a52a3c432815e3f3ed2dd745b126de213ca2c039a44853ba00f16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcIlz0gfOSKhPQN5azGbYN646FQn5tgzb8F3hkQcu1dnF1tVbSjjUpaMtjQQPLixAJhR0wfPgCX/xzD+325aAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:59:39.667413Z","bundle_sha256":"63e059e05affde69b883f18580ffbeea6284ba4acd9ead7acf513caa57a97345"}}