{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:A4JNB3I4H773OCORTGXDJEGPQX","short_pith_number":"pith:A4JNB3I4","canonical_record":{"source":{"id":"2402.14103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T19:55:01Z","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ed7fe5fcb02dba470f7fed41cc3aa6d6579f9fa0fe4b607f29c6fb5bd920172a","abstract_canon_sha256":"2e24c61f574fabc1da97e72d6000ca5931ede0a8d1f9793ee86e303186fa7660"},"schema_version":"1.0"},"canonical_sha256":"0712d0ed1c3fffb709d199ae3490cf85fb6e4744ae9e7236d241ae0d7c5c7b80","source":{"kind":"arxiv","id":"2402.14103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14103","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14103v2","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14103","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4JNB3I4H773","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_16","alias_value":"A4JNB3I4H773OCOR","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_8","alias_value":"A4JNB3I4","created_at":"2026-07-05T08:36:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:A4JNB3I4H773OCORTGXDJEGPQX","target":"record","payload":{"canonical_record":{"source":{"id":"2402.14103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T19:55:01Z","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ed7fe5fcb02dba470f7fed41cc3aa6d6579f9fa0fe4b607f29c6fb5bd920172a","abstract_canon_sha256":"2e24c61f574fabc1da97e72d6000ca5931ede0a8d1f9793ee86e303186fa7660"},"schema_version":"1.0"},"canonical_sha256":"0712d0ed1c3fffb709d199ae3490cf85fb6e4744ae9e7236d241ae0d7c5c7b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:22.902734Z","signature_b64":"7NjwOZOyFH5aBhZCPZ1ohd0D56BPLrlAeJ6pKDMCC/A0elZ7/zUiRQyPiF7JgnYg13zRKKfRCPApQsPwDUMoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0712d0ed1c3fffb709d199ae3490cf85fb6e4744ae9e7236d241ae0d7c5c7b80","last_reissued_at":"2026-07-05T08:36:22.902045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:22.902045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.14103","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-07-05T08:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqjZOEobWKQAkXXnrnesvIClTouOVK7a+977QScOarWZ+Q9CtN4Zhms45JeX8QCtDxp+P3gPKNpIRGlM2lkJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:19:26.460543Z"},"content_sha256":"b5089b892da50566301d1105c47e595eefb60cd5766c8351cec8f7c534118bba","schema_version":"1.0","event_id":"sha256:b5089b892da50566301d1105c47e595eefb60cd5766c8351cec8f7c534118bba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:A4JNB3I4H773OCORTGXDJEGPQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Jingqiu Ding, Rares-Darius Buhai, Stefan Tiegel","submitted_at":"2024-02-21T19:55:01Z","abstract_excerpt":"We study computational-statistical gaps for improper learning in sparse linear regression. More specifically, given $n$ samples from a $k$-sparse linear model in dimension $d$, we ask what is the minimum sample complexity to efficiently (in time polynomial in $d$, $k$, and $n$) find a potentially dense estimate for the regression vector that achieves non-trivial prediction error on the $n$ samples. Information-theoretically this can be achieved using $\\Theta(k \\log (d/k))$ samples. Yet, despite its prominence in the literature, there is no polynomial-time algorithm known to achieve the same gu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14103","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.14103/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTqaeJ2xPlcl473ugiYpTHXFV88VUqrhWpnzGnYOh8PpeVPPgrCXGB8HrrB4c9ORTV59QuO4rBM8GyYnswUYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:19:26.461237Z"},"content_sha256":"69f94875322b41c4810ee14db0ed57ae5cc50ec221748077a66ad0eee5add0e1","schema_version":"1.0","event_id":"sha256:69f94875322b41c4810ee14db0ed57ae5cc50ec221748077a66ad0eee5add0e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4JNB3I4H773OCORTGXDJEGPQX/bundle.json","state_url":"https://pith.science/pith/A4JNB3I4H773OCORTGXDJEGPQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4JNB3I4H773OCORTGXDJEGPQX/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-08-08T17:19:26Z","links":{"resolver":"https://pith.science/pith/A4JNB3I4H773OCORTGXDJEGPQX","bundle":"https://pith.science/pith/A4JNB3I4H773OCORTGXDJEGPQX/bundle.json","state":"https://pith.science/pith/A4JNB3I4H773OCORTGXDJEGPQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4JNB3I4H773OCORTGXDJEGPQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:A4JNB3I4H773OCORTGXDJEGPQX","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":"2e24c61f574fabc1da97e72d6000ca5931ede0a8d1f9793ee86e303186fa7660","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T19:55:01Z","title_canon_sha256":"ed7fe5fcb02dba470f7fed41cc3aa6d6579f9fa0fe4b607f29c6fb5bd920172a"},"schema_version":"1.0","source":{"id":"2402.14103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14103","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14103v2","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14103","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4JNB3I4H773","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_16","alias_value":"A4JNB3I4H773OCOR","created_at":"2026-07-05T08:36:22Z"},{"alias_kind":"pith_short_8","alias_value":"A4JNB3I4","created_at":"2026-07-05T08:36:22Z"}],"graph_snapshots":[{"event_id":"sha256:69f94875322b41c4810ee14db0ed57ae5cc50ec221748077a66ad0eee5add0e1","target":"graph","created_at":"2026-07-05T08:36:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.14103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study computational-statistical gaps for improper learning in sparse linear regression. More specifically, given $n$ samples from a $k$-sparse linear model in dimension $d$, we ask what is the minimum sample complexity to efficiently (in time polynomial in $d$, $k$, and $n$) find a potentially dense estimate for the regression vector that achieves non-trivial prediction error on the $n$ samples. Information-theoretically this can be achieved using $\\Theta(k \\log (d/k))$ samples. Yet, despite its prominence in the literature, there is no polynomial-time algorithm known to achieve the same gu","authors_text":"Jingqiu Ding, Rares-Darius Buhai, Stefan Tiegel","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T19:55:01Z","title":"Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14103","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:b5089b892da50566301d1105c47e595eefb60cd5766c8351cec8f7c534118bba","target":"record","created_at":"2026-07-05T08:36:22Z","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":"2e24c61f574fabc1da97e72d6000ca5931ede0a8d1f9793ee86e303186fa7660","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T19:55:01Z","title_canon_sha256":"ed7fe5fcb02dba470f7fed41cc3aa6d6579f9fa0fe4b607f29c6fb5bd920172a"},"schema_version":"1.0","source":{"id":"2402.14103","kind":"arxiv","version":2}},"canonical_sha256":"0712d0ed1c3fffb709d199ae3490cf85fb6e4744ae9e7236d241ae0d7c5c7b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0712d0ed1c3fffb709d199ae3490cf85fb6e4744ae9e7236d241ae0d7c5c7b80","first_computed_at":"2026-07-05T08:36:22.902045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:22.902045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7NjwOZOyFH5aBhZCPZ1ohd0D56BPLrlAeJ6pKDMCC/A0elZ7/zUiRQyPiF7JgnYg13zRKKfRCPApQsPwDUMoCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:22.902734Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.14103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5089b892da50566301d1105c47e595eefb60cd5766c8351cec8f7c534118bba","sha256:69f94875322b41c4810ee14db0ed57ae5cc50ec221748077a66ad0eee5add0e1"],"state_sha256":"c608509fffac7a108688540335a69aa36f9422a361af01f532731020ec71a3b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sk6c4Kbkq/Kuy1St6Bnm0BQOLrksdGBGpNb7Pn2Ia2pFBoVY5ewawnzC3wtD3kd7IRsheJhrI6spPbf7irjGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:19:26.468415Z","bundle_sha256":"4fde6287e1a1d4195e71474384814b387e8dd47be8d3a88c86b45fb3a23ce550"}}