{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5LYJE4HCMPC36A6MSAJT32DLRZ","short_pith_number":"pith:5LYJE4HC","canonical_record":{"source":{"id":"1712.04493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-12T20:13:49Z","cross_cats_sorted":["cs.LG","math.DS"],"title_canon_sha256":"60cfbef17d81ad5a67b3003a32409c6d694215fc73e7a56405a5a07688150436","abstract_canon_sha256":"04653e2f6938db2f6f97305b2073200771eda2bd3ebd397137f39ffd3b9ebb2e"},"schema_version":"1.0"},"canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","source":{"kind":"arxiv","id":"1712.04493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04493","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04493v1","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04493","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"5LYJE4HCMPC3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LYJE4HCMPC36A6M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LYJE4HC","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5LYJE4HCMPC36A6MSAJT32DLRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-12T20:13:49Z","cross_cats_sorted":["cs.LG","math.DS"],"title_canon_sha256":"60cfbef17d81ad5a67b3003a32409c6d694215fc73e7a56405a5a07688150436","abstract_canon_sha256":"04653e2f6938db2f6f97305b2073200771eda2bd3ebd397137f39ffd3b9ebb2e"},"schema_version":"1.0"},"canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.753070Z","signature_b64":"kiR2X73dK6JTZCBJeNrXDn4jc4TtN0BitSynusWEi/Vc+kslkXO8QIBUFkPn7Xp1eYQQx4IyR2MnQULxnWtcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","last_reissued_at":"2026-05-18T00:28:07.752474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.752474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04493","source_version":1,"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:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pV9nCZ9SgiA4ZsnUyOCJAK6o2kHm39rZq38HmDJdTr5f0hcJWxZ2COaRmuM8/dl0/ciPa05c5elwrL/NYjYtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:11:34.226740Z"},"content_sha256":"379e9b7525d176904985c238653ad3f18fd8fb3251ba952b6d0778e70fd384aa","schema_version":"1.0","event_id":"sha256:379e9b7525d176904985c238653ad3f18fd8fb3251ba952b6d0778e70fd384aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5LYJE4HCMPC36A6MSAJT32DLRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.DS"],"primary_cat":"math.OC","authors_text":"Alfred O. Hero, Angela Violi, Farshad Harirchi, Omar A. Khalil, Paolo Elvati, Sijia Liu","submitted_at":"2017-12-12T20:13:49Z","abstract_excerpt":"In this paper, we propose an optimization-based sparse learning approach to identify the set of most influential reactions in a chemical reaction network. This reduced set of reactions is then employed to construct a reduced chemical reaction mechanism, which is relevant to chemical interaction network modeling. The problem of identifying influential reactions is first formulated as a mixed-integer quadratic program, and then a relaxation method is leveraged to reduce the computational complexity of our approach. Qualitative and quantitative validation of the sparse encoding approach demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04493","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":""},"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:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNm29fVfl0z3vTy5TQkkq4r2OS1p4gZg+QQY/DycHAPaJY/aHmNYj2LnkSJnZVP6oX4TpcaRNR4v321FDHRUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:11:34.227488Z"},"content_sha256":"d0334ec28e49121bb49501507f251c2f8d308efac1e9e9abae91cac694347110","schema_version":"1.0","event_id":"sha256:d0334ec28e49121bb49501507f251c2f8d308efac1e9e9abae91cac694347110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/bundle.json","state_url":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/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-06-10T01:11:34Z","links":{"resolver":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ","bundle":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/bundle.json","state":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5LYJE4HCMPC36A6MSAJT32DLRZ","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":"04653e2f6938db2f6f97305b2073200771eda2bd3ebd397137f39ffd3b9ebb2e","cross_cats_sorted":["cs.LG","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-12T20:13:49Z","title_canon_sha256":"60cfbef17d81ad5a67b3003a32409c6d694215fc73e7a56405a5a07688150436"},"schema_version":"1.0","source":{"id":"1712.04493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04493","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04493v1","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04493","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"5LYJE4HCMPC3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LYJE4HCMPC36A6M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LYJE4HC","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:d0334ec28e49121bb49501507f251c2f8d308efac1e9e9abae91cac694347110","target":"graph","created_at":"2026-05-18T00:28:07Z","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":"In this paper, we propose an optimization-based sparse learning approach to identify the set of most influential reactions in a chemical reaction network. This reduced set of reactions is then employed to construct a reduced chemical reaction mechanism, which is relevant to chemical interaction network modeling. The problem of identifying influential reactions is first formulated as a mixed-integer quadratic program, and then a relaxation method is leveraged to reduce the computational complexity of our approach. Qualitative and quantitative validation of the sparse encoding approach demonstra","authors_text":"Alfred O. Hero, Angela Violi, Farshad Harirchi, Omar A. Khalil, Paolo Elvati, Sijia Liu","cross_cats":["cs.LG","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-12T20:13:49Z","title":"A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04493","kind":"arxiv","version":1},"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:379e9b7525d176904985c238653ad3f18fd8fb3251ba952b6d0778e70fd384aa","target":"record","created_at":"2026-05-18T00:28:07Z","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":"04653e2f6938db2f6f97305b2073200771eda2bd3ebd397137f39ffd3b9ebb2e","cross_cats_sorted":["cs.LG","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-12T20:13:49Z","title_canon_sha256":"60cfbef17d81ad5a67b3003a32409c6d694215fc73e7a56405a5a07688150436"},"schema_version":"1.0","source":{"id":"1712.04493","kind":"arxiv","version":1}},"canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","first_computed_at":"2026-05-18T00:28:07.752474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:07.752474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kiR2X73dK6JTZCBJeNrXDn4jc4TtN0BitSynusWEi/Vc+kslkXO8QIBUFkPn7Xp1eYQQx4IyR2MnQULxnWtcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:07.753070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379e9b7525d176904985c238653ad3f18fd8fb3251ba952b6d0778e70fd384aa","sha256:d0334ec28e49121bb49501507f251c2f8d308efac1e9e9abae91cac694347110"],"state_sha256":"37ffb4f642053803af2d0bd1a369e0badaf814bc8d731fc88d7f1a17213fdd8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7ptJXxTaIPjAg/CBJjASPV/bTAO5Kcz+97KEnTxzUML38XWeOxcrHTEq4hwmp+Dsuvl6FQCcxcBOz/hzh6TAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:11:34.231658Z","bundle_sha256":"03d1151d14f52e0407114641d50379bd7e31a34122a285b21d51c82c2132d1ee"}}