{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AKU26HKEM3SVB7N7JZLJSUTL5F","short_pith_number":"pith:AKU26HKE","canonical_record":{"source":{"id":"1609.02233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-08T00:28:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a37aa61bdc7465469ba961bf8d361114fca45b58842c99f050b7cb1585d35885","abstract_canon_sha256":"f30cb0cc19f3c54a1ef4d6de568165040e56914c8cbe504d8bf41acd347ad09b"},"schema_version":"1.0"},"canonical_sha256":"02a9af1d4466e550fdbf4e5699526be953d6f012c69a621cde1148ecea2fa7bf","source":{"kind":"arxiv","id":"1609.02233","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02233","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02233v2","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02233","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"AKU26HKEM3SV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AKU26HKEM3SVB7N7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AKU26HKE","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AKU26HKEM3SVB7N7JZLJSUTL5F","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-08T00:28:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a37aa61bdc7465469ba961bf8d361114fca45b58842c99f050b7cb1585d35885","abstract_canon_sha256":"f30cb0cc19f3c54a1ef4d6de568165040e56914c8cbe504d8bf41acd347ad09b"},"schema_version":"1.0"},"canonical_sha256":"02a9af1d4466e550fdbf4e5699526be953d6f012c69a621cde1148ecea2fa7bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:50.793258Z","signature_b64":"nlhAGK8vg83O7Hd6G9MayfbkRf/XK0+PY9g20yyhVGOf1l9jYnUNfrNrqgNFGanr91CFMcyStIp996B3tcmUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a9af1d4466e550fdbf4e5699526be953d6f012c69a621cde1148ecea2fa7bf","last_reissued_at":"2026-05-18T00:58:50.792634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:50.792634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02233","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-18T00:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SI+Ug+tczJk4rpl2tadui9Hry3o8F0oQqEXp55XnyicSOD0XsFjIVn/oaDAiqzgxu66XxSLSN8HE9Q5ORFoKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:13.542674Z"},"content_sha256":"04d301321c04df656e2eaea33ed80963bf786d9b544361e519a245c3d3261642","schema_version":"1.0","event_id":"sha256:04d301321c04df656e2eaea33ed80963bf786d9b544361e519a245c3d3261642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AKU26HKEM3SVB7N7JZLJSUTL5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization methods for frame conditioning and application to graph Laplacian scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.FA","authors_text":"Chae Clark, Kasso A. Okoudjou, Mathew Begu\\'e, Radu Balan","submitted_at":"2016-09-08T00:28:36Z","abstract_excerpt":"A frame is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some algorithms to solve these problems. We then apply and extend our methods to the problem of reweighing (finite) graph so as to minimize the condition number of the resulting Laplacian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02233","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-18T00:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvBSwXKuhXVBLqWKkAn1d19X94aliUmlzmr++oE2k4z3zOYUd3FjoBgMUfF2uXjpxEu4KGT69w7991iAFCE4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:13.543392Z"},"content_sha256":"f4c778ee9ee97a9939eb596619602bb962a8a6824f120d6966cc4c9546a2e58f","schema_version":"1.0","event_id":"sha256:f4c778ee9ee97a9939eb596619602bb962a8a6824f120d6966cc4c9546a2e58f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/bundle.json","state_url":"https://pith.science/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/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-05-27T16:53:13Z","links":{"resolver":"https://pith.science/pith/AKU26HKEM3SVB7N7JZLJSUTL5F","bundle":"https://pith.science/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/bundle.json","state":"https://pith.science/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKU26HKEM3SVB7N7JZLJSUTL5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AKU26HKEM3SVB7N7JZLJSUTL5F","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":"f30cb0cc19f3c54a1ef4d6de568165040e56914c8cbe504d8bf41acd347ad09b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-08T00:28:36Z","title_canon_sha256":"a37aa61bdc7465469ba961bf8d361114fca45b58842c99f050b7cb1585d35885"},"schema_version":"1.0","source":{"id":"1609.02233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02233","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02233v2","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02233","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"AKU26HKEM3SV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AKU26HKEM3SVB7N7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AKU26HKE","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f4c778ee9ee97a9939eb596619602bb962a8a6824f120d6966cc4c9546a2e58f","target":"graph","created_at":"2026-05-18T00:58:50Z","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 is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some algorithms to solve these problems. We then apply and extend our methods to the problem of reweighing (finite) graph so as to minimize the condition number of the resulting Laplacian.","authors_text":"Chae Clark, Kasso A. Okoudjou, Mathew Begu\\'e, Radu Balan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-08T00:28:36Z","title":"Optimization methods for frame conditioning and application to graph Laplacian scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02233","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:04d301321c04df656e2eaea33ed80963bf786d9b544361e519a245c3d3261642","target":"record","created_at":"2026-05-18T00:58:50Z","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":"f30cb0cc19f3c54a1ef4d6de568165040e56914c8cbe504d8bf41acd347ad09b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-08T00:28:36Z","title_canon_sha256":"a37aa61bdc7465469ba961bf8d361114fca45b58842c99f050b7cb1585d35885"},"schema_version":"1.0","source":{"id":"1609.02233","kind":"arxiv","version":2}},"canonical_sha256":"02a9af1d4466e550fdbf4e5699526be953d6f012c69a621cde1148ecea2fa7bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02a9af1d4466e550fdbf4e5699526be953d6f012c69a621cde1148ecea2fa7bf","first_computed_at":"2026-05-18T00:58:50.792634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:50.792634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nlhAGK8vg83O7Hd6G9MayfbkRf/XK0+PY9g20yyhVGOf1l9jYnUNfrNrqgNFGanr91CFMcyStIp996B3tcmUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:50.793258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d301321c04df656e2eaea33ed80963bf786d9b544361e519a245c3d3261642","sha256:f4c778ee9ee97a9939eb596619602bb962a8a6824f120d6966cc4c9546a2e58f"],"state_sha256":"e2d8ddbb7ca0d6440455cedbd5c69f9c5c46785617a4fa09223c8f4459187075"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGzndgfrQ95wRsLOd6yMYQZsaVX6AALWgo5sr5cL8uPhZTotj1EmVG+rrHbEj6D2nGhCMhBOS61XUA0jdhTADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:53:13.547357Z","bundle_sha256":"a20a3e24a28ad530bcca93cef85bc9912c484623343614e976295b072a6f1aa2"}}