{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QUGR6EGTG7YCIJLVF3LZTD2IFF","short_pith_number":"pith:QUGR6EGT","canonical_record":{"source":{"id":"1211.3046","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-13T16:39:45Z","cross_cats_sorted":[],"title_canon_sha256":"b0a73d57c88afd6394f31822591c159794f58d42aa1b17f479d41df54993b0b6","abstract_canon_sha256":"50ba1a82f3b3fcd18ca0920a05e6ec0ed108c243a71132246c10a778f5c8a8ae"},"schema_version":"1.0"},"canonical_sha256":"850d1f10d337f02425752ed7998f48297f75ef53351b5fab695c69e1e32aca32","source":{"kind":"arxiv","id":"1211.3046","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3046","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3046v4","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3046","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUGR6EGTG7YC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QUGR6EGTG7YCIJLV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QUGR6EGT","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QUGR6EGTG7YCIJLVF3LZTD2IFF","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3046","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-13T16:39:45Z","cross_cats_sorted":[],"title_canon_sha256":"b0a73d57c88afd6394f31822591c159794f58d42aa1b17f479d41df54993b0b6","abstract_canon_sha256":"50ba1a82f3b3fcd18ca0920a05e6ec0ed108c243a71132246c10a778f5c8a8ae"},"schema_version":"1.0"},"canonical_sha256":"850d1f10d337f02425752ed7998f48297f75ef53351b5fab695c69e1e32aca32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:23.688878Z","signature_b64":"tVcZ5XGqunHPmNGwxTrEeJeg+HXaFOs4UOGT+Y7rsj4XgSrFWLAlR3k+kFhSmC6BqBvhG6Y3eovHY4MUdEWhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850d1f10d337f02425752ed7998f48297f75ef53351b5fab695c69e1e32aca32","last_reissued_at":"2026-05-18T02:58:23.688471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:23.688471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3046","source_version":4,"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-18T02:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQvwMgFcqkNKmRvFXoC6fZnf80Fx3PS8ux2I9jVZYFuzXLLyDZJJ1SVcLZNseLux/FKry780wBY+0VKxS5GbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:45:57.147007Z"},"content_sha256":"c9467ff926943b77460e5a8719b7a2742f39dcbdc3ecbd15c3cdb42322df3eb0","schema_version":"1.0","event_id":"sha256:c9467ff926943b77460e5a8719b7a2742f39dcbdc3ecbd15c3cdb42322df3eb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QUGR6EGTG7YCIJLVF3LZTD2IFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering the Optimal Solution by Dual Random Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Mehrdad Mahdavi, Rong Jin, Shenghuo Zhu, Tianbao Yang","submitted_at":"2012-11-13T16:39:45Z","abstract_excerpt":"Random projection has been widely used in data classification. It maps high-dimensional data into a low-dimensional subspace in order to reduce the computational cost in solving the related optimization problem. While previous studies are focused on analyzing the classification performance of using random projection, in this work, we consider the recovery problem, i.e., how to accurately recover the optimal solution to the original optimization problem in the high-dimensional space based on the solution learned from the subspace spanned by random projections. We present a simple algorithm, ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3046","kind":"arxiv","version":4},"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-18T02:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8SiowErVHyX7BbuHMa/iBGienHmqYdOTxE4wL0Q4lXdm8W2ZS5awQ2ZF7qMFz6agsij1MWL03DerM//XG4QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:45:57.147378Z"},"content_sha256":"907bbea7d5bdd443f80cd74b20e2a0132d5a2fc8db251cc9b79906bd6aef613b","schema_version":"1.0","event_id":"sha256:907bbea7d5bdd443f80cd74b20e2a0132d5a2fc8db251cc9b79906bd6aef613b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/bundle.json","state_url":"https://pith.science/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/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-26T20:45:57Z","links":{"resolver":"https://pith.science/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF","bundle":"https://pith.science/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/bundle.json","state":"https://pith.science/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUGR6EGTG7YCIJLVF3LZTD2IFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QUGR6EGTG7YCIJLVF3LZTD2IFF","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":"50ba1a82f3b3fcd18ca0920a05e6ec0ed108c243a71132246c10a778f5c8a8ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-13T16:39:45Z","title_canon_sha256":"b0a73d57c88afd6394f31822591c159794f58d42aa1b17f479d41df54993b0b6"},"schema_version":"1.0","source":{"id":"1211.3046","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3046","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3046v4","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3046","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUGR6EGTG7YC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QUGR6EGTG7YCIJLV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QUGR6EGT","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:907bbea7d5bdd443f80cd74b20e2a0132d5a2fc8db251cc9b79906bd6aef613b","target":"graph","created_at":"2026-05-18T02:58:23Z","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":"Random projection has been widely used in data classification. It maps high-dimensional data into a low-dimensional subspace in order to reduce the computational cost in solving the related optimization problem. While previous studies are focused on analyzing the classification performance of using random projection, in this work, we consider the recovery problem, i.e., how to accurately recover the optimal solution to the original optimization problem in the high-dimensional space based on the solution learned from the subspace spanned by random projections. We present a simple algorithm, ter","authors_text":"Lijun Zhang, Mehrdad Mahdavi, Rong Jin, Shenghuo Zhu, Tianbao Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-13T16:39:45Z","title":"Recovering the Optimal Solution by Dual Random Projection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3046","kind":"arxiv","version":4},"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:c9467ff926943b77460e5a8719b7a2742f39dcbdc3ecbd15c3cdb42322df3eb0","target":"record","created_at":"2026-05-18T02:58:23Z","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":"50ba1a82f3b3fcd18ca0920a05e6ec0ed108c243a71132246c10a778f5c8a8ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-13T16:39:45Z","title_canon_sha256":"b0a73d57c88afd6394f31822591c159794f58d42aa1b17f479d41df54993b0b6"},"schema_version":"1.0","source":{"id":"1211.3046","kind":"arxiv","version":4}},"canonical_sha256":"850d1f10d337f02425752ed7998f48297f75ef53351b5fab695c69e1e32aca32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850d1f10d337f02425752ed7998f48297f75ef53351b5fab695c69e1e32aca32","first_computed_at":"2026-05-18T02:58:23.688471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:23.688471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVcZ5XGqunHPmNGwxTrEeJeg+HXaFOs4UOGT+Y7rsj4XgSrFWLAlR3k+kFhSmC6BqBvhG6Y3eovHY4MUdEWhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:23.688878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3046","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9467ff926943b77460e5a8719b7a2742f39dcbdc3ecbd15c3cdb42322df3eb0","sha256:907bbea7d5bdd443f80cd74b20e2a0132d5a2fc8db251cc9b79906bd6aef613b"],"state_sha256":"0efaa0127261857058abdf66dd316122e28982db9cdcaa60f0149e373bb50920"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWRIi/1MMOvsvOMx2h1c4qksdI+e/+zrulxgy9LikK+nLGNhif7FcGJ2482fZvtr4i/92Gzsjb+ePywpTfzQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:45:57.149430Z","bundle_sha256":"af4f973fc1c85e10258b93b87f88cd71cb73f7ff2ed5d7f7b74bea6b83636278"}}