{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TX2TC7FU3DYFEKV2E4CT5OVIQK","short_pith_number":"pith:TX2TC7FU","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"},"canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","source":{"kind":"arxiv","id":"2011.11609","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.11609","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"2011.11609v2","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11609","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"TX2TC7FU3DYF","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_16","alias_value":"TX2TC7FU3DYFEKV2","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_8","alias_value":"TX2TC7FU","created_at":"2026-07-05T02:28:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TX2TC7FU3DYFEKV2E4CT5OVIQK","target":"record","payload":{"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"},"canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","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"},"source_kind":"arxiv","source_id":"2011.11609","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1K+YmFE/OlBcPNfx2fwAICP7Qusl1kaKR0mkoQxo62XEevxaP1ZgvgzbtbRYCf5JMMXfTxQJCB9zWpGp8n1JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T16:54:24.160039Z"},"content_sha256":"9285338dea3925e6f18fb9d9e809b9bc74d212f01eaa95706d6bff375cdfd58d","schema_version":"1.0","event_id":"sha256:9285338dea3925e6f18fb9d9e809b9bc74d212f01eaa95706d6bff375cdfd58d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TX2TC7FU3DYFEKV2E4CT5OVIQK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fwd+IU/PBlweySfd+3FwFr3k6BubNAcgMP2YIQzldoNl1uSoo/9Eq6YFlhSkP8RL3/6QM5e76G7CYg/qkviwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T16:54:24.160431Z"},"content_sha256":"03b449297c4852b904fb6228e50aabf6149d5fee58a5a163d3ebbafbce8f27fd","schema_version":"1.0","event_id":"sha256:03b449297c4852b904fb6228e50aabf6149d5fee58a5a163d3ebbafbce8f27fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/bundle.json","state_url":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-18T16:54:24Z","links":{"resolver":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK","bundle":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/bundle.json","state":"https://pith.science/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TX2TC7FU3DYFEKV2E4CT5OVIQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TX2TC7FU3DYFEKV2E4CT5OVIQK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"18bde5f439730b14b4af45f757cb192b1373111cfb603fb4357cb636682b3b5f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-23T18:35:53Z","title_canon_sha256":"0bdc58b6723dc8c3f54918b61cd5e5a32576c3c199000a146b89e05f40859b61"},"schema_version":"1.0","source":{"id":"2011.11609","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.11609","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"2011.11609v2","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11609","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"TX2TC7FU3DYF","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_16","alias_value":"TX2TC7FU3DYFEKV2","created_at":"2026-07-05T02:28:18Z"},{"alias_kind":"pith_short_8","alias_value":"TX2TC7FU","created_at":"2026-07-05T02:28:18Z"}],"graph_snapshots":[{"event_id":"sha256:03b449297c4852b904fb6228e50aabf6149d5fee58a5a163d3ebbafbce8f27fd","target":"graph","created_at":"2026-07-05T02:28:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.11609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Joseph A. Vincent, Mac Schwager","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-23T18:35:53Z","title":"Reachable Polyhedral Marching (RPM): A Safety Verification Algorithm for Robotic Systems with Deep Neural Network Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11609","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9285338dea3925e6f18fb9d9e809b9bc74d212f01eaa95706d6bff375cdfd58d","target":"record","created_at":"2026-07-05T02:28:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"18bde5f439730b14b4af45f757cb192b1373111cfb603fb4357cb636682b3b5f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-23T18:35:53Z","title_canon_sha256":"0bdc58b6723dc8c3f54918b61cd5e5a32576c3c199000a146b89e05f40859b61"},"schema_version":"1.0","source":{"id":"2011.11609","kind":"arxiv","version":2}},"canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9df5317cb4d8f0522aba27053ebaa88290dee8ab06d4dcae4e885c8315445416","first_computed_at":"2026-07-05T02:28:18.968882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:28:18.968882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymr9luLskWWWxu2SlZnGQlYTppSA0HU+QcOrcjkLQg00ab7oSXCpnlcY8KhYZUZad1O3rrmsN5IfPSeWfw30Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:28:18.969449Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.11609","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9285338dea3925e6f18fb9d9e809b9bc74d212f01eaa95706d6bff375cdfd58d","sha256:03b449297c4852b904fb6228e50aabf6149d5fee58a5a163d3ebbafbce8f27fd"],"state_sha256":"1009406fcee3d414a641afb1f9404592bcc038f9462eb24a520e0d8ac98ba335"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZkTJvZ5y5IAsjB2W3zNRD/GLo3FUCC3RiMu8WNuS0FyT5cD0i5phbM+lBbhAHFhalts02vaap+mwQN8fte4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T16:54:24.162638Z","bundle_sha256":"627fb9353fbc669c58804025099d7e066d651f4ccea978a36cff04d73d5ee9a5"}}