{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:POCG5N5ICFS6A45PUPERQPLZ2A","short_pith_number":"pith:POCG5N5I","schema_version":"1.0","canonical_sha256":"7b846eb7a81165e073afa3c9183d79d0356c7d6157f8a75aabfc557eb9e05958","source":{"kind":"arxiv","id":"2204.11894","version":3},"attestation_state":"computed","paper":{"title":"Properly learning monotone functions via local reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arsen Vasilyan, Jane Lange, Ronitt Rubinfeld","submitted_at":"2022-04-25T18:01:14Z","abstract_excerpt":"We give a $2^{\\tilde{O}(\\sqrt{n}/\\epsilon)}$-time algorithm for properly learning monotone Boolean functions under the uniform distribution over $\\{0,1\\}^n$. Our algorithm is robust to adversarial label noise and has a running time nearly matching that of the state-of-the-art improper learning algorithm of Bshouty and Tamon (JACM '96) and an information-theoretic lower bound of Blais et al (RANDOM '15). Prior to this work, no proper learning algorithm with running time smaller than $2^{\\Omega(n)}$ was known to exist.\n  The core of our proper learner is a \\emph{local computation algorithm} for "},"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":"2204.11894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-25T18:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"b5c4514dd1f5a7b0c1760983d605b0400c2df47d3418e28817adf126411ac770","abstract_canon_sha256":"89aecae6c06f7fa3bf37835a32b8ab071aafacefcb82ac0b57f57339ef0ba351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:08.483496Z","signature_b64":"Tegmc4+xJGgMAecNS2AAgLPRFo4Ee0dtKT85JIXYCZR2Cd36wA14nTH6jmUIzNlCIsfPPrIjmbSyRUfoCc4DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b846eb7a81165e073afa3c9183d79d0356c7d6157f8a75aabfc557eb9e05958","last_reissued_at":"2026-07-05T05:55:08.482944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:08.482944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properly learning monotone functions via local reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arsen Vasilyan, Jane Lange, Ronitt Rubinfeld","submitted_at":"2022-04-25T18:01:14Z","abstract_excerpt":"We give a $2^{\\tilde{O}(\\sqrt{n}/\\epsilon)}$-time algorithm for properly learning monotone Boolean functions under the uniform distribution over $\\{0,1\\}^n$. Our algorithm is robust to adversarial label noise and has a running time nearly matching that of the state-of-the-art improper learning algorithm of Bshouty and Tamon (JACM '96) and an information-theoretic lower bound of Blais et al (RANDOM '15). Prior to this work, no proper learning algorithm with running time smaller than $2^{\\Omega(n)}$ was known to exist.\n  The core of our proper learner is a \\emph{local computation algorithm} for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.11894","kind":"arxiv","version":3},"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/2204.11894/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":"2204.11894","created_at":"2026-07-05T05:55:08.483001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.11894v3","created_at":"2026-07-05T05:55:08.483001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.11894","created_at":"2026-07-05T05:55:08.483001+00:00"},{"alias_kind":"pith_short_12","alias_value":"POCG5N5ICFS6","created_at":"2026-07-05T05:55:08.483001+00:00"},{"alias_kind":"pith_short_16","alias_value":"POCG5N5ICFS6A45P","created_at":"2026-07-05T05:55:08.483001+00:00"},{"alias_kind":"pith_short_8","alias_value":"POCG5N5I","created_at":"2026-07-05T05:55:08.483001+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/POCG5N5ICFS6A45PUPERQPLZ2A","json":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A.json","graph_json":"https://pith.science/api/pith-number/POCG5N5ICFS6A45PUPERQPLZ2A/graph.json","events_json":"https://pith.science/api/pith-number/POCG5N5ICFS6A45PUPERQPLZ2A/events.json","paper":"https://pith.science/paper/POCG5N5I"},"agent_actions":{"view_html":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A","download_json":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A.json","view_paper":"https://pith.science/paper/POCG5N5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.11894&json=true","fetch_graph":"https://pith.science/api/pith-number/POCG5N5ICFS6A45PUPERQPLZ2A/graph.json","fetch_events":"https://pith.science/api/pith-number/POCG5N5ICFS6A45PUPERQPLZ2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A/action/storage_attestation","attest_author":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A/action/author_attestation","sign_citation":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A/action/citation_signature","submit_replication":"https://pith.science/pith/POCG5N5ICFS6A45PUPERQPLZ2A/action/replication_record"}},"created_at":"2026-07-05T05:55:08.483001+00:00","updated_at":"2026-07-05T05:55:08.483001+00:00"}