{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X2EZQCO2LDFN43LJG4GXFE52JI","short_pith_number":"pith:X2EZQCO2","canonical_record":{"source":{"id":"1502.05375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T20:36:19Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"3c7a663539396af561adef8f04c1793cfc3170b6280dfaab467059e711d64fa9","abstract_canon_sha256":"c85f7568b4e6c1755ad38da6ac6b10c509646be1b5fea39bcfcf2add12206781"},"schema_version":"1.0"},"canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","source":{"kind":"arxiv","id":"1502.05375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05375","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05375v1","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05375","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"X2EZQCO2LDFN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X2EZQCO2LDFN43LJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X2EZQCO2","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X2EZQCO2LDFN43LJG4GXFE52JI","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T20:36:19Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"3c7a663539396af561adef8f04c1793cfc3170b6280dfaab467059e711d64fa9","abstract_canon_sha256":"c85f7568b4e6c1755ad38da6ac6b10c509646be1b5fea39bcfcf2add12206781"},"schema_version":"1.0"},"canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:51.889471Z","signature_b64":"83VweuiTcwxLfn0vgcvr8umm/dr7mBb4bczjZSglKd8wKaKucosCe98B+JjNNx9iLl9YojUacbNAb0Xv2tUNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","last_reissued_at":"2026-05-18T02:26:51.889047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:51.889047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05375","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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UsrkRDF8eUO0V/xidLRsAL92M1M9EjzfHRtBLYLAYFye3ZbrosR5Ykd/w+j0NeKebA3FtH3RsjFpLav2jnECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:12.981536Z"},"content_sha256":"7b4a6080a7e471b213e6a44e237a402813e48f1f3ba48e5cf1bc471e397f1b96","schema_version":"1.0","event_id":"sha256:7b4a6080a7e471b213e6a44e237a402813e48f1f3ba48e5cf1bc471e397f1b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X2EZQCO2LDFN43LJG4GXFE52JI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On learning k-parities with and without noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Ameet Gadekar, Arnab Bhattacharyya, Ninad Rajgopal","submitted_at":"2015-02-18T20:36:19Z","abstract_excerpt":"We first consider the problem of learning $k$-parities in the on-line mistake-bound model: given a hidden vector $x \\in \\{0,1\\}^n$ with $|x|=k$ and a sequence of \"questions\" $a_1, a_2, ...\\in \\{0,1\\}^n$, where the algorithm must reply to each question with $< a_i, x> \\pmod 2$, what is the best tradeoff between the number of mistakes made by the algorithm and its time complexity? We improve the previous best result of Buhrman et al. by an $\\exp(k)$ factor in the time complexity.\n  Second, we consider the problem of learning $k$-parities in the presence of classification noise of rate $\\eta \\in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05375","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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8XPbjsYLRCS8z/k8vf7jcPmKmqOOAbqtC+5iNkbk7dL2Y9xtsuu4tRx/2Pyiof3RswTaSoi20HmuEE2sZVQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:12.981888Z"},"content_sha256":"f722c530b441b0ce8ccdcce02581d38a8264208f917ea1d8a8492a39279fcf73","schema_version":"1.0","event_id":"sha256:f722c530b441b0ce8ccdcce02581d38a8264208f917ea1d8a8492a39279fcf73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/bundle.json","state_url":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2EZQCO2LDFN43LJG4GXFE52JI/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-31T06:14:12Z","links":{"resolver":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI","bundle":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/bundle.json","state":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2EZQCO2LDFN43LJG4GXFE52JI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X2EZQCO2LDFN43LJG4GXFE52JI","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":"c85f7568b4e6c1755ad38da6ac6b10c509646be1b5fea39bcfcf2add12206781","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T20:36:19Z","title_canon_sha256":"3c7a663539396af561adef8f04c1793cfc3170b6280dfaab467059e711d64fa9"},"schema_version":"1.0","source":{"id":"1502.05375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05375","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05375v1","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05375","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"X2EZQCO2LDFN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X2EZQCO2LDFN43LJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X2EZQCO2","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f722c530b441b0ce8ccdcce02581d38a8264208f917ea1d8a8492a39279fcf73","target":"graph","created_at":"2026-05-18T02:26:51Z","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 first consider the problem of learning $k$-parities in the on-line mistake-bound model: given a hidden vector $x \\in \\{0,1\\}^n$ with $|x|=k$ and a sequence of \"questions\" $a_1, a_2, ...\\in \\{0,1\\}^n$, where the algorithm must reply to each question with $< a_i, x> \\pmod 2$, what is the best tradeoff between the number of mistakes made by the algorithm and its time complexity? We improve the previous best result of Buhrman et al. by an $\\exp(k)$ factor in the time complexity.\n  Second, we consider the problem of learning $k$-parities in the presence of classification noise of rate $\\eta \\in ","authors_text":"Ameet Gadekar, Arnab Bhattacharyya, Ninad Rajgopal","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T20:36:19Z","title":"On learning k-parities with and without noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05375","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:7b4a6080a7e471b213e6a44e237a402813e48f1f3ba48e5cf1bc471e397f1b96","target":"record","created_at":"2026-05-18T02:26:51Z","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":"c85f7568b4e6c1755ad38da6ac6b10c509646be1b5fea39bcfcf2add12206781","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T20:36:19Z","title_canon_sha256":"3c7a663539396af561adef8f04c1793cfc3170b6280dfaab467059e711d64fa9"},"schema_version":"1.0","source":{"id":"1502.05375","kind":"arxiv","version":1}},"canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","first_computed_at":"2026-05-18T02:26:51.889047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:51.889047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83VweuiTcwxLfn0vgcvr8umm/dr7mBb4bczjZSglKd8wKaKucosCe98B+JjNNx9iLl9YojUacbNAb0Xv2tUNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:51.889471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b4a6080a7e471b213e6a44e237a402813e48f1f3ba48e5cf1bc471e397f1b96","sha256:f722c530b441b0ce8ccdcce02581d38a8264208f917ea1d8a8492a39279fcf73"],"state_sha256":"fc566c57f68874e6c66527ac9c53c4a376f90c1871f035c48b9a22e6ae414530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDwJfGN6EdF82PjocXycEzf1YUagAQGUMmaHPuYMZzdq2czyNUZ6PXfO26C+84NyWBsLelCbD13jFCF+6bGqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:14:12.983890Z","bundle_sha256":"318fd1c3ce9e26a015444a8d0c799ee8684b4c871a2de640b6db2ca10c65d400"}}