{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RYVJ2PSSLI7VV6S2UTV6BTOLO3","short_pith_number":"pith:RYVJ2PSS","canonical_record":{"source":{"id":"2305.01932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T07:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"7b0c60819f67aa81830c208c80c25a45f24e0d5e61e56f076a53ed7c2036afca","abstract_canon_sha256":"afea7f21ac600447c6d6f2f823cc09f9a94d5972535d0d37285342eb4d457b35"},"schema_version":"1.0"},"canonical_sha256":"8e2a9d3e525a3f5afa5aa4ebe0cdcb76c904eca4c16e01c51a606311bf708894","source":{"kind":"arxiv","id":"2305.01932","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01932","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01932v3","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01932","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"RYVJ2PSSLI7V","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_16","alias_value":"RYVJ2PSSLI7VV6S2","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_8","alias_value":"RYVJ2PSS","created_at":"2026-07-05T11:32:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RYVJ2PSSLI7VV6S2UTV6BTOLO3","target":"record","payload":{"canonical_record":{"source":{"id":"2305.01932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T07:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"7b0c60819f67aa81830c208c80c25a45f24e0d5e61e56f076a53ed7c2036afca","abstract_canon_sha256":"afea7f21ac600447c6d6f2f823cc09f9a94d5972535d0d37285342eb4d457b35"},"schema_version":"1.0"},"canonical_sha256":"8e2a9d3e525a3f5afa5aa4ebe0cdcb76c904eca4c16e01c51a606311bf708894","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:12.668359Z","signature_b64":"8eonWs9XTBVB+DlwN8gAsi8gM66V4TGHuq1qgPhggO906avXdyjsPP42KiSlMTZAJxEd7RRWmzOFDCZG7k5EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2a9d3e525a3f5afa5aa4ebe0cdcb76c904eca4c16e01c51a606311bf708894","last_reissued_at":"2026-07-05T11:32:12.667900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:12.667900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.01932","source_version":3,"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-05T11:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIX9yCs0jpUvkWHMN+LWNqZNB+iWjDyGA0tBs44GLlPoD3cQAfhoVLIr0WTLpFtcDA5CV5MtbNQeC5T1cainAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:53:39.129877Z"},"content_sha256":"722fcb1646b21d06aaba4aca88ba2b0c22ce9bd8047fa97538139003fd63ceff","schema_version":"1.0","event_id":"sha256:722fcb1646b21d06aaba4aca88ba2b0c22ce9bd8047fa97538139003fd63ceff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RYVJ2PSSLI7VV6S2UTV6BTOLO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Automatic Neural Network Reduction for Formal Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthias Althoff, Tobias Ladner","submitted_at":"2023-05-03T07:13:47Z","abstract_excerpt":"Formal verification of neural networks is essential before their deployment in safety-critical applications. However, existing methods for formally verifying neural networks are not yet scalable enough to handle practical problems under strict time constraints. We address this challenge by introducing a fully automatic and sound reduction of neural networks using reachability analysis. The soundness ensures that the verification of the reduced network entails the verification of the original network. Our sound reduction approach is applicable to neural networks with any type of element-wise ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01932","kind":"arxiv","version":3},"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/2305.01932/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-05T11:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+noZBhPr2RFZbebWX5qwKEsgmGCMGSCIIY2Hem2UnM8vkmC1I/yQBEWlhjgz0wt3nYOMMpoHQ86ELk23dQ4JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:53:39.130802Z"},"content_sha256":"b96d9bef8f098740318b4359a4d8922fd1f3eb7ae3db3a2bf3d2591045bfc52e","schema_version":"1.0","event_id":"sha256:b96d9bef8f098740318b4359a4d8922fd1f3eb7ae3db3a2bf3d2591045bfc52e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/bundle.json","state_url":"https://pith.science/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/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-08-09T00:53:39Z","links":{"resolver":"https://pith.science/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3","bundle":"https://pith.science/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/bundle.json","state":"https://pith.science/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYVJ2PSSLI7VV6S2UTV6BTOLO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RYVJ2PSSLI7VV6S2UTV6BTOLO3","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":"afea7f21ac600447c6d6f2f823cc09f9a94d5972535d0d37285342eb4d457b35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T07:13:47Z","title_canon_sha256":"7b0c60819f67aa81830c208c80c25a45f24e0d5e61e56f076a53ed7c2036afca"},"schema_version":"1.0","source":{"id":"2305.01932","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01932","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01932v3","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01932","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"RYVJ2PSSLI7V","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_16","alias_value":"RYVJ2PSSLI7VV6S2","created_at":"2026-07-05T11:32:12Z"},{"alias_kind":"pith_short_8","alias_value":"RYVJ2PSS","created_at":"2026-07-05T11:32:12Z"}],"graph_snapshots":[{"event_id":"sha256:b96d9bef8f098740318b4359a4d8922fd1f3eb7ae3db3a2bf3d2591045bfc52e","target":"graph","created_at":"2026-07-05T11:32:12Z","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/2305.01932/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Formal verification of neural networks is essential before their deployment in safety-critical applications. However, existing methods for formally verifying neural networks are not yet scalable enough to handle practical problems under strict time constraints. We address this challenge by introducing a fully automatic and sound reduction of neural networks using reachability analysis. The soundness ensures that the verification of the reduced network entails the verification of the original network. Our sound reduction approach is applicable to neural networks with any type of element-wise ac","authors_text":"Matthias Althoff, Tobias Ladner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T07:13:47Z","title":"Fully Automatic Neural Network Reduction for Formal Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01932","kind":"arxiv","version":3},"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:722fcb1646b21d06aaba4aca88ba2b0c22ce9bd8047fa97538139003fd63ceff","target":"record","created_at":"2026-07-05T11:32:12Z","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":"afea7f21ac600447c6d6f2f823cc09f9a94d5972535d0d37285342eb4d457b35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T07:13:47Z","title_canon_sha256":"7b0c60819f67aa81830c208c80c25a45f24e0d5e61e56f076a53ed7c2036afca"},"schema_version":"1.0","source":{"id":"2305.01932","kind":"arxiv","version":3}},"canonical_sha256":"8e2a9d3e525a3f5afa5aa4ebe0cdcb76c904eca4c16e01c51a606311bf708894","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2a9d3e525a3f5afa5aa4ebe0cdcb76c904eca4c16e01c51a606311bf708894","first_computed_at":"2026-07-05T11:32:12.667900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:12.667900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8eonWs9XTBVB+DlwN8gAsi8gM66V4TGHuq1qgPhggO906avXdyjsPP42KiSlMTZAJxEd7RRWmzOFDCZG7k5EBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:12.668359Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.01932","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:722fcb1646b21d06aaba4aca88ba2b0c22ce9bd8047fa97538139003fd63ceff","sha256:b96d9bef8f098740318b4359a4d8922fd1f3eb7ae3db3a2bf3d2591045bfc52e"],"state_sha256":"a9caa0f57c81357906cb42fe437768d134d06e6aaca6b55c928a6982157ab60e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fiTgxJVMead+T+DGes8ro/l3BpDA/1lKo4unPFXmiwgTK3KEmLbwbTB39d0P5Rq9BIUqRY0ka6uVQz0mbYfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:53:39.137283Z","bundle_sha256":"94e09723e93c6b28e9af7d8b696d23200ff6fbd0a6a286edf9e50673696f1af3"}}