{"as_of":"2026-08-18T00:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f58192987f23a94c0a31bb9f66b9081e0ee145611f6b30df856fdac4f2277fed","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:31:55.118164Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.13118/citation-record","integrity":"/paper/2608.13118/integrity","json":"/paper/2608.13118/citation-record.json","paper":"/paper/2608.13118"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.606815Z","title":"Evasion attacks against machine learning at test time,","venue":null,"work_id":"f9bcab91-eb69-482c-97d0-8188d5333905","year":2013},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.954301Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:52d4d28b321dbc91d5cff5bc46fd178965420497164ca2ae745da3c79ab4e3ea","observation_id":"e9334d9e-b530-48c2-8a76-c942ac2d68eb","resolution":{"observed_at":"2026-08-15T16:31:55.610682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.595392Z","title":"Explaining and harnessing adversarial examples,","venue":null,"work_id":"94f0f671-fb78-4b6c-b5a9-30100c27e35a","year":2015},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.958365Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:7a5a09b2403eefb29c5a1b1af6718687e0b88b38738544601fdda3004b510ec5","observation_id":"fe747551-1c6a-4173-8ddd-37e1195e4768","resolution":{"observed_at":"2026-08-15T16:31:55.598901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.583278Z","title":"Reluplex: An efficient SMT solver for verifying deep neural networks,","venue":null,"work_id":"012513f0-eb37-4722-93c9-c090e168a5d2","year":2017},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.961972Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:36ea14384aa98a4ddbbdd77fed7fec5d7b60dbc8feaff776c76a487598929abe","observation_id":"a1e39e57-e6f2-4c5d-9016-c623e19d5632","resolution":{"observed_at":"2026-08-15T16:31:55.587084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.571860Z","title":"Safety verification of deep neural networks,","venue":null,"work_id":"a82daad0-9d7c-40bb-899a-40b52413e71c","year":2017},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.965813Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:5973bf5c609778261601ff618251a3ad9aad820626d3437c77db7c2551d8501e","observation_id":"ea9098c7-b99b-49c3-b806-02862cf0a213","resolution":{"observed_at":"2026-08-15T16:31:55.576114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.561170Z","title":"Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis","venue":null,"work_id":"69038a4c-9d25-4b68-a0d5-4fd83f96e30a","year":2021},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.969127Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:9bd71e89b5a46b2e3dbec3ac6ee133d1292b09f36bca0acb5a51ab8d01e4606c","observation_id":"4fd497b2-b792-48dd-b676-2bb1edcbe774","resolution":{"observed_at":"2026-08-15T16:31:55.564946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.550799Z","title":"An abstract domain for certifying neural networks,","venue":null,"work_id":"3cbb8ec0-62d8-4f5f-bed8-5a0b543e92f2","year":2019},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.972841Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:e8be7bfdcdaeff13bb2aa9808a6b8a8b60a0cf78ab33a9b54fb1fa818533a46b","observation_id":"7335ca11-5804-40c8-aaa2-b8bb46364c74","resolution":{"observed_at":"2026-08-15T16:31:55.554481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:54.976557Z","title":"Branch and bound for piecewise linear neural network verification,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.976557Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:10b4cc5f70beeb9587903785c8fb960ab8600676dd21db9d8ff7d0ae5d0809cc","observation_id":"aa311fdf-757b-48ff-9fd1-eb9b0ab0a88f","resolution":{"observed_at":"2026-08-15T16:31:54.976557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.533744Z","title":"Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification,","venue":null,"work_id":"6b4a8229-a6b7-4614-aff1-006679e85d5a","year":2021},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.979993Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:1250beca3f03a6129c6f073056a18d88b2a7c6fd4826cf62ef79500fc8db726b","observation_id":"03941f4f-f59c-474d-a8b4-51d326b03937","resolution":{"observed_at":"2026-08-15T16:31:55.537899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.523859Z","title":"Fast and effective robustness certification,","venue":null,"work_id":"7b664ca2-ea09-48a0-99ce-0c241c9dabef","year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.983360Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:767509fc87933df2b653f09866258e1ef7f47936a37b1e71380a4d54ec7d5f40","observation_id":"2c2a3e20-85ef-4b1a-9879-2dd24c119102","resolution":{"observed_at":"2026-08-15T16:31:55.527092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.513719Z","title":"Falsifai: Falsification of ai-enabled hybrid control systems guided by time-aware coverage criteria,","venue":null,"work_id":"88b91847-a36b-4bbc-8da2-0f856efe7b4a","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.986708Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:5d4de3e5c1a6891fbd37a95b23f169ebd1c2897b6bde577b8af778fdc58eacb5","observation_id":"1f263552-1ac7-4c84-a4dc-da412eb798fe","resolution":{"observed_at":"2026-08-15T16:31:55.517270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.503656Z","title":"Efficient global robustness certifi- cation of neural networks via interleaving twin-network encoding,","venue":null,"work_id":"7d0d0402-40fd-43a6-b690-b074faf945c9","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.990554Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:cb7126efb871321f2c894b7b67259b6adc5f4ef0aab3a695d9abe2cc12cd97bf","observation_id":"bca5a502-da7f-4871-a429-8630e56f1ee6","resolution":{"observed_at":"2026-08-15T16:31:55.507227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.493191Z","title":"Input-relational verification of deep neural networks,","venue":null,"work_id":"37296c8c-1d48-4743-9e49-291296c58cb3","year":2024},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.994173Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:38e8444c0339fd4951baa5ca27848cf72ae11982d2f66f7c2aae3b0a12309d07","observation_id":"cffa7bb9-1380-4b83-8385-1e96c96969d9","resolution":{"observed_at":"2026-08-15T16:31:55.496965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-08-16T18:31:42.990932Z","submitted_at":"2021-04-14T09:22:42Z","title":"Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.06718","snapshot_observed_at":"2026-08-15T16:31:54.997611Z","title":"Improved branch and bound for neu- ral network verification via lagrangian decomposition,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:54.997611Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:811382b62adaed0842168d2e8d470bd85a933e98b3d4dc3f193ab5a6bd7cac7c","observation_id":"3185a667-871f-4408-815f-e46a987f60b3","resolution":{"observed_at":"2026-08-15T16:31:54.997611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.483099Z","title":"Neural network verification with branch-and-bound for general nonlinearities,","venue":null,"work_id":"e74598f0-7482-4a92-bd0f-3b0f1076777a","year":2025},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.001438Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:0a936e852bf4c76b618810f646baabdea8c659db69d83c56eae8a1be09589a12","observation_id":"b44b11cb-dbcc-4c8f-a51e-8c1ca9bddf70","resolution":{"observed_at":"2026-08-15T16:31:55.486645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01329","last_updated":"2019-12-03T12:12:29Z","snapshot_observed_at":"2026-08-10T10:10:32.009826Z","submitted_at":"2019-12-03T12:12:29Z","title":"Neural Network Branching for Neural Network Verification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01329","snapshot_observed_at":"2026-08-15T16:31:55.004794Z","title":"Neural network branching for neural network verification,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.004794Z"},"links":{"cited_paper":"/paper/1912.01329","citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:2350645d1d6af747e6181c19a943c466102ddd943716914c963d3cc79aa57610","observation_id":"6e93713e-353f-447f-b8fc-b163576ccbb4","resolution":{"observed_at":"2026-08-15T16:31:55.004794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.471874Z","title":"Complete verification via multi-neuron relaxation guided branch-and-bound,","venue":null,"work_id":"ab09a018-1c57-4d3d-9288-1594df8da613","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.008654Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:9dcc62374de673a7f94d507042d321b2e896eb1a96f0ba3112ae6f6066478cff","observation_id":"9196a315-4259-4f3d-81d7-bd1ae86ed978","resolution":{"observed_at":"2026-08-15T16:31:55.476368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.461513Z","title":"Relational verification leaps forward with RABBit,","venue":null,"work_id":"e5f699c9-39f8-4e97-99ca-249b95a2ba62","year":2024},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.011827Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:27657b6eb35140455272d76a462dd3e5ce1ca900939a475a07cb89b181eb8a66","observation_id":"1f506a87-f480-49b7-a67b-0a6117e00453","resolution":{"observed_at":"2026-08-15T16:31:55.465345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.451575Z","title":"Algorithms for verifying deep neural networks,","venue":null,"work_id":"d8f8f95e-53d3-4ff4-a730-420614f8b9a2","year":2021},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.015162Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:27020b68c6ecad72bea8aa1fa2ab18d7373f1eff4e2cad8ad3fa57a3340f25b4","observation_id":"20129d2f-c68c-44ad-b94b-36c46a4986e2","resolution":{"observed_at":"2026-08-15T16:31:55.455273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.441491Z","title":"Improving neural network verification through spurious region guided refinement,","venue":null,"work_id":"5e6085e8-84b1-4928-9e78-4ac16b3b4b3c","year":2021},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.018544Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:e929c5391186011555dbdd2e07e46a1866883970a9ae28f4837fc3fde52e9061","observation_id":"2426b50c-6691-46d3-adca-d68c1bf71bce","resolution":{"observed_at":"2026-08-15T16:31:55.445251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.430684Z","title":"Optimization and abstraction: a synergistic approach for analyzing neural network robustness,","venue":null,"work_id":"421b4957-bc60-4c27-9cc1-de42efee3f9c","year":2019},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.021993Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:20b722fd24c4d34367f8f8507b0d1873cadc1af019fe77c1b6d06e3eecbe7f03","observation_id":"14a79e80-cb79-40a6-922d-9f2cc6de204d","resolution":{"observed_at":"2026-08-15T16:31:55.434509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.419882Z","title":"Cleverest: accelerating cegar-based neural network verification via adversarial attacks,","venue":null,"work_id":"6c99ffdf-dcd2-4079-9778-f5b986d45ac3","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.025285Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:b6b3994ae445976658f59f62a718320c4ae14f609576039797bb6755f3e2a4a3","observation_id":"dc31cdc8-00f6-444f-84ae-542524cd0c0c","resolution":{"observed_at":"2026-08-15T16:31:55.423475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.408737Z","title":"Hyperproperties,","venue":null,"work_id":"85c592d1-d792-4baa-b54a-96757ed9da94","year":2010},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.028645Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:fc81ec3e9170bb03cda4eaf538cb6bc46e253ecd48ce380d2cffac11e0099ac7","observation_id":"a60bff34-5411-427a-b835-71d058d62cad","resolution":{"observed_at":"2026-08-15T16:31:55.413050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.398657Z","title":"Deepgemini: verifying dependency fairness for deep neural network,","venue":null,"work_id":"fe35180b-c621-47e9-8f7b-ad7d357b7669","year":2023},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.032179Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:590bc1226e35f5987bef57f4a8e930997832244a73d89547c2dcf4b1792e0678","observation_id":"eb32c99f-b83c-45c6-b241-1d947ffffb58","resolution":{"observed_at":"2026-08-15T16:31:55.402211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.388801Z","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope,","venue":null,"work_id":"d9e0337f-705c-48b6-9d32-9c28355f3e42","year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.035427Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:b3d57a4e05eb432e875348b55a6608b71118435c45404310af74234565205cd9","observation_id":"9a5bb3a8-b1e8-4f92-ac74-414f6fc2854c","resolution":{"observed_at":"2026-08-15T16:31:55.392425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.378873Z","title":"Artifact for the paper “Branch and Bound for Relational Verification of Neural Networks","venue":null,"work_id":"5a60a49f-bd9f-4c8e-ba67-9ebdf3f2b43a","year":null},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.038832Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:2d33a3ad33996622ccfc26a0895b92f7ff74bf5e8f5f194039e7d4377028cf75","observation_id":"05f191f3-2946-4a56-ac8f-c9203a4cbb0b","resolution":{"observed_at":"2026-08-15T16:31:55.382505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.045797Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.045797Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:631dc7f4cef6dbdb4814ef0e38f31fbec6b3ad4ca9021e40a2a13e06ee271815","observation_id":"22c75061-35a6-4489-bc57-6c15a04f271e","resolution":{"observed_at":"2026-08-15T16:31:55.045797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19985","last_updated":"2024-12-28T03:07:00Z","snapshot_observed_at":"2026-08-17T18:49:09.020021Z","submitted_at":"2024-12-28T03:07:00Z","title":"The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Results","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19985","snapshot_observed_at":"2026-08-15T16:31:55.053335Z","title":"The fifth international verification of neural networks competition (vnn-comp 2024): Summary and results,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.053335Z"},"links":{"cited_paper":"/paper/2412.19985","citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:9444555671eeb667c6e057c5ecf8de46ee5b43816392bf00acc03fa290ae18e3","observation_id":"4f708b52-28ca-474e-9a61-b99e9d961798","resolution":{"observed_at":"2026-08-15T16:31:55.053335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.057025Z","title":"Cohen,Statistical power analysis for the behavioral sciences","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.057025Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:a54ce151cda7b4edfe6aa23eaa61abb5943b9a4ab6946134f30801f5338dc079","observation_id":"5ecc3607-f2de-4eb2-86ff-311e2f5e2dc6","resolution":{"observed_at":"2026-08-15T16:31:55.057025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.351596Z","title":"Evaluating robustness of neural networks with mixed integer programming,","venue":null,"work_id":"a349cac5-785a-482c-b6e1-7af9adba3ab4","year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.060517Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:3b7d156e80bbc1870b688fbd90d323e4b4394ab9bf65b25993beaf88fc65b646","observation_id":"ae26bcea-bc2f-40ff-86a6-302f1c61f439","resolution":{"observed_at":"2026-08-15T16:31:55.355221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.341189Z","title":"Formal verification of piece-wise linear feed-forward neural networks,","venue":null,"work_id":"0fc5fa94-3529-4ee0-9771-28cbcf2507f6","year":2017},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.063912Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:2c282440666441b36cf43c85c5c5e591ba119f3d0108565dfec50b5d61ccf4b6","observation_id":"ccf13dff-dc77-4a9e-8275-cf6219bcc319","resolution":{"observed_at":"2026-08-15T16:31:55.344848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10868","last_updated":"2021-05-18T10:14:05Z","snapshot_observed_at":"2026-08-09T18:32:19.700542Z","submitted_at":"2020-07-20T16:09:07Z","title":"Scaling Polyhedral Neural Network Verification on GPUs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10868","snapshot_observed_at":"2026-08-15T16:31:55.067176Z","title":"Neural network robustness verification on gpus,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.067176Z"},"links":{"cited_paper":"/paper/2007.10868","citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:07e13ae42e2f8e8a727b88ab0d2d1f073886ac7f939511c9e17724d8d88a5a13","observation_id":"cbecefb3-5b59-41d7-94fe-f342017177fc","resolution":{"observed_at":"2026-08-15T16:31:55.067176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.070773Z","title":"Efficient formal safety analysis of neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.070773Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:2d986bcbd72a93fbe5001195f147b6ff7903be9ec85f65ecad077dfb59d716a4","observation_id":"9e5082b2-61aa-4929-b7c0-3d9103c7f7e6","resolution":{"observed_at":"2026-08-15T16:31:55.070773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.325015Z","title":"Efficiently computing local lipschitz constants of neural networks via bound prop- agation,","venue":null,"work_id":"15b1bced-ec59-48b8-bd99-ff0ae4e3bf93","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.074423Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:e1be4c373884511d7546fd1794e2949e46ddc1488e0eec24e547d85ce6dcadec","observation_id":"8dd08cdd-4807-4464-8b88-e3192311bbf9","resolution":{"observed_at":"2026-08-15T16:31:55.328528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.315397Z","title":"Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018),","venue":null,"work_id":"284b9e31-d960-41d9-bf23-7a385e6a1fc9","year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.078426Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:c1c3107dd6a953e2642da621719421f971df8f68b0ab9e59e6c193b82300fdb4","observation_id":"d80c5a91-c0f7-43ae-98d0-6c9b9d368a9c","resolution":{"observed_at":"2026-08-15T16:31:55.319029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.305566Z","title":"The convex relaxation barrier, revisited: Tightened single- neuron relaxations for neural network verification,","venue":null,"work_id":"0cde277c-2a45-4ff5-83d7-be275f1a9fd1","year":2020},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.081949Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:e82d41c2b8b4eb43a973abd4dbce35c42e3af95ec439025631f7d0d23ff5d529","observation_id":"f8989998-b535-4831-aade-577033300122","resolution":{"observed_at":"2026-08-15T16:31:55.309031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.296127Z","title":"Beyond the single neuron convex barrier for neural network certification,","venue":null,"work_id":"ed4da395-89c1-44ef-b89b-4fb73e9f8e5e","year":2019},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.085161Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:6473e58e963d138c91df051344e30756a07e9f0a80e5b7f7f0ab03e0e82866d6","observation_id":"3125565a-4c65-47c5-ab94-72c9cf3f9dee","resolution":{"observed_at":"2026-08-15T16:31:55.299496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.286442Z","title":"Prima: general and precise neural network certification via scalable convex hull approximations,","venue":null,"work_id":"c315518e-1b98-48be-8ae2-43fb09b39c24","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.088466Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:582b00afa578711fdbf533695464516fe083461ee87021b946e7d5145356c5b7","observation_id":"44321bab-411c-4ba2-9334-ea5fbe34f64b","resolution":{"observed_at":"2026-08-15T16:31:55.289748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.276804Z","title":"Semidefinite relaxations for certifying robustness to adversarial examples,","venue":null,"work_id":"10f3aca6-3a93-4d99-a920-b0fcbc02e741","year":2018},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.091674Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:4f0ea158c4d34cc0da00b91a2efa9bef7ae8b532c7ed5930a331b7c747e80c1d","observation_id":"710ee02f-e787-4de4-bd7d-adbd41d2c224","resolution":{"observed_at":"2026-08-15T16:31:55.280384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.267036Z","title":"Relational dnn verification with cross executional bound refinement,","venue":null,"work_id":"624697d2-4778-4670-a56a-1ae0659e2f3a","year":2024},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.095013Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:7d850e1b3b24226608e777312458a16e2740b9905b318e5097dda4886d60ae19","observation_id":"b4290dc1-c857-471d-97ba-1f3546067c0f","resolution":{"observed_at":"2026-08-15T16:31:55.270406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.257125Z","title":"Neurodiff: scalable differ- ential verification of neural networks using fine-grained approximation,","venue":null,"work_id":"2ca61db5-7e84-47f3-a2ed-5234297fe73b","year":2020},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.098309Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:f5615c2c9bfcff7c3ee70dcead6361903ff0dac25796240875cf8d556ec8807b","observation_id":"c3ca0de2-cbc9-4121-a3c5-497d6a81cc5c","resolution":{"observed_at":"2026-08-15T16:31:55.260614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.246638Z","title":"Reludiff: Differential verification of deep neural networks,","venue":null,"work_id":"9e1c7f89-dd1f-4673-9962-bcfd3288e822","year":2020},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.101436Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:6abcc02c4c2df9c46dfdba889e78d9bec99a68db0c0b446d48cd518f025f0e8e","observation_id":"259c6c8f-2a8d-439a-8e61-9bdb98c4f497","resolution":{"observed_at":"2026-08-15T16:31:55.250331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.235936Z","title":"Revisiting differential verification: Equivalence verification with confidence,","venue":null,"work_id":"4ba5bd8d-a563-4f91-b506-44e22b674db7","year":2025},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.105012Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:1cfb08a8e9f300867af7a6dbdb5098d2785f54bee074f34ae57f445d468b2706","observation_id":"5093f959-154b-48b6-9816-feca748bb436","resolution":{"observed_at":"2026-08-15T16:31:55.239529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.225821Z","title":"Shared certificates for neural network verification,","venue":null,"work_id":"e0f88998-47a7-4f8c-a14e-5a51367f9e6a","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.108286Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:844b211e2eaed9e5e6652e68a52191c7d655f8674df7fb9a17ddd54c71293593","observation_id":"62c36e24-084b-4558-93ee-9dc661475df3","resolution":{"observed_at":"2026-08-15T16:31:55.229404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.214917Z","title":"Proof transfer for fast certifica- tion of multiple approximate neural networks,","venue":null,"work_id":"a7bbc0b4-6d81-40ef-8803-954a98034bdd","year":2022},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.111514Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:8734cb70e4a41e453b990ae48677a1aa4b0480424a4564494add2e4b2dddaad8","observation_id":"66d81cc9-3f45-4b66-b190-d59fd6a92987","resolution":{"observed_at":"2026-08-15T16:31:55.218818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.203885Z","title":"Incremental verification of neural networks,","venue":null,"work_id":"9be9b77d-3c35-4160-ae15-b998f4b79a4d","year":1920},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.114762Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:12f26976fe88d1c13b10af35ffd46e41db5dd57cc3d1af25221f46b7ed312a9a","observation_id":"bce28aa3-e971-47b2-b3f5-b9f1513e44d7","resolution":{"observed_at":"2026-08-15T16:31:55.207686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.192531Z","title":"Efficient incremental verification of neural networks guided by coun- terexample potentiality,","venue":null,"work_id":"360760a8-97cb-4989-9754-21869e28070e","year":2025},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.118164Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:b193038a2038d8f4d85439057e18f9ee8ac08e78faf662233c305b09c69d4f89","observation_id":"6cb6f49e-c725-4ee8-b6f3-b91993376c75","resolution":{"observed_at":"2026-08-15T16:31:55.196733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.049742Z","title":"Available: https://www.gurobi.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.049742Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:f806a9d1d2a207978ba44a7f79ce7321ff1553ed2174bf684d73a894403646f9","observation_id":"d07cb244-9aed-4cb1-b635-98e53d5c9b37","resolution":{"observed_at":"2026-08-15T16:31:55.049742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.21536550","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:31:55.144312Z","title":"Available: https://doi.org/10.5281/zenodo.21536550","venue":null,"work_id":"49c30f40-a54e-4aec-afd6-4df151f95df4","year":null},"citing_paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-15T16:31:55.042334Z"},"links":{"citing_paper":"/paper/2608.13118"},"observation_digest":"sha256:e52f194b9993ff61eda162d34f4d72b94c47deda69e796edb985eed5429e7491","observation_id":"fa54cd1c-305d-4b5d-a50d-bf49149d704a","resolution":{"observed_at":"2026-08-15T16:31:55.148839Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.13118","last_updated":"2026-08-13T11:47:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T21:01:16.365304Z","submitted_at":"2026-08-13T11:47:46Z","title":"Branch and Bound for Relational Verification of Neural Networks"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":48},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2608.13118."}