{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:D66HCIC7JJA6YZTUPPZ4TJDUCR","short_pith_number":"pith:D66HCIC7","schema_version":"1.0","canonical_sha256":"1fbc71205f4a41ec66747bf3c9a474147d7a11d8f6dceec4e98eff0cf2742c1e","source":{"kind":"arxiv","id":"2104.02259","version":1},"attestation_state":"computed","paper":{"title":"A Caputo fractional derivative-based algorithm for optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"George Em Karniadakis, J\\'er\\^ome Darbon, Yeonjong Shin","submitted_at":"2021-04-06T03:01:14Z","abstract_excerpt":"We propose a novel Caputo fractional derivative-based optimization algorithm. Upon defining the Caputo fractional gradient with respect to the Cartesian coordinate, we present a generic Caputo fractional gradient descent (CFGD) method. We prove that the CFGD yields the steepest descent direction of a locally smoothed objective function. The generic CFGD requires three parameters to be specified, and a choice of the parameters yields a version of CFGD. We propose three versions -- non-adaptive, adaptive terminal and adaptive order. By focusing on quadratic objective functions, we provide a conv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.02259","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-04-06T03:01:14Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"a687e77726787c14250f6deb212a675e414c9c46c56a1bc49b0c36c463ca621a","abstract_canon_sha256":"c1eb6a3c0b8e183608d16a441ec0408290ddb75cb0412c279357ce143711ed6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:16.229864Z","signature_b64":"9Vz6PR/lna1taDTUhfNEPtt1pwrRkTS1iinrNCVZtHC0WxDQzwbONcIs0SEvqXizj7aATZeA46SLVL/64DT7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fbc71205f4a41ec66747bf3c9a474147d7a11d8f6dceec4e98eff0cf2742c1e","last_reissued_at":"2026-07-05T02:29:16.229446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:16.229446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Caputo fractional derivative-based algorithm for optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"George Em Karniadakis, J\\'er\\^ome Darbon, Yeonjong Shin","submitted_at":"2021-04-06T03:01:14Z","abstract_excerpt":"We propose a novel Caputo fractional derivative-based optimization algorithm. Upon defining the Caputo fractional gradient with respect to the Cartesian coordinate, we present a generic Caputo fractional gradient descent (CFGD) method. We prove that the CFGD yields the steepest descent direction of a locally smoothed objective function. The generic CFGD requires three parameters to be specified, and a choice of the parameters yields a version of CFGD. We propose three versions -- non-adaptive, adaptive terminal and adaptive order. By focusing on quadratic objective functions, we provide a conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02259","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/2104.02259/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.02259","created_at":"2026-07-05T02:29:16.229513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.02259v1","created_at":"2026-07-05T02:29:16.229513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02259","created_at":"2026-07-05T02:29:16.229513+00:00"},{"alias_kind":"pith_short_12","alias_value":"D66HCIC7JJA6","created_at":"2026-07-05T02:29:16.229513+00:00"},{"alias_kind":"pith_short_16","alias_value":"D66HCIC7JJA6YZTU","created_at":"2026-07-05T02:29:16.229513+00:00"},{"alias_kind":"pith_short_8","alias_value":"D66HCIC7","created_at":"2026-07-05T02:29:16.229513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14855","citing_title":"Applications of fractional calculus in learned optimization","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR","json":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR.json","graph_json":"https://pith.science/api/pith-number/D66HCIC7JJA6YZTUPPZ4TJDUCR/graph.json","events_json":"https://pith.science/api/pith-number/D66HCIC7JJA6YZTUPPZ4TJDUCR/events.json","paper":"https://pith.science/paper/D66HCIC7"},"agent_actions":{"view_html":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR","download_json":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR.json","view_paper":"https://pith.science/paper/D66HCIC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.02259&json=true","fetch_graph":"https://pith.science/api/pith-number/D66HCIC7JJA6YZTUPPZ4TJDUCR/graph.json","fetch_events":"https://pith.science/api/pith-number/D66HCIC7JJA6YZTUPPZ4TJDUCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR/action/storage_attestation","attest_author":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR/action/author_attestation","sign_citation":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR/action/citation_signature","submit_replication":"https://pith.science/pith/D66HCIC7JJA6YZTUPPZ4TJDUCR/action/replication_record"}},"created_at":"2026-07-05T02:29:16.229513+00:00","updated_at":"2026-07-05T02:29:16.229513+00:00"}