{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EIMXW5WF5BBYRRC6KJYVKQTA5B","short_pith_number":"pith:EIMXW5WF","schema_version":"1.0","canonical_sha256":"22197b76c5e84388c45e5271554260e865e244b1f91825200bc580815e122572","source":{"kind":"arxiv","id":"2403.05711","version":1},"attestation_state":"computed","paper":{"title":"A Compositional Framework for First-Order Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.OC","authors_text":"Evan Patterson, James Fairbanks, Matthew Hale, Matthew Klawonn, Tyler Hanks","submitted_at":"2024-03-08T22:58:17Z","abstract_excerpt":"Optimization decomposition methods are a fundamental tool to develop distributed solution algorithms for large scale optimization problems arising in fields such as machine learning and optimal control. In this paper, we present an algebraic framework for hierarchically composing optimization problems defined on hypergraphs and automatically generating distributed solution algorithms that respect the given hierarchical structure. The central abstractions of our framework are operads, operad algebras, and algebra morphisms, which formalize notions of syntax, semantics, and structure preserving "},"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":"2403.05711","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-08T22:58:17Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"cb62bb653712db13ae1762dcdbb42eb37229ebb1f01708892e83f8360dd831d5","abstract_canon_sha256":"7e0e93791f5c32791bfecabde1bb263274ac91f97e9a9f15ace1ceba680dd5fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:12.214623Z","signature_b64":"AQFRC9LDJjkaxuESmuYDNDwAvMZkFAFbvLvAO8kpfIXniTW23U1wADZdWNDWCSRXTA0Ra2u2IyQbzk3+xz5EBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22197b76c5e84388c45e5271554260e865e244b1f91825200bc580815e122572","last_reissued_at":"2026-07-05T07:54:12.214234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:12.214234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compositional Framework for First-Order Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.OC","authors_text":"Evan Patterson, James Fairbanks, Matthew Hale, Matthew Klawonn, Tyler Hanks","submitted_at":"2024-03-08T22:58:17Z","abstract_excerpt":"Optimization decomposition methods are a fundamental tool to develop distributed solution algorithms for large scale optimization problems arising in fields such as machine learning and optimal control. In this paper, we present an algebraic framework for hierarchically composing optimization problems defined on hypergraphs and automatically generating distributed solution algorithms that respect the given hierarchical structure. The central abstractions of our framework are operads, operad algebras, and algebra morphisms, which formalize notions of syntax, semantics, and structure preserving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05711","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/2403.05711/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":"2403.05711","created_at":"2026-07-05T07:54:12.214291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05711v1","created_at":"2026-07-05T07:54:12.214291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05711","created_at":"2026-07-05T07:54:12.214291+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIMXW5WF5BBY","created_at":"2026-07-05T07:54:12.214291+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIMXW5WF5BBYRRC6","created_at":"2026-07-05T07:54:12.214291+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIMXW5WF","created_at":"2026-07-05T07:54:12.214291+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/EIMXW5WF5BBYRRC6KJYVKQTA5B","json":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B.json","graph_json":"https://pith.science/api/pith-number/EIMXW5WF5BBYRRC6KJYVKQTA5B/graph.json","events_json":"https://pith.science/api/pith-number/EIMXW5WF5BBYRRC6KJYVKQTA5B/events.json","paper":"https://pith.science/paper/EIMXW5WF"},"agent_actions":{"view_html":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B","download_json":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B.json","view_paper":"https://pith.science/paper/EIMXW5WF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05711&json=true","fetch_graph":"https://pith.science/api/pith-number/EIMXW5WF5BBYRRC6KJYVKQTA5B/graph.json","fetch_events":"https://pith.science/api/pith-number/EIMXW5WF5BBYRRC6KJYVKQTA5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B/action/storage_attestation","attest_author":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B/action/author_attestation","sign_citation":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B/action/citation_signature","submit_replication":"https://pith.science/pith/EIMXW5WF5BBYRRC6KJYVKQTA5B/action/replication_record"}},"created_at":"2026-07-05T07:54:12.214291+00:00","updated_at":"2026-07-05T07:54:12.214291+00:00"}