{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q4VGL77AR36T6CUTHES27VF5JD","short_pith_number":"pith:Q4VGL77A","canonical_record":{"source":{"id":"1810.01407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:58:23Z","cross_cats_sorted":["cs.CC","cs.CR","stat.ML"],"title_canon_sha256":"9bdb6df4507ce96b31345622dd72615af58e8c54bd17328abaa533b938ca5771","abstract_canon_sha256":"dba2ae987ab8df80a908b5ce885fc2737a169a61fdd3f769d0abf7bc5f78f8fc"},"schema_version":"1.0"},"canonical_sha256":"872a65ffe08efd3f0a933925afd4bd48dd4d789c746319a232cb01e3a95a9534","source":{"kind":"arxiv","id":"1810.01407","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01407","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01407v3","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01407","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"Q4VGL77AR36T","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4VGL77AR36T6CUT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4VGL77A","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q4VGL77AR36T6CUTHES27VF5JD","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:58:23Z","cross_cats_sorted":["cs.CC","cs.CR","stat.ML"],"title_canon_sha256":"9bdb6df4507ce96b31345622dd72615af58e8c54bd17328abaa533b938ca5771","abstract_canon_sha256":"dba2ae987ab8df80a908b5ce885fc2737a169a61fdd3f769d0abf7bc5f78f8fc"},"schema_version":"1.0"},"canonical_sha256":"872a65ffe08efd3f0a933925afd4bd48dd4d789c746319a232cb01e3a95a9534","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:28.022334Z","signature_b64":"ab6oMS+uhPz8cFVG3WqBwwCRPMy8RHSziB3DS7745m8/vUOpjYNSq5ejDFavyNn5pqsT5xzAQ2EhrD/jfZFLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872a65ffe08efd3f0a933925afd4bd48dd4d789c746319a232cb01e3a95a9534","last_reissued_at":"2026-05-18T00:01:28.021704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:28.021704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01407","source_version":3,"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-18T00:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2P04k+JsTruQkB7NV5lqLAuEmAlGf1MK7R6G59QLq3iKKC/LnB5HUxxl8YrezGb6GTalYmQBfZLtKadDdmSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:10.038282Z"},"content_sha256":"dc2e849f64af5e862de66620b2058ed068a846b8bfbc355ca24c4f6f511ac15c","schema_version":"1.0","event_id":"sha256:dc2e849f64af5e862de66620b2058ed068a846b8bfbc355ca24c4f6f511ac15c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q4VGL77AR36T6CUTHES27VF5JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Adversarially Robust Learning Leverage Computational Hardness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mohammad Mahmoody, Saeed Mahloujifar","submitted_at":"2018-10-02T17:58:23Z","abstract_excerpt":"Making learners robust to adversarial perturbation at test time (i.e., evasion attacks) or training time (i.e., poisoning attacks) has emerged as a challenging task. It is known that for some natural settings, sublinear perturbations in the training phase or the testing phase can drastically decrease the quality of the predictions. These negative results, however, are information theoretic and only prove the existence of such successful adversarial perturbations. A natural question for these settings is whether or not we can make classifiers computationally robust to polynomial-time attacks.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01407","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":""},"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-18T00:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JESVfdws1LH6216CPGGoBWZ60SVY/hFYCXvZj35XnW7abwzmK0SmIh1RcOlGy+lzFquTBSxBrqxNedr82LWtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:10.039018Z"},"content_sha256":"1a11f6a8137fc1a5c55827aa7e29362b63b29b5c4c4c97941df12aed3d580aaf","schema_version":"1.0","event_id":"sha256:1a11f6a8137fc1a5c55827aa7e29362b63b29b5c4c4c97941df12aed3d580aaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4VGL77AR36T6CUTHES27VF5JD/bundle.json","state_url":"https://pith.science/pith/Q4VGL77AR36T6CUTHES27VF5JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4VGL77AR36T6CUTHES27VF5JD/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-31T01:18:10Z","links":{"resolver":"https://pith.science/pith/Q4VGL77AR36T6CUTHES27VF5JD","bundle":"https://pith.science/pith/Q4VGL77AR36T6CUTHES27VF5JD/bundle.json","state":"https://pith.science/pith/Q4VGL77AR36T6CUTHES27VF5JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4VGL77AR36T6CUTHES27VF5JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q4VGL77AR36T6CUTHES27VF5JD","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":"dba2ae987ab8df80a908b5ce885fc2737a169a61fdd3f769d0abf7bc5f78f8fc","cross_cats_sorted":["cs.CC","cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:58:23Z","title_canon_sha256":"9bdb6df4507ce96b31345622dd72615af58e8c54bd17328abaa533b938ca5771"},"schema_version":"1.0","source":{"id":"1810.01407","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01407","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01407v3","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01407","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"Q4VGL77AR36T","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4VGL77AR36T6CUT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4VGL77A","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:1a11f6a8137fc1a5c55827aa7e29362b63b29b5c4c4c97941df12aed3d580aaf","target":"graph","created_at":"2026-05-18T00:01:28Z","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":"Making learners robust to adversarial perturbation at test time (i.e., evasion attacks) or training time (i.e., poisoning attacks) has emerged as a challenging task. It is known that for some natural settings, sublinear perturbations in the training phase or the testing phase can drastically decrease the quality of the predictions. These negative results, however, are information theoretic and only prove the existence of such successful adversarial perturbations. A natural question for these settings is whether or not we can make classifiers computationally robust to polynomial-time attacks.\n ","authors_text":"Mohammad Mahmoody, Saeed Mahloujifar","cross_cats":["cs.CC","cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:58:23Z","title":"Can Adversarially Robust Learning Leverage Computational Hardness?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01407","kind":"arxiv","version":3},"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:dc2e849f64af5e862de66620b2058ed068a846b8bfbc355ca24c4f6f511ac15c","target":"record","created_at":"2026-05-18T00:01:28Z","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":"dba2ae987ab8df80a908b5ce885fc2737a169a61fdd3f769d0abf7bc5f78f8fc","cross_cats_sorted":["cs.CC","cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:58:23Z","title_canon_sha256":"9bdb6df4507ce96b31345622dd72615af58e8c54bd17328abaa533b938ca5771"},"schema_version":"1.0","source":{"id":"1810.01407","kind":"arxiv","version":3}},"canonical_sha256":"872a65ffe08efd3f0a933925afd4bd48dd4d789c746319a232cb01e3a95a9534","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"872a65ffe08efd3f0a933925afd4bd48dd4d789c746319a232cb01e3a95a9534","first_computed_at":"2026-05-18T00:01:28.021704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:28.021704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ab6oMS+uhPz8cFVG3WqBwwCRPMy8RHSziB3DS7745m8/vUOpjYNSq5ejDFavyNn5pqsT5xzAQ2EhrD/jfZFLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:28.022334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01407","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc2e849f64af5e862de66620b2058ed068a846b8bfbc355ca24c4f6f511ac15c","sha256:1a11f6a8137fc1a5c55827aa7e29362b63b29b5c4c4c97941df12aed3d580aaf"],"state_sha256":"68c480a98f355f66f224fea8b523312363942ac59fd8d8192538b781143a4518"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dPspNUEH5w9ybQMyXZeCOjjeyEjb+RFdg6lBpu79dtdV0NRYQAdeyZQb+v7RavBMcnZRgYl+iqFG5uHJt3aCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:18:10.042697Z","bundle_sha256":"a292e302ca6a1b8ccb45ee868809e7768d72f606400d2baa80ae5e1a391f4182"}}