{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NOX2K32QRLPCMSEUDKJROAJVMO","short_pith_number":"pith:NOX2K32Q","schema_version":"1.0","canonical_sha256":"6bafa56f508ade2648941a93170135638ed8fc6fca23a4d2982f6299002f6f80","source":{"kind":"arxiv","id":"1710.02587","version":2},"attestation_state":"computed","paper":{"title":"The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OA","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Akshay Ramachandran, Lap Chi Lau, Tsz Chiu Kwok, Yin Tat Lee","submitted_at":"2017-10-06T21:09:34Z","abstract_excerpt":"The Paulsen problem is a basic open problem in operator theory: Given vectors $u_1, \\ldots, u_n \\in \\mathbb R^d$ that are $\\epsilon$-nearly satisfying the Parseval's condition and the equal norm condition, is it close to a set of vectors $v_1, \\ldots, v_n \\in \\mathbb R^d$ that exactly satisfy the Parseval's condition and the equal norm condition? Given $u_1, \\ldots, u_n$, the squared distance (to the set of exact solutions) is defined as $\\inf_{v} \\sum_{i=1}^n \\| u_i - v_i \\|_2^2$ where the infimum is over the set of exact solutions. Previous results show that the squared distance of any $\\eps"},"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":"1710.02587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T21:09:34Z","cross_cats_sorted":["math.FA","math.OA","math.OC","quant-ph"],"title_canon_sha256":"22238c682bd8ca722588faf10c3dab0b16dab5eb0bc2ab71549d220b16a20e03","abstract_canon_sha256":"0c08e6981d013061012f27cc151395848de261a6deb859a3a1bda22d47de2fbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.311851Z","signature_b64":"hqDoV5zchQjMC2KvjlAj7grfP7yGsHMzjyxIlUoasFCF/+ykylt4W7I+ZmKYJZ5bUEyRXtocF+Oid/t0qXj1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bafa56f508ade2648941a93170135638ed8fc6fca23a4d2982f6299002f6f80","last_reissued_at":"2026-05-18T00:30:57.311187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.311187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OA","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Akshay Ramachandran, Lap Chi Lau, Tsz Chiu Kwok, Yin Tat Lee","submitted_at":"2017-10-06T21:09:34Z","abstract_excerpt":"The Paulsen problem is a basic open problem in operator theory: Given vectors $u_1, \\ldots, u_n \\in \\mathbb R^d$ that are $\\epsilon$-nearly satisfying the Parseval's condition and the equal norm condition, is it close to a set of vectors $v_1, \\ldots, v_n \\in \\mathbb R^d$ that exactly satisfy the Parseval's condition and the equal norm condition? Given $u_1, \\ldots, u_n$, the squared distance (to the set of exact solutions) is defined as $\\inf_{v} \\sum_{i=1}^n \\| u_i - v_i \\|_2^2$ where the infimum is over the set of exact solutions. Previous results show that the squared distance of any $\\eps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02587","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02587","created_at":"2026-05-18T00:30:57.311289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02587v2","created_at":"2026-05-18T00:30:57.311289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02587","created_at":"2026-05-18T00:30:57.311289+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOX2K32QRLPC","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOX2K32QRLPCMSEU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOX2K32Q","created_at":"2026-05-18T12:31:34.259226+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/NOX2K32QRLPCMSEUDKJROAJVMO","json":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO.json","graph_json":"https://pith.science/api/pith-number/NOX2K32QRLPCMSEUDKJROAJVMO/graph.json","events_json":"https://pith.science/api/pith-number/NOX2K32QRLPCMSEUDKJROAJVMO/events.json","paper":"https://pith.science/paper/NOX2K32Q"},"agent_actions":{"view_html":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO","download_json":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO.json","view_paper":"https://pith.science/paper/NOX2K32Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02587&json=true","fetch_graph":"https://pith.science/api/pith-number/NOX2K32QRLPCMSEUDKJROAJVMO/graph.json","fetch_events":"https://pith.science/api/pith-number/NOX2K32QRLPCMSEUDKJROAJVMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO/action/storage_attestation","attest_author":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO/action/author_attestation","sign_citation":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO/action/citation_signature","submit_replication":"https://pith.science/pith/NOX2K32QRLPCMSEUDKJROAJVMO/action/replication_record"}},"created_at":"2026-05-18T00:30:57.311289+00:00","updated_at":"2026-05-18T00:30:57.311289+00:00"}