{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:76QLEEWBQANEJQJRCNGK3B7CQK","short_pith_number":"pith:76QLEEWB","canonical_record":{"source":{"id":"1907.03343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-07T20:09:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8627bcf9432e1c41bba4936d72d0e61a75e9525adf90ca000de6fcd10c06e8d7","abstract_canon_sha256":"9b61cb3edf828afa4348211f59a57bb127a81c7217a89b69df31f1f1f0185ba0"},"schema_version":"1.0"},"canonical_sha256":"ffa0b212c1801a44c131134cad87e282a5b39bc73e113a079ccde5f719be6fb4","source":{"kind":"arxiv","id":"1907.03343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03343","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03343v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03343","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"76QLEEWBQANE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76QLEEWBQANEJQJR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76QLEEWB","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:76QLEEWBQANEJQJRCNGK3B7CQK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-07T20:09:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8627bcf9432e1c41bba4936d72d0e61a75e9525adf90ca000de6fcd10c06e8d7","abstract_canon_sha256":"9b61cb3edf828afa4348211f59a57bb127a81c7217a89b69df31f1f1f0185ba0"},"schema_version":"1.0"},"canonical_sha256":"ffa0b212c1801a44c131134cad87e282a5b39bc73e113a079ccde5f719be6fb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:16.512904Z","signature_b64":"eSExG2wCi75ydhEyXeovw7eA3gXiSrdzwzfL+BLRAcURoriMIKAuxgAZA6fb+qTVNLvtepXOYZzWtou45We6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffa0b212c1801a44c131134cad87e282a5b39bc73e113a079ccde5f719be6fb4","last_reissued_at":"2026-05-17T23:41:16.512274Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:16.512274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03343","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-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkvNyC9xg0DfEaI8FSVN6ljCiYXhlC9cui62IQlgTFcTg9zPT4lawbewUgfAWrac5FWPdd2xi3JLV2uFg2tRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:21:33.334051Z"},"content_sha256":"4db8a21b203b1dba41936b48091ca7792a507ef5a616818e62b489419a39dfda","schema_version":"1.0","event_id":"sha256:4db8a21b203b1dba41936b48091ca7792a507ef5a616818e62b489419a39dfda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:76QLEEWBQANEJQJRCNGK3B7CQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Provable ADMM for Learning with Generative Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Armin Eftekhari, Fabian Latorre G\\'omez, Volkan Cevher","submitted_at":"2019-07-07T20:09:58Z","abstract_excerpt":"In this work, we propose a (linearized) Alternating Direction Method-of-Multipliers (ADMM) algorithm for minimizing a convex function subject to a nonconvex constraint. We focus on the special case where such constraint arises from the specification that a variable should lie in the range of a neural network. This is motivated by recent successful applications of Generative Adversarial Networks (GANs) in tasks like compressive sensing, denoising and robustness against adversarial examples. The derived rates for our algorithm are characterized in terms of certain geometric properties of the gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03343","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-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KzMVJs+fA8ace/ix1KDlfQkeyAgQgrt20S1SdArZ2EdCmNC1BifuJQnXxuKXBQ4c3IZD+boI/vvnQbSnMvZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:21:33.334650Z"},"content_sha256":"ba934eed9589fe9bcdec67e820f312bd20516d074edfcecee707f5f0cbaa348e","schema_version":"1.0","event_id":"sha256:ba934eed9589fe9bcdec67e820f312bd20516d074edfcecee707f5f0cbaa348e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76QLEEWBQANEJQJRCNGK3B7CQK/bundle.json","state_url":"https://pith.science/pith/76QLEEWBQANEJQJRCNGK3B7CQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76QLEEWBQANEJQJRCNGK3B7CQK/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-25T07:21:33Z","links":{"resolver":"https://pith.science/pith/76QLEEWBQANEJQJRCNGK3B7CQK","bundle":"https://pith.science/pith/76QLEEWBQANEJQJRCNGK3B7CQK/bundle.json","state":"https://pith.science/pith/76QLEEWBQANEJQJRCNGK3B7CQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76QLEEWBQANEJQJRCNGK3B7CQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:76QLEEWBQANEJQJRCNGK3B7CQK","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":"9b61cb3edf828afa4348211f59a57bb127a81c7217a89b69df31f1f1f0185ba0","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-07T20:09:58Z","title_canon_sha256":"8627bcf9432e1c41bba4936d72d0e61a75e9525adf90ca000de6fcd10c06e8d7"},"schema_version":"1.0","source":{"id":"1907.03343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03343","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03343v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03343","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"76QLEEWBQANE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76QLEEWBQANEJQJR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76QLEEWB","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:ba934eed9589fe9bcdec67e820f312bd20516d074edfcecee707f5f0cbaa348e","target":"graph","created_at":"2026-05-17T23:41:16Z","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":"In this work, we propose a (linearized) Alternating Direction Method-of-Multipliers (ADMM) algorithm for minimizing a convex function subject to a nonconvex constraint. We focus on the special case where such constraint arises from the specification that a variable should lie in the range of a neural network. This is motivated by recent successful applications of Generative Adversarial Networks (GANs) in tasks like compressive sensing, denoising and robustness against adversarial examples. The derived rates for our algorithm are characterized in terms of certain geometric properties of the gen","authors_text":"Armin Eftekhari, Fabian Latorre G\\'omez, Volkan Cevher","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-07T20:09:58Z","title":"Fast and Provable ADMM for Learning with Generative Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03343","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:4db8a21b203b1dba41936b48091ca7792a507ef5a616818e62b489419a39dfda","target":"record","created_at":"2026-05-17T23:41:16Z","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":"9b61cb3edf828afa4348211f59a57bb127a81c7217a89b69df31f1f1f0185ba0","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-07T20:09:58Z","title_canon_sha256":"8627bcf9432e1c41bba4936d72d0e61a75e9525adf90ca000de6fcd10c06e8d7"},"schema_version":"1.0","source":{"id":"1907.03343","kind":"arxiv","version":1}},"canonical_sha256":"ffa0b212c1801a44c131134cad87e282a5b39bc73e113a079ccde5f719be6fb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffa0b212c1801a44c131134cad87e282a5b39bc73e113a079ccde5f719be6fb4","first_computed_at":"2026-05-17T23:41:16.512274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:16.512274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eSExG2wCi75ydhEyXeovw7eA3gXiSrdzwzfL+BLRAcURoriMIKAuxgAZA6fb+qTVNLvtepXOYZzWtou45We6AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:16.512904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4db8a21b203b1dba41936b48091ca7792a507ef5a616818e62b489419a39dfda","sha256:ba934eed9589fe9bcdec67e820f312bd20516d074edfcecee707f5f0cbaa348e"],"state_sha256":"a40f9fa08f05d9e7313c6fcb17a2af09d123143697254ea4c3796c9202ff5bd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyTebFW7ohJDC36WLLm7GW3C8nkcIsgrMVyaaeKg1mQGKzDbxXr7UUQdM/wpxCgLEsOjuZxqM6Wi5y53v+b9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:21:33.337897Z","bundle_sha256":"ae528db071c87fd5efcc06663c98f1ccb059195eed6d1199b346d823f4e4ccb4"}}