{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MIS6SVM3AOIGFQURK3ESTCQFTU","short_pith_number":"pith:MIS6SVM3","schema_version":"1.0","canonical_sha256":"6225e9559b039062c29156c9298a059d32b946d93be7d8513d82ae8b06a7cf7c","source":{"kind":"arxiv","id":"1906.05815","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Adversarially Robust PAC Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitrios I. Diochnos, Mohammad Mahmoody, Saeed Mahloujifar","submitted_at":"2019-06-13T17:01:19Z","abstract_excerpt":"In this work, we initiate a formal study of probably approximately correct (PAC) learning under evasion attacks, where the adversary's goal is to \\emph{misclassify} the adversarially perturbed sample point $\\widetilde{x}$, i.e., $h(\\widetilde{x})\\neq c(\\widetilde{x})$, where $c$ is the ground truth concept and $h$ is the learned hypothesis. Previous work on PAC learning of adversarial examples have all modeled adversarial examples as corrupted inputs in which the goal of the adversary is to achieve $h(\\widetilde{x}) \\neq c(x)$, where $x$ is the original untampered instance. These two definitio"},"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":"1906.05815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-13T17:01:19Z","cross_cats_sorted":["cs.CC","cs.CR","stat.ML"],"title_canon_sha256":"fdbb4d74a9f6e468d04c793e8ba62b30b00703605849ca390d6f5c139e80979e","abstract_canon_sha256":"cfb4040b2749071e4e9bff6d88d41561298669ac5f8408b3f7c68a807bf83d98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:24.309604Z","signature_b64":"Z/q5HSeFjbrtrRcVKLG2JPV+kUBzaYO5zBxvkZhJi1gBSEu2mY4FdIyybhXAuvsw27HUsgRuCubBzCrBepFLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6225e9559b039062c29156c9298a059d32b946d93be7d8513d82ae8b06a7cf7c","last_reissued_at":"2026-05-17T23:43:24.309080Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:24.309080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Adversarially Robust PAC Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitrios I. Diochnos, Mohammad Mahmoody, Saeed Mahloujifar","submitted_at":"2019-06-13T17:01:19Z","abstract_excerpt":"In this work, we initiate a formal study of probably approximately correct (PAC) learning under evasion attacks, where the adversary's goal is to \\emph{misclassify} the adversarially perturbed sample point $\\widetilde{x}$, i.e., $h(\\widetilde{x})\\neq c(\\widetilde{x})$, where $c$ is the ground truth concept and $h$ is the learned hypothesis. Previous work on PAC learning of adversarial examples have all modeled adversarial examples as corrupted inputs in which the goal of the adversary is to achieve $h(\\widetilde{x}) \\neq c(x)$, where $x$ is the original untampered instance. These two definitio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05815","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":"1906.05815","created_at":"2026-05-17T23:43:24.309171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05815v1","created_at":"2026-05-17T23:43:24.309171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05815","created_at":"2026-05-17T23:43:24.309171+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIS6SVM3AOIG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIS6SVM3AOIGFQUR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIS6SVM3","created_at":"2026-05-18T12:33:21.387695+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/MIS6SVM3AOIGFQURK3ESTCQFTU","json":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU.json","graph_json":"https://pith.science/api/pith-number/MIS6SVM3AOIGFQURK3ESTCQFTU/graph.json","events_json":"https://pith.science/api/pith-number/MIS6SVM3AOIGFQURK3ESTCQFTU/events.json","paper":"https://pith.science/paper/MIS6SVM3"},"agent_actions":{"view_html":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU","download_json":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU.json","view_paper":"https://pith.science/paper/MIS6SVM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05815&json=true","fetch_graph":"https://pith.science/api/pith-number/MIS6SVM3AOIGFQURK3ESTCQFTU/graph.json","fetch_events":"https://pith.science/api/pith-number/MIS6SVM3AOIGFQURK3ESTCQFTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU/action/storage_attestation","attest_author":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU/action/author_attestation","sign_citation":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU/action/citation_signature","submit_replication":"https://pith.science/pith/MIS6SVM3AOIGFQURK3ESTCQFTU/action/replication_record"}},"created_at":"2026-05-17T23:43:24.309171+00:00","updated_at":"2026-05-17T23:43:24.309171+00:00"}