{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OXVQEGX64LPAWI4FIOEIWSATMG","short_pith_number":"pith:OXVQEGX6","canonical_record":{"source":{"id":"2412.13473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T03:38:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c2bde9f5acecb42446816570418affa69a56e2f5b4b0acbd5538175c8fe51804","abstract_canon_sha256":"f0cbec81293d25cffb1eb81265fe083ddb51d6dead9c5c6aae549274fadaf1da"},"schema_version":"1.0"},"canonical_sha256":"75eb021afee2de0b238543888b481361a08e122eae9a61908ce287c452747d82","source":{"kind":"arxiv","id":"2412.13473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13473","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13473v1","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13473","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"OXVQEGX64LPA","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_16","alias_value":"OXVQEGX64LPAWI4F","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_8","alias_value":"OXVQEGX6","created_at":"2026-07-05T09:51:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OXVQEGX64LPAWI4FIOEIWSATMG","target":"record","payload":{"canonical_record":{"source":{"id":"2412.13473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T03:38:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c2bde9f5acecb42446816570418affa69a56e2f5b4b0acbd5538175c8fe51804","abstract_canon_sha256":"f0cbec81293d25cffb1eb81265fe083ddb51d6dead9c5c6aae549274fadaf1da"},"schema_version":"1.0"},"canonical_sha256":"75eb021afee2de0b238543888b481361a08e122eae9a61908ce287c452747d82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:02.341958Z","signature_b64":"tYbuAVUVLE/fSikctQLHG/+Nl/FIwV7Nfnvcxg+4YwsCHMcM+6WbPbjLSKN/E6AVbqME59mg1vpC80x9h+J8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75eb021afee2de0b238543888b481361a08e122eae9a61908ce287c452747d82","last_reissued_at":"2026-07-05T09:51:02.341379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:02.341379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.13473","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-05T09:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"selpKZvD3v3jHBESGS5Rj2pGTfuTMMY8OmYpqZQYXfkt6iMD7LT8fxKU3MrnZmZ3JfQ7TKpFzIOelcEwjfqJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:34.138277Z"},"content_sha256":"383d80594becfd32b82729aec3b4125f844b937817f6fc7ac9b4f8030bb51e31","schema_version":"1.0","event_id":"sha256:383d80594becfd32b82729aec3b4125f844b937817f6fc7ac9b4f8030bb51e31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OXVQEGX64LPAWI4FIOEIWSATMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning complexity of gradient descent and conjugate gradient algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Jia Liu, Xianqi Jiao, Zhiping Chen","submitted_at":"2024-12-18T03:38:29Z","abstract_excerpt":"Gradient Descent (GD) and Conjugate Gradient (CG) methods are among the most effective iterative algorithms for solving unconstrained optimization problems, particularly in machine learning and statistical modeling, where they are employed to minimize cost functions. In these algorithms, tunable parameters, such as step sizes or conjugate parameters, play a crucial role in determining key performance metrics, like runtime and solution quality. In this work, we introduce a framework that models algorithm selection as a statistical learning problem, and thus learning complexity can be estimated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13473","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/2412.13473/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:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJIfRhMrhwXQvXpHyWqt6H+vxy5LzSt53vbjPYlYg5zUFx65bcsVAKvAWKoPuzSgzrLQ7Tba7RWPv1TXVjX4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:34.138791Z"},"content_sha256":"0e2cc96471a14c959d8147813eb1697a7183b5b4cda9de5fe46de387b970753c","schema_version":"1.0","event_id":"sha256:0e2cc96471a14c959d8147813eb1697a7183b5b4cda9de5fe46de387b970753c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXVQEGX64LPAWI4FIOEIWSATMG/bundle.json","state_url":"https://pith.science/pith/OXVQEGX64LPAWI4FIOEIWSATMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXVQEGX64LPAWI4FIOEIWSATMG/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-16T11:46:34Z","links":{"resolver":"https://pith.science/pith/OXVQEGX64LPAWI4FIOEIWSATMG","bundle":"https://pith.science/pith/OXVQEGX64LPAWI4FIOEIWSATMG/bundle.json","state":"https://pith.science/pith/OXVQEGX64LPAWI4FIOEIWSATMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXVQEGX64LPAWI4FIOEIWSATMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OXVQEGX64LPAWI4FIOEIWSATMG","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":"f0cbec81293d25cffb1eb81265fe083ddb51d6dead9c5c6aae549274fadaf1da","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T03:38:29Z","title_canon_sha256":"c2bde9f5acecb42446816570418affa69a56e2f5b4b0acbd5538175c8fe51804"},"schema_version":"1.0","source":{"id":"2412.13473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13473","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13473v1","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13473","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"OXVQEGX64LPA","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_16","alias_value":"OXVQEGX64LPAWI4F","created_at":"2026-07-05T09:51:02Z"},{"alias_kind":"pith_short_8","alias_value":"OXVQEGX6","created_at":"2026-07-05T09:51:02Z"}],"graph_snapshots":[{"event_id":"sha256:0e2cc96471a14c959d8147813eb1697a7183b5b4cda9de5fe46de387b970753c","target":"graph","created_at":"2026-07-05T09:51:02Z","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/2412.13473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gradient Descent (GD) and Conjugate Gradient (CG) methods are among the most effective iterative algorithms for solving unconstrained optimization problems, particularly in machine learning and statistical modeling, where they are employed to minimize cost functions. In these algorithms, tunable parameters, such as step sizes or conjugate parameters, play a crucial role in determining key performance metrics, like runtime and solution quality. In this work, we introduce a framework that models algorithm selection as a statistical learning problem, and thus learning complexity can be estimated ","authors_text":"Jia Liu, Xianqi Jiao, Zhiping Chen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13473","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:383d80594becfd32b82729aec3b4125f844b937817f6fc7ac9b4f8030bb51e31","target":"record","created_at":"2026-07-05T09:51:02Z","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":"f0cbec81293d25cffb1eb81265fe083ddb51d6dead9c5c6aae549274fadaf1da","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T03:38:29Z","title_canon_sha256":"c2bde9f5acecb42446816570418affa69a56e2f5b4b0acbd5538175c8fe51804"},"schema_version":"1.0","source":{"id":"2412.13473","kind":"arxiv","version":1}},"canonical_sha256":"75eb021afee2de0b238543888b481361a08e122eae9a61908ce287c452747d82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75eb021afee2de0b238543888b481361a08e122eae9a61908ce287c452747d82","first_computed_at":"2026-07-05T09:51:02.341379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:51:02.341379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tYbuAVUVLE/fSikctQLHG/+Nl/FIwV7Nfnvcxg+4YwsCHMcM+6WbPbjLSKN/E6AVbqME59mg1vpC80x9h+J8Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:51:02.341958Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.13473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:383d80594becfd32b82729aec3b4125f844b937817f6fc7ac9b4f8030bb51e31","sha256:0e2cc96471a14c959d8147813eb1697a7183b5b4cda9de5fe46de387b970753c"],"state_sha256":"26a04c13becbb522fe8722db1dddead487feb6a6ff1bf08573df9ba37467c851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FE6KrK/wowWKG8c6ygRqJjtKvt2lTd8dEttw1UOgqbIqUdOn9t2j3lsAv8PsMEVjoJdPG6uoG+9gJG+mGx8MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:46:34.142892Z","bundle_sha256":"8bf3f5eff1637ac76d6b80c63c9d858d811c4997601ba5db4f0f63bbd10ca572"}}