{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X2EZQCO2LDFN43LJG4GXFE52JI","short_pith_number":"pith:X2EZQCO2","schema_version":"1.0","canonical_sha256":"be899809da58cade6d69370d7293ba4a3481193c5b2e2613133b880651f24318","source":{"kind":"arxiv","id":"1502.05375","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05375","created_at":"2026-05-18T02:26:51.889116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05375v1","created_at":"2026-05-18T02:26:51.889116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05375","created_at":"2026-05-18T02:26:51.889116+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2EZQCO2LDFN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2EZQCO2LDFN43LJ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2EZQCO2","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI","json":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI.json","graph_json":"https://pith.science/api/pith-number/X2EZQCO2LDFN43LJG4GXFE52JI/graph.json","events_json":"https://pith.science/api/pith-number/X2EZQCO2LDFN43LJG4GXFE52JI/events.json","paper":"https://pith.science/paper/X2EZQCO2"},"agent_actions":{"view_html":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI","download_json":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI.json","view_paper":"https://pith.science/paper/X2EZQCO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05375&json=true","fetch_graph":"https://pith.science/api/pith-number/X2EZQCO2LDFN43LJG4GXFE52JI/graph.json","fetch_events":"https://pith.science/api/pith-number/X2EZQCO2LDFN43LJG4GXFE52JI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/action/storage_attestation","attest_author":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/action/author_attestation","sign_citation":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/action/citation_signature","submit_replication":"https://pith.science/pith/X2EZQCO2LDFN43LJG4GXFE52JI/action/replication_record"}},"created_at":"2026-05-18T02:26:51.889116+00:00","updated_at":"2026-05-18T02:26:51.889116+00:00"}