{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74ZXY45HQ7SGMCJJ5CRS5KZPIB","short_pith_number":"pith:74ZXY45H","schema_version":"1.0","canonical_sha256":"ff337c73a787e4660929e8a32eab2f404bb390d79b7e3a79fec8291fe18c7c00","source":{"kind":"arxiv","id":"1801.09526","version":1},"attestation_state":"computed","paper":{"title":"Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Andreas Podelski, Christian Schilling, Fr\\'ed\\'eric Viry, Goran Frehse, Marcelo Forets, Sergiy Bogomolov","submitted_at":"2018-01-29T14:36:23Z","abstract_excerpt":"Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical systems, available algorithms still lack scalability to ensure their wide adoption in the industrial setting. While modern linear algebra packages are efficient for matrices with tens of thousands of dimensions, set-based image computations are limited to a few hundred. We propose to decompose reach set computations such that set operations are performed in lo"},"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":"1801.09526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-01-29T14:36:23Z","cross_cats_sorted":["cs.SY","math.DS"],"title_canon_sha256":"c2721b5796ff4430d39370e46122d6a5a575d2440edc66bda36a42d192d90352","abstract_canon_sha256":"eb4e77d13beeb5235b0973caf78803ba3ff76881fc981448818c25e4bc0396c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:11:27.948098Z","signature_b64":"UVbmTpoHtdMIJ/iyAycDKSc7/v450pMy0Un175cgqlsydTm2WYaNjdQohCAEzSSBHbBA4vsyliIm36gxjDh8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff337c73a787e4660929e8a32eab2f404bb390d79b7e3a79fec8291fe18c7c00","last_reissued_at":"2026-06-04T19:11:27.947664Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:11:27.947664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Andreas Podelski, Christian Schilling, Fr\\'ed\\'eric Viry, Goran Frehse, Marcelo Forets, Sergiy Bogomolov","submitted_at":"2018-01-29T14:36:23Z","abstract_excerpt":"Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical systems, available algorithms still lack scalability to ensure their wide adoption in the industrial setting. While modern linear algebra packages are efficient for matrices with tens of thousands of dimensions, set-based image computations are limited to a few hundred. We propose to decompose reach set computations such that set operations are performed in lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09526","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/1801.09526/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":"1801.09526","created_at":"2026-06-04T19:11:27.947723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09526v1","created_at":"2026-06-04T19:11:27.947723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09526","created_at":"2026-06-04T19:11:27.947723+00:00"},{"alias_kind":"pith_short_12","alias_value":"74ZXY45HQ7SG","created_at":"2026-06-04T19:11:27.947723+00:00"},{"alias_kind":"pith_short_16","alias_value":"74ZXY45HQ7SGMCJJ","created_at":"2026-06-04T19:11:27.947723+00:00"},{"alias_kind":"pith_short_8","alias_value":"74ZXY45H","created_at":"2026-06-04T19:11:27.947723+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/74ZXY45HQ7SGMCJJ5CRS5KZPIB","json":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB.json","graph_json":"https://pith.science/api/pith-number/74ZXY45HQ7SGMCJJ5CRS5KZPIB/graph.json","events_json":"https://pith.science/api/pith-number/74ZXY45HQ7SGMCJJ5CRS5KZPIB/events.json","paper":"https://pith.science/paper/74ZXY45H"},"agent_actions":{"view_html":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB","download_json":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB.json","view_paper":"https://pith.science/paper/74ZXY45H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09526&json=true","fetch_graph":"https://pith.science/api/pith-number/74ZXY45HQ7SGMCJJ5CRS5KZPIB/graph.json","fetch_events":"https://pith.science/api/pith-number/74ZXY45HQ7SGMCJJ5CRS5KZPIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB/action/storage_attestation","attest_author":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB/action/author_attestation","sign_citation":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB/action/citation_signature","submit_replication":"https://pith.science/pith/74ZXY45HQ7SGMCJJ5CRS5KZPIB/action/replication_record"}},"created_at":"2026-06-04T19:11:27.947723+00:00","updated_at":"2026-06-04T19:11:27.947723+00:00"}