{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UC3OMTLPKD6YDUJYF4DTM654GX","short_pith_number":"pith:UC3OMTLP","schema_version":"1.0","canonical_sha256":"a0b6e64d6f50fd81d1382f07367bbc35d6d825fc5fda5b9d63be41af45887ab0","source":{"kind":"arxiv","id":"2505.18839","version":1},"attestation_state":"computed","paper":{"title":"DNF Learning via Locally Mixing Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Josh Alman, Rocco A. Servedio, Shivam Nadimpalli, Shyamal Patel","submitted_at":"2025-05-24T19:29:02Z","abstract_excerpt":"We give two results on PAC learning DNF formulas using membership queries in the challenging \"distribution-free\" learning framework, where learning algorithms must succeed for an arbitrary and unknown distribution over $\\{0,1\\}^n$.\n  (1) We first give a quasi-polynomial time \"list-decoding\" algorithm for learning a single term of an unknown DNF formula. More precisely, for any target $s$-term DNF formula $f = T_1 \\vee \\cdots \\vee T_s$ over $\\{0,1\\}^n$ and any unknown distribution $D$ over $\\{0,1\\}^n$, our algorithm, which uses membership queries and random examples from $D$, runs in $\\textsf{q"},"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":"2505.18839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-24T19:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"65c6c8aec6121a78a11dd534ceebf08211b83e5d4a157a0a929d158c23017edf","abstract_canon_sha256":"a02e2cfc44c37640885c47ab752d937db734a39f2fabe6c501de8bc91abdfdf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:20.423425Z","signature_b64":"ad1plk1/rOBr02vSOlbHOKLy4jC07R7Nc6+rWdKLyfOFrl7m82J0lK2JVgUhVI32ert9sHUE4dHdJNV7srB2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b6e64d6f50fd81d1382f07367bbc35d6d825fc5fda5b9d63be41af45887ab0","last_reissued_at":"2026-07-05T11:09:20.422812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:20.422812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DNF Learning via Locally Mixing Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Josh Alman, Rocco A. Servedio, Shivam Nadimpalli, Shyamal Patel","submitted_at":"2025-05-24T19:29:02Z","abstract_excerpt":"We give two results on PAC learning DNF formulas using membership queries in the challenging \"distribution-free\" learning framework, where learning algorithms must succeed for an arbitrary and unknown distribution over $\\{0,1\\}^n$.\n  (1) We first give a quasi-polynomial time \"list-decoding\" algorithm for learning a single term of an unknown DNF formula. More precisely, for any target $s$-term DNF formula $f = T_1 \\vee \\cdots \\vee T_s$ over $\\{0,1\\}^n$ and any unknown distribution $D$ over $\\{0,1\\}^n$, our algorithm, which uses membership queries and random examples from $D$, runs in $\\textsf{q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18839","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/2505.18839/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.18839","created_at":"2026-07-05T11:09:20.422871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18839v1","created_at":"2026-07-05T11:09:20.422871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18839","created_at":"2026-07-05T11:09:20.422871+00:00"},{"alias_kind":"pith_short_12","alias_value":"UC3OMTLPKD6Y","created_at":"2026-07-05T11:09:20.422871+00:00"},{"alias_kind":"pith_short_16","alias_value":"UC3OMTLPKD6YDUJY","created_at":"2026-07-05T11:09:20.422871+00:00"},{"alias_kind":"pith_short_8","alias_value":"UC3OMTLP","created_at":"2026-07-05T11:09:20.422871+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/UC3OMTLPKD6YDUJYF4DTM654GX","json":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX.json","graph_json":"https://pith.science/api/pith-number/UC3OMTLPKD6YDUJYF4DTM654GX/graph.json","events_json":"https://pith.science/api/pith-number/UC3OMTLPKD6YDUJYF4DTM654GX/events.json","paper":"https://pith.science/paper/UC3OMTLP"},"agent_actions":{"view_html":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX","download_json":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX.json","view_paper":"https://pith.science/paper/UC3OMTLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18839&json=true","fetch_graph":"https://pith.science/api/pith-number/UC3OMTLPKD6YDUJYF4DTM654GX/graph.json","fetch_events":"https://pith.science/api/pith-number/UC3OMTLPKD6YDUJYF4DTM654GX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX/action/storage_attestation","attest_author":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX/action/author_attestation","sign_citation":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX/action/citation_signature","submit_replication":"https://pith.science/pith/UC3OMTLPKD6YDUJYF4DTM654GX/action/replication_record"}},"created_at":"2026-07-05T11:09:20.422871+00:00","updated_at":"2026-07-05T11:09:20.422871+00:00"}