{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SESJTXCFFIXCO7U2D7NPZH7BV5","short_pith_number":"pith:SESJTXCF","canonical_record":{"source":{"id":"1205.0088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T04:59:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a5bca6eddbf4fb6b1e88196faa18b12bfd086362c7537798e4812d96c4b67f29","abstract_canon_sha256":"242aa2ba2320b6fc8103a47f7f0b7305681733264d7ca26f23d366a446212374"},"schema_version":"1.0"},"canonical_sha256":"912499dc452a2e277e9a1fdafc9fe1af58305b3c7667b918145114a18088c99f","source":{"kind":"arxiv","id":"1205.0088","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0088","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0088v2","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0088","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"SESJTXCFFIXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SESJTXCFFIXCO7U2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SESJTXCF","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SESJTXCFFIXCO7U2D7NPZH7BV5","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T04:59:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a5bca6eddbf4fb6b1e88196faa18b12bfd086362c7537798e4812d96c4b67f29","abstract_canon_sha256":"242aa2ba2320b6fc8103a47f7f0b7305681733264d7ca26f23d366a446212374"},"schema_version":"1.0"},"canonical_sha256":"912499dc452a2e277e9a1fdafc9fe1af58305b3c7667b918145114a18088c99f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.828982Z","signature_b64":"vNY9iBXJEF/7FZf+BJjA+1zwNQ8QEABRdlubJjCcXG7bUyDeNggwrP5bR6xVPPJUQ6av22onRdRa91DjSgWxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912499dc452a2e277e9a1fdafc9fe1af58305b3c7667b918145114a18088c99f","last_reissued_at":"2026-05-18T02:21:15.828431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.828431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0088","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/VO5L0tPKIg62icyVuKFZq+8Ul8S/cpy2SCNzETUdEsrxpqxK1WGP6Z0jt7zigjqCXPJmSNPpDmR7lRYGalAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:49:43.678473Z"},"content_sha256":"471a9fcbcc8a333d8abaeffb3d4b42b45465fa9997805d6b8d96c7eeb1504a78","schema_version":"1.0","event_id":"sha256:471a9fcbcc8a333d8abaeffb3d4b42b45465fa9997805d6b8d96c7eeb1504a78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SESJTXCFFIXCO7U2D7NPZH7BV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ProPPA: A Fast Algorithm for $\\ell_1$ Minimization and Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Pong C. Yuen, Ranch Y.Q. Lai","submitted_at":"2012-05-01T04:59:12Z","abstract_excerpt":"We propose a Projected Proximal Point Algorithm (ProPPA) for solving a class of optimization problems. The algorithm iteratively computes the proximal point of the last estimated solution projected into an affine space which itself is parallel and approaching to the feasible set. We provide convergence analysis theoretically supporting the general algorithm, and then apply it for solving $\\ell_1$-minimization problems and the matrix completion problem. These problems arise in many applications including machine learning, image and signal processing. We compare our algorithm with the existing s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0088","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhdpNOFrmDaVb9CItZev3jfcSlu0FnbY4XunDq+1QBAIb79ozFsGIpjSvfTJa9mR9fONlODAYW7uYOQ/hOfiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:49:43.679019Z"},"content_sha256":"3a9b577d2da4eabaface922c0465741c5b1aab2f599067d01aba17b3a5219e4b","schema_version":"1.0","event_id":"sha256:3a9b577d2da4eabaface922c0465741c5b1aab2f599067d01aba17b3a5219e4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/bundle.json","state_url":"https://pith.science/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/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-19T07:49:43Z","links":{"resolver":"https://pith.science/pith/SESJTXCFFIXCO7U2D7NPZH7BV5","bundle":"https://pith.science/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/bundle.json","state":"https://pith.science/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SESJTXCFFIXCO7U2D7NPZH7BV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SESJTXCFFIXCO7U2D7NPZH7BV5","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":"242aa2ba2320b6fc8103a47f7f0b7305681733264d7ca26f23d366a446212374","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T04:59:12Z","title_canon_sha256":"a5bca6eddbf4fb6b1e88196faa18b12bfd086362c7537798e4812d96c4b67f29"},"schema_version":"1.0","source":{"id":"1205.0088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0088","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0088v2","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0088","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"SESJTXCFFIXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SESJTXCFFIXCO7U2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SESJTXCF","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:3a9b577d2da4eabaface922c0465741c5b1aab2f599067d01aba17b3a5219e4b","target":"graph","created_at":"2026-05-18T02:21:15Z","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 propose a Projected Proximal Point Algorithm (ProPPA) for solving a class of optimization problems. The algorithm iteratively computes the proximal point of the last estimated solution projected into an affine space which itself is parallel and approaching to the feasible set. We provide convergence analysis theoretically supporting the general algorithm, and then apply it for solving $\\ell_1$-minimization problems and the matrix completion problem. These problems arise in many applications including machine learning, image and signal processing. We compare our algorithm with the existing s","authors_text":"Pong C. Yuen, Ranch Y.Q. Lai","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T04:59:12Z","title":"ProPPA: A Fast Algorithm for $\\ell_1$ Minimization and Low-Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0088","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:471a9fcbcc8a333d8abaeffb3d4b42b45465fa9997805d6b8d96c7eeb1504a78","target":"record","created_at":"2026-05-18T02:21:15Z","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":"242aa2ba2320b6fc8103a47f7f0b7305681733264d7ca26f23d366a446212374","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T04:59:12Z","title_canon_sha256":"a5bca6eddbf4fb6b1e88196faa18b12bfd086362c7537798e4812d96c4b67f29"},"schema_version":"1.0","source":{"id":"1205.0088","kind":"arxiv","version":2}},"canonical_sha256":"912499dc452a2e277e9a1fdafc9fe1af58305b3c7667b918145114a18088c99f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"912499dc452a2e277e9a1fdafc9fe1af58305b3c7667b918145114a18088c99f","first_computed_at":"2026-05-18T02:21:15.828431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.828431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vNY9iBXJEF/7FZf+BJjA+1zwNQ8QEABRdlubJjCcXG7bUyDeNggwrP5bR6xVPPJUQ6av22onRdRa91DjSgWxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:15.828982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471a9fcbcc8a333d8abaeffb3d4b42b45465fa9997805d6b8d96c7eeb1504a78","sha256:3a9b577d2da4eabaface922c0465741c5b1aab2f599067d01aba17b3a5219e4b"],"state_sha256":"b1d7f25778d216f8b5993e04af674e7219da2f857e2553982cbc1715f9c5ba47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eed9/UFJaC4I4gb13Pu1O0SzHnTj1Z7+9OS4hQ/xUoXxCREOCA1cKJjVItklSkrnYMaemhsAaosuetHZmGR5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:49:43.681406Z","bundle_sha256":"4310f6494d81b6055be6ebf467ec8c86889e53a81bf6c1a05ae6335fc33aa517"}}