{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ZFZYSMEGGPVHP6QANXWXKRKSX","short_pith_number":"pith:6ZFZYSME","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"},"canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","source":{"kind":"arxiv","id":"1711.11527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11527","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11527v2","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11527","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"6ZFZYSMEGGPV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZFZYSMEGGPVHP6Q","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZFZYSME","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ZFZYSMEGGPVHP6QANXWXKRKSX","target":"record","payload":{"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"},"canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","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"},"source_kind":"arxiv","source_id":"1711.11527","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:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d86EkrvL6Jnu/V24vv22gS3jwXUPPmDvz7xqlHVzm47bhhainVCasb+2jxS5+9mrpJwuPbfzy/skkhNJCnWDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:04:01.549521Z"},"content_sha256":"5d306d8c554d146dd9ef255c8bd4d07bf746d7a6f75714ec7fb9c5289e2976be","schema_version":"1.0","event_id":"sha256:5d306d8c554d146dd9ef255c8bd4d07bf746d7a6f75714ec7fb9c5289e2976be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ZFZYSMEGGPVHP6QANXWXKRKSX","target":"graph","payload":{"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"},"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:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fF8G+7faRkhhaoDfZWtgqcvcrEeVei1Kc+EjA+DlaPuWN+pfnDwOEMSGhu9wqdTbb/13y1ecqgddkRSf67uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:04:01.549871Z"},"content_sha256":"96f52b3dc71b2cbb58980359ddb0cbcd854e62fd9b3c4c1ef6c60dc89c8135c1","schema_version":"1.0","event_id":"sha256:96f52b3dc71b2cbb58980359ddb0cbcd854e62fd9b3c4c1ef6c60dc89c8135c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/bundle.json","state_url":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/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-28T14:04:01Z","links":{"resolver":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX","bundle":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/bundle.json","state":"https://pith.science/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZFZYSMEGGPVHP6QANXWXKRKSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ZFZYSMEGGPVHP6QANXWXKRKSX","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":"6e37fb8f478fb1e16ac5d621c7a61a90fb2b39a41da2195b2b889982f12d1ce0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-30T17:31:56Z","title_canon_sha256":"b83e341f00d4992e6beacec83530eb535807008388bdae971a5f6432570f9854"},"schema_version":"1.0","source":{"id":"1711.11527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11527","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11527v2","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11527","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"6ZFZYSMEGGPV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZFZYSMEGGPVHP6Q","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZFZYSME","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:96f52b3dc71b2cbb58980359ddb0cbcd854e62fd9b3c4c1ef6c60dc89c8135c1","target":"graph","created_at":"2026-05-18T00:28:01Z","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":"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 ","authors_text":"Anirban Dasgupta, Dinesh Garg, Kshiteej Sheth","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-30T17:31:56Z","title":"Improved Linear Embeddings via Lagrange Duality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11527","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:5d306d8c554d146dd9ef255c8bd4d07bf746d7a6f75714ec7fb9c5289e2976be","target":"record","created_at":"2026-05-18T00:28:01Z","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":"6e37fb8f478fb1e16ac5d621c7a61a90fb2b39a41da2195b2b889982f12d1ce0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-30T17:31:56Z","title_canon_sha256":"b83e341f00d4992e6beacec83530eb535807008388bdae971a5f6432570f9854"},"schema_version":"1.0","source":{"id":"1711.11527","kind":"arxiv","version":2}},"canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f64b9c4984319f53bfd0036f6baa2a95e986560ffd9ae0207288f0cac1edbfa1","first_computed_at":"2026-05-18T00:28:01.586784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:01.586784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJq0Gi0PQlYWW/G4+3spoMirUHS95CkxEiFMXEeAEuUhof27w4hu7zsN99zSQn0O974s3ZSAjYo3FAtsBGu0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:01.587470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d306d8c554d146dd9ef255c8bd4d07bf746d7a6f75714ec7fb9c5289e2976be","sha256:96f52b3dc71b2cbb58980359ddb0cbcd854e62fd9b3c4c1ef6c60dc89c8135c1"],"state_sha256":"4a9fa3425653c05a3da43c00bc957fa64f031946581d932681d394066f1174bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk56m9Vz4PKpH9oNZd0xma85L7SJUMK1fbaA03byUSk53bA5dItQ02PiKOANy186hLm+SoZtBWInLmY6Pt0oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:04:01.551907Z","bundle_sha256":"6be477c7a588665b1cd189f5f902948244b4f63063a7c9f841ff63e11c6f6472"}}