{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YKCAKZRU2TNN5PD6HQKOZ7D54B","short_pith_number":"pith:YKCAKZRU","schema_version":"1.0","canonical_sha256":"c284056634d4dadebc7e3c14ecfc7de069adb240510b76de3d8bc7bef6c5717c","source":{"kind":"arxiv","id":"2204.01623","version":1},"attestation_state":"computed","paper":{"title":"More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.AG"],"primary_cat":"cs.SC","authors_text":"Alexey Ovchinnikov, Gleb Pogudin, Ilia Ilmer, Pedro Soto","submitted_at":"2022-04-04T16:12:48Z","abstract_excerpt":"Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such parameters are called non-identifiable. We present a procedure for accelerating a global identifiability query by eliminating algebraically independent non-identifiable parameters. Our proposed approach significantly improves performance across different computer algebra frameworks."},"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":"2204.01623","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2022-04-04T16:12:48Z","cross_cats_sorted":["cs.LG","math.AG"],"title_canon_sha256":"6a11f395bea5f372f810c7021df9a53a291a01fa38ad5c9de35f05401c6fcb17","abstract_canon_sha256":"317005a3792aae26267f06da4405158940d60f39d48930346dbc2f2e0131c39f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:20.928221Z","signature_b64":"BiPSWyWCPQpQFXQwJMWwh8a8+fLLXi/HOOjNQYA+FA76XlQP5XuGE5PMoqEL2sdn5897p+YxnYpiooeS8v60Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c284056634d4dadebc7e3c14ecfc7de069adb240510b76de3d8bc7bef6c5717c","last_reissued_at":"2026-07-05T04:11:20.927716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:20.927716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.AG"],"primary_cat":"cs.SC","authors_text":"Alexey Ovchinnikov, Gleb Pogudin, Ilia Ilmer, Pedro Soto","submitted_at":"2022-04-04T16:12:48Z","abstract_excerpt":"Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such parameters are called non-identifiable. We present a procedure for accelerating a global identifiability query by eliminating algebraically independent non-identifiable parameters. Our proposed approach significantly improves performance across different computer algebra frameworks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01623","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.01623/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":"2204.01623","created_at":"2026-07-05T04:11:20.927782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.01623v1","created_at":"2026-07-05T04:11:20.927782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01623","created_at":"2026-07-05T04:11:20.927782+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKCAKZRU2TNN","created_at":"2026-07-05T04:11:20.927782+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKCAKZRU2TNN5PD6","created_at":"2026-07-05T04:11:20.927782+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKCAKZRU","created_at":"2026-07-05T04:11:20.927782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00412","citing_title":"Verifying global identifiability of parametric linear ODE models is NP-hard","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B","json":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B.json","graph_json":"https://pith.science/api/pith-number/YKCAKZRU2TNN5PD6HQKOZ7D54B/graph.json","events_json":"https://pith.science/api/pith-number/YKCAKZRU2TNN5PD6HQKOZ7D54B/events.json","paper":"https://pith.science/paper/YKCAKZRU"},"agent_actions":{"view_html":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B","download_json":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B.json","view_paper":"https://pith.science/paper/YKCAKZRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.01623&json=true","fetch_graph":"https://pith.science/api/pith-number/YKCAKZRU2TNN5PD6HQKOZ7D54B/graph.json","fetch_events":"https://pith.science/api/pith-number/YKCAKZRU2TNN5PD6HQKOZ7D54B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B/action/storage_attestation","attest_author":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B/action/author_attestation","sign_citation":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B/action/citation_signature","submit_replication":"https://pith.science/pith/YKCAKZRU2TNN5PD6HQKOZ7D54B/action/replication_record"}},"created_at":"2026-07-05T04:11:20.927782+00:00","updated_at":"2026-07-05T04:11:20.927782+00:00"}