{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YFBMVHMHPXODAON3AVYTIQDDCB","short_pith_number":"pith:YFBMVHMH","schema_version":"1.0","canonical_sha256":"c142ca9d877ddc3039bb05713440631055eb7c4ba6fd264048bdf001060e362a","source":{"kind":"arxiv","id":"2512.10747","version":2},"attestation_state":"computed","paper":{"title":"Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Guy Katz, Maya Swisa","submitted_at":"2025-12-11T15:36:16Z","abstract_excerpt":"Modern neural network verifiers often encode neural network verification as constraint satisfaction problems. When dealing with standard piecewise-linear activation functions, such as ReLUs, verifiers typically employ branching heuristics that break a complex constraint satisfaction problem into multiple, simpler problems. The verifier's performance depends heavily on the order in which this branching is performed: a poor selection may give rise to exponentially many sub-problems, hampering scalability. Here, we focus on the setting in which many related verification queries must be solved for"},"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":"2512.10747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-12-11T15:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"621b69517878577321dccc43395996b2cfe8db743072c57ded277180698a92ed","abstract_canon_sha256":"46919bb946b03cf66f0c7d99ec342a7b19a5d2d72a9c4786dda3fcb74130a2cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:26.425737Z","signature_b64":"C0CVeQPZKtqY0etS3J7FNvuWJ6hjfoJXrpmQB6mBA/6Ew3khw287KqoFh4Yaaoci7puAym3kABKOScg6uc6jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c142ca9d877ddc3039bb05713440631055eb7c4ba6fd264048bdf001060e362a","last_reissued_at":"2026-07-28T01:22:26.424812Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:26.424812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Guy Katz, Maya Swisa","submitted_at":"2025-12-11T15:36:16Z","abstract_excerpt":"Modern neural network verifiers often encode neural network verification as constraint satisfaction problems. When dealing with standard piecewise-linear activation functions, such as ReLUs, verifiers typically employ branching heuristics that break a complex constraint satisfaction problem into multiple, simpler problems. The verifier's performance depends heavily on the order in which this branching is performed: a poor selection may give rise to exponentially many sub-problems, hampering scalability. Here, we focus on the setting in which many related verification queries must be solved for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.10747","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/2512.10747/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":"2512.10747","created_at":"2026-07-28T01:22:26.425245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.10747v2","created_at":"2026-07-28T01:22:26.425245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.10747","created_at":"2026-07-28T01:22:26.425245+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFBMVHMHPXOD","created_at":"2026-07-28T01:22:26.425245+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFBMVHMHPXODAON3","created_at":"2026-07-28T01:22:26.425245+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFBMVHMH","created_at":"2026-07-28T01:22:26.425245+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/YFBMVHMHPXODAON3AVYTIQDDCB","json":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB.json","graph_json":"https://pith.science/api/pith-number/YFBMVHMHPXODAON3AVYTIQDDCB/graph.json","events_json":"https://pith.science/api/pith-number/YFBMVHMHPXODAON3AVYTIQDDCB/events.json","paper":"https://pith.science/paper/YFBMVHMH"},"agent_actions":{"view_html":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB","download_json":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB.json","view_paper":"https://pith.science/paper/YFBMVHMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.10747&json=true","fetch_graph":"https://pith.science/api/pith-number/YFBMVHMHPXODAON3AVYTIQDDCB/graph.json","fetch_events":"https://pith.science/api/pith-number/YFBMVHMHPXODAON3AVYTIQDDCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB/action/storage_attestation","attest_author":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB/action/author_attestation","sign_citation":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB/action/citation_signature","submit_replication":"https://pith.science/pith/YFBMVHMHPXODAON3AVYTIQDDCB/action/replication_record"}},"created_at":"2026-07-28T01:22:26.425245+00:00","updated_at":"2026-07-28T01:22:26.425245+00:00"}