{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R6QDEQFYK3OEC6POEIOX7HSTGP","short_pith_number":"pith:R6QDEQFY","schema_version":"1.0","canonical_sha256":"8fa03240b856dc4179ee221d7f9e5333fcf77e1299dd0a3560af0d37aae4e64b","source":{"kind":"arxiv","id":"1902.05204","version":1},"attestation_state":"computed","paper":{"title":"TIRA: Toolbox for Interval Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alex Devonport, Murat Arcak, Pierre-Jean Meyer","submitted_at":"2019-02-14T03:39:19Z","abstract_excerpt":"This paper presents TIRA, a Matlab library gathering several methods for the computation of interval over-approximations of the reachable sets for both continuous- and discrete-time nonlinear systems. Unlike other existing tools, the main strength of interval-based reachability analysis is its simplicity and scalability, rather than the accuracy of the over-approximations. The current implementation of TIRA contains four reachability methods covering wide classes of nonlinear systems, handled with recent results relying on contraction/growth bounds and monotonicity concepts. TIRA's architectur"},"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":"1902.05204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-02-14T03:39:19Z","cross_cats_sorted":[],"title_canon_sha256":"9096af65b261af9916b9cb129b1382155532d311a783915891250f778a88add9","abstract_canon_sha256":"115eb93cec614a29dc0987a7927178ad65161b42d488f3ca36cc57d0aee4a3d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:01.596158Z","signature_b64":"CyoDem8JEo+5qlbTpuJrlf0boVmVxg4v8lCi3K6clLRw48/FATeuVNfdXuWDSvY2ATvHSd3LCwlnYsY70M00Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa03240b856dc4179ee221d7f9e5333fcf77e1299dd0a3560af0d37aae4e64b","last_reissued_at":"2026-05-17T23:54:01.595512Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:01.595512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TIRA: Toolbox for Interval Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alex Devonport, Murat Arcak, Pierre-Jean Meyer","submitted_at":"2019-02-14T03:39:19Z","abstract_excerpt":"This paper presents TIRA, a Matlab library gathering several methods for the computation of interval over-approximations of the reachable sets for both continuous- and discrete-time nonlinear systems. Unlike other existing tools, the main strength of interval-based reachability analysis is its simplicity and scalability, rather than the accuracy of the over-approximations. The current implementation of TIRA contains four reachability methods covering wide classes of nonlinear systems, handled with recent results relying on contraction/growth bounds and monotonicity concepts. TIRA's architectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05204","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":"1902.05204","created_at":"2026-05-17T23:54:01.595600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05204v1","created_at":"2026-05-17T23:54:01.595600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05204","created_at":"2026-05-17T23:54:01.595600+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6QDEQFYK3OE","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6QDEQFYK3OEC6PO","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6QDEQFY","created_at":"2026-05-18T12:33:27.125529+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/R6QDEQFYK3OEC6POEIOX7HSTGP","json":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP.json","graph_json":"https://pith.science/api/pith-number/R6QDEQFYK3OEC6POEIOX7HSTGP/graph.json","events_json":"https://pith.science/api/pith-number/R6QDEQFYK3OEC6POEIOX7HSTGP/events.json","paper":"https://pith.science/paper/R6QDEQFY"},"agent_actions":{"view_html":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP","download_json":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP.json","view_paper":"https://pith.science/paper/R6QDEQFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05204&json=true","fetch_graph":"https://pith.science/api/pith-number/R6QDEQFYK3OEC6POEIOX7HSTGP/graph.json","fetch_events":"https://pith.science/api/pith-number/R6QDEQFYK3OEC6POEIOX7HSTGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP/action/storage_attestation","attest_author":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP/action/author_attestation","sign_citation":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP/action/citation_signature","submit_replication":"https://pith.science/pith/R6QDEQFYK3OEC6POEIOX7HSTGP/action/replication_record"}},"created_at":"2026-05-17T23:54:01.595600+00:00","updated_at":"2026-05-17T23:54:01.595600+00:00"}