{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WPKQVB5MM7RBHSTIU7SYUNQ6YB","short_pith_number":"pith:WPKQVB5M","canonical_record":{"source":{"id":"1111.1124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-04T13:33:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"aa079b946955a5d26b3225aec8100ca99e3a0a34010c18a004191dcb421439e6","abstract_canon_sha256":"9d563f5cd62d1696051c424ea1e06b25c46d959f68f248e6c3520c21f0b26e3c"},"schema_version":"1.0"},"canonical_sha256":"b3d50a87ac67e213ca68a7e58a361ec042bebac362aba2fc64a55ab918d28dfd","source":{"kind":"arxiv","id":"1111.1124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1124","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1124v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1124","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"WPKQVB5MM7RB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPKQVB5MM7RBHSTI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPKQVB5M","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WPKQVB5MM7RBHSTIU7SYUNQ6YB","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-04T13:33:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"aa079b946955a5d26b3225aec8100ca99e3a0a34010c18a004191dcb421439e6","abstract_canon_sha256":"9d563f5cd62d1696051c424ea1e06b25c46d959f68f248e6c3520c21f0b26e3c"},"schema_version":"1.0"},"canonical_sha256":"b3d50a87ac67e213ca68a7e58a361ec042bebac362aba2fc64a55ab918d28dfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.677212Z","signature_b64":"yx4+7CkkVq7SqUH8hW0QyC7NiQq3gIjJ7onFGDIjp/2ylnIBFZcu0ZntJ3zStAYSH50EHYNOzPQ7OwQyq8cwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d50a87ac67e213ca68a7e58a361ec042bebac362aba2fc64a55ab918d28dfd","last_reissued_at":"2026-05-18T04:09:35.676791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.676791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1124","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-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVezootcT8K552tRSoIs2DLMuyvQZy55uJlVTuy21KvaO9GGpzRhDdFTcRkXN7mYkdIGoUFNPTD7AfCStktoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:13.543638Z"},"content_sha256":"cf09f4338d90c2d7a62f070f3597d33d9a562627f38adae46006e7ea0953e8ee","schema_version":"1.0","event_id":"sha256:cf09f4338d90c2d7a62f070f3597d33d9a562627f38adae46006e7ea0953e8ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WPKQVB5MM7RBHSTIU7SYUNQ6YB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds on Proper Equivalence Query Learning of DNF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Devorah Kletenik, Linda Sellie, Lisa Hellerstein, Rocco Servedio","submitted_at":"2011-11-04T13:33:24Z","abstract_excerpt":"We prove a new structural lemma for partial Boolean functions $f$, which we call the seed lemma for DNF. Using the lemma, we give the first subexponential algorithm for proper learning of DNF in Angluin's Equivalence Query (EQ) model. The algorithm has time and query complexity $2^{(\\tilde{O}{\\sqrt{n}})}$, which is optimal. We also give a new result on certificates for DNF-size, a simple algorithm for properly PAC-learning DNF, and new results on EQ-learning $\\log n$-term DNF and decision trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1124","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"},"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-05-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHduSKYnChHLHsSthbzU+XI2e51ALKRlQ9Lp5CBjd7YyNiTkiiRemNbZfzxb6DwYynJDIIcRXIrEaItS0YT5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:13.544340Z"},"content_sha256":"56355845d69f8cd78d66ac50b6e48e5fb91266357a6af006629f100d57f15665","schema_version":"1.0","event_id":"sha256:56355845d69f8cd78d66ac50b6e48e5fb91266357a6af006629f100d57f15665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/bundle.json","state_url":"https://pith.science/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/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-05-30T07:34:13Z","links":{"resolver":"https://pith.science/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB","bundle":"https://pith.science/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/bundle.json","state":"https://pith.science/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPKQVB5MM7RBHSTIU7SYUNQ6YB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WPKQVB5MM7RBHSTIU7SYUNQ6YB","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":"9d563f5cd62d1696051c424ea1e06b25c46d959f68f248e6c3520c21f0b26e3c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-04T13:33:24Z","title_canon_sha256":"aa079b946955a5d26b3225aec8100ca99e3a0a34010c18a004191dcb421439e6"},"schema_version":"1.0","source":{"id":"1111.1124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1124","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1124v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1124","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"WPKQVB5MM7RB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPKQVB5MM7RBHSTI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPKQVB5M","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:56355845d69f8cd78d66ac50b6e48e5fb91266357a6af006629f100d57f15665","target":"graph","created_at":"2026-05-18T04:09:35Z","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"},"paper":{"abstract_excerpt":"We prove a new structural lemma for partial Boolean functions $f$, which we call the seed lemma for DNF. Using the lemma, we give the first subexponential algorithm for proper learning of DNF in Angluin's Equivalence Query (EQ) model. The algorithm has time and query complexity $2^{(\\tilde{O}{\\sqrt{n}})}$, which is optimal. We also give a new result on certificates for DNF-size, a simple algorithm for properly PAC-learning DNF, and new results on EQ-learning $\\log n$-term DNF and decision trees.","authors_text":"Devorah Kletenik, Linda Sellie, Lisa Hellerstein, Rocco Servedio","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-04T13:33:24Z","title":"Tight Bounds on Proper Equivalence Query Learning of DNF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1124","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:cf09f4338d90c2d7a62f070f3597d33d9a562627f38adae46006e7ea0953e8ee","target":"record","created_at":"2026-05-18T04:09:35Z","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":"9d563f5cd62d1696051c424ea1e06b25c46d959f68f248e6c3520c21f0b26e3c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-04T13:33:24Z","title_canon_sha256":"aa079b946955a5d26b3225aec8100ca99e3a0a34010c18a004191dcb421439e6"},"schema_version":"1.0","source":{"id":"1111.1124","kind":"arxiv","version":1}},"canonical_sha256":"b3d50a87ac67e213ca68a7e58a361ec042bebac362aba2fc64a55ab918d28dfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d50a87ac67e213ca68a7e58a361ec042bebac362aba2fc64a55ab918d28dfd","first_computed_at":"2026-05-18T04:09:35.676791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:35.676791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yx4+7CkkVq7SqUH8hW0QyC7NiQq3gIjJ7onFGDIjp/2ylnIBFZcu0ZntJ3zStAYSH50EHYNOzPQ7OwQyq8cwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:35.677212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf09f4338d90c2d7a62f070f3597d33d9a562627f38adae46006e7ea0953e8ee","sha256:56355845d69f8cd78d66ac50b6e48e5fb91266357a6af006629f100d57f15665"],"state_sha256":"21a0b1ca6be0405192652d46cc0129d5b64de04b3b9788a744084a80e8a41c5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EojETUUa6t4W6NXJJa/c7C4Bs52qvuW5Rje1tqIi6Ec4503SiQ1nboCRDSFkOBH5MChaKuPe0Ue0zPWrZ416DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:34:13.556851Z","bundle_sha256":"9ac8c306a115f6f28c45b34d448c96e45170005d3e78f6a57cd4735a28b4d511"}}