{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TALM4XO5Y6C6SQGCXNCJCOQCWT","short_pith_number":"pith:TALM4XO5","canonical_record":{"source":{"id":"2107.12855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-27T14:42:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"03f6a005fcaec4bcc71808f892c8f94197ffe95f05587e564ae0c5cf574a78d5","abstract_canon_sha256":"64541231f424b0bc59a16e624fe1395f98cb6741551bb1cde65f2bf2a0605f33"},"schema_version":"1.0"},"canonical_sha256":"9816ce5dddc785e940c2bb44913a02b4d53bbc9a9b824752e93bf41954297b29","source":{"kind":"arxiv","id":"2107.12855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.12855","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2107.12855v1","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.12855","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"TALM4XO5Y6C6","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"TALM4XO5Y6C6SQGC","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"TALM4XO5","created_at":"2026-07-05T03:01:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TALM4XO5Y6C6SQGCXNCJCOQCWT","target":"record","payload":{"canonical_record":{"source":{"id":"2107.12855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-27T14:42:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"03f6a005fcaec4bcc71808f892c8f94197ffe95f05587e564ae0c5cf574a78d5","abstract_canon_sha256":"64541231f424b0bc59a16e624fe1395f98cb6741551bb1cde65f2bf2a0605f33"},"schema_version":"1.0"},"canonical_sha256":"9816ce5dddc785e940c2bb44913a02b4d53bbc9a9b824752e93bf41954297b29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:01.420008Z","signature_b64":"LZJ3VkQrOLMTBCqrG5EbLHvN992M5Zt3m6fQYJpPBNeC8o6VHFyhjr94iaH+kf9IRGrdpFluLfzjpbGu/3b4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9816ce5dddc785e940c2bb44913a02b4d53bbc9a9b824752e93bf41954297b29","last_reissued_at":"2026-07-05T03:01:01.419496Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:01.419496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.12855","source_version":1,"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-05T03:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wC1QGl2lxambaq/4C1KwZ2ECpKe6kX7QPHJPeRwZrAUmYmWxAKpboSYeeQ5cBQylXrJfWXmHwABKeRAqQCgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:05:45.817017Z"},"content_sha256":"efa19d248f0e6c12ccc677977bc8c794bbdb0bf50032e79f5b201808027257bd","schema_version":"1.0","event_id":"sha256:efa19d248f0e6c12ccc677977bc8c794bbdb0bf50032e79f5b201808027257bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TALM4XO5Y6C6SQGCXNCJCOQCWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Network Branch-and-Bound for Neural Network Verification","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Florian Jaeckle, Jingyue Lu, M. Pawan Kumar","submitted_at":"2021-07-27T14:42:57Z","abstract_excerpt":"Many available formal verification methods have been shown to be instances of a unified Branch-and-Bound (BaB) formulation. We propose a novel machine learning framework that can be used for designing an effective branching strategy as well as for computing better lower bounds. Specifically, we learn two graph neural networks (GNN) that both directly treat the network we want to verify as a graph input and perform forward-backward passes through the GNN layers. We use one GNN to simulate the strong branching heuristic behaviour and another to compute a feasible dual solution of the convex rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.12855","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/2107.12855/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-05T03:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFaABq+9xHkIChRKeS9leu39BlxKl5c29KvyKRTyUuLD6x96R8+DO10Qo7RmJ6OCmhQqLTwmGU83YoNGek6CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:05:45.817536Z"},"content_sha256":"89ac2e8e19a1378856bde252cb4e9a73d84362800d5917fd8575fbfc4fe4f238","schema_version":"1.0","event_id":"sha256:89ac2e8e19a1378856bde252cb4e9a73d84362800d5917fd8575fbfc4fe4f238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/bundle.json","state_url":"https://pith.science/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/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-10T11:05:45Z","links":{"resolver":"https://pith.science/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT","bundle":"https://pith.science/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/bundle.json","state":"https://pith.science/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TALM4XO5Y6C6SQGCXNCJCOQCWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TALM4XO5Y6C6SQGCXNCJCOQCWT","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":"64541231f424b0bc59a16e624fe1395f98cb6741551bb1cde65f2bf2a0605f33","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-27T14:42:57Z","title_canon_sha256":"03f6a005fcaec4bcc71808f892c8f94197ffe95f05587e564ae0c5cf574a78d5"},"schema_version":"1.0","source":{"id":"2107.12855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.12855","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2107.12855v1","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.12855","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"TALM4XO5Y6C6","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"TALM4XO5Y6C6SQGC","created_at":"2026-07-05T03:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"TALM4XO5","created_at":"2026-07-05T03:01:01Z"}],"graph_snapshots":[{"event_id":"sha256:89ac2e8e19a1378856bde252cb4e9a73d84362800d5917fd8575fbfc4fe4f238","target":"graph","created_at":"2026-07-05T03:01:01Z","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/2107.12855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many available formal verification methods have been shown to be instances of a unified Branch-and-Bound (BaB) formulation. We propose a novel machine learning framework that can be used for designing an effective branching strategy as well as for computing better lower bounds. Specifically, we learn two graph neural networks (GNN) that both directly treat the network we want to verify as a graph input and perform forward-backward passes through the GNN layers. We use one GNN to simulate the strong branching heuristic behaviour and another to compute a feasible dual solution of the convex rela","authors_text":"Florian Jaeckle, Jingyue Lu, M. Pawan Kumar","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-27T14:42:57Z","title":"Neural Network Branch-and-Bound for Neural Network Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.12855","kind":"arxiv","version":1},"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:efa19d248f0e6c12ccc677977bc8c794bbdb0bf50032e79f5b201808027257bd","target":"record","created_at":"2026-07-05T03:01:01Z","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":"64541231f424b0bc59a16e624fe1395f98cb6741551bb1cde65f2bf2a0605f33","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-27T14:42:57Z","title_canon_sha256":"03f6a005fcaec4bcc71808f892c8f94197ffe95f05587e564ae0c5cf574a78d5"},"schema_version":"1.0","source":{"id":"2107.12855","kind":"arxiv","version":1}},"canonical_sha256":"9816ce5dddc785e940c2bb44913a02b4d53bbc9a9b824752e93bf41954297b29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9816ce5dddc785e940c2bb44913a02b4d53bbc9a9b824752e93bf41954297b29","first_computed_at":"2026-07-05T03:01:01.419496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:01:01.419496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZJ3VkQrOLMTBCqrG5EbLHvN992M5Zt3m6fQYJpPBNeC8o6VHFyhjr94iaH+kf9IRGrdpFluLfzjpbGu/3b4Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T03:01:01.420008Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.12855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efa19d248f0e6c12ccc677977bc8c794bbdb0bf50032e79f5b201808027257bd","sha256:89ac2e8e19a1378856bde252cb4e9a73d84362800d5917fd8575fbfc4fe4f238"],"state_sha256":"cf7420db8750bceab4b095337d3a039892ce04c31cebd1c78f7e8a40ffd57d82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8h6P9NUuuJ286MVFHKSBH5U8GqXm3ZZaZh/L7OF1n01ykewz4nnuQpck2ewCMcCU65xVdROU4yvEY0IHjmVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T11:05:45.821551Z","bundle_sha256":"415ceee3c29bed10ee17643af44a1af6bcf0228a4cc341ce98f40b3f40799130"}}