{"as_of":"2026-08-17T22:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfc83ccb24ac78460ac8d05f31561c979f0b35578cf034377e54bba2a8cab5af","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:37:13.468613Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"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/2505.00963/citation-record","integrity":"/paper/2505.00963/integrity","json":"/paper/2505.00963/citation-record.json","paper":"/paper/2505.00963"},"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-16T04:37:15.389277Z","title":"Algorithms for verifying deep neural networks,","venue":null,"work_id":"79f7c210-88d5-4280-bb84-cfbd102c0d74","year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.278283Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:4055a15ffaee9e85131a87ab1802acf3328d354368b70268fa3fc3e94d572bf2","observation_id":"0933e82c-5f9d-4b85-8dac-19cc5c296fa6","resolution":{"observed_at":"2026-08-16T04:37:15.399681Z","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-16T04:37:15.363292Z","title":"Explaining and harnessing adversarial examples,","venue":null,"work_id":"f2d0a332-5a3a-41f3-b630-9d819e5a296e","year":2015},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.293652Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:eb52d700faedf6ab5449d7237e898a49bcc33ad4dfb3663d40dfad8863f0fe9b","observation_id":"c5bf5383-3dfe-4520-9911-e28057ef391f","resolution":{"observed_at":"2026-08-16T04:37:15.371890Z","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":"2212.10376","last_updated":"2023-02-16T08:06:35Z","snapshot_observed_at":"2026-08-16T16:07:15.893730Z","submitted_at":"2022-12-20T15:58:01Z","title":"The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10376","snapshot_observed_at":"2026-08-16T04:37:12.316354Z","title":"3rd international verification of neural networks competition (VNN-COMP 2022): Summary and results,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.316354Z"},"links":{"cited_paper":"/paper/2212.10376","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:790f03cd92c623949692a6e1f5282219591d200ba73d30d8081e8e9cc4183447","observation_id":"9ffe11e4-0dc0-4dcd-a969-3d63b4d4c372","resolution":{"observed_at":"2026-08-16T04:37:12.316354Z","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-16T04:37:15.327349Z","title":"Maximum resilience of artificial neural networks,","venue":null,"work_id":"26a7af81-0531-49cf-9784-1bd01a5f0240","year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.399892Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:e6f36faad4a8d6a2110022b5836df5be2b865c93d332302a2bff39fe5a12e34a","observation_id":"43ec8f6f-e546-4eca-8b3b-2d921e867198","resolution":{"observed_at":"2026-08-16T04:37:15.334414Z","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-16T04:37:15.293275Z","title":"Evaluating robustness of neural networks with mixed integer programming,","venue":null,"work_id":"54363356-7767-4acc-912d-93e9f685feed","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.502403Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:c0ed9bdf214efc63a47a3413c680536940150f5200b085e82636d88cc5cc9e89","observation_id":"e5557692-b5ba-448f-91d5-1f0c839556bb","resolution":{"observed_at":"2026-08-16T04:37:15.308049Z","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-16T04:37:15.246933Z","title":"Fast and effective robustness certification,","venue":null,"work_id":"87165f98-0542-44a9-996d-a627e68f214f","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.531893Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:ad23a8dcad61ab4986b36db525012d017cf1250f98fc66ca58f1ab607d4ef6a0","observation_id":"5e833c36-716e-42b2-9357-91ba61e997a6","resolution":{"observed_at":"2026-08-16T04:37:15.259870Z","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-16T04:37:15.209974Z","title":"An abstract domain for certifying neural networks,","venue":null,"work_id":"5a49e1f6-5487-4a91-8b99-c1e6258a36ef","year":2019},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.543713Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:1b05827e1557057f39736874d8c1eb02f3e9d8553d36ca36515aca9e165ef6d3","observation_id":"6dfbc34a-f007-40af-9441-e9dc2cfb0621","resolution":{"observed_at":"2026-08-16T04:37:15.223474Z","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-16T04:37:15.169089Z","title":"Efficient neural network robustness certification with general activation functions,","venue":null,"work_id":"5b7e8d4d-e26a-4d65-ab4a-2c283b108c63","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.549273Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:f6beca9fc048e7f8dd462abb289343061f2c721b6513ff9709df721eb73c123f","observation_id":"63f757f2-bee9-4663-bed6-326f887d6d9a","resolution":{"observed_at":"2026-08-16T04:37:15.176905Z","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-16T04:37:15.107283Z","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope,","venue":null,"work_id":"6306a935-e4d4-41d9-951c-65130b368361","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.558263Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:9b843cc1dbf7f102ad98f72dab655887646d196babeeb6b3fa5f012dd2f1e682","observation_id":"eee4d005-f4c0-4cad-92ce-df9e937e958a","resolution":{"observed_at":"2026-08-16T04:37:15.124069Z","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-16T04:37:12.568385Z","title":"Branch and bound for piecewise linear neural network verification,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.568385Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:a605166147e85de980b7f367202fbe1fc859e29008cded2e2ee0e5d87e75abe1","observation_id":"87094487-5271-4f88-8b85-e4df5f0008a8","resolution":{"observed_at":"2026-08-16T04:37:12.568385Z","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-16T04:37:14.988315Z","title":"A survey of Monte Carlo tree search methods,","venue":null,"work_id":"8a67eb06-25c2-4418-856b-516a69abf8a8","year":2012},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.577835Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:306c42619e04e380dbb01c4ce88106d502d0d20b380c92faad24a3c1768ddc9e","observation_id":"b279624b-8c9e-4147-9582-903ee3ec21c7","resolution":{"observed_at":"2026-08-16T04:37:14.999437Z","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-16T04:37:14.949702Z","title":"Incremental veri- fication of neural networks,","venue":null,"work_id":"1a2d4e23-94e1-4c26-89ab-b5adb96f9d95","year":1920},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.583946Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:7fdb1b87e5860f34539a2bd0e4dcc95cd3a2d23f4d5b0b6a35dfc437402c2d54","observation_id":"808f6b5b-2cc4-4ce3-a5ee-eedf717957df","resolution":{"observed_at":"2026-08-16T04:37:14.963884Z","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-16T04:37:14.901723Z","title":"Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification,","venue":null,"work_id":"c598dae7-a1b3-44eb-92e1-846bcdcf3f2c","year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.593329Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:e9dc41b8f7511067a640394f67850e705dbba9c1601382fc98b9d6b2d62df227","observation_id":"fcd552f1-96ca-4204-9398-bf4ac14b2366","resolution":{"observed_at":"2026-08-16T04:37:14.918416Z","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-16T04:37:14.867051Z","title":"Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis","venue":null,"work_id":"7780b9a8-caf7-4e02-b406-45d48000106d","year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.601234Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:35ea2ffe87fc74893a23620395e6890c3af743c83d9d70e1828147456384bf4e","observation_id":"98e5257a-5967-4d30-bd3b-b328c3982415","resolution":{"observed_at":"2026-08-16T04:37:14.876693Z","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-16T04:37:12.615616Z","title":"Improved branch and bound for neural network veri- fication via lagrangian decomposition,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.615616Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:814cd9af335e4bcf36c3457fcd8fd829ee0d334aa1260874cca7dd479039bdc4","observation_id":"2b0f6ecb-b834-44a4-b2d2-be8b578064ba","resolution":{"observed_at":"2026-08-16T04:37:12.615616Z","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-16T04:37:14.830317Z","title":"Fast and effective robustness certification,","venue":null,"work_id":"a6e9195b-5449-4953-9637-ab455c8996cb","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.634475Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:15be6a9f5239d0f2368c1d8c8ea37edbc44e3e6398bfdf38a0629daa2cc6958e","observation_id":"a62fcd78-0f6c-432c-95b6-7ccd36682b1b","resolution":{"observed_at":"2026-08-16T04:37:14.839913Z","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-16T04:37:14.760288Z","title":"Two- layered falsification of hybrid systems guided by monte carlo tree search,","venue":null,"work_id":"da943de3-c167-4d51-80ee-12a8ef989348","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.639979Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:f845667b30f41c69665527155d04336e80a9820edabf72833876e98788faad49","observation_id":"170a95b4-5513-4e67-a9a2-820862e07bbc","resolution":{"observed_at":"2026-08-16T04:37:14.779825Z","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-16T04:37:14.718864Z","title":"Reluplex: An efficient SMT solver for verifying deep neural networks,","venue":null,"work_id":"ccbb81c0-504f-4504-8f30-70d4821168b2","year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.650758Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:e6b77d2c3a2734c9a1c774bb569b1273efb92fc2450a659c2e164e346a6c4c08","observation_id":"03cff1eb-4bb4-4067-8b97-9cf491fba129","resolution":{"observed_at":"2026-08-16T04:37:14.732113Z","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-16T04:37:14.664005Z","title":"Formal verification of piece-wise linear feed-forward neural networks,","venue":null,"work_id":"aaf0a4d2-f69a-415b-a050-44363fa18cec","year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.663079Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:1db69b8fb0809ef4d202f5fc0cfef8cbc141ee4a10916ef863979f18bd959ba3","observation_id":"f9be1525-c49d-46a0-a3ea-86df5c1512f4","resolution":{"observed_at":"2026-08-16T04:37:14.678045Z","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-16T04:37:14.622873Z","title":"Safety verification of deep neural networks,","venue":null,"work_id":"de5856c5-e871-48a4-9199-7762286b8f9e","year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.745878Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:78ef5c1992475d6fd8ccb55bef05eed0179ada30af6451caad8d1bd93cbd6c1d","observation_id":"6e6e21eb-77f8-463e-acf2-033e455b71ce","resolution":{"observed_at":"2026-08-16T04:37:14.636911Z","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-16T04:37:12.827446Z","title":"Neural network robustness verification on gpus,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.827446Z"},"links":{"cited_paper":"/paper/2007.10868","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:e4a3aa7c2bf6bcfe1db5c25ecaae5e8ec884868a5636b6d4bd06f75dbf912eb9","observation_id":"800273c3-4017-43d2-bc71-196f18a59a3d","resolution":{"observed_at":"2026-08-16T04:37:12.827446Z","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-16T04:37:14.577624Z","title":"Efficient formal safety analysis of neural networks,","venue":null,"work_id":"8399d5f0-0ab5-41aa-875c-545d4400c016","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.937331Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:d4e7284e03b64c5568432b2462c46e8b3bec0404648fc8e0811262c11bedf319","observation_id":"831222ad-68f0-44c8-a2fb-fc007e63b7db","resolution":{"observed_at":"2026-08-16T04:37:14.585846Z","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-16T04:37:14.542384Z","title":"Efficiently computing local lipschitz constants of neural networks via bound prop- agation,","venue":null,"work_id":"ae1d1f15-fe17-4e49-b48d-0a3436a3c99f","year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.948044Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:93ec059a32cf0cbb9f08b3c7747533ca2bbd30a4373fed4ee3686ed183a007a9","observation_id":"6c5793e9-d1c2-4b21-acb3-9c113a86f3e4","resolution":{"observed_at":"2026-08-16T04:37:14.549503Z","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-16T04:37:12.960872Z","title":"Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018),","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.960872Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:ae576deb887bba7983a45df6506ca8147ff798ffdd8a3094aef37cb2ec293adb","observation_id":"61bf27fa-813f-4f29-9186-f04f7e99167e","resolution":{"observed_at":"2026-08-16T04:37:12.960872Z","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-16T04:37:14.472938Z","title":"The convex relaxation barrier, revisited: Tightened single- neuron relaxations for neural network verification,","venue":null,"work_id":"d1d08d99-75d2-4b30-8caf-14cdea3aaf6c","year":2020},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.973526Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:6a7af9ddd6929e8b7367245bc1838f049b4a5402092b8747182e6789888f7ebc","observation_id":"a35e6a2d-1562-4683-8900-6dd1dac36c1f","resolution":{"observed_at":"2026-08-16T04:37:14.482991Z","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-16T04:37:14.449289Z","title":"Beyond the single neuron convex barrier for neural network certification,","venue":null,"work_id":"3c2df8e3-eb21-4db4-bf9e-ef9ffa754bc2","year":2019},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.982359Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:f7246a69821554f8a396499ddd1358cf6658cb65a483cd6a1a2cc6899764051e","observation_id":"a0bbbace-e15e-4a6e-bb90-0f53781f87f2","resolution":{"observed_at":"2026-08-16T04:37:14.455656Z","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-16T04:37:14.408466Z","title":"Prima: general and precise neural network certification via scalable convex hull approximations,","venue":null,"work_id":"f1e573c7-c9a9-4f92-87ad-fb9076087273","year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:12.993105Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:06be0d4fa86daf3e5687a9741db3fa12c64b717beb45bf76c9494a7c19456b41","observation_id":"bc74a486-9846-4aa9-8c73-9b2e3c1444c0","resolution":{"observed_at":"2026-08-16T04:37:14.424396Z","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":"2103.03638","last_updated":"2022-02-28T16:54:50Z","snapshot_observed_at":"2026-08-16T18:41:00.243859Z","submitted_at":"2021-03-05T12:53:24Z","title":"PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03638","snapshot_observed_at":"2026-08-16T04:37:13.003470Z","title":"Precise multi-neuron abstractions for neural network certification,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.003470Z"},"links":{"cited_paper":"/paper/2103.03638","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:c6e844cf2940cd3efb30b630a2466dff57918b9ae845faffa6131446a3746d07","observation_id":"188e4b32-75c0-4255-a785-cc69e872e5d7","resolution":{"observed_at":"2026-08-16T04:37:13.003470Z","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-16T04:37:14.371259Z","title":"Semidefinite relaxations for certifying robustness to adversarial examples,","venue":null,"work_id":"34c7e533-73fd-4f2e-8871-2d28da55fa01","year":2018},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.017049Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:c2bdc3b6828da5086aedbd0ec6cd35538acc02b32d24efc9806c93016a00d562","observation_id":"bfb31307-8724-41ae-9422-1cab497ff3b7","resolution":{"observed_at":"2026-08-16T04:37:14.380818Z","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-16T04:37:14.339142Z","title":"Improving neural network verification through spurious region guided refinement,","venue":null,"work_id":"f3081067-263e-4b54-913f-d61eb18e8a0a","year":2021},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.025442Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:56b9f19755650568b656f51302e39e1912d0d6576f8906d8e932a4491f2deaa1","observation_id":"6a97c008-7549-4e0a-aeca-f3260def62f3","resolution":{"observed_at":"2026-08-16T04:37:14.347547Z","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-16T04:37:14.289695Z","title":"An abstraction-refinement approach to verifying convolutional neural networks,","venue":null,"work_id":"df274eb2-3da3-44a7-b33b-af3a6c680538","year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.036897Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:d2de8b5523bb50376b775efa97bae12f7eb995f99a7d8001442e325a518dd892","observation_id":"95361ce7-c50a-4e3f-a355-3fc08ab84d25","resolution":{"observed_at":"2026-08-16T04:37:14.303878Z","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-16T04:37:14.231825Z","title":"Cleverest: accelerating cegar-based neural network verification via adversarial at- tacks,","venue":null,"work_id":"61a7c088-cc3f-4892-a301-e62acacd7fab","year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.053062Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:db6f651dbe9b05f5a73cd6c06159c615afb2da364b000990cd6474301ace875d","observation_id":"d168a7e1-74b5-4ec4-8bb5-64ddb3d94dbc","resolution":{"observed_at":"2026-08-16T04:37:14.242502Z","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-16T04:37:14.193761Z","title":"Counterexample- guided abstraction refinement,","venue":null,"work_id":"326b2ba3-0522-4896-b3e8-cd7afb473e62","year":2000},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.062728Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:29a421297fb3824e79d4ce9e0d28661d414a06057a8c63ef90de68901d0a6acd","observation_id":"25cdea29-8615-4822-b56b-fb75fbd5409e","resolution":{"observed_at":"2026-08-16T04:37:14.202338Z","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":"2405.21063","last_updated":"2025-02-07T22:42:52Z","snapshot_observed_at":"2026-08-16T13:47:19.522086Z","submitted_at":"2024-05-31T17:51:07Z","title":"Neural Network Verification with Branch-and-Bound for General Nonlinearities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.21063","snapshot_observed_at":"2026-08-16T04:37:13.074491Z","title":"Neural network verification with branch-and-bound for general nonlinearities,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.074491Z"},"links":{"cited_paper":"/paper/2405.21063","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:def39c31856a6188653a835ebfc13c89449e889fe589cdd7bce9aefc59dbffb6","observation_id":"ab3f89a2-019c-4dfe-b720-6f42759e598f","resolution":{"observed_at":"2026-08-16T04:37:13.074491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-16T04:37:13.194137Z","title":"Neural network branching for neural network verification,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.194137Z"},"links":{"cited_paper":"/paper/1912.01329","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:baac7edf28c6bacc1ee52a9d809bfbe64330654559b1a3e945a809b9add63273","observation_id":"94c73ed6-c683-467d-b077-28c3810af567","resolution":{"observed_at":"2026-08-16T04:37:13.194137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.00263","last_updated":"2022-04-30T13:12:33Z","snapshot_observed_at":"2026-08-16T17:03:29.379863Z","submitted_at":"2022-04-30T13:12:33Z","title":"Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.00263","snapshot_observed_at":"2026-08-16T04:37:13.289166Z","title":"Complete verification via multi-neuron relaxation guided branch-and-bound,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.289166Z"},"links":{"cited_paper":"/paper/2205.00263","citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:4bf5024c50d9725fc5d80886fee3cfe9220dc04c4ecfa5d95402c2d17cca5961","observation_id":"4a225650-4edf-448f-9903-e1f4eaa10bc9","resolution":{"observed_at":"2026-08-16T04:37:13.289166Z","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-16T04:37:14.145500Z","title":"Deepxplore: Automated whitebox testing of deep learning systems,","venue":null,"work_id":"aa1c7632-ee2d-440a-ac12-7e355079e41f","year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.331917Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:52bf40c0cb8ded1b2d44fb7a12c2b7540fa86b7025d33735a5a07a26ca9206c1","observation_id":"6cc5e3f0-e62e-411e-8c43-33752120fd66","resolution":{"observed_at":"2026-08-16T04:37:14.155904Z","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-16T04:37:13.983577Z","title":"Tensorfuzz: De- bugging neural networks with coverage-guided fuzzing,","venue":null,"work_id":"fdb752c4-b535-4f2d-800a-daef16dd50cf","year":2019},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.344850Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:c29aaeff9b5e551cedea9627b2fce97b53d2bfbc987bc7b2ea88fbaa1fee4552","observation_id":"81b40259-2f6d-4826-a285-8379e9765a23","resolution":{"observed_at":"2026-08-16T04:37:14.056385Z","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-16T04:37:13.938124Z","title":"Square attack: a query-efficient black-box adversarial attack via random search,","venue":null,"work_id":"7d3e4649-a216-4457-8625-68bcfb16a297","year":2020},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.441938Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:e85e3bf75db05a04ac4b3c602fc11813ba9b6c97cd6b4aa09f52ca127fab7118","observation_id":"a69c561e-b947-4541-8744-52e65e2b2a7a","resolution":{"observed_at":"2026-08-16T04:37:13.949214Z","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-16T04:37:13.450928Z","title":"Improving transferability of adversarial examples with input diversity,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.450928Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:474a80d7c100576d299f0598ac259b4fe8eca572f99bc228e3f0eeb318170721","observation_id":"102ea460-5ebf-462c-8a9d-59f3820f119a","resolution":{"observed_at":"2026-08-16T04:37:13.450928Z","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-16T04:37:13.870273Z","title":"A branch and bound framework for stronger adversarial attacks of relu networks,","venue":null,"work_id":"43603b10-1ca7-4afd-a74f-fd080c43fa87","year":2022},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.458698Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:1c2eb305f88479ef81767248ef7fa993c56031d240949782ae79e9a4b566a7d1","observation_id":"3b2600cc-2893-4e2c-ac03-f202bca340df","resolution":{"observed_at":"2026-08-16T04:37:13.882956Z","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-16T04:37:13.468613Z","title":"Towards evaluating the robustness of neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T04:37:13.468613Z"},"links":{"citing_paper":"/paper/2505.00963"},"observation_digest":"sha256:02dec4f2424c0bd0cea359435d6ce5a259240b9fd0c77af5ae6d24c9a874b60e","observation_id":"170d03f8-81af-4751-a3b5-8b66dfead642","resolution":{"observed_at":"2026-08-16T04:37:13.468613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.00963","last_updated":"2025-05-02T02:41:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T04:28:16.956162Z","submitted_at":"2025-05-02T02:41:02Z","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":42},"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 17 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2505.00963."}