{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4VBVHF44XNWFOSXY4YQMDOC42F","short_pith_number":"pith:4VBVHF44","schema_version":"1.0","canonical_sha256":"e54353979cbb6c574af8e620c1b85cd17bbcee036a2c3de8a70929e463b5066c","source":{"kind":"arxiv","id":"2206.03466","version":2},"attestation_state":"computed","paper":{"title":"Adversarial Reprogramming Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthias Englert, Ranko Lazic","submitted_at":"2022-06-07T17:37:22Z","abstract_excerpt":"Adversarial reprogramming, introduced by Elsayed, Goodfellow, and Sohl-Dickstein, seeks to repurpose a neural network to perform a different task, by manipulating its input without modifying its weights. We prove that two-layer ReLU neural networks with random weights can be adversarially reprogrammed to achieve arbitrarily high accuracy on Bernoulli data models over hypercube vertices, provided the network width is no greater than its input dimension. We also substantially strengthen a recent result of Phuong and Lampert on directional convergence of gradient flow, and obtain as a corollary t"},"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":"2206.03466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-07T17:37:22Z","cross_cats_sorted":[],"title_canon_sha256":"be8122893dd1c9875d577349a0628032314c0f91563bb7d4c2ce81a872a4dd99","abstract_canon_sha256":"c7bbf22f7f249f38cb5e99bbd76ec23106711111e23c5e1b276d5bd481f94527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:06.126071Z","signature_b64":"FF9poULLJmPxqmGhMEjz9jB6dtxkP/E+HOyd6gLrn2fA9mHqZyu8LzBDKCdlhOikMzi8tNYcNJkCgcaGASJoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e54353979cbb6c574af8e620c1b85cd17bbcee036a2c3de8a70929e463b5066c","last_reissued_at":"2026-07-05T05:05:06.125641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:06.125641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Reprogramming Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthias Englert, Ranko Lazic","submitted_at":"2022-06-07T17:37:22Z","abstract_excerpt":"Adversarial reprogramming, introduced by Elsayed, Goodfellow, and Sohl-Dickstein, seeks to repurpose a neural network to perform a different task, by manipulating its input without modifying its weights. We prove that two-layer ReLU neural networks with random weights can be adversarially reprogrammed to achieve arbitrarily high accuracy on Bernoulli data models over hypercube vertices, provided the network width is no greater than its input dimension. We also substantially strengthen a recent result of Phuong and Lampert on directional convergence of gradient flow, and obtain as a corollary t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03466","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.03466/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.03466","created_at":"2026-07-05T05:05:06.125701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03466v2","created_at":"2026-07-05T05:05:06.125701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03466","created_at":"2026-07-05T05:05:06.125701+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VBVHF44XNWF","created_at":"2026-07-05T05:05:06.125701+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VBVHF44XNWFOSXY","created_at":"2026-07-05T05:05:06.125701+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VBVHF44","created_at":"2026-07-05T05:05:06.125701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06300","citing_title":"The impact of allocation strategies in subset learning on the expressive power of neural networks","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F","json":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F.json","graph_json":"https://pith.science/api/pith-number/4VBVHF44XNWFOSXY4YQMDOC42F/graph.json","events_json":"https://pith.science/api/pith-number/4VBVHF44XNWFOSXY4YQMDOC42F/events.json","paper":"https://pith.science/paper/4VBVHF44"},"agent_actions":{"view_html":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F","download_json":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F.json","view_paper":"https://pith.science/paper/4VBVHF44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03466&json=true","fetch_graph":"https://pith.science/api/pith-number/4VBVHF44XNWFOSXY4YQMDOC42F/graph.json","fetch_events":"https://pith.science/api/pith-number/4VBVHF44XNWFOSXY4YQMDOC42F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F/action/storage_attestation","attest_author":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F/action/author_attestation","sign_citation":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F/action/citation_signature","submit_replication":"https://pith.science/pith/4VBVHF44XNWFOSXY4YQMDOC42F/action/replication_record"}},"created_at":"2026-07-05T05:05:06.125701+00:00","updated_at":"2026-07-05T05:05:06.125701+00:00"}