{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SPCNL4AWPKG4AJFBJ7QVPNTFYO","short_pith_number":"pith:SPCNL4AW","schema_version":"1.0","canonical_sha256":"93c4d5f0167a8dc024a14fe157b665c3b7f5739a96e4665175271518a0625102","source":{"kind":"arxiv","id":"1308.3643","version":1},"attestation_state":"computed","paper":{"title":"Robust boundary tracking for reachable sets of nonlinear differential inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Janosch Rieger","submitted_at":"2013-08-16T14:45:43Z","abstract_excerpt":"The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization. Therefore, it makes sense to reassess the Euler scheme and optimize its performance. In the present paper, a considerable reduction of the computational cost is achieved by setting up a numerical method that computes the boundaries instead of the complete reachable sets of the fully discretized Euler scheme from lower-dimensional data only. Rigorous proofs for the p"},"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":"1308.3643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-16T14:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"235706bd142c5ec5d4a032d6f0dc78c672005e4fa8d41d90995749699be67c4c","abstract_canon_sha256":"fb55ddc68f696236a6aed7a44af7735290af05a120e2d33e36176d84fab43132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:44.342655Z","signature_b64":"sL4vL0R8iXAqZS46UdKm2AXKxpD8SIWKvKHYlHHdO/FgTWki+q7Jp7bQKMTed6b0xg0NRSWYGkdewHAqZB/JBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c4d5f0167a8dc024a14fe157b665c3b7f5739a96e4665175271518a0625102","last_reissued_at":"2026-05-18T03:15:44.341953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:44.341953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust boundary tracking for reachable sets of nonlinear differential inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Janosch Rieger","submitted_at":"2013-08-16T14:45:43Z","abstract_excerpt":"The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization. Therefore, it makes sense to reassess the Euler scheme and optimize its performance. In the present paper, a considerable reduction of the computational cost is achieved by setting up a numerical method that computes the boundaries instead of the complete reachable sets of the fully discretized Euler scheme from lower-dimensional data only. Rigorous proofs for the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3643","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":"1308.3643","created_at":"2026-05-18T03:15:44.342031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3643v1","created_at":"2026-05-18T03:15:44.342031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3643","created_at":"2026-05-18T03:15:44.342031+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPCNL4AWPKG4","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPCNL4AWPKG4AJFB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPCNL4AW","created_at":"2026-05-18T12:27:59.945178+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/SPCNL4AWPKG4AJFBJ7QVPNTFYO","json":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO.json","graph_json":"https://pith.science/api/pith-number/SPCNL4AWPKG4AJFBJ7QVPNTFYO/graph.json","events_json":"https://pith.science/api/pith-number/SPCNL4AWPKG4AJFBJ7QVPNTFYO/events.json","paper":"https://pith.science/paper/SPCNL4AW"},"agent_actions":{"view_html":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO","download_json":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO.json","view_paper":"https://pith.science/paper/SPCNL4AW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3643&json=true","fetch_graph":"https://pith.science/api/pith-number/SPCNL4AWPKG4AJFBJ7QVPNTFYO/graph.json","fetch_events":"https://pith.science/api/pith-number/SPCNL4AWPKG4AJFBJ7QVPNTFYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO/action/storage_attestation","attest_author":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO/action/author_attestation","sign_citation":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO/action/citation_signature","submit_replication":"https://pith.science/pith/SPCNL4AWPKG4AJFBJ7QVPNTFYO/action/replication_record"}},"created_at":"2026-05-18T03:15:44.342031+00:00","updated_at":"2026-05-18T03:15:44.342031+00:00"}