{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XJP5LVT57LALIRTXVQQLZLLBGT","short_pith_number":"pith:XJP5LVT5","canonical_record":{"source":{"id":"2509.09295","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-11T09:35:40Z","cross_cats_sorted":[],"title_canon_sha256":"14bf0acb030298df29f7317ee399f1f9a17c253c397564d80b06c9bb1577581b","abstract_canon_sha256":"d0c386402bd0c7c7d15be7db088a95272556a926bb2bb1ba4fb6092e6e49488c"},"schema_version":"1.0"},"canonical_sha256":"ba5fd5d67dfac0b44677ac20bcad6134d0cdb2fc6baf151e0a085c54f86f9e44","source":{"kind":"arxiv","id":"2509.09295","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09295","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09295v3","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09295","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"XJP5LVT57LAL","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"XJP5LVT57LALIRTX","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"XJP5LVT5","created_at":"2026-08-07T00:51:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XJP5LVT57LALIRTXVQQLZLLBGT","target":"record","payload":{"canonical_record":{"source":{"id":"2509.09295","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-11T09:35:40Z","cross_cats_sorted":[],"title_canon_sha256":"14bf0acb030298df29f7317ee399f1f9a17c253c397564d80b06c9bb1577581b","abstract_canon_sha256":"d0c386402bd0c7c7d15be7db088a95272556a926bb2bb1ba4fb6092e6e49488c"},"schema_version":"1.0"},"canonical_sha256":"ba5fd5d67dfac0b44677ac20bcad6134d0cdb2fc6baf151e0a085c54f86f9e44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:51:08.125616Z","signature_b64":"rbDKk2Q7++FqQLhHeda2J98hz12E2GOfmIm/V2SRQQtmnBT+YksNcnYOKOR7/tc6Ejiq0LrkkjacBcCnX3kzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba5fd5d67dfac0b44677ac20bcad6134d0cdb2fc6baf151e0a085c54f86f9e44","last_reissued_at":"2026-08-07T00:51:08.123955Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:51:08.123955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.09295","source_version":3,"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-08-07T00:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOnqlqH8vGUFedJjeRLWy8wmEDa2V5zdKj7H3kXMw21T2sc3ZJypPX2/GLNS/Y/dq10lyYuYb88fuq5UwLGcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:10:22.903147Z"},"content_sha256":"bfd92785a9da37b5d648dceb39dffd7e5e728ab60a8363f253b7b71b396e26d1","schema_version":"1.0","event_id":"sha256:bfd92785a9da37b5d648dceb39dffd7e5e728ab60a8363f253b7b71b396e26d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XJP5LVT57LALIRTXVQQLZLLBGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $\\sqrt{2}$-accelerated FISTA for composite strongly convex problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kansei Ushiyama","submitted_at":"2025-09-11T09:35:40Z","abstract_excerpt":"In this paper, we propose a novel accelerated forward-backward splitting algorithm for minimizing composite convex functions expressed as the sum of a smooth function and a possibly nonsmooth function. When the composite objective is strongly convex, the proposed method achieves a linear convergence rate in objective value that improves the leading constant in the exponent by a factor of $\\sqrt{2}$ relative to FISTA and also improves upon the best previously known convergence rate for this problem class. Our convergence analysis remains valid even when one of the two component functions is wea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09295","kind":"arxiv","version":3},"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/2509.09295/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-08-07T00:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbdWOD6DKtl988WYYD695oBwRdaJ0pqqklSxBq6CMjXYK9iWBvabEh/yvZj8Fw91wWNLjlXS3yJijrKQdL5CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:10:22.904897Z"},"content_sha256":"93564d1a84d262746fa923eea52f83bd2fc5fe819c5638092f03fe11f46a28d3","schema_version":"1.0","event_id":"sha256:93564d1a84d262746fa923eea52f83bd2fc5fe819c5638092f03fe11f46a28d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJP5LVT57LALIRTXVQQLZLLBGT/bundle.json","state_url":"https://pith.science/pith/XJP5LVT57LALIRTXVQQLZLLBGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJP5LVT57LALIRTXVQQLZLLBGT/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-08-18T10:10:22Z","links":{"resolver":"https://pith.science/pith/XJP5LVT57LALIRTXVQQLZLLBGT","bundle":"https://pith.science/pith/XJP5LVT57LALIRTXVQQLZLLBGT/bundle.json","state":"https://pith.science/pith/XJP5LVT57LALIRTXVQQLZLLBGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJP5LVT57LALIRTXVQQLZLLBGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XJP5LVT57LALIRTXVQQLZLLBGT","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":"d0c386402bd0c7c7d15be7db088a95272556a926bb2bb1ba4fb6092e6e49488c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-11T09:35:40Z","title_canon_sha256":"14bf0acb030298df29f7317ee399f1f9a17c253c397564d80b06c9bb1577581b"},"schema_version":"1.0","source":{"id":"2509.09295","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09295","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09295v3","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09295","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"XJP5LVT57LAL","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"XJP5LVT57LALIRTX","created_at":"2026-08-07T00:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"XJP5LVT5","created_at":"2026-08-07T00:51:08Z"}],"graph_snapshots":[{"event_id":"sha256:93564d1a84d262746fa923eea52f83bd2fc5fe819c5638092f03fe11f46a28d3","target":"graph","created_at":"2026-08-07T00:51:08Z","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/2509.09295/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a novel accelerated forward-backward splitting algorithm for minimizing composite convex functions expressed as the sum of a smooth function and a possibly nonsmooth function. When the composite objective is strongly convex, the proposed method achieves a linear convergence rate in objective value that improves the leading constant in the exponent by a factor of $\\sqrt{2}$ relative to FISTA and also improves upon the best previously known convergence rate for this problem class. Our convergence analysis remains valid even when one of the two component functions is wea","authors_text":"Kansei Ushiyama","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-11T09:35:40Z","title":"A $\\sqrt{2}$-accelerated FISTA for composite strongly convex problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09295","kind":"arxiv","version":3},"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:bfd92785a9da37b5d648dceb39dffd7e5e728ab60a8363f253b7b71b396e26d1","target":"record","created_at":"2026-08-07T00:51:08Z","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":"d0c386402bd0c7c7d15be7db088a95272556a926bb2bb1ba4fb6092e6e49488c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-11T09:35:40Z","title_canon_sha256":"14bf0acb030298df29f7317ee399f1f9a17c253c397564d80b06c9bb1577581b"},"schema_version":"1.0","source":{"id":"2509.09295","kind":"arxiv","version":3}},"canonical_sha256":"ba5fd5d67dfac0b44677ac20bcad6134d0cdb2fc6baf151e0a085c54f86f9e44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba5fd5d67dfac0b44677ac20bcad6134d0cdb2fc6baf151e0a085c54f86f9e44","first_computed_at":"2026-08-07T00:51:08.123955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T00:51:08.123955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rbDKk2Q7++FqQLhHeda2J98hz12E2GOfmIm/V2SRQQtmnBT+YksNcnYOKOR7/tc6Ejiq0LrkkjacBcCnX3kzDw==","signature_status":"signed_v1","signed_at":"2026-08-07T00:51:08.125616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09295","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfd92785a9da37b5d648dceb39dffd7e5e728ab60a8363f253b7b71b396e26d1","sha256:93564d1a84d262746fa923eea52f83bd2fc5fe819c5638092f03fe11f46a28d3"],"state_sha256":"abc0bd12af22a905efb534767cedc81a28ed0dc178ebd79111385c3c3511b887"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pamgXGiZSDxUuUl9qA88DZpyNDxpNt4NLSNTMmYhnA0cMFUlYpbqz3p12RzJ2R3ZTZev2iohvSwHvFsexqt2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T10:10:22.915037Z","bundle_sha256":"90cb167af27ecbc3574cfccde732bca9f4fbcd7d83557905d40824d4471ef540"}}