{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ASNNMWAFJJBDDP7Y3SEZSNG7ZL","short_pith_number":"pith:ASNNMWAF","canonical_record":{"source":{"id":"2504.15244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:16:14Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"57af474d0951fa9b986f4a7110f455bb3dc61bfe43cc985b099e4675c07f810b","abstract_canon_sha256":"e08279a729b989c824ea95b306748ffed43e3338df69319225a201e2d2466a13"},"schema_version":"1.0"},"canonical_sha256":"049ad658054a4231bff8dc899934dfcad25e1c60c940bd665360477bdcfbab22","source":{"kind":"arxiv","id":"2504.15244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15244","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15244v1","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15244","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"ASNNMWAFJJBD","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASNNMWAFJJBDDP7Y","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASNNMWAF","created_at":"2026-07-05T10:51:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ASNNMWAFJJBDDP7Y3SEZSNG7ZL","target":"record","payload":{"canonical_record":{"source":{"id":"2504.15244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:16:14Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"57af474d0951fa9b986f4a7110f455bb3dc61bfe43cc985b099e4675c07f810b","abstract_canon_sha256":"e08279a729b989c824ea95b306748ffed43e3338df69319225a201e2d2466a13"},"schema_version":"1.0"},"canonical_sha256":"049ad658054a4231bff8dc899934dfcad25e1c60c940bd665360477bdcfbab22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:58.701420Z","signature_b64":"RF8zHJgKwM2XLEulSwkw04xwvj2I85ZL6/RpITg72lg9M3AcBvNejv677OLR0fC4oaiIux28WbYdF0PmoQUDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"049ad658054a4231bff8dc899934dfcad25e1c60c940bd665360477bdcfbab22","last_reissued_at":"2026-07-05T10:51:58.700970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:58.700970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.15244","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-07-05T10:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Om+0l1wdV79Nj45o4CCc16mOJJxOsMXk/Exqo6FVe86aJfvdXOPkl3JJdSbGs/LYs6xkBS4m3LRRnbvyEEJrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:50.935126Z"},"content_sha256":"64711f54f525d7acebbc897a61a424a38530dbe2dec3be524cb58c1ebc5d8cfa","schema_version":"1.0","event_id":"sha256:64711f54f525d7acebbc897a61a424a38530dbe2dec3be524cb58c1ebc5d8cfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ASNNMWAFJJBDDP7Y3SEZSNG7ZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Agnostically Learning Disjunctions and their Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Lisheng Ren","submitted_at":"2025-04-21T17:16:14Z","abstract_excerpt":"We study the algorithmic task of learning Boolean disjunctions in the distribution-free agnostic PAC model. The best known agnostic learner for the class of disjunctions over $\\{0, 1\\}^n$ is the $L_1$-polynomial regression algorithm, achieving complexity $2^{\\tilde{O}(n^{1/2})}$. This complexity bound is known to be nearly best possible within the class of Correlational Statistical Query (CSQ) algorithms. In this work, we develop an agnostic learner for this concept class with complexity $2^{\\tilde{O}(n^{1/3})}$. Our algorithm can be implemented in the Statistical Query (SQ) model, providing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15244","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.15244/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-05T10:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2t9/ypG5I4rwafeSZ8ex+YCHn17h7pSr/hGUDew8UyhAEcT+/dG/kY2QDZ2uo0DNbRDT5wMWzVq0mu2bQOxNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:50.935649Z"},"content_sha256":"344b7ca25e696e5b7117af077c99a4faa5e6f9944166f3189fb06ee0baab8ac1","schema_version":"1.0","event_id":"sha256:344b7ca25e696e5b7117af077c99a4faa5e6f9944166f3189fb06ee0baab8ac1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/bundle.json","state_url":"https://pith.science/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/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-07T10:32:50Z","links":{"resolver":"https://pith.science/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL","bundle":"https://pith.science/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/bundle.json","state":"https://pith.science/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASNNMWAFJJBDDP7Y3SEZSNG7ZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ASNNMWAFJJBDDP7Y3SEZSNG7ZL","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":"e08279a729b989c824ea95b306748ffed43e3338df69319225a201e2d2466a13","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:16:14Z","title_canon_sha256":"57af474d0951fa9b986f4a7110f455bb3dc61bfe43cc985b099e4675c07f810b"},"schema_version":"1.0","source":{"id":"2504.15244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15244","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15244v1","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15244","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"ASNNMWAFJJBD","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASNNMWAFJJBDDP7Y","created_at":"2026-07-05T10:51:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASNNMWAF","created_at":"2026-07-05T10:51:58Z"}],"graph_snapshots":[{"event_id":"sha256:344b7ca25e696e5b7117af077c99a4faa5e6f9944166f3189fb06ee0baab8ac1","target":"graph","created_at":"2026-07-05T10:51:58Z","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/2504.15244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the algorithmic task of learning Boolean disjunctions in the distribution-free agnostic PAC model. The best known agnostic learner for the class of disjunctions over $\\{0, 1\\}^n$ is the $L_1$-polynomial regression algorithm, achieving complexity $2^{\\tilde{O}(n^{1/2})}$. This complexity bound is known to be nearly best possible within the class of Correlational Statistical Query (CSQ) algorithms. In this work, we develop an agnostic learner for this concept class with complexity $2^{\\tilde{O}(n^{1/3})}$. Our algorithm can be implemented in the Statistical Query (SQ) model, providing t","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Lisheng Ren","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:16:14Z","title":"Faster Algorithms for Agnostically Learning Disjunctions and their Implications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15244","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:64711f54f525d7acebbc897a61a424a38530dbe2dec3be524cb58c1ebc5d8cfa","target":"record","created_at":"2026-07-05T10:51:58Z","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":"e08279a729b989c824ea95b306748ffed43e3338df69319225a201e2d2466a13","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:16:14Z","title_canon_sha256":"57af474d0951fa9b986f4a7110f455bb3dc61bfe43cc985b099e4675c07f810b"},"schema_version":"1.0","source":{"id":"2504.15244","kind":"arxiv","version":1}},"canonical_sha256":"049ad658054a4231bff8dc899934dfcad25e1c60c940bd665360477bdcfbab22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"049ad658054a4231bff8dc899934dfcad25e1c60c940bd665360477bdcfbab22","first_computed_at":"2026-07-05T10:51:58.700970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:58.700970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RF8zHJgKwM2XLEulSwkw04xwvj2I85ZL6/RpITg72lg9M3AcBvNejv677OLR0fC4oaiIux28WbYdF0PmoQUDBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:58.701420Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64711f54f525d7acebbc897a61a424a38530dbe2dec3be524cb58c1ebc5d8cfa","sha256:344b7ca25e696e5b7117af077c99a4faa5e6f9944166f3189fb06ee0baab8ac1"],"state_sha256":"66113aaadfb1003bf626f1c2351a30c35f1783d3279df550320849e50526cfc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXGflZY3arQ1tPUxf42QrvyXMdz1VBaA9BSrBOHsozxEVbrPwvdKYW2zZG8T2yjgXLvx36q7A9ag5nmppLTuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:32:50.941270Z","bundle_sha256":"3655a0f1f477e3615907bf84e602118787171924d7c7a8edd7495747f7a89d6a"}}