{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TGU6ECXQKCAW4254DN7F5OT4HX","short_pith_number":"pith:TGU6ECXQ","schema_version":"1.0","canonical_sha256":"99a9e20af050816e6bbc1b7e5eba7c3dc5e26e07038e088de5eaaeac3b508e95","source":{"kind":"arxiv","id":"1912.01329","version":1},"attestation_state":"computed","paper":{"title":"Neural Network Branching for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jingyue Lu, M. Pawan Kumar","submitted_at":"2019-12-03T12:12:29Z","abstract_excerpt":"Formal verification of neural networks is essential for their deployment in safety-critical areas. Many available formal verification methods have been shown to be instances of a unified Branch and Bound (BaB) formulation. We propose a novel framework for designing an effective branching strategy for BaB. Specifically, we learn a graph neural network (GNN) to imitate the strong branching heuristic behaviour. Our framework differs from previous methods for learning to branch in two main aspects. Firstly, our framework directly treats the neural network we want to verify as a graph input for the"},"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":"1912.01329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-03T12:12:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"18c871ede8b56791c6097247e8672c57b61cc817670a3574813ac1b5c9faab37","abstract_canon_sha256":"f08cba5da5d121138c2cb18319b381d514c861ee34039d7b45c7a55e5255eed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:29.865889Z","signature_b64":"pNP+/Arccs7xTPQV+Fkjjp96+f3Vx7SMzGyiFF0bIQcTusYEmVPPBuz+MvJHsjyxoPNez9iZEtPqHQpYcnjjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99a9e20af050816e6bbc1b7e5eba7c3dc5e26e07038e088de5eaaeac3b508e95","last_reissued_at":"2026-07-05T00:23:29.865385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:29.865385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Network Branching for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jingyue Lu, M. Pawan Kumar","submitted_at":"2019-12-03T12:12:29Z","abstract_excerpt":"Formal verification of neural networks is essential for their deployment in safety-critical areas. Many available formal verification methods have been shown to be instances of a unified Branch and Bound (BaB) formulation. We propose a novel framework for designing an effective branching strategy for BaB. Specifically, we learn a graph neural network (GNN) to imitate the strong branching heuristic behaviour. Our framework differs from previous methods for learning to branch in two main aspects. Firstly, our framework directly treats the neural network we want to verify as a graph input for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01329","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/1912.01329/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":"1912.01329","created_at":"2026-07-05T00:23:29.865447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.01329v1","created_at":"2026-07-05T00:23:29.865447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01329","created_at":"2026-07-05T00:23:29.865447+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGU6ECXQKCAW","created_at":"2026-07-05T00:23:29.865447+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGU6ECXQKCAW4254","created_at":"2026-07-05T00:23:29.865447+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGU6ECXQ","created_at":"2026-07-05T00:23:29.865447+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/TGU6ECXQKCAW4254DN7F5OT4HX","json":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX.json","graph_json":"https://pith.science/api/pith-number/TGU6ECXQKCAW4254DN7F5OT4HX/graph.json","events_json":"https://pith.science/api/pith-number/TGU6ECXQKCAW4254DN7F5OT4HX/events.json","paper":"https://pith.science/paper/TGU6ECXQ"},"agent_actions":{"view_html":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX","download_json":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX.json","view_paper":"https://pith.science/paper/TGU6ECXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.01329&json=true","fetch_graph":"https://pith.science/api/pith-number/TGU6ECXQKCAW4254DN7F5OT4HX/graph.json","fetch_events":"https://pith.science/api/pith-number/TGU6ECXQKCAW4254DN7F5OT4HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX/action/storage_attestation","attest_author":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX/action/author_attestation","sign_citation":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX/action/citation_signature","submit_replication":"https://pith.science/pith/TGU6ECXQKCAW4254DN7F5OT4HX/action/replication_record"}},"created_at":"2026-07-05T00:23:29.865447+00:00","updated_at":"2026-07-05T00:23:29.865447+00:00"}