{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ZFZYSMEGGPVHP6QANXWXKRKSX","short_pith_number":"pith:6ZFZYSME","schema_version":"1.0","canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","source":{"kind":"arxiv","id":"1711.11527","version":2},"attestation_state":"computed","paper":{"title":"Improved Linear Embeddings via Lagrange Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anirban Dasgupta, Dinesh Garg, Kshiteej Sheth","submitted_at":"2017-11-30T17:31:56Z","abstract_excerpt":"Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of points. We formulate the problem as a non convex constrained optimization problem. We first construct a primal relaxation and then use the theory of Lagrange duality to create dual relaxation. We also suggest a polynomial time algorithm based on the theory of convex optimization to solve the dual relaxation provably. We provide a theoretical upper bound on the "},"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":"1711.11527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-30T17:31:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b83e341f00d4992e6beacec83530eb535807008388bdae971a5f6432570f9854","abstract_canon_sha256":"6e37fb8f478fb1e16ac5d621c7a61a90fb2b39a41da2195b2b889982f12d1ce0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:01.587470Z","signature_b64":"PJq0Gi0PQlYWW/G4+3spoMirUHS95CkxEiFMXEeAEuUhof27w4hu7zsN99zSQn0O974s3ZSAjYo3FAtsBGu0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","last_reissued_at":"2026-05-18T00:28:01.586784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:01.586784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Linear Embeddings via Lagrange Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anirban Dasgupta, Dinesh Garg, Kshiteej Sheth","submitted_at":"2017-11-30T17:31:56Z","abstract_excerpt":"Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of points. We formulate the problem as a non convex constrained optimization problem. We first construct a primal relaxation and then use the theory of Lagrange duality to create dual relaxation. We also suggest a polynomial time algorithm based on the theory of convex optimization to solve the dual relaxation provably. We provide a theoretical upper bound on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11527","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":"1711.11527","created_at":"2026-05-18T00:28:01.586865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11527v2","created_at":"2026-05-18T00:28:01.586865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11527","created_at":"2026-05-18T00:28:01.586865+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZFZYSMEGGPV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZFZYSMEGGPVHP6Q","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZFZYSME","created_at":"2026-05-18T12:31:03.183658+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/6ZFZYSMEGGPVHP6QANXWXKRKSX","json":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX.json","graph_json":"https://pith.science/api/pith-number/6ZFZYSMEGGPVHP6QANXWXKRKSX/graph.json","events_json":"https://pith.science/api/pith-number/6ZFZYSMEGGPVHP6QANXWXKRKSX/events.json","paper":"https://pith.science/paper/6ZFZYSME"},"agent_actions":{"view_html":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX","download_json":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX.json","view_paper":"https://pith.science/paper/6ZFZYSME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11527&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZFZYSMEGGPVHP6QANXWXKRKSX/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZFZYSMEGGPVHP6QANXWXKRKSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/action/storage_attestation","attest_author":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/action/author_attestation","sign_citation":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/action/citation_signature","submit_replication":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/action/replication_record"}},"created_at":"2026-05-18T00:28:01.586865+00:00","updated_at":"2026-05-18T00:28:01.586865+00:00"}