{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RXGUSEV5ZDFFGWVG3AXY3PPLRB","short_pith_number":"pith:RXGUSEV5","schema_version":"1.0","canonical_sha256":"8dcd4912bdc8ca535aa6d82f8dbdeb8870c2811b187d92ce1a84053ff534def9","source":{"kind":"arxiv","id":"1410.8420","version":1},"attestation_state":"computed","paper":{"title":"Learning circuits with few negations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Cl\\'ement L. Canonne, Eric Blais, Igor C. Oliveira, Li-Yang Tan, Rocco A. Servedio","submitted_at":"2014-10-30T16:10:26Z","abstract_excerpt":"Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in any circuit computing them, a complexity measure that interpolates between monotone functions and the class of all functions. We study this generalization of monotonicity from the vantage point of learning theory, giving near-matching upper and lower bounds on the uniform-distribution learnability of circuits in terms of the number of negations they contain. O"},"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":"1410.8420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-30T16:10:26Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"ef8cd8719df851f3c295abe402490a80c9d11d563eefb154731d54219a5a8d2d","abstract_canon_sha256":"3e3eecf9469edcf24da7940889728a3aa0333fef2614b13ac5d44e68f677ca43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:59.942454Z","signature_b64":"ShXHA9uJHKw2VkR7gGaqFkWs7aguFBgVUZNJd6GHZ9bBDQhsXE6d6WrpRTNqYsd6CFiFNvubtrW2845qVtnAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dcd4912bdc8ca535aa6d82f8dbdeb8870c2811b187d92ce1a84053ff534def9","last_reissued_at":"2026-05-18T02:38:59.942033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:59.942033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning circuits with few negations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Cl\\'ement L. Canonne, Eric Blais, Igor C. Oliveira, Li-Yang Tan, Rocco A. Servedio","submitted_at":"2014-10-30T16:10:26Z","abstract_excerpt":"Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in any circuit computing them, a complexity measure that interpolates between monotone functions and the class of all functions. We study this generalization of monotonicity from the vantage point of learning theory, giving near-matching upper and lower bounds on the uniform-distribution learnability of circuits in terms of the number of negations they contain. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8420","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":"1410.8420","created_at":"2026-05-18T02:38:59.942098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8420v1","created_at":"2026-05-18T02:38:59.942098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8420","created_at":"2026-05-18T02:38:59.942098+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXGUSEV5ZDFF","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXGUSEV5ZDFFGWVG","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXGUSEV5","created_at":"2026-05-18T12:28:46.137349+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/RXGUSEV5ZDFFGWVG3AXY3PPLRB","json":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB.json","graph_json":"https://pith.science/api/pith-number/RXGUSEV5ZDFFGWVG3AXY3PPLRB/graph.json","events_json":"https://pith.science/api/pith-number/RXGUSEV5ZDFFGWVG3AXY3PPLRB/events.json","paper":"https://pith.science/paper/RXGUSEV5"},"agent_actions":{"view_html":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB","download_json":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB.json","view_paper":"https://pith.science/paper/RXGUSEV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8420&json=true","fetch_graph":"https://pith.science/api/pith-number/RXGUSEV5ZDFFGWVG3AXY3PPLRB/graph.json","fetch_events":"https://pith.science/api/pith-number/RXGUSEV5ZDFFGWVG3AXY3PPLRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB/action/storage_attestation","attest_author":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB/action/author_attestation","sign_citation":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB/action/citation_signature","submit_replication":"https://pith.science/pith/RXGUSEV5ZDFFGWVG3AXY3PPLRB/action/replication_record"}},"created_at":"2026-05-18T02:38:59.942098+00:00","updated_at":"2026-05-18T02:38:59.942098+00:00"}