{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CVNK5GRCOOZ76743FYJWIKYJ55","short_pith_number":"pith:CVNK5GRC","schema_version":"1.0","canonical_sha256":"155aae9a2273b3ff7f9b2e13642b09ef495043a0990cbae2c5f33afeb0cce0e9","source":{"kind":"arxiv","id":"2301.11653","version":2},"attestation_state":"computed","paper":{"title":"Exact hierarchical reductions of dynamical models via linear transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SC","cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Alexander Demin, Elizaveta Demitraki, Gleb Pogudin","submitted_at":"2023-01-27T11:08:55Z","abstract_excerpt":"Dynamical models described by ordinary differential equations (ODEs) are a fundamental tool in the sciences and engineering. Exact reduction aims at producing a lower-dimensional model in which each macro-variable can be directly related to the original variables, and it is thus a natural step towards the model's formal analysis and mechanistic understanding. We present an algorithm which, given a polynomial ODE model, computes a longest possible chain of exact linear reductions of the model such that each reduction refines the previous one, thus giving a user control of the level of detail pr"},"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":"2301.11653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-01-27T11:08:55Z","cross_cats_sorted":["cs.MS","cs.SC","cs.SY","math.DS"],"title_canon_sha256":"f839ffc7ef058801b269eb7e9b0198864b551bf3a8a2ddd1a2a22ebd6d042397","abstract_canon_sha256":"6b8fff5596f288fd7e51e1d152ede5488ca9ff2d4546ce030fe9d55577d1dfe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:01.491785Z","signature_b64":"FK9U6DfcTAAY8UpLcpZpaLQ9cH0r6qR64HJte6O5fMnJqSq1Xl47p7JLT2UVB2WbSzFQ9P3xaERCJGTXioCODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155aae9a2273b3ff7f9b2e13642b09ef495043a0990cbae2c5f33afeb0cce0e9","last_reissued_at":"2026-07-05T07:30:01.491393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:01.491393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact hierarchical reductions of dynamical models via linear transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SC","cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Alexander Demin, Elizaveta Demitraki, Gleb Pogudin","submitted_at":"2023-01-27T11:08:55Z","abstract_excerpt":"Dynamical models described by ordinary differential equations (ODEs) are a fundamental tool in the sciences and engineering. Exact reduction aims at producing a lower-dimensional model in which each macro-variable can be directly related to the original variables, and it is thus a natural step towards the model's formal analysis and mechanistic understanding. We present an algorithm which, given a polynomial ODE model, computes a longest possible chain of exact linear reductions of the model such that each reduction refines the previous one, thus giving a user control of the level of detail pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.11653","kind":"arxiv","version":2},"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/2301.11653/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":"2301.11653","created_at":"2026-07-05T07:30:01.491446+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.11653v2","created_at":"2026-07-05T07:30:01.491446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.11653","created_at":"2026-07-05T07:30:01.491446+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVNK5GRCOOZ7","created_at":"2026-07-05T07:30:01.491446+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVNK5GRCOOZ76743","created_at":"2026-07-05T07:30:01.491446+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVNK5GRC","created_at":"2026-07-05T07:30:01.491446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.21708","citing_title":"Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55","json":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55.json","graph_json":"https://pith.science/api/pith-number/CVNK5GRCOOZ76743FYJWIKYJ55/graph.json","events_json":"https://pith.science/api/pith-number/CVNK5GRCOOZ76743FYJWIKYJ55/events.json","paper":"https://pith.science/paper/CVNK5GRC"},"agent_actions":{"view_html":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55","download_json":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55.json","view_paper":"https://pith.science/paper/CVNK5GRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.11653&json=true","fetch_graph":"https://pith.science/api/pith-number/CVNK5GRCOOZ76743FYJWIKYJ55/graph.json","fetch_events":"https://pith.science/api/pith-number/CVNK5GRCOOZ76743FYJWIKYJ55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55/action/storage_attestation","attest_author":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55/action/author_attestation","sign_citation":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55/action/citation_signature","submit_replication":"https://pith.science/pith/CVNK5GRCOOZ76743FYJWIKYJ55/action/replication_record"}},"created_at":"2026-07-05T07:30:01.491446+00:00","updated_at":"2026-07-05T07:30:01.491446+00:00"}