{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HCMHZU2LV53DBRKFB2IDKXMSRH","short_pith_number":"pith:HCMHZU2L","canonical_record":{"source":{"id":"1507.05185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","cross_cats_sorted":["cs.CC","stat.ML","stat.TH"],"title_canon_sha256":"9d2fdcb0bcb6c2eb5fc1be9ce09aff231293a4cea260f04a210b67535604b020","abstract_canon_sha256":"15119d7c6ec2bdf3a13281e79e8e73a3aa9bc0610ebc36c1a0af6665e16cc060"},"schema_version":"1.0"},"canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","source":{"kind":"arxiv","id":"1507.05185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05185","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05185v1","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05185","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"HCMHZU2LV53D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HCMHZU2LV53DBRKF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HCMHZU2L","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HCMHZU2LV53DBRKFB2IDKXMSRH","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","cross_cats_sorted":["cs.CC","stat.ML","stat.TH"],"title_canon_sha256":"9d2fdcb0bcb6c2eb5fc1be9ce09aff231293a4cea260f04a210b67535604b020","abstract_canon_sha256":"15119d7c6ec2bdf3a13281e79e8e73a3aa9bc0610ebc36c1a0af6665e16cc060"},"schema_version":"1.0"},"canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:39.348236Z","signature_b64":"+W6pYutv+GgFINZN5gHkDjVH+yJCdXA3mjYz5eoPktMdIbXZDwcv4ycVB9RgqdtEX4TLDPgOg9q/bM56FPozCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","last_reissued_at":"2026-05-18T01:36:39.347492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:39.347492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05185","source_version":1,"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-18T01:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4BFafmSv0Yx7xIXwXXYy5IUa6f33xumw8aviBIkpN2hHyKKJoaMqi276w6a5imN4M3VaT7hS+j/IpShgdqDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:02.510213Z"},"content_sha256":"199b8a8a5dc9b1dee7948ca938a4e05272bc5d27cacd9f2a0a8ef79c379c6e11","schema_version":"1.0","event_id":"sha256:199b8a8a5dc9b1dee7948ca938a4e05272bc5d27cacd9f2a0a8ef79c379c6e11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HCMHZU2LV53DBRKFB2IDKXMSRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lijun Zhang, Qihang Lin, Rong Jin, Tianbao Yang","submitted_at":"2015-07-18T13:16:09Z","abstract_excerpt":"In this paper, we study a fast approximation method for {\\it large-scale high-dimensional} sparse least-squares regression problem by exploiting the Johnson-Lindenstrauss (JL) transforms, which embed a set of high-dimensional vectors into a low-dimensional space. In particular, we propose to apply the JL transforms to the data matrix and the target vector and then to solve a sparse least-squares problem on the compressed data with a {\\it slightly larger regularization parameter}. Theoretically, we establish the optimization error bound of the learned model for two different sparsity-inducing r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05185","kind":"arxiv","version":1},"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-18T01:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poHr5J6KCywiWuwCfHNm4EWj3t2ODqw+emYGZQysOYwG+D/pP+sumNOnBHh1wBiHAJYQX6gZbYR4RrIp+mlnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:02.510898Z"},"content_sha256":"fb353c5a1dc0f0835f8e56bd4cd1e3efa06df901d5af070aca1f1ef666372064","schema_version":"1.0","event_id":"sha256:fb353c5a1dc0f0835f8e56bd4cd1e3efa06df901d5af070aca1f1ef666372064"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/bundle.json","state_url":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/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-26T19:59:02Z","links":{"resolver":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH","bundle":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/bundle.json","state":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HCMHZU2LV53DBRKFB2IDKXMSRH","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":"15119d7c6ec2bdf3a13281e79e8e73a3aa9bc0610ebc36c1a0af6665e16cc060","cross_cats_sorted":["cs.CC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","title_canon_sha256":"9d2fdcb0bcb6c2eb5fc1be9ce09aff231293a4cea260f04a210b67535604b020"},"schema_version":"1.0","source":{"id":"1507.05185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05185","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05185v1","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05185","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"HCMHZU2LV53D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HCMHZU2LV53DBRKF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HCMHZU2L","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:fb353c5a1dc0f0835f8e56bd4cd1e3efa06df901d5af070aca1f1ef666372064","target":"graph","created_at":"2026-05-18T01:36:39Z","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":"In this paper, we study a fast approximation method for {\\it large-scale high-dimensional} sparse least-squares regression problem by exploiting the Johnson-Lindenstrauss (JL) transforms, which embed a set of high-dimensional vectors into a low-dimensional space. In particular, we propose to apply the JL transforms to the data matrix and the target vector and then to solve a sparse least-squares problem on the compressed data with a {\\it slightly larger regularization parameter}. Theoretically, we establish the optimization error bound of the learned model for two different sparsity-inducing r","authors_text":"Lijun Zhang, Qihang Lin, Rong Jin, Tianbao Yang","cross_cats":["cs.CC","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","title":"Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05185","kind":"arxiv","version":1},"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:199b8a8a5dc9b1dee7948ca938a4e05272bc5d27cacd9f2a0a8ef79c379c6e11","target":"record","created_at":"2026-05-18T01:36:39Z","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":"15119d7c6ec2bdf3a13281e79e8e73a3aa9bc0610ebc36c1a0af6665e16cc060","cross_cats_sorted":["cs.CC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","title_canon_sha256":"9d2fdcb0bcb6c2eb5fc1be9ce09aff231293a4cea260f04a210b67535604b020"},"schema_version":"1.0","source":{"id":"1507.05185","kind":"arxiv","version":1}},"canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","first_computed_at":"2026-05-18T01:36:39.347492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:39.347492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+W6pYutv+GgFINZN5gHkDjVH+yJCdXA3mjYz5eoPktMdIbXZDwcv4ycVB9RgqdtEX4TLDPgOg9q/bM56FPozCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:39.348236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199b8a8a5dc9b1dee7948ca938a4e05272bc5d27cacd9f2a0a8ef79c379c6e11","sha256:fb353c5a1dc0f0835f8e56bd4cd1e3efa06df901d5af070aca1f1ef666372064"],"state_sha256":"67a892301208c6a9ded178c4c21758c2c6dc3ad700a04a31307c2ba76cbcfc57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UljXdCcVvYkUfDGGoc3xGtV215GgUuS98mgBPC8FEALjdRwTRWVihe0R2B7Q37qRpNVVeZLVyCRPG2xvQzLkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:59:02.514637Z","bundle_sha256":"c55e459179029ca8cca56350d36e38405031ca3aac0ccc240d75ffa492258bee"}}