{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:QJATNOJL676HWK2PNABHTST62T","short_pith_number":"pith:QJATNOJL","canonical_record":{"source":{"id":"2301.01530","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T10:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"aced942c5515a971f735df639d96cbb86570e60c187d635659c01f80d006e777","abstract_canon_sha256":"69262268eb92bc3005c4faffd1f62d345caa0eec132941adeac9dda5615a85f4"},"schema_version":"1.0"},"canonical_sha256":"824136b92bf7fc7b2b4f680279ca7ed4ccdea33c551ad29717b0b6d852bca3c6","source":{"kind":"arxiv","id":"2301.01530","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01530","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01530v5","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01530","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"QJATNOJL676H","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"QJATNOJL676HWK2P","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"QJATNOJL","created_at":"2026-07-05T09:08:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:QJATNOJL676HWK2PNABHTST62T","target":"record","payload":{"canonical_record":{"source":{"id":"2301.01530","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T10:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"aced942c5515a971f735df639d96cbb86570e60c187d635659c01f80d006e777","abstract_canon_sha256":"69262268eb92bc3005c4faffd1f62d345caa0eec132941adeac9dda5615a85f4"},"schema_version":"1.0"},"canonical_sha256":"824136b92bf7fc7b2b4f680279ca7ed4ccdea33c551ad29717b0b6d852bca3c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:44.857998Z","signature_b64":"LJ2DsQTwzgEUA+28q6B+78k684AcQZz6ydLCLHNAC0aSGi0nNcpHqyLkuHB0cg8EIuNuxMQ/khOx7V4nLMkZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824136b92bf7fc7b2b4f680279ca7ed4ccdea33c551ad29717b0b6d852bca3c6","last_reissued_at":"2026-07-05T09:08:44.857463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:44.857463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.01530","source_version":5,"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-05T09:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3iwlkfBeCO549GBmj1KeXLo+T7xoUFj3nNxxSU3Y68iywZsucmePLBRS2v8Saeu2ZJPZ4Jq/CatOYWTLFscCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:41:17.375858Z"},"content_sha256":"5c53673cf8ede2c8a4c91b6c8d86d8b006dcb3c95a4b780865489726b05b7dcd","schema_version":"1.0","event_id":"sha256:5c53673cf8ede2c8a4c91b6c8d86d8b006dcb3c95a4b780865489726b05b7dcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:QJATNOJL676HWK2PNABHTST62T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Robert M. Freund, Shuvomoy Das Gupta, Xu Andy Sun","submitted_at":"2023-01-04T10:48:12Z","abstract_excerpt":"We propose a computer-assisted approach to the analysis of the worst-case convergence of nonlinear conjugate gradient methods (NCGMs). Those methods are known for their generally good empirical performances for large-scale optimization, while having relatively incomplete analyses. Using our computer-assisted approach, we establish novel complexity bounds for the Polak-Ribi\\`ere-Polyak (PRP) and the Fletcher-Reeves (FR) NCGMs for smooth strongly convex minimization. In particular, we construct mathematical proofs that establish the first non-asymptotic convergence bound for FR (which is histori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01530","kind":"arxiv","version":5},"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/2301.01530/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-05T09:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCOwopQ9Ro+FCNqfbVx86x7ULAlCzJLJ6YncHzu9z0eApwwzXQbYjOGxTKigjCcWVFkP0dEvO7wCB1ngsgb0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:41:17.377416Z"},"content_sha256":"17623abadb7ec101cfded1dd02f90830479b4ffa4998fa04db61cdd470e00ec8","schema_version":"1.0","event_id":"sha256:17623abadb7ec101cfded1dd02f90830479b4ffa4998fa04db61cdd470e00ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJATNOJL676HWK2PNABHTST62T/bundle.json","state_url":"https://pith.science/pith/QJATNOJL676HWK2PNABHTST62T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJATNOJL676HWK2PNABHTST62T/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-11T11:41:17Z","links":{"resolver":"https://pith.science/pith/QJATNOJL676HWK2PNABHTST62T","bundle":"https://pith.science/pith/QJATNOJL676HWK2PNABHTST62T/bundle.json","state":"https://pith.science/pith/QJATNOJL676HWK2PNABHTST62T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJATNOJL676HWK2PNABHTST62T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QJATNOJL676HWK2PNABHTST62T","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":"69262268eb92bc3005c4faffd1f62d345caa0eec132941adeac9dda5615a85f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T10:48:12Z","title_canon_sha256":"aced942c5515a971f735df639d96cbb86570e60c187d635659c01f80d006e777"},"schema_version":"1.0","source":{"id":"2301.01530","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01530","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01530v5","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01530","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"QJATNOJL676H","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"QJATNOJL676HWK2P","created_at":"2026-07-05T09:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"QJATNOJL","created_at":"2026-07-05T09:08:44Z"}],"graph_snapshots":[{"event_id":"sha256:17623abadb7ec101cfded1dd02f90830479b4ffa4998fa04db61cdd470e00ec8","target":"graph","created_at":"2026-07-05T09:08:44Z","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/2301.01530/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a computer-assisted approach to the analysis of the worst-case convergence of nonlinear conjugate gradient methods (NCGMs). Those methods are known for their generally good empirical performances for large-scale optimization, while having relatively incomplete analyses. Using our computer-assisted approach, we establish novel complexity bounds for the Polak-Ribi\\`ere-Polyak (PRP) and the Fletcher-Reeves (FR) NCGMs for smooth strongly convex minimization. In particular, we construct mathematical proofs that establish the first non-asymptotic convergence bound for FR (which is histori","authors_text":"Adrien Taylor, Robert M. Freund, Shuvomoy Das Gupta, Xu Andy Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T10:48:12Z","title":"Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01530","kind":"arxiv","version":5},"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:5c53673cf8ede2c8a4c91b6c8d86d8b006dcb3c95a4b780865489726b05b7dcd","target":"record","created_at":"2026-07-05T09:08:44Z","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":"69262268eb92bc3005c4faffd1f62d345caa0eec132941adeac9dda5615a85f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T10:48:12Z","title_canon_sha256":"aced942c5515a971f735df639d96cbb86570e60c187d635659c01f80d006e777"},"schema_version":"1.0","source":{"id":"2301.01530","kind":"arxiv","version":5}},"canonical_sha256":"824136b92bf7fc7b2b4f680279ca7ed4ccdea33c551ad29717b0b6d852bca3c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"824136b92bf7fc7b2b4f680279ca7ed4ccdea33c551ad29717b0b6d852bca3c6","first_computed_at":"2026-07-05T09:08:44.857463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:08:44.857463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LJ2DsQTwzgEUA+28q6B+78k684AcQZz6ydLCLHNAC0aSGi0nNcpHqyLkuHB0cg8EIuNuxMQ/khOx7V4nLMkZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:08:44.857998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.01530","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c53673cf8ede2c8a4c91b6c8d86d8b006dcb3c95a4b780865489726b05b7dcd","sha256:17623abadb7ec101cfded1dd02f90830479b4ffa4998fa04db61cdd470e00ec8"],"state_sha256":"19957ef82d8f8e6695e04357afd70c92a3817a647e967891afc474c0559b0738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVhY7JKldo0ELdFv+64hWPnw/iEC+Jye401FtiZd3GT1Ap7agko2wI2cOwTrw0/PtiOxWIfCwo7S28qUsPkUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:41:17.384240Z","bundle_sha256":"9f16bebefb6489080ecbc5de1c2cc7e5cdf4fca8a919d40658e6049207f14965"}}