{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JQRBOBRKYWETFNWULOLSR3WCVO","short_pith_number":"pith:JQRBOBRK","schema_version":"1.0","canonical_sha256":"4c2217062ac58932b6d45b9728eec2abab6a47d4dfa9708c7bb14f315cc7f96b","source":{"kind":"arxiv","id":"2409.14670","version":2},"attestation_state":"computed","paper":{"title":"BDF schemes for accelerated gradient flows in projection-free approximation of nonconvex constrained variational minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Guozhi Dong, Shuo Yang, Zikang Gong, Ziqing Xie","submitted_at":"2024-09-23T02:22:52Z","abstract_excerpt":"We propose novel algorithms combining accelerated gradient flows with linearized projection-free treatments of non-convex constraints and BDF pseudo-temporal discretization for quadratic energy minimization. A general framework is developed to analyze constraint violations in such projection-free techniques for quadratic constraints. This analysis proves to be universal to all projection-free iterative methods, and constraint error bounds depend solely on iterate regularity. For BDF-k(k=1,2,3,4), we derive both unconditional and conditional high-order constraint violation estimates for acceler"},"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":"2409.14670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-09-23T02:22:52Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"400ce4045f47080c4d08d88f241f854ec923cec7f32c8efedf5de5f4f52d4a0a","abstract_canon_sha256":"7fddf85ebe7c47dcecf6a90bc4931350b19343c1f5089d89ac2a0ed2f3383353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:05.151037Z","signature_b64":"AIAiOTZcckB3ur/yKkB8lopJO4Dat/648pky8rZMhTz/2E+A1rPswjBTbV7u9zU4FsuaLvZy6BgPORdb28V8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2217062ac58932b6d45b9728eec2abab6a47d4dfa9708c7bb14f315cc7f96b","last_reissued_at":"2026-07-05T11:20:05.150586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:05.150586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BDF schemes for accelerated gradient flows in projection-free approximation of nonconvex constrained variational minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Guozhi Dong, Shuo Yang, Zikang Gong, Ziqing Xie","submitted_at":"2024-09-23T02:22:52Z","abstract_excerpt":"We propose novel algorithms combining accelerated gradient flows with linearized projection-free treatments of non-convex constraints and BDF pseudo-temporal discretization for quadratic energy minimization. A general framework is developed to analyze constraint violations in such projection-free techniques for quadratic constraints. This analysis proves to be universal to all projection-free iterative methods, and constraint error bounds depend solely on iterate regularity. For BDF-k(k=1,2,3,4), we derive both unconditional and conditional high-order constraint violation estimates for acceler"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14670","kind":"arxiv","version":2},"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/2409.14670/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":"2409.14670","created_at":"2026-07-05T11:20:05.150656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14670v2","created_at":"2026-07-05T11:20:05.150656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14670","created_at":"2026-07-05T11:20:05.150656+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQRBOBRKYWET","created_at":"2026-07-05T11:20:05.150656+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQRBOBRKYWETFNWU","created_at":"2026-07-05T11:20:05.150656+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQRBOBRK","created_at":"2026-07-05T11:20:05.150656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00389","citing_title":"Momentum-based minimization of the Ginzburg-Landau functional on Euclidean spaces and graphs","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO","json":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO.json","graph_json":"https://pith.science/api/pith-number/JQRBOBRKYWETFNWULOLSR3WCVO/graph.json","events_json":"https://pith.science/api/pith-number/JQRBOBRKYWETFNWULOLSR3WCVO/events.json","paper":"https://pith.science/paper/JQRBOBRK"},"agent_actions":{"view_html":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO","download_json":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO.json","view_paper":"https://pith.science/paper/JQRBOBRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14670&json=true","fetch_graph":"https://pith.science/api/pith-number/JQRBOBRKYWETFNWULOLSR3WCVO/graph.json","fetch_events":"https://pith.science/api/pith-number/JQRBOBRKYWETFNWULOLSR3WCVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO/action/storage_attestation","attest_author":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO/action/author_attestation","sign_citation":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO/action/citation_signature","submit_replication":"https://pith.science/pith/JQRBOBRKYWETFNWULOLSR3WCVO/action/replication_record"}},"created_at":"2026-07-05T11:20:05.150656+00:00","updated_at":"2026-07-05T11:20:05.150656+00:00"}