{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TC2WEUH6Q7LDNWH7OI6ZLZR2S6","short_pith_number":"pith:TC2WEUH6","canonical_record":{"source":{"id":"1603.02250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T20:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"cd5c3382bf923dd4b04e2de5c0405039633611ab03bccba054642f7a63cea4a8","abstract_canon_sha256":"7298329998dfa86c93ab30bc7bfc68508064ac89c509a2fbe16186ecc57c6e00"},"schema_version":"1.0"},"canonical_sha256":"98b56250fe87d636d8ff723d95e63a97bdfb77dbf32483b4a9fd9111370386de","source":{"kind":"arxiv","id":"1603.02250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02250","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02250v1","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02250","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"TC2WEUH6Q7LD","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TC2WEUH6Q7LDNWH7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TC2WEUH6","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TC2WEUH6Q7LDNWH7OI6ZLZR2S6","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T20:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"cd5c3382bf923dd4b04e2de5c0405039633611ab03bccba054642f7a63cea4a8","abstract_canon_sha256":"7298329998dfa86c93ab30bc7bfc68508064ac89c509a2fbe16186ecc57c6e00"},"schema_version":"1.0"},"canonical_sha256":"98b56250fe87d636d8ff723d95e63a97bdfb77dbf32483b4a9fd9111370386de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:31.252797Z","signature_b64":"V5+sv4z0GX8oDpuQsZ89+qrppqYym83LREgOb+ISwuekhpidHNAnt7Z5mVzXpFpd1v7/X2qXUwkeq6P7E+CEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b56250fe87d636d8ff723d95e63a97bdfb77dbf32483b4a9fd9111370386de","last_reissued_at":"2026-05-18T01:19:31.252192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:31.252192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02250","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+mawSWQnlWi/LGb+1KyiTqgeLSlTBn8rMMsBkE7xznWJtRrsclDua3dxmIM5chhy/ZeQv4UvVZlFtOqJNAKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:40:25.344356Z"},"content_sha256":"d43b785218691cbb41f774d489942c910799e9f5e6ebdb36dfd5e387446af90c","schema_version":"1.0","event_id":"sha256:d43b785218691cbb41f774d489942c910799e9f5e6ebdb36dfd5e387446af90c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TC2WEUH6Q7LDNWH7OI6ZLZR2S6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Sparse Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dean Foster, Howard Karloff, Satyen Kale","submitted_at":"2016-03-07T20:49:52Z","abstract_excerpt":"We consider the online sparse linear regression problem, which is the problem of sequentially making predictions observing only a limited number of features in each round, to minimize regret with respect to the best sparse linear regressor, where prediction accuracy is measured by square loss. We give an inefficient algorithm that obtains regret bounded by $\\tilde{O}(\\sqrt{T})$ after $T$ prediction rounds. We complement this result by showing that no algorithm running in polynomial time per iteration can achieve regret bounded by $O(T^{1-\\delta})$ for any constant $\\delta > 0$ unless $\\text{NP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02250","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5O9zn9nrcyFy54LwNQ06gQTxDTR4uGtNtA7o1xITE1BG9zAY+AnW+k3XB4tYfgzaoHifWub3OfIzubC13UW4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:40:25.344998Z"},"content_sha256":"cbbd40cca52e391d8c6a3a438637ba6faad19d23dfd6ea21a53fcf0a37ac68db","schema_version":"1.0","event_id":"sha256:cbbd40cca52e391d8c6a3a438637ba6faad19d23dfd6ea21a53fcf0a37ac68db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/bundle.json","state_url":"https://pith.science/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/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-28T23:40:25Z","links":{"resolver":"https://pith.science/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6","bundle":"https://pith.science/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/bundle.json","state":"https://pith.science/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TC2WEUH6Q7LDNWH7OI6ZLZR2S6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TC2WEUH6Q7LDNWH7OI6ZLZR2S6","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":"7298329998dfa86c93ab30bc7bfc68508064ac89c509a2fbe16186ecc57c6e00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T20:49:52Z","title_canon_sha256":"cd5c3382bf923dd4b04e2de5c0405039633611ab03bccba054642f7a63cea4a8"},"schema_version":"1.0","source":{"id":"1603.02250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02250","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02250v1","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02250","created_at":"2026-05-18T01:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"TC2WEUH6Q7LD","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TC2WEUH6Q7LDNWH7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TC2WEUH6","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:cbbd40cca52e391d8c6a3a438637ba6faad19d23dfd6ea21a53fcf0a37ac68db","target":"graph","created_at":"2026-05-18T01:19:31Z","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":"We consider the online sparse linear regression problem, which is the problem of sequentially making predictions observing only a limited number of features in each round, to minimize regret with respect to the best sparse linear regressor, where prediction accuracy is measured by square loss. We give an inefficient algorithm that obtains regret bounded by $\\tilde{O}(\\sqrt{T})$ after $T$ prediction rounds. We complement this result by showing that no algorithm running in polynomial time per iteration can achieve regret bounded by $O(T^{1-\\delta})$ for any constant $\\delta > 0$ unless $\\text{NP","authors_text":"Dean Foster, Howard Karloff, Satyen Kale","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T20:49:52Z","title":"Online Sparse Linear Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02250","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:d43b785218691cbb41f774d489942c910799e9f5e6ebdb36dfd5e387446af90c","target":"record","created_at":"2026-05-18T01:19:31Z","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":"7298329998dfa86c93ab30bc7bfc68508064ac89c509a2fbe16186ecc57c6e00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T20:49:52Z","title_canon_sha256":"cd5c3382bf923dd4b04e2de5c0405039633611ab03bccba054642f7a63cea4a8"},"schema_version":"1.0","source":{"id":"1603.02250","kind":"arxiv","version":1}},"canonical_sha256":"98b56250fe87d636d8ff723d95e63a97bdfb77dbf32483b4a9fd9111370386de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98b56250fe87d636d8ff723d95e63a97bdfb77dbf32483b4a9fd9111370386de","first_computed_at":"2026-05-18T01:19:31.252192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:31.252192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5+sv4z0GX8oDpuQsZ89+qrppqYym83LREgOb+ISwuekhpidHNAnt7Z5mVzXpFpd1v7/X2qXUwkeq6P7E+CEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:31.252797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d43b785218691cbb41f774d489942c910799e9f5e6ebdb36dfd5e387446af90c","sha256:cbbd40cca52e391d8c6a3a438637ba6faad19d23dfd6ea21a53fcf0a37ac68db"],"state_sha256":"ed1668b676ead707d9cc2c28872b19411d7dd6c66cc4f2d7afef60500db96882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSM+DrpM1d6me1A0uUI46mFjPz2JMfinHuRpgYTk5wiidYVTgH1tAHO+JzcXuX1XZVtqrWEgo6fo476zMg7FAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:40:25.348719Z","bundle_sha256":"d0793564a1523421bb0ab1c20ff2f92fc4af28710f6cf52e779dcf43aa324782"}}