{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PPCK4I5TBKOXSTQMCVMJ5FQN2L","short_pith_number":"pith:PPCK4I5T","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"},"canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","source":{"kind":"arxiv","id":"1609.06917","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06917","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06917v3","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06917","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"PPCK4I5TBKOX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PPCK4I5TBKOXSTQM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PPCK4I5T","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PPCK4I5TBKOXSTQMCVMJ5FQN2L","target":"record","payload":{"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"},"canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","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"},"source_kind":"arxiv","source_id":"1609.06917","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oCPeL8EpFI9z5nta/Bfe4RRmeIU5DIlcVq4dZqV2haRVEQ9h+mDh/Ugul5vSzdGWLuxUXHlXeR8qjuwIBeyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:26:41.514032Z"},"content_sha256":"b4a1d92e7f238216b820a52a677f3407265389edd7cd7188d184a83ea12ffb99","schema_version":"1.0","event_id":"sha256:b4a1d92e7f238216b820a52a677f3407265389edd7cd7188d184a83ea12ffb99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PPCK4I5TBKOXSTQMCVMJ5FQN2L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLsxF0gDMtAlfkJ8CsNCzXmn/PIAryu7SCo4U7YaL7fga/UVo2wqDPVSZWACs0venk6oTVtvormuGuF9hD+eCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:26:41.514387Z"},"content_sha256":"cead2ffc71b1f2f24eea902d85ebb49ca33133b14db07690c2a03dfb5925206e","schema_version":"1.0","event_id":"sha256:cead2ffc71b1f2f24eea902d85ebb49ca33133b14db07690c2a03dfb5925206e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/bundle.json","state_url":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T21:26:41Z","links":{"resolver":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L","bundle":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/bundle.json","state":"https://pith.science/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPCK4I5TBKOXSTQMCVMJ5FQN2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PPCK4I5TBKOXSTQMCVMJ5FQN2L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b4175fbbfac588fc212cbc59fad24cf0246322882e6b01207bedc330f35d9e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-22T11:24:28Z","title_canon_sha256":"ccd6f4b3217a1c44efd058426181fbd38968a041af3ec968dd6ea41076540b0d"},"schema_version":"1.0","source":{"id":"1609.06917","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06917","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06917v3","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06917","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"PPCK4I5TBKOX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PPCK4I5TBKOXSTQM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PPCK4I5T","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:cead2ffc71b1f2f24eea902d85ebb49ca33133b14db07690c2a03dfb5925206e","target":"graph","created_at":"2026-05-18T00:23:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Mitsos, Ioannis G. Kevrekidis, Jaromi{\\l} Najman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-22T11:24:28Z","title":"Optimal Deterministic Algorithm Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06917","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4a1d92e7f238216b820a52a677f3407265389edd7cd7188d184a83ea12ffb99","target":"record","created_at":"2026-05-18T00:23:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b4175fbbfac588fc212cbc59fad24cf0246322882e6b01207bedc330f35d9e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-22T11:24:28Z","title_canon_sha256":"ccd6f4b3217a1c44efd058426181fbd38968a041af3ec968dd6ea41076540b0d"},"schema_version":"1.0","source":{"id":"1609.06917","kind":"arxiv","version":3}},"canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bc4ae23b30a9d794e0c15589e960dd2dc1fa25679f6a1d4e115918ecdd53994","first_computed_at":"2026-05-18T00:23:46.092739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:46.092739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yUa+7lAYGKUf6NMIz+7sYQR9/ZocIvKjBGzLBThhaDkiReBw8DGOZpar8JkUoGJRGfUpml8HyqSLWo5gV17uCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:46.093291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06917","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4a1d92e7f238216b820a52a677f3407265389edd7cd7188d184a83ea12ffb99","sha256:cead2ffc71b1f2f24eea902d85ebb49ca33133b14db07690c2a03dfb5925206e"],"state_sha256":"03e847d69d6685e22ef0172f3da00eb9b03f6895d26abf72c992cd2db73fcd39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95z/gf0N/WoMtHX88kh+MBwdnRKlObRpzDcOnchFCBQqNiqXv1UdsuRfanalFa3Kkdk4nc8F150aqYBT/vbpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:26:41.516626Z","bundle_sha256":"48a5a98ef8c2e6760a7c3ccb99906f739cfe482a520653485d922056520dde03"}}