{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FXCG2BJTA4PG4AQJ7S5H525HVP","short_pith_number":"pith:FXCG2BJT","canonical_record":{"source":{"id":"1711.07653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T07:21:53Z","cross_cats_sorted":[],"title_canon_sha256":"22bf9cba9da959db365321da79cf8ba9f167c0d949d5748a3b474b1b06a645c8","abstract_canon_sha256":"4bc96377bdb1962ff87ecbc39559d822be75a308383ba485da114e9a0e43c28e"},"schema_version":"1.0"},"canonical_sha256":"2dc46d0533071e6e0209fcba7eeba7abe21e11aa3868ffa7298b98608079fa45","source":{"kind":"arxiv","id":"1711.07653","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07653","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07653v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07653","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"FXCG2BJTA4PG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FXCG2BJTA4PG4AQJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FXCG2BJT","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FXCG2BJTA4PG4AQJ7S5H525HVP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T07:21:53Z","cross_cats_sorted":[],"title_canon_sha256":"22bf9cba9da959db365321da79cf8ba9f167c0d949d5748a3b474b1b06a645c8","abstract_canon_sha256":"4bc96377bdb1962ff87ecbc39559d822be75a308383ba485da114e9a0e43c28e"},"schema_version":"1.0"},"canonical_sha256":"2dc46d0533071e6e0209fcba7eeba7abe21e11aa3868ffa7298b98608079fa45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.777915Z","signature_b64":"7x2rfVFrxFcteIoSG9ze54HmqGZo1V0aArubHDYB+NvJ/15aSivqkcNnT0ldw9jyLHUDU/J4xD7E5aIWjpXQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dc46d0533071e6e0209fcba7eeba7abe21e11aa3868ffa7298b98608079fa45","last_reissued_at":"2026-05-18T00:27:56.777283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.777283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07653","source_version":2,"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:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bIwoNaODKJ+mrbCveEQYAB3oNZVWLd83eNnvK53cpLjn1TOxY4u2DodbN23+jxYdi1gkguiyUFAC7Q1Vp5YAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:42:47.438841Z"},"content_sha256":"4ab3f20b7fd535b51e1e5330d0b193d469a8a5eea940232a87702b09b0e5fa24","schema_version":"1.0","event_id":"sha256:4ab3f20b7fd535b51e1e5330d0b193d469a8a5eea940232a87702b09b0e5fa24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FXCG2BJTA4PG4AQJ7S5H525HVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Alternating Direction Network: A Globally Converged Deep Unrolling Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Shichao Cheng, Xiangyu Wang, Xin Fan, Zhongxuan Luo","submitted_at":"2017-11-21T07:21:53Z","abstract_excerpt":"Deep learning models have gained great success in many real-world applications. However, most existing networks are typically designed in heuristic manners, thus lack of rigorous mathematical principles and derivations. Several recent studies build deep structures by unrolling a particular optimization model that involves task information. Unfortunately, due to the dynamic nature of network parameters, their resultant deep propagation networks do \\emph{not} possess the nice convergence property as the original optimization scheme does. This paper provides a novel proximal unrolling framework t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07653","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":""},"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:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1S8rrTpTl3rYKb5K8/gSUnrpA30FQCLhdM12ZW08hpb8zlogzDosXnFxvOZkRNKLQTofjVVpe9NWVwTcpt1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:42:47.439189Z"},"content_sha256":"da6096bbe5bafaac6097313f99ab1a252ae9d3a9787e67d8bece1eaf54ef114d","schema_version":"1.0","event_id":"sha256:da6096bbe5bafaac6097313f99ab1a252ae9d3a9787e67d8bece1eaf54ef114d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/bundle.json","state_url":"https://pith.science/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/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-06-05T14:42:47Z","links":{"resolver":"https://pith.science/pith/FXCG2BJTA4PG4AQJ7S5H525HVP","bundle":"https://pith.science/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/bundle.json","state":"https://pith.science/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXCG2BJTA4PG4AQJ7S5H525HVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FXCG2BJTA4PG4AQJ7S5H525HVP","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":"4bc96377bdb1962ff87ecbc39559d822be75a308383ba485da114e9a0e43c28e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T07:21:53Z","title_canon_sha256":"22bf9cba9da959db365321da79cf8ba9f167c0d949d5748a3b474b1b06a645c8"},"schema_version":"1.0","source":{"id":"1711.07653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07653","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07653v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07653","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"FXCG2BJTA4PG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FXCG2BJTA4PG4AQJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FXCG2BJT","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:da6096bbe5bafaac6097313f99ab1a252ae9d3a9787e67d8bece1eaf54ef114d","target":"graph","created_at":"2026-05-18T00:27:56Z","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":"Deep learning models have gained great success in many real-world applications. However, most existing networks are typically designed in heuristic manners, thus lack of rigorous mathematical principles and derivations. Several recent studies build deep structures by unrolling a particular optimization model that involves task information. Unfortunately, due to the dynamic nature of network parameters, their resultant deep propagation networks do \\emph{not} possess the nice convergence property as the original optimization scheme does. This paper provides a novel proximal unrolling framework t","authors_text":"Risheng Liu, Shichao Cheng, Xiangyu Wang, Xin Fan, Zhongxuan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T07:21:53Z","title":"Proximal Alternating Direction Network: A Globally Converged Deep Unrolling Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07653","kind":"arxiv","version":2},"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:4ab3f20b7fd535b51e1e5330d0b193d469a8a5eea940232a87702b09b0e5fa24","target":"record","created_at":"2026-05-18T00:27:56Z","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":"4bc96377bdb1962ff87ecbc39559d822be75a308383ba485da114e9a0e43c28e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T07:21:53Z","title_canon_sha256":"22bf9cba9da959db365321da79cf8ba9f167c0d949d5748a3b474b1b06a645c8"},"schema_version":"1.0","source":{"id":"1711.07653","kind":"arxiv","version":2}},"canonical_sha256":"2dc46d0533071e6e0209fcba7eeba7abe21e11aa3868ffa7298b98608079fa45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dc46d0533071e6e0209fcba7eeba7abe21e11aa3868ffa7298b98608079fa45","first_computed_at":"2026-05-18T00:27:56.777283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.777283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7x2rfVFrxFcteIoSG9ze54HmqGZo1V0aArubHDYB+NvJ/15aSivqkcNnT0ldw9jyLHUDU/J4xD7E5aIWjpXQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.777915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ab3f20b7fd535b51e1e5330d0b193d469a8a5eea940232a87702b09b0e5fa24","sha256:da6096bbe5bafaac6097313f99ab1a252ae9d3a9787e67d8bece1eaf54ef114d"],"state_sha256":"eeb2a5be541dd33a230575a81ed53e6f5aba57e76fac8c418f66620ff0e6120c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAizxyIg71p+DG3WBh34eYSZhbbeWQtw/hhdsMQCyZKoqRaGH5POngXsZYT1aCSQ/gycRMe/lDx+EawuX3NsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:42:47.441168Z","bundle_sha256":"e5e60a9b6763d4e64aa545e448c1431e84365cf7707eb1e920f1829608a78357"}}