{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SSQES7V3L3TU6DOOZHFPMY7K34","short_pith_number":"pith:SSQES7V3","schema_version":"1.0","canonical_sha256":"94a0497ebb5ee74f0dcec9caf663eadf02ae5d22590fabed054888ab6f300627","source":{"kind":"arxiv","id":"2607.08753","version":1},"attestation_state":"computed","paper":{"title":"Finding Simple Proofs for First-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Aymeric Dieuleveut, Baptiste Goujaud, Daniel Berg Thomsen, Manu Upadhyaya","submitted_at":"2026-07-09T17:51:07Z","abstract_excerpt":"Progress in mathematics often requires more than a certificate of truth: it requires proof structures that are transparent, checkable, and reusable. Automated systems can increasingly certify that a result is true; what they typically return, however, is a dense certificate rather than an interpretable, reusable proof structure.\n  Recent work on performance estimation problems has shown that performance bounds and complexity analyses of first-order optimization methods can be discovered by searching over a structured space of Lagrangian dual certificates. We cast the search for simpler proof s"},"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":"2607.08753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T17:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"4e529a7eec3d4167c81da1bdd6aacabaa06736c274111f63ea4df093638f3cc4","abstract_canon_sha256":"f4f63b90a5d6019420eea43815f39e24130fa0e10e9c1e2cb8c0b9cd02eca4fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:59.322770Z","signature_b64":"smzTo0DYds8DTNLxTfBcdWFcIzOWSd7UTrI1T1Ty/El514ia6vGYOzGC6aMW022DVqBGc0lAlBJkIH0amEkdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a0497ebb5ee74f0dcec9caf663eadf02ae5d22590fabed054888ab6f300627","last_reissued_at":"2026-07-10T01:19:59.322361Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:59.322361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Simple Proofs for First-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Aymeric Dieuleveut, Baptiste Goujaud, Daniel Berg Thomsen, Manu Upadhyaya","submitted_at":"2026-07-09T17:51:07Z","abstract_excerpt":"Progress in mathematics often requires more than a certificate of truth: it requires proof structures that are transparent, checkable, and reusable. Automated systems can increasingly certify that a result is true; what they typically return, however, is a dense certificate rather than an interpretable, reusable proof structure.\n  Recent work on performance estimation problems has shown that performance bounds and complexity analyses of first-order optimization methods can be discovered by searching over a structured space of Lagrangian dual certificates. We cast the search for simpler proof s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08753","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/2607.08753/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":"2607.08753","created_at":"2026-07-10T01:19:59.322420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08753v1","created_at":"2026-07-10T01:19:59.322420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08753","created_at":"2026-07-10T01:19:59.322420+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSQES7V3L3TU","created_at":"2026-07-10T01:19:59.322420+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSQES7V3L3TU6DOO","created_at":"2026-07-10T01:19:59.322420+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSQES7V3","created_at":"2026-07-10T01:19:59.322420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34","json":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34.json","graph_json":"https://pith.science/api/pith-number/SSQES7V3L3TU6DOOZHFPMY7K34/graph.json","events_json":"https://pith.science/api/pith-number/SSQES7V3L3TU6DOOZHFPMY7K34/events.json","paper":"https://pith.science/paper/SSQES7V3"},"agent_actions":{"view_html":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34","download_json":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34.json","view_paper":"https://pith.science/paper/SSQES7V3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08753&json=true","fetch_graph":"https://pith.science/api/pith-number/SSQES7V3L3TU6DOOZHFPMY7K34/graph.json","fetch_events":"https://pith.science/api/pith-number/SSQES7V3L3TU6DOOZHFPMY7K34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34/action/storage_attestation","attest_author":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34/action/author_attestation","sign_citation":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34/action/citation_signature","submit_replication":"https://pith.science/pith/SSQES7V3L3TU6DOOZHFPMY7K34/action/replication_record"}},"created_at":"2026-07-10T01:19:59.322420+00:00","updated_at":"2026-07-10T01:19:59.322420+00:00"}