{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AVY46NDD4HLQSTVV6AK6JVNSPZ","short_pith_number":"pith:AVY46NDD","canonical_record":{"source":{"id":"1907.04469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-10T00:43:00Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fd228aee9e7f5dfe07a8aa82c71ab7a3233d3ead50a4b2326b21eff28123fd83","abstract_canon_sha256":"e129964e74ead3896c831253108fe67fad7c93fba43e754e35b5720308ed702f"},"schema_version":"1.0"},"canonical_sha256":"0571cf3463e1d7094eb5f015e4d5b27e43184fef096f9da9956ee07801ac8b9b","source":{"kind":"arxiv","id":"1907.04469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04469","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04469v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04469","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"AVY46NDD4HLQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AVY46NDD4HLQSTVV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AVY46NDD","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AVY46NDD4HLQSTVV6AK6JVNSPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-10T00:43:00Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fd228aee9e7f5dfe07a8aa82c71ab7a3233d3ead50a4b2326b21eff28123fd83","abstract_canon_sha256":"e129964e74ead3896c831253108fe67fad7c93fba43e754e35b5720308ed702f"},"schema_version":"1.0"},"canonical_sha256":"0571cf3463e1d7094eb5f015e4d5b27e43184fef096f9da9956ee07801ac8b9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.209382Z","signature_b64":"8EMQBOk1MeB2emnA4UCw4WsSEppknO9WQU0vV2L2B4cyLStyy28T+LVewJcjFruCmCwAHLISeArJQUZGL9RYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0571cf3463e1d7094eb5f015e4d5b27e43184fef096f9da9956ee07801ac8b9b","last_reissued_at":"2026-05-17T23:41:00.208689Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.208689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04469","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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WX/uo/IL9TWragmryS5kZsznLVNVF+TuPYQS8WLZkHhAkdOtoeQwbhQczmrSDY042BthBU+5RDLIgMJfRXvPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:01:49.008466Z"},"content_sha256":"5828f6a844538aa9eefb5e019dd7f21f918042d77b2127e19d3547504d8b5e2a","schema_version":"1.0","event_id":"sha256:5828f6a844538aa9eefb5e019dd7f21f918042d77b2127e19d3547504d8b5e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AVY46NDD4HLQSTVV6AK6JVNSPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A family of multi-parameterized proximal point algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jianchao Bai, Ke Guo, Xiaokai Chang","submitted_at":"2019-07-10T00:43:00Z","abstract_excerpt":"In this paper, a multi-parameterized proximal point algorithm combining with a relaxation step is developed for solving convex minimization problem subject to linear constraints. We show its global convergence and sublinear convergence rate from the prospective of variational inequality. Preliminary numerical experiments on testing a sparse minimization problem from signal processing indicate that the proposed algorithm performs better than some well-established methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04469","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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fPfdAyFMcu8BU00UWDPwcbI12e+nCVBurPOXU2ULcmf8wuUvIbTIm54NyJcl5x+V/w3lY4FIO4AY1EtXp6qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:01:49.009029Z"},"content_sha256":"646fc8f5065198b11f1c218ca47eb9b84ff7826e8a8fd6401002de5b381eacf1","schema_version":"1.0","event_id":"sha256:646fc8f5065198b11f1c218ca47eb9b84ff7826e8a8fd6401002de5b381eacf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/bundle.json","state_url":"https://pith.science/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/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-25T19:01:49Z","links":{"resolver":"https://pith.science/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ","bundle":"https://pith.science/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/bundle.json","state":"https://pith.science/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVY46NDD4HLQSTVV6AK6JVNSPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AVY46NDD4HLQSTVV6AK6JVNSPZ","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":"e129964e74ead3896c831253108fe67fad7c93fba43e754e35b5720308ed702f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-10T00:43:00Z","title_canon_sha256":"fd228aee9e7f5dfe07a8aa82c71ab7a3233d3ead50a4b2326b21eff28123fd83"},"schema_version":"1.0","source":{"id":"1907.04469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04469","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04469v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04469","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"AVY46NDD4HLQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AVY46NDD4HLQSTVV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AVY46NDD","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:646fc8f5065198b11f1c218ca47eb9b84ff7826e8a8fd6401002de5b381eacf1","target":"graph","created_at":"2026-05-17T23:41:00Z","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 paper, a multi-parameterized proximal point algorithm combining with a relaxation step is developed for solving convex minimization problem subject to linear constraints. We show its global convergence and sublinear convergence rate from the prospective of variational inequality. Preliminary numerical experiments on testing a sparse minimization problem from signal processing indicate that the proposed algorithm performs better than some well-established methods","authors_text":"Jianchao Bai, Ke Guo, Xiaokai Chang","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-10T00:43:00Z","title":"A family of multi-parameterized proximal point algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04469","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:5828f6a844538aa9eefb5e019dd7f21f918042d77b2127e19d3547504d8b5e2a","target":"record","created_at":"2026-05-17T23:41:00Z","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":"e129964e74ead3896c831253108fe67fad7c93fba43e754e35b5720308ed702f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-10T00:43:00Z","title_canon_sha256":"fd228aee9e7f5dfe07a8aa82c71ab7a3233d3ead50a4b2326b21eff28123fd83"},"schema_version":"1.0","source":{"id":"1907.04469","kind":"arxiv","version":1}},"canonical_sha256":"0571cf3463e1d7094eb5f015e4d5b27e43184fef096f9da9956ee07801ac8b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0571cf3463e1d7094eb5f015e4d5b27e43184fef096f9da9956ee07801ac8b9b","first_computed_at":"2026-05-17T23:41:00.208689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.208689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8EMQBOk1MeB2emnA4UCw4WsSEppknO9WQU0vV2L2B4cyLStyy28T+LVewJcjFruCmCwAHLISeArJQUZGL9RYCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.209382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5828f6a844538aa9eefb5e019dd7f21f918042d77b2127e19d3547504d8b5e2a","sha256:646fc8f5065198b11f1c218ca47eb9b84ff7826e8a8fd6401002de5b381eacf1"],"state_sha256":"c3899f8a1a4ec3a865c648ceb9c3c6146f9f69bc5559ab93e1e26916626b7d2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1vQRtl4gYAFsb2+7DxUmsJ4srJegWW/vNjjVbs/YqHX/moh4dWltB7Kv+SYiD0hztDN95tBHo4N0caUarrrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:01:49.011869Z","bundle_sha256":"ab3404920322eecd9a2c4580d91fd88944b4288d7ebd1329ae298e81392978d9"}}