{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Z6E3BXDKJ3VIEJ3J5FRCMWY5I5","short_pith_number":"pith:Z6E3BXDK","canonical_record":{"source":{"id":"2605.13840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T17:58:46Z","cross_cats_sorted":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"57784455d6f967c37c1538e4edba9185a921d021fd916f90fae7bc6fd286546f","abstract_canon_sha256":"7086e9550442952c36c38ae5c9c84048d9a914a03ae26da5de549d02d0a15bf1"},"schema_version":"1.0"},"canonical_sha256":"cf89b0dc6a4eea822769e962265b1d4747415266867d49bd54e53b19cba45bc9","source":{"kind":"arxiv","id":"2605.13840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13840","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13840v1","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13840","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"Z6E3BXDKJ3VI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Z6E3BXDKJ3VIEJ3J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Z6E3BXDK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Z6E3BXDKJ3VIEJ3J5FRCMWY5I5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T17:58:46Z","cross_cats_sorted":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"57784455d6f967c37c1538e4edba9185a921d021fd916f90fae7bc6fd286546f","abstract_canon_sha256":"7086e9550442952c36c38ae5c9c84048d9a914a03ae26da5de549d02d0a15bf1"},"schema_version":"1.0"},"canonical_sha256":"cf89b0dc6a4eea822769e962265b1d4747415266867d49bd54e53b19cba45bc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:09.538363Z","signature_b64":"Qb3mWTkJsVPdsmOxPngS5NdSbRDQ6fTB9+WqkjlzW+EN1SylNmDFVqQGe6LSRWsD5EDbhnqgLsuvW6pd5GMfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf89b0dc6a4eea822769e962265b1d4747415266867d49bd54e53b19cba45bc9","last_reissued_at":"2026-05-18T02:44:09.537748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:09.537748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13840","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-05-18T02:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDeWDaXNYMHhewIc4LW7Yb1e/UT5XZ6txEIn7zALp1/6U6yptf34A/nZJtQxDaadoushVFYlduYjCcO+ZGzwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:56:47.494517Z"},"content_sha256":"8f6b1dd441a833efb39b3ed1b3cbdc972561b50ff5d4aa0e54eae83f7533f495","schema_version":"1.0","event_id":"sha256:8f6b1dd441a833efb39b3ed1b3cbdc972561b50ff5d4aa0e54eae83f7533f495"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Z6E3BXDKJ3VIEJ3J5FRCMWY5I5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What is Learnable in Valiant's Theory of the Learnable?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme.","cross_cats":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ML","authors_text":"Anay Mehrotra, Grigoris Velegkas, Manolis Zampetakis, Steve Hanneke","submitted_at":"2026-05-13T17:58:46Z","abstract_excerpt":"Valiant's 1984 paper is widely credited with introducing the PAC learning model, but it, in fact, introduced a different model: unlike PAC learning, the learner receives only positives, may issue membership queries, and must output a hypothesis with no false positives. Prior work characterized variants, including the case without queries. We revisit Valiant's original model and ask: *Which classes are learnable in it?*\n  For every finite domain, including Valiant's Boolean-hypercube setting, we show that a class is learnable if and only if every realizable positive sample can be certified by a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For every finite domain, a class is learnable if and only if every realizable positive sample can be certified by a poly-size adaptive query-compression scheme.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model requires the learner to output a hypothesis with no false positives and the domain is finite for the exact if-and-only-if characterization to hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9c5f34cadf1b10f853398476a7bd909335de673fd617b1fe6f36d201f7c52b2d"},"source":{"id":"2605.13840","kind":"arxiv","version":1},"verdict":{"id":"fdb76418-d71e-48a9-a077-daf798bc4555","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:30:54.054013Z","strongest_claim":"For every finite domain, a class is learnable if and only if every realizable positive sample can be certified by a poly-size adaptive query-compression scheme.","one_line_summary":"Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model requires the learner to output a hypothesis with no false positives and the domain is finite for the exact if-and-only-if characterization to hold.","pith_extraction_headline":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme."},"references":{"count":9,"sample":[{"doi":"10.1023/a:1022821128753","year":1991,"title":"Neural Net Algorithms That Learn in Polynomial Time from Examples and Queries","work_id":"6d03f663-f8bc-4556-a703-8f8e09e81c90","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/pl00013833","year":2010,"title":"The true sample complexity of active learning","work_id":"5bf099ea-031b-4f0b-b79e-c0c2ee65c91d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/1","year":2025,"title":"More asymmetry yields faster matrix multiplication","work_id":"5ec132ea-8bab-4415-b2af-677e9db16f00","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/1968.1972","year":1968,"title":"Valiant , title =","work_id":"8ab345b4-f5a5-4245-be18-8cf6d13bf08e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"if h ⋆ ∈ K, then S ⊆ DS,K ⊆ supp(h⋆)","work_id":"5a70d8b3-8c38-487c-bb2b-43502bc63c4b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":9,"snapshot_sha256":"0196e485db7cb4b60bdd520b60a5638b542f51088d0ccd097d492f014ac44373","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":"fdb76418-d71e-48a9-a077-daf798bc4555"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pa2MXRzDn+m2CfZzNGLtSVlitEhMXqhYBSIN66dedWCkaq9BiT0LgUGpvp17nxrK4V8Tpcl7YuMCZk7rBW4FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:56:47.495629Z"},"content_sha256":"632c73907d77d32f69ed929f5fbf9f1a2cb88de47ea883bed513cee66211a960","schema_version":"1.0","event_id":"sha256:632c73907d77d32f69ed929f5fbf9f1a2cb88de47ea883bed513cee66211a960"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/bundle.json","state_url":"https://pith.science/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/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-06-08T05:56:47Z","links":{"resolver":"https://pith.science/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5","bundle":"https://pith.science/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/bundle.json","state":"https://pith.science/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6E3BXDKJ3VIEJ3J5FRCMWY5I5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z6E3BXDKJ3VIEJ3J5FRCMWY5I5","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":"7086e9550442952c36c38ae5c9c84048d9a914a03ae26da5de549d02d0a15bf1","cross_cats_sorted":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T17:58:46Z","title_canon_sha256":"57784455d6f967c37c1538e4edba9185a921d021fd916f90fae7bc6fd286546f"},"schema_version":"1.0","source":{"id":"2605.13840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13840","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13840v1","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13840","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"Z6E3BXDKJ3VI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Z6E3BXDKJ3VIEJ3J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Z6E3BXDK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:632c73907d77d32f69ed929f5fbf9f1a2cb88de47ea883bed513cee66211a960","target":"graph","created_at":"2026-05-18T02:44:09Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For every finite domain, a class is learnable if and only if every realizable positive sample can be certified by a poly-size adaptive query-compression scheme."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model requires the learner to output a hypothesis with no false positives and the domain is finite for the exact if-and-only-if characterization to hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme."}],"snapshot_sha256":"9c5f34cadf1b10f853398476a7bd909335de673fd617b1fe6f36d201f7c52b2d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Valiant's 1984 paper is widely credited with introducing the PAC learning model, but it, in fact, introduced a different model: unlike PAC learning, the learner receives only positives, may issue membership queries, and must output a hypothesis with no false positives. Prior work characterized variants, including the case without queries. We revisit Valiant's original model and ask: *Which classes are learnable in it?*\n  For every finite domain, including Valiant's Boolean-hypercube setting, we show that a class is learnable if and only if every realizable positive sample can be certified by a","authors_text":"Anay Mehrotra, Grigoris Velegkas, Manolis Zampetakis, Steve Hanneke","cross_cats":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"headline":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T17:58:46Z","title":"What is Learnable in Valiant's Theory of the Learnable?"},"references":{"count":9,"internal_anchors":0,"resolved_work":9,"sample":[{"cited_arxiv_id":"","doi":"10.1023/a:1022821128753","is_internal_anchor":false,"ref_index":1,"title":"Neural Net Algorithms That Learn in Polynomial Time from Examples and Queries","work_id":"6d03f663-f8bc-4556-a703-8f8e09e81c90","year":1991},{"cited_arxiv_id":"","doi":"10.1007/pl00013833","is_internal_anchor":false,"ref_index":2,"title":"The true sample complexity of active learning","work_id":"5bf099ea-031b-4f0b-b79e-c0c2ee65c91d","year":2010},{"cited_arxiv_id":"","doi":"10.1137/1","is_internal_anchor":false,"ref_index":3,"title":"More asymmetry yields faster matrix multiplication","work_id":"5ec132ea-8bab-4415-b2af-677e9db16f00","year":2025},{"cited_arxiv_id":"","doi":"10.1145/1968.1972","is_internal_anchor":false,"ref_index":4,"title":"Valiant , title =","work_id":"8ab345b4-f5a5-4245-be18-8cf6d13bf08e","year":1968},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"if h ⋆ ∈ K, then S ⊆ DS,K ⊆ supp(h⋆)","work_id":"5a70d8b3-8c38-487c-bb2b-43502bc63c4b","year":null}],"snapshot_sha256":"0196e485db7cb4b60bdd520b60a5638b542f51088d0ccd097d492f014ac44373"},"source":{"id":"2605.13840","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:30:54.054013Z","id":"fdb76418-d71e-48a9-a077-daf798bc4555","model_set":{"reader":"grok-4.3"},"one_line_summary":"Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A class is learnable in Valiant's model exactly when every realizable positive sample admits a poly-size adaptive query-compression scheme.","strongest_claim":"For every finite domain, a class is learnable if and only if every realizable positive sample can be certified by a poly-size adaptive query-compression scheme.","weakest_assumption":"The model requires the learner to output a hypothesis with no false positives and the domain is finite for the exact if-and-only-if characterization to hold."}},"verdict_id":"fdb76418-d71e-48a9-a077-daf798bc4555"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8f6b1dd441a833efb39b3ed1b3cbdc972561b50ff5d4aa0e54eae83f7533f495","target":"record","created_at":"2026-05-18T02:44:09Z","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":"7086e9550442952c36c38ae5c9c84048d9a914a03ae26da5de549d02d0a15bf1","cross_cats_sorted":["cs.DS","cs.LG","math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T17:58:46Z","title_canon_sha256":"57784455d6f967c37c1538e4edba9185a921d021fd916f90fae7bc6fd286546f"},"schema_version":"1.0","source":{"id":"2605.13840","kind":"arxiv","version":1}},"canonical_sha256":"cf89b0dc6a4eea822769e962265b1d4747415266867d49bd54e53b19cba45bc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf89b0dc6a4eea822769e962265b1d4747415266867d49bd54e53b19cba45bc9","first_computed_at":"2026-05-18T02:44:09.537748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:09.537748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qb3mWTkJsVPdsmOxPngS5NdSbRDQ6fTB9+WqkjlzW+EN1SylNmDFVqQGe6LSRWsD5EDbhnqgLsuvW6pd5GMfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:09.538363Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f6b1dd441a833efb39b3ed1b3cbdc972561b50ff5d4aa0e54eae83f7533f495","sha256:632c73907d77d32f69ed929f5fbf9f1a2cb88de47ea883bed513cee66211a960"],"state_sha256":"21776a154afec550df1dcb09391f9b5a65c46613490ab891551126467120985d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYphKY2UIGcQP+ned51vKU6R2gtfzcCPoe31FxuybQn5iAqKkL4fZWPeVNinmOh9D1AcL3lRfciqJvT/1Z6WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:56:47.500732Z","bundle_sha256":"a07ca1f3e1e368efdbb359f1952cb5bcaad58a529ce6ee53ea96d2c8737b6be5"}}