{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DDJWT74KQAKZA4OQNUWIUAKL3K","short_pith_number":"pith:DDJWT74K","canonical_record":{"source":{"id":"1604.05299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-17T08:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"9057f0ac56978389ccc299b4136bbdad2269adb612d26fafec86f98da18cf585","abstract_canon_sha256":"faad8fa6e995fa07df5c75a8fc8214bb41c398995189c5326026611bf7d2fa00"},"schema_version":"1.0"},"canonical_sha256":"18d369ff8a80159071d06d2c8a014bdaa40a6ff309bc2f1ae0a971b555d15825","source":{"kind":"arxiv","id":"1604.05299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05299","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05299v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05299","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"DDJWT74KQAKZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DDJWT74KQAKZA4OQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DDJWT74K","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DDJWT74KQAKZA4OQNUWIUAKL3K","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-17T08:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"9057f0ac56978389ccc299b4136bbdad2269adb612d26fafec86f98da18cf585","abstract_canon_sha256":"faad8fa6e995fa07df5c75a8fc8214bb41c398995189c5326026611bf7d2fa00"},"schema_version":"1.0"},"canonical_sha256":"18d369ff8a80159071d06d2c8a014bdaa40a6ff309bc2f1ae0a971b555d15825","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:54.321501Z","signature_b64":"ZihnU1dLu8TUEJs1Km4O1jmJm2DaMKVSO6m44WCaLMG9SpU/M/RpPr4PIpXagO7lTlF7OZXmPFdYHpHHIwGSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18d369ff8a80159071d06d2c8a014bdaa40a6ff309bc2f1ae0a971b555d15825","last_reissued_at":"2026-05-18T01:16:54.320794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:54.320794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05299","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovJ+Vxw09j76ay7iaV+OivqpPOSTjCObI9Coz8pmgQWGbdz9XE+fd1S5047eVM0Oj5tCp1n6OCsw/DqXjU4wAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:33:39.829332Z"},"content_sha256":"bc493bcd6d38b9af0dc224ed391eaaadb247805cae4d63cb6fd58fdebe2e3947","schema_version":"1.0","event_id":"sha256:bc493bcd6d38b9af0dc224ed391eaaadb247805cae4d63cb6fd58fdebe2e3947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DDJWT74KQAKZA4OQNUWIUAKL3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inertial primal-dual fixed point algorithm for composite optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jigen Peng, Meng Wen, Yu-Chao Tang","submitted_at":"2016-04-17T08:40:26Z","abstract_excerpt":"We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their proximity operators. The convergence of the IPDFP is obtained by reformulating the Problem (1.1) to the sum of three convex functions. This work brings together and notably extends several classical splitting schemes, like the primaldual method proposed by Chambolle and Pock, and the recent proximity algorithms of Charles A. et al designed for the L1/TV ima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05299","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CX7Pt3XH4KBWlQEAc9sWcMXWksvndMknK6wcmUK+V5zb/5a8Zgg7Fijb9cvpE+CwNXEdWIKHcNBcht79w7MtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:33:39.829707Z"},"content_sha256":"db5d9a821a68cc44d312662a42dae94597acdbab7e63606918b35e31779f3ec5","schema_version":"1.0","event_id":"sha256:db5d9a821a68cc44d312662a42dae94597acdbab7e63606918b35e31779f3ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/bundle.json","state_url":"https://pith.science/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/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-29T08:33:39Z","links":{"resolver":"https://pith.science/pith/DDJWT74KQAKZA4OQNUWIUAKL3K","bundle":"https://pith.science/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/bundle.json","state":"https://pith.science/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDJWT74KQAKZA4OQNUWIUAKL3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DDJWT74KQAKZA4OQNUWIUAKL3K","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":"faad8fa6e995fa07df5c75a8fc8214bb41c398995189c5326026611bf7d2fa00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-17T08:40:26Z","title_canon_sha256":"9057f0ac56978389ccc299b4136bbdad2269adb612d26fafec86f98da18cf585"},"schema_version":"1.0","source":{"id":"1604.05299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05299","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05299v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05299","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"DDJWT74KQAKZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DDJWT74KQAKZA4OQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DDJWT74K","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:db5d9a821a68cc44d312662a42dae94597acdbab7e63606918b35e31779f3ec5","target":"graph","created_at":"2026-05-18T01:16:54Z","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":"We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their proximity operators. The convergence of the IPDFP is obtained by reformulating the Problem (1.1) to the sum of three convex functions. This work brings together and notably extends several classical splitting schemes, like the primaldual method proposed by Chambolle and Pock, and the recent proximity algorithms of Charles A. et al designed for the L1/TV ima","authors_text":"Jigen Peng, Meng Wen, Yu-Chao Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-17T08:40:26Z","title":"An inertial primal-dual fixed point algorithm for composite optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05299","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:bc493bcd6d38b9af0dc224ed391eaaadb247805cae4d63cb6fd58fdebe2e3947","target":"record","created_at":"2026-05-18T01:16:54Z","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":"faad8fa6e995fa07df5c75a8fc8214bb41c398995189c5326026611bf7d2fa00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-17T08:40:26Z","title_canon_sha256":"9057f0ac56978389ccc299b4136bbdad2269adb612d26fafec86f98da18cf585"},"schema_version":"1.0","source":{"id":"1604.05299","kind":"arxiv","version":1}},"canonical_sha256":"18d369ff8a80159071d06d2c8a014bdaa40a6ff309bc2f1ae0a971b555d15825","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18d369ff8a80159071d06d2c8a014bdaa40a6ff309bc2f1ae0a971b555d15825","first_computed_at":"2026-05-18T01:16:54.320794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:54.320794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZihnU1dLu8TUEJs1Km4O1jmJm2DaMKVSO6m44WCaLMG9SpU/M/RpPr4PIpXagO7lTlF7OZXmPFdYHpHHIwGSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:54.321501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc493bcd6d38b9af0dc224ed391eaaadb247805cae4d63cb6fd58fdebe2e3947","sha256:db5d9a821a68cc44d312662a42dae94597acdbab7e63606918b35e31779f3ec5"],"state_sha256":"23621a4e5a83ade7472e1f252e8b51a31bb73fb6225a6278a88daf8b2f76f90d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skiqCBabEGA+07DrdoNBkAPsDs9hUMNRIRc2NOw+Mcu6roVstQ3lXP/fyUMAHesxaij88iEa5VQfO0ysqu+HCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:33:39.831700Z","bundle_sha256":"122b15c35a395c92d8ee33ce6d6f425b8c4230944d0e2bef8c925a58777d49d6"}}