{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YSPFMO6NACYXRCR6UDXDGDXT6Z","short_pith_number":"pith:YSPFMO6N","canonical_record":{"source":{"id":"2501.08146","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T14:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"92972f08e59ac8c95715c3e82bc3ce3e7b9104cb269b2b4905b76762250d0012","abstract_canon_sha256":"aa9de689ee803bbc10ef968ef499b0f248cd75133a9e0627a10fce3a0b9da54b"},"schema_version":"1.0"},"canonical_sha256":"c49e563bcd00b1788a3ea0ee330ef3f6717d331ec5af94ffec0441773191a952","source":{"kind":"arxiv","id":"2501.08146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08146","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08146v1","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08146","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"YSPFMO6NACYX","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"YSPFMO6NACYXRCR6","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"YSPFMO6N","created_at":"2026-07-05T10:00:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YSPFMO6NACYXRCR6UDXDGDXT6Z","target":"record","payload":{"canonical_record":{"source":{"id":"2501.08146","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T14:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"92972f08e59ac8c95715c3e82bc3ce3e7b9104cb269b2b4905b76762250d0012","abstract_canon_sha256":"aa9de689ee803bbc10ef968ef499b0f248cd75133a9e0627a10fce3a0b9da54b"},"schema_version":"1.0"},"canonical_sha256":"c49e563bcd00b1788a3ea0ee330ef3f6717d331ec5af94ffec0441773191a952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:56.618250Z","signature_b64":"CWv+Yvb09znvBNpJrGswa7jT1uT2qUvWzGTPct0TL+B4ErNQXPRq14v1aFQ7A652bLamsj5SnsfIel2bE3iQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c49e563bcd00b1788a3ea0ee330ef3f6717d331ec5af94ffec0441773191a952","last_reissued_at":"2026-07-05T10:00:56.617819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:56.617819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.08146","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-07-05T10:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Rw8YuLyaKJdnvUT7MFr67YCrT8qVO7K7ed/gzotha5l4y1hjbB3R0NtSOY/O51lxAhqjmCsRpZxmwEDPgbnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:28:21.269570Z"},"content_sha256":"4db459e488c15d3edfde9ee7435299307278ba177a0b95545c82610144d55213","schema_version":"1.0","event_id":"sha256:4db459e488c15d3edfde9ee7435299307278ba177a0b95545c82610144d55213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YSPFMO6NACYXRCR6UDXDGDXT6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Flow Inspired Multi-Step Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yifan Sun, Yushen Huang","submitted_at":"2025-01-14T14:23:52Z","abstract_excerpt":"We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each update as the proximal point method. We explore several optimization methods where applying an approximate multistep proximal points method results in improved convergence behavior. We also include convergence analysis for the proposed method in several problem settings: quadratic problems, general problems that are strongly or weakly (non)convex, and accelerated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08146","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.08146/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l05O9ZpY+2amw7Za8gySTAJX85khg1Q7egHeBV8xv+Fdvkz+oK8VNqopwnIu9aNCVXam7Pvcx4cnQSQSSEbdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:28:21.269938Z"},"content_sha256":"cd6e5f9687a7c0cd2206ae9b03b82a85d96318e015bbc0ec6526641715fb8edb","schema_version":"1.0","event_id":"sha256:cd6e5f9687a7c0cd2206ae9b03b82a85d96318e015bbc0ec6526641715fb8edb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/bundle.json","state_url":"https://pith.science/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/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-07-10T06:28:21Z","links":{"resolver":"https://pith.science/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z","bundle":"https://pith.science/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/bundle.json","state":"https://pith.science/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSPFMO6NACYXRCR6UDXDGDXT6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YSPFMO6NACYXRCR6UDXDGDXT6Z","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":"aa9de689ee803bbc10ef968ef499b0f248cd75133a9e0627a10fce3a0b9da54b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T14:23:52Z","title_canon_sha256":"92972f08e59ac8c95715c3e82bc3ce3e7b9104cb269b2b4905b76762250d0012"},"schema_version":"1.0","source":{"id":"2501.08146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08146","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08146v1","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08146","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"YSPFMO6NACYX","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"YSPFMO6NACYXRCR6","created_at":"2026-07-05T10:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"YSPFMO6N","created_at":"2026-07-05T10:00:56Z"}],"graph_snapshots":[{"event_id":"sha256:cd6e5f9687a7c0cd2206ae9b03b82a85d96318e015bbc0ec6526641715fb8edb","target":"graph","created_at":"2026-07-05T10:00: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.08146/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each update as the proximal point method. We explore several optimization methods where applying an approximate multistep proximal points method results in improved convergence behavior. We also include convergence analysis for the proposed method in several problem settings: quadratic problems, general problems that are strongly or weakly (non)convex, and accelerated","authors_text":"Yifan Sun, Yushen Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T14:23:52Z","title":"Proximal Flow Inspired Multi-Step Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08146","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:4db459e488c15d3edfde9ee7435299307278ba177a0b95545c82610144d55213","target":"record","created_at":"2026-07-05T10:00: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":"aa9de689ee803bbc10ef968ef499b0f248cd75133a9e0627a10fce3a0b9da54b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T14:23:52Z","title_canon_sha256":"92972f08e59ac8c95715c3e82bc3ce3e7b9104cb269b2b4905b76762250d0012"},"schema_version":"1.0","source":{"id":"2501.08146","kind":"arxiv","version":1}},"canonical_sha256":"c49e563bcd00b1788a3ea0ee330ef3f6717d331ec5af94ffec0441773191a952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c49e563bcd00b1788a3ea0ee330ef3f6717d331ec5af94ffec0441773191a952","first_computed_at":"2026-07-05T10:00:56.617819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:56.617819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CWv+Yvb09znvBNpJrGswa7jT1uT2qUvWzGTPct0TL+B4ErNQXPRq14v1aFQ7A652bLamsj5SnsfIel2bE3iQBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:56.618250Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.08146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4db459e488c15d3edfde9ee7435299307278ba177a0b95545c82610144d55213","sha256:cd6e5f9687a7c0cd2206ae9b03b82a85d96318e015bbc0ec6526641715fb8edb"],"state_sha256":"66e7d2ec398b1709f259397668608a636916893e5651db13a700f50dca00c26b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cM1YujpWHPoD2AXPMg0Mg3Q4rS025tlfC0GyVmCsV4g8DjrlhJdPPeZIjkxcFOc5360EQw7mgFnK1+j/+JKjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T06:28:21.272070Z","bundle_sha256":"6746953ca327edd355d8b2b1fa9da6b67f2dad927ce4235e6a64cee09a5ff8f0"}}