{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YNGCHODLWR7PTG4TMSET6PNJY2","short_pith_number":"pith:YNGCHODL","schema_version":"1.0","canonical_sha256":"c34c23b86bb47ef99b9364893f3da9c693e03d7fd55b8c6bb542e0e8b0939169","source":{"kind":"arxiv","id":"2408.07866","version":5},"attestation_state":"computed","paper":{"title":"Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Claire Tomlin, Donggun Lee, Jaewon Lee, Jingqi Li, Kris Shengjun Dong, Somayeh Sojoudi","submitted_at":"2024-08-15T00:42:02Z","abstract_excerpt":"We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on reach-avoid problems. These problems require computing the reach-avoid set, which ensures that all its elements can safely reach a target set despite disturbances within pre-specified bounds. Our framework has two main parts: offline learning of a newly designed reachavoid value function, and post-learning certification. Compared to prior work, our new value function is Lipschitz continuous and its associated Bellman operator is a contraction mapping, both of which improve the learning performa"},"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":"2408.07866","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-08-15T00:42:02Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a6f67ff0ab2e8d481ae398dd13e27487e77c1356721157a3a668e4d7f297b44f","abstract_canon_sha256":"7536a4e3d155af17a4089b4eafafd8e1f77d74ac97140b7375426e454af5f10c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:44.331381Z","signature_b64":"4aO4v0wnqB3Og3EVbtdHrrHnmsaMBH9RTYpDSbgx6gd+/82KbBqNVicWqYDQcf1C9QGZdzXi/xfjEEWpqnIoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34c23b86bb47ef99b9364893f3da9c693e03d7fd55b8c6bb542e0e8b0939169","last_reissued_at":"2026-07-05T10:14:44.330855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:44.330855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Claire Tomlin, Donggun Lee, Jaewon Lee, Jingqi Li, Kris Shengjun Dong, Somayeh Sojoudi","submitted_at":"2024-08-15T00:42:02Z","abstract_excerpt":"We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on reach-avoid problems. These problems require computing the reach-avoid set, which ensures that all its elements can safely reach a target set despite disturbances within pre-specified bounds. Our framework has two main parts: offline learning of a newly designed reachavoid value function, and post-learning certification. Compared to prior work, our new value function is Lipschitz continuous and its associated Bellman operator is a contraction mapping, both of which improve the learning performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.07866","kind":"arxiv","version":5},"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/2408.07866/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":"2408.07866","created_at":"2026-07-05T10:14:44.330918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.07866v5","created_at":"2026-07-05T10:14:44.330918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.07866","created_at":"2026-07-05T10:14:44.330918+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNGCHODLWR7P","created_at":"2026-07-05T10:14:44.330918+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNGCHODLWR7PTG4T","created_at":"2026-07-05T10:14:44.330918+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNGCHODL","created_at":"2026-07-05T10:14:44.330918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.09067","citing_title":"Solving Reach- and Stabilize-Avoid Problems Using Discounted Reachability","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2","json":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2.json","graph_json":"https://pith.science/api/pith-number/YNGCHODLWR7PTG4TMSET6PNJY2/graph.json","events_json":"https://pith.science/api/pith-number/YNGCHODLWR7PTG4TMSET6PNJY2/events.json","paper":"https://pith.science/paper/YNGCHODL"},"agent_actions":{"view_html":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2","download_json":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2.json","view_paper":"https://pith.science/paper/YNGCHODL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.07866&json=true","fetch_graph":"https://pith.science/api/pith-number/YNGCHODLWR7PTG4TMSET6PNJY2/graph.json","fetch_events":"https://pith.science/api/pith-number/YNGCHODLWR7PTG4TMSET6PNJY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2/action/storage_attestation","attest_author":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2/action/author_attestation","sign_citation":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2/action/citation_signature","submit_replication":"https://pith.science/pith/YNGCHODLWR7PTG4TMSET6PNJY2/action/replication_record"}},"created_at":"2026-07-05T10:14:44.330918+00:00","updated_at":"2026-07-05T10:14:44.330918+00:00"}