{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TX2TC7FU3DYFEKV2E4CT5OVIQK","short_pith_number":"pith:TX2TC7FU","schema_version":"1.0","canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","source":{"kind":"arxiv","id":"2011.11609","version":2},"attestation_state":"computed","paper":{"title":"Reachable Polyhedral Marching (RPM): A Safety Verification Algorithm for Robotic Systems with Deep Neural Network Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Joseph A. Vincent, Mac Schwager","submitted_at":"2020-11-23T18:35:53Z","abstract_excerpt":"We present a method for computing exact reachable sets for deep neural networks with rectified linear unit (ReLU) activation. Our method is well-suited for use in rigorous safety analysis of robotic perception and control systems with deep neural network components. Our algorithm can compute both forward and backward reachable sets for a ReLU network iterated over multiple time steps, as would be found in a perception-action loop in a robotic system. Our algorithm is unique in that it builds the reachable sets by incrementally enumerating polyhedral cells in the input space, rather than iterat"},"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":"2011.11609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-23T18:35:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0bdc58b6723dc8c3f54918b61cd5e5a32576c3c199000a146b89e05f40859b61","abstract_canon_sha256":"18bde5f439730b14b4af45f757cb192b1373111cfb603fb4357cb636682b3b5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:18.969449Z","signature_b64":"ymr9luLskWWWxu2SlZnGQlYTppSA0HU+QcOrcjkLQg00ab7oSXCpnlcY8KhYZUZad1O3rrmsN5IfPSeWfw30Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","last_reissued_at":"2026-07-05T02:28:18.968882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:18.968882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachable Polyhedral Marching (RPM): A Safety Verification Algorithm for Robotic Systems with Deep Neural Network Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Joseph A. Vincent, Mac Schwager","submitted_at":"2020-11-23T18:35:53Z","abstract_excerpt":"We present a method for computing exact reachable sets for deep neural networks with rectified linear unit (ReLU) activation. Our method is well-suited for use in rigorous safety analysis of robotic perception and control systems with deep neural network components. Our algorithm can compute both forward and backward reachable sets for a ReLU network iterated over multiple time steps, as would be found in a perception-action loop in a robotic system. Our algorithm is unique in that it builds the reachable sets by incrementally enumerating polyhedral cells in the input space, rather than iterat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11609","kind":"arxiv","version":2},"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/2011.11609/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":"2011.11609","created_at":"2026-07-05T02:28:18.968941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.11609v2","created_at":"2026-07-05T02:28:18.968941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11609","created_at":"2026-07-05T02:28:18.968941+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX2TC7FU3DYF","created_at":"2026-07-05T02:28:18.968941+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX2TC7FU3DYFEKV2","created_at":"2026-07-05T02:28:18.968941+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX2TC7FU","created_at":"2026-07-05T02:28:18.968941+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/TX2TC7FU3DYFEKV2E4CT5OVIQK","json":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK.json","graph_json":"https://pith.science/api/pith-number/TX2TC7FU3DYFEKV2E4CT5OVIQK/graph.json","events_json":"https://pith.science/api/pith-number/TX2TC7FU3DYFEKV2E4CT5OVIQK/events.json","paper":"https://pith.science/paper/TX2TC7FU"},"agent_actions":{"view_html":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK","download_json":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK.json","view_paper":"https://pith.science/paper/TX2TC7FU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.11609&json=true","fetch_graph":"https://pith.science/api/pith-number/TX2TC7FU3DYFEKV2E4CT5OVIQK/graph.json","fetch_events":"https://pith.science/api/pith-number/TX2TC7FU3DYFEKV2E4CT5OVIQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/action/storage_attestation","attest_author":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/action/author_attestation","sign_citation":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/action/citation_signature","submit_replication":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/action/replication_record"}},"created_at":"2026-07-05T02:28:18.968941+00:00","updated_at":"2026-07-05T02:28:18.968941+00:00"}