{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PB3DKZ426GMMFU5Y3LPQXTGJZ6","short_pith_number":"pith:PB3DKZ42","canonical_record":{"source":{"id":"1311.2271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"b6ecd4baa003263b279323df82e6f0971c3a873cfc2aa653ec916e8dbbfc74c3","abstract_canon_sha256":"7b5ea4856f31a5e8c246b91d02df4ea5b33c9e2a3c5e270a27eb641f1bdc3cb4"},"schema_version":"1.0"},"canonical_sha256":"787635679af198c2d3b8dadf0bccc9cfbd76d0f95f922ee062d9ca2ac9941d27","source":{"kind":"arxiv","id":"1311.2271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2271","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2271v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2271","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"PB3DKZ426GMM","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PB3DKZ426GMMFU5Y","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PB3DKZ42","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PB3DKZ426GMMFU5Y3LPQXTGJZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"b6ecd4baa003263b279323df82e6f0971c3a873cfc2aa653ec916e8dbbfc74c3","abstract_canon_sha256":"7b5ea4856f31a5e8c246b91d02df4ea5b33c9e2a3c5e270a27eb641f1bdc3cb4"},"schema_version":"1.0"},"canonical_sha256":"787635679af198c2d3b8dadf0bccc9cfbd76d0f95f922ee062d9ca2ac9941d27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:33.097578Z","signature_b64":"EJp79PkwoCyPcp1jYw7qAXee0FNujTPZ1xiYEaTkccLI2Eo3Cy0NNDDIANJP08pJqrduPI94a4WhO8SZ20M/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787635679af198c2d3b8dadf0bccc9cfbd76d0f95f922ee062d9ca2ac9941d27","last_reissued_at":"2026-05-18T03:07:33.097067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:33.097067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2271","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qkg971H38MdRsWzYKz6fey9FIkdExtVzhRdOH1q7Ww0D86PvgE4J1XG6tDRqvs0QEq+RZHIF6Fq8xNsrlAbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:00.828653Z"},"content_sha256":"9e4ad6aa6c67cdce98efc604aa2e9234fc5457cdc643a86abbc448af338886e1","schema_version":"1.0","event_id":"sha256:9e4ad6aa6c67cdce98efc604aa2e9234fc5457cdc643a86abbc448af338886e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PB3DKZ426GMMFU5Y3LPQXTGJZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More data speeds up training time in learning halfspaces over sparse vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amit Daniely, Nati Linial, Shai Shalev Shwartz","submitted_at":"2013-11-10T13:28:19Z","abstract_excerpt":"The increased availability of data in recent years has led several authors to ask whether it is possible to use data as a {\\em computational} resource. That is, if more data is available, beyond the sample complexity limit, is it possible to use the extra examples to speed up the computation time required to perform the learning task?\n  We give the first positive answer to this question for a {\\em natural supervised learning problem} --- we consider agnostic PAC learning of halfspaces over $3$-sparse vectors in $\\{-1,1,0\\}^n$. This class is inefficiently learnable using $O\\left(n/\\epsilon^2\\ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2271","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0mj1ZN1k+AoaI/VjsvbaOAGtPvXS1tvmwP4N3OIU3f37Vfriud/BbVuOPydF9gX6U+XlmMBeBoIEHJtE4KNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:00.829001Z"},"content_sha256":"0ea1dec694fd57d1c40eae0ca082fc7a97681af1825077a18bc9a84578d75608","schema_version":"1.0","event_id":"sha256:0ea1dec694fd57d1c40eae0ca082fc7a97681af1825077a18bc9a84578d75608"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/bundle.json","state_url":"https://pith.science/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/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-28T07:27:00Z","links":{"resolver":"https://pith.science/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6","bundle":"https://pith.science/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/bundle.json","state":"https://pith.science/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB3DKZ426GMMFU5Y3LPQXTGJZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PB3DKZ426GMMFU5Y3LPQXTGJZ6","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":"7b5ea4856f31a5e8c246b91d02df4ea5b33c9e2a3c5e270a27eb641f1bdc3cb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:28:19Z","title_canon_sha256":"b6ecd4baa003263b279323df82e6f0971c3a873cfc2aa653ec916e8dbbfc74c3"},"schema_version":"1.0","source":{"id":"1311.2271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2271","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2271v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2271","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"PB3DKZ426GMM","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PB3DKZ426GMMFU5Y","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PB3DKZ42","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:0ea1dec694fd57d1c40eae0ca082fc7a97681af1825077a18bc9a84578d75608","target":"graph","created_at":"2026-05-18T03:07:33Z","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":"The increased availability of data in recent years has led several authors to ask whether it is possible to use data as a {\\em computational} resource. That is, if more data is available, beyond the sample complexity limit, is it possible to use the extra examples to speed up the computation time required to perform the learning task?\n  We give the first positive answer to this question for a {\\em natural supervised learning problem} --- we consider agnostic PAC learning of halfspaces over $3$-sparse vectors in $\\{-1,1,0\\}^n$. This class is inefficiently learnable using $O\\left(n/\\epsilon^2\\ri","authors_text":"Amit Daniely, Nati Linial, Shai Shalev Shwartz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:28:19Z","title":"More data speeds up training time in learning halfspaces over sparse vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2271","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:9e4ad6aa6c67cdce98efc604aa2e9234fc5457cdc643a86abbc448af338886e1","target":"record","created_at":"2026-05-18T03:07:33Z","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":"7b5ea4856f31a5e8c246b91d02df4ea5b33c9e2a3c5e270a27eb641f1bdc3cb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:28:19Z","title_canon_sha256":"b6ecd4baa003263b279323df82e6f0971c3a873cfc2aa653ec916e8dbbfc74c3"},"schema_version":"1.0","source":{"id":"1311.2271","kind":"arxiv","version":1}},"canonical_sha256":"787635679af198c2d3b8dadf0bccc9cfbd76d0f95f922ee062d9ca2ac9941d27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787635679af198c2d3b8dadf0bccc9cfbd76d0f95f922ee062d9ca2ac9941d27","first_computed_at":"2026-05-18T03:07:33.097067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:33.097067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJp79PkwoCyPcp1jYw7qAXee0FNujTPZ1xiYEaTkccLI2Eo3Cy0NNDDIANJP08pJqrduPI94a4WhO8SZ20M/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:33.097578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e4ad6aa6c67cdce98efc604aa2e9234fc5457cdc643a86abbc448af338886e1","sha256:0ea1dec694fd57d1c40eae0ca082fc7a97681af1825077a18bc9a84578d75608"],"state_sha256":"336d90ed84a297b470a2be485ab595160921c22034f9f42edf5da7045215b21e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqMkvrNObTaDO7qPzX39FkegXzuyuqu+25KHuDApzwqaq9/fVPMz2ZDO2plGxiTrf1a0BkugzDZT2t4FjBJXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:27:00.830978Z","bundle_sha256":"3180ece1e457af781d0ed8bad296c61aaae00efa3c7c7dc20688224550affac8"}}