{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5LYJE4HCMPC36A6MSAJT32DLRZ","short_pith_number":"pith:5LYJE4HC","schema_version":"1.0","canonical_sha256":"eaf09270e263c5bf03cc90133de86b8e5f92478fa8a2d5456e6620d5a64ef836","source":{"kind":"arxiv","id":"1712.04493","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.04493","created_at":"2026-05-18T00:28:07.752562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04493v1","created_at":"2026-05-18T00:28:07.752562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04493","created_at":"2026-05-18T00:28:07.752562+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LYJE4HCMPC3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LYJE4HCMPC36A6M","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LYJE4HC","created_at":"2026-05-18T12:31:00.734936+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/5LYJE4HCMPC36A6MSAJT32DLRZ","json":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ.json","graph_json":"https://pith.science/api/pith-number/5LYJE4HCMPC36A6MSAJT32DLRZ/graph.json","events_json":"https://pith.science/api/pith-number/5LYJE4HCMPC36A6MSAJT32DLRZ/events.json","paper":"https://pith.science/paper/5LYJE4HC"},"agent_actions":{"view_html":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ","download_json":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ.json","view_paper":"https://pith.science/paper/5LYJE4HC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04493&json=true","fetch_graph":"https://pith.science/api/pith-number/5LYJE4HCMPC36A6MSAJT32DLRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5LYJE4HCMPC36A6MSAJT32DLRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/action/storage_attestation","attest_author":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/action/author_attestation","sign_citation":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/action/citation_signature","submit_replication":"https://pith.science/pith/5LYJE4HCMPC36A6MSAJT32DLRZ/action/replication_record"}},"created_at":"2026-05-18T00:28:07.752562+00:00","updated_at":"2026-05-18T00:28:07.752562+00:00"}