{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PPCK4I5TBKOXSTQMCVMJ5FQN2L","short_pith_number":"pith:PPCK4I5T","schema_version":"1.0","canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","source":{"kind":"arxiv","id":"1609.06917","version":3},"attestation_state":"computed","paper":{"title":"Optimal Deterministic Algorithm Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Mitsos, Ioannis G. Kevrekidis, Jaromi{\\l} Najman","submitted_at":"2016-09-22T11:24:28Z","abstract_excerpt":"A formulation for the automated generation of algorithms via mathematical programming (optimization) is proposed. The formulation is based on the concept of optimizing within a parameterized family of algorithms, or equivalently a family of functions describing the algorithmic steps. The optimization variables are the parameters -within this family of algorithms- that encode algorithm design: the computational steps of which the selected algorithms consists. The objective function of the optimization problem encodes the merit function of the algorithm, e.g., the computational cost (possibly al"},"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":"1609.06917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-22T11:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"ccd6f4b3217a1c44efd058426181fbd38968a041af3ec968dd6ea41076540b0d","abstract_canon_sha256":"b4175fbbfac588fc212cbc59fad24cf0246322882e6b01207bedc330f35d9e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:46.093291Z","signature_b64":"yUa+7lAYGKUf6NMIz+7sYQR9/ZocIvKjBGzLBThhaDkiReBw8DGOZpar8JkUoGJRGfUpml8HyqSLWo5gV17uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","last_reissued_at":"2026-05-18T00:23:46.092739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:46.092739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Deterministic Algorithm Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Mitsos, Ioannis G. Kevrekidis, Jaromi{\\l} Najman","submitted_at":"2016-09-22T11:24:28Z","abstract_excerpt":"A formulation for the automated generation of algorithms via mathematical programming (optimization) is proposed. The formulation is based on the concept of optimizing within a parameterized family of algorithms, or equivalently a family of functions describing the algorithmic steps. The optimization variables are the parameters -within this family of algorithms- that encode algorithm design: the computational steps of which the selected algorithms consists. The objective function of the optimization problem encodes the merit function of the algorithm, e.g., the computational cost (possibly al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06917","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1609.06917","created_at":"2026-05-18T00:23:46.092810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06917v3","created_at":"2026-05-18T00:23:46.092810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06917","created_at":"2026-05-18T00:23:46.092810+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPCK4I5TBKOX","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPCK4I5TBKOXSTQM","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPCK4I5T","created_at":"2026-05-18T12:30:39.010887+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/PPCK4I5TBKOXSTQMCVMJ5FQN2L","json":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L.json","graph_json":"https://pith.science/api/pith-number/PPCK4I5TBKOXSTQMCVMJ5FQN2L/graph.json","events_json":"https://pith.science/api/pith-number/PPCK4I5TBKOXSTQMCVMJ5FQN2L/events.json","paper":"https://pith.science/paper/PPCK4I5T"},"agent_actions":{"view_html":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L","download_json":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L.json","view_paper":"https://pith.science/paper/PPCK4I5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06917&json=true","fetch_graph":"https://pith.science/api/pith-number/PPCK4I5TBKOXSTQMCVMJ5FQN2L/graph.json","fetch_events":"https://pith.science/api/pith-number/PPCK4I5TBKOXSTQMCVMJ5FQN2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/action/storage_attestation","attest_author":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/action/author_attestation","sign_citation":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/action/citation_signature","submit_replication":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/action/replication_record"}},"created_at":"2026-05-18T00:23:46.092810+00:00","updated_at":"2026-05-18T00:23:46.092810+00:00"}