{"as_of":"2026-08-08T03:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04f33a6be496475ceddd74d33cbe7403cb0c838b23bfaa904a4548b822f9ac68","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:07:55.251567Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:39:31.491465Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06665","snapshot_observed_at":"2026-08-03T08:39:31.491465Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.16510","last_updated":"2026-07-06T14:55:50Z","snapshot_observed_at":"2026-08-07T00:38:18.433498Z","submitted_at":"2026-01-23T07:18:07Z","title":"Learning to Optimize by Differentiable Programming","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T08:39:31.491465Z"},"links":{"cited_paper":"/paper/2506.06665","citing_paper":"/paper/2601.16510"},"observation_digest":"sha256:96e5dd240b2b2a1a13c869e1876be8d1721efc2b158e6bb7299437c93bedcd0a","observation_id":"8eef712c-34fe-4801-b96f-5d2869d8cb6f","resolution":{"observed_at":"2026-08-03T08:39:31.491465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.06665/citation-record","integrity":"/paper/2506.06665/integrity","json":"/paper/2506.06665/citation-record.json","paper":"/paper/2506.06665"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.09306","last_updated":"2025-05-10T21:15:51Z","snapshot_observed_at":"2026-07-06T10:34:46.540803Z","submitted_at":"2021-01-22T19:36:40Z","title":"Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification","version":4},"cited_work":{"arxiv_id":"2101.09306","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.09306","snapshot_observed_at":"2026-08-07T06:07:55.495290Z","title":"Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification","venue":"cs.LG","work_id":"44f15454-3bf8-4a0b-9511-314fccc7b395","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:51.767648Z"},"links":{"cited_paper":"/paper/2101.09306","citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:2aa18f7ae1a5a73ac67bf5a900bffca23d5cfd15ad258070ee1892ca78eba3bf","observation_id":"450187f3-b4a6-41a0-8016-bf8762414807","resolution":{"observed_at":"2026-08-07T06:07:55.549215Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.846338Z","title":"J., Delattre, B., Allauzen, A., and Hu, B","venue":null,"work_id":"0c17de3b-8e32-4180-a7f0-f2742c987c30","year":2023},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:51.838070Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:4142c5da3c6f39f2f34b26ad8dc1d7f7080078ed2129bc1a6c5b546b6861e7eb","observation_id":"429997b2-8ffc-446e-9843-9f9f389d8b86","resolution":{"observed_at":"2026-08-07T06:07:59.849139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.836524Z","title":"Certifiably robust variational autoencoders","venue":null,"work_id":"e47ce1be-9fd0-4156-938d-ce8c81eaf7dc","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:51.934593Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:238e809efc6bb8fc01a73e568dda42c88dab70a0f4f2edaf4478ac4174b43e40","observation_id":"1f636744-7c07-4b67-864d-e25aa290be3a","resolution":{"observed_at":"2026-08-07T06:07:59.839560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.826769Z","title":"Efficient neural network verification via layer-based semidefinite relaxations and linear cuts","venue":null,"work_id":"21d4e472-7634-453b-8897-630a8c1d040c","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.025658Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:542f4adabca475ab91b807380c6456e88dfe056ae2cb857f58178223f82dd21c","observation_id":"e5312a86-7f46-43e6-8ee1-d16e715d2b67","resolution":{"observed_at":"2026-08-07T06:07:59.830347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.816541Z","title":"N., Bak, S., Johnson, T","venue":null,"work_id":"e62dcca8-730c-49c0-912a-6612dd2dae75","year":2023},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.084403Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:d7698a899714a332c36cdd930b0a602710e33a084483439b92fc8d581a2e0df7","observation_id":"41dc8760-c512-4340-8512-bb6d5f5c0f7a","resolution":{"observed_at":"2026-08-07T06:07:59.820080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19985","last_updated":"2024-12-28T03:07:00Z","snapshot_observed_at":"2026-07-06T20:13:58.813488Z","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-07T06:07:52.141476Z","title":"T., and Wu, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.141476Z"},"links":{"cited_paper":"/paper/2412.19985","citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:4a7895f6f37160efef809ee4e6a47f47c094c8f7b30827d83b0b1bdabc0cbe70","observation_id":"245119e4-4b6e-47cc-b4a7-4c84799b2f55","resolution":{"observed_at":"2026-08-07T06:07:52.141476Z","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-07T06:07:59.806830Z","title":"A., Schmerling, E., Azizan, N., and Pavone, M","venue":null,"work_id":"2db2b6da-6dbd-4075-9bea-46e92f2b071f","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.261001Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:f46dbddc069596cce9a998dcdcec2dfd5aad22b3be8286e10f769d07684e9f9d","observation_id":"107c8edd-9984-4dac-9b4c-5ec32a136ba7","resolution":{"observed_at":"2026-08-07T06:07:59.809662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.797740Z","title":"and Zhang, R","venue":null,"work_id":"b6324243-4063-4b9c-8dfa-25cc958805ef","year":2023},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.341445Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:fb24198a4d0ac1a4dc13445f822f9af48776d78d5812784b21d625502fe64ce1","observation_id":"676e5baa-3060-4e59-a893-7ecb1d2084dc","resolution":{"observed_at":"2026-08-07T06:07:59.800735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.788624Z","title":"Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming","venue":null,"work_id":"8549e28f-f275-4388-a809-210bf117c6b7","year":2020},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.404153Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:c5122cae3b4a2496b2de8b5fcce34398856f3dc2c28cb6f2e19503f188eb4f24","observation_id":"5e654614-ebad-417d-b926-8ba562f5a87e","resolution":{"observed_at":"2026-08-07T06:07:59.791825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.779565Z","title":"S., Bunel, R., Torr, P., and Kumar, M","venue":null,"work_id":"e3a72f70-e790-4a73-8b94-cca3876c6779","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.468193Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:1cd94986da396e61dc441f3d04f1bde9b5d4a68b4211fded5c17ec0d5490399f","observation_id":"f3f612d0-b23d-46eb-972f-f3961d3046a8","resolution":{"observed_at":"2026-08-07T06:07:59.782415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.769778Z","title":"A., and Kohli, P","venue":null,"work_id":"664457fc-687d-4fad-b072-9686ac178c5d","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.533978Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a80aff8a948ef0693288b314e88f11a03f07fe1d752f76a0f0b10cd3b307f85c","observation_id":"d2622ed0-4163-422b-ac50-d1fd384c7e28","resolution":{"observed_at":"2026-08-07T06:07:59.772825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:52.617949Z","title":"Efficient and accurate estimation of lipschitz constants for deep neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.617949Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:9f3f1c23fa797d790611c31f242d46bc50ea568bbfdaed311718bc7d9cad5793","observation_id":"ff89bbd5-27e2-4ae4-b604-cc6456faaf7e","resolution":{"observed_at":"2026-08-07T06:07:52.617949Z","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-07T06:07:59.753635Z","title":null,"venue":null,"work_id":"42ac6b64-39f8-46b9-82be-b3e58735f08b","year":2020},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.687000Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:f7b97d48b78ec5211730e6aeeb35063e24bff98bc5810d104cde40ca1911c8d0","observation_id":"ee599717-ec26-4b90-ad78-01ba6a9495bb","resolution":{"observed_at":"2026-08-07T06:07:59.756857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.744059Z","title":"N., Jovanovi \\'c , N., and Vechev, M","venue":null,"work_id":"96461c81-a548-4ad6-b60c-30007fbeb3f4","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.731730Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:45a7df8445e5472da517862bf11bd9d0f32cddccf1a51138eb7f1390174388b4","observation_id":"a5282829-bb0e-468c-9abf-d97fa14ce711","resolution":{"observed_at":"2026-08-07T06:07:59.747061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.734580Z","title":null,"venue":null,"work_id":"cd19ff89-95e3-4df3-9b9e-f2b854d5d69b","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.805179Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a40943bf934a70a3958bc211f829789726debdf72a33d11fe1787de838bca2fe","observation_id":"e50e27ab-a28d-4e83-bea4-60828f35a775","resolution":{"observed_at":"2026-08-07T06:07:59.737743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.723965Z","title":"D., Stanforth, R., Bunel, R., Qin, C., Uesato, J., Arandjelovic, R., Mann, T., and Kohli, P","venue":null,"work_id":"477c0471-0ad3-4ffd-bddb-36a24134b41b","year":2019},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.896105Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:385391ec049ca4d83f486628398aee40687057389359065fd96b23a8b1556431","observation_id":"947d34b2-8b2a-4bf8-b793-3d8224fc7be0","resolution":{"observed_at":"2026-08-07T06:07:59.727980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.713808Z","title":"Osip: Tightened bound propagation for the verification of relu neural networks","venue":null,"work_id":"fdac3f9e-9661-4dad-9f51-d3b4c84946e0","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:52.964793Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a60a191eaca464e0cdd0b2e622a17fff3bf2027ba1f1a4d773d2217e6a814e49","observation_id":"bb149225-2bd4-4416-b18d-ab1def40da89","resolution":{"observed_at":"2026-08-07T06:07:59.717136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.703822Z","title":"Unlocking deterministic robustness certification on imagenet","venue":null,"work_id":"e3181e82-3a5f-4aa6-9d5a-d7bd4375ebfb","year":2023},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.032922Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:c7df046b7bd146f4f3a36e2fd7eaa0e28a6edb070c1f99c433195a242a70781f","observation_id":"7abab13d-9319-4402-958d-ea5f7643d251","resolution":{"observed_at":"2026-08-07T06:07:59.707339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.693854Z","title":"Z., and Anandkumar, A","venue":null,"work_id":"2bfdef69-8cb1-4564-9d88-034206789695","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.100349Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:0287dc9f49af7eaae180ae593fd68b4cd058c33ed8d978e880ce56c6a1bf53b5","observation_id":"af49b40f-c9cf-40dc-81c9-d3cf10fa5389","resolution":{"observed_at":"2026-08-07T06:07:59.696719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.684472Z","title":"Globally-robust neural networks","venue":null,"work_id":"58a1aaee-ccc2-4bb0-8da1-6eaf72c24e38","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.170401Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:7399b6e1cbffab4794808fc1b434639b812722b255df9759ff8089e8c4b3dddc","observation_id":"194f0e0f-d837-4075-84be-fd729a009393","resolution":{"observed_at":"2026-08-07T06:07:59.687779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.674782Z","title":"B., and Jacobsen, J.-H","venue":null,"work_id":"11611f8f-57dd-41c3-bf14-ff95246b90fc","year":2019},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.237753Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:0589357934311c813c655d1a2ea1c943570ea4891ccac4c6c9f4e0097cdfa703","observation_id":"d2ac7e5e-caf9-47fe-bb06-e65a3e1a98b6","resolution":{"observed_at":"2026-08-07T06:07:59.677907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08603","last_updated":"2021-09-27T07:15:03Z","snapshot_observed_at":"2026-07-06T10:05:16.719098Z","submitted_at":"2020-10-16T19:45:11Z","title":"A Sequential Framework Towards an Exact SDP Verification of Neural Networks","version":2},"cited_work":{"arxiv_id":"2010.08603","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.08603","snapshot_observed_at":"2026-08-07T06:07:55.358753Z","title":"A Sequential Framework Towards an Exact SDP Verification of Neural Networks","venue":"cs.LG","work_id":"b5e7aa84-23b8-42ce-aa3d-b6c2ffc53a77","year":2020},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.340266Z"},"links":{"cited_paper":"/paper/2010.08603","citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:c49770a903d8acf78921ab30d110a75c5826de80976244ce7d749200b002bd7d","observation_id":"c5552e52-7a85-4aa9-a3fa-a1bcdd576ccf","resolution":{"observed_at":"2026-08-07T06:07:55.406552Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:53.438711Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.438711Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:0ee4ee8af8dcc970478950af37b1ae970fb3b1e27d5610913c5b0fe8cc8f0f89","observation_id":"a0b2ee20-1bac-4099-9d89-469d01ad47c7","resolution":{"observed_at":"2026-08-07T06:07:53.438711Z","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-07T06:07:59.659127Z","title":"J., Araujo, A., and Allauzen, A","venue":null,"work_id":"fcb73cc2-b441-4d84-a517-76f6318e05b4","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.507995Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:375b829671a8f55b85678884e37f76cf6e98eec7d8c550b426935b5eb6eeeb79","observation_id":"b3fce42d-7d50-42c1-b177-b77a84b7f302","resolution":{"observed_at":"2026-08-07T06:07:59.661907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.650559Z","title":"and Papachristodoulou, A","venue":null,"work_id":"847a7943-8930-4af7-bf79-dbab1497691c","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.579649Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a2e6acceb38e3f79e5e97591e4f1eaabaeb17e3716f28520d9d283fdb9a978d1","observation_id":"187e08fc-c416-4700-b48d-3795094a04c8","resolution":{"observed_at":"2026-08-07T06:07:59.653581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.600032Z","title":null,"venue":null,"work_id":"f7874d75-f4cc-40e7-9723-8afcf1c7ef2f","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.642621Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a6423adb0b49b916e9ea900f625b6a7627ccc3322d7c1738e164b3d86570069e","observation_id":"ce49bc4d-8854-4153-9ce8-7622ed28d77d","resolution":{"observed_at":"2026-08-07T06:07:59.644475Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:59.251640Z","title":"A convex relaxation barrier to tight robustness verification of neural networks","venue":null,"work_id":"2b3246b8-1c97-4fed-b468-5ae0542f8484","year":2019},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.716058Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:b6837d7d1d8c349e89b2c39667a685e43c7638c212f7d4c0d1bef9c2c0cdaa25","observation_id":"efcee331-12e6-4944-8abd-41ec037a4676","resolution":{"observed_at":"2026-08-07T06:07:59.425314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:58.905410Z","title":"Neural network verification with branch-and-bound for general nonlinearities","venue":null,"work_id":"51a482f6-dba8-4090-9f25-a34e61a5c816","year":2025},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.818512Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:009319d04d95533731fe88bade02539ecd05978c0e4bfe8d84d8256266a2f5c3","observation_id":"4a21286b-316f-4667-a531-7425c63c5efb","resolution":{"observed_at":"2026-08-07T06:07:59.030960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:58.668503Z","title":"Fast and effective robustness certification","venue":null,"work_id":"451fa12c-cb20-4aba-9290-bf8313e3a5f2","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:53.927883Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:161fc2e874ab90c7798b1dada474c28b9adebf6ef3573bfb3f88f122dcd157bb","observation_id":"dd22fe39-88d8-4602-a32c-ed96a3bbf958","resolution":{"observed_at":"2026-08-07T06:07:58.801972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:58.445829Z","title":"An abstract domain for certifying neural networks","venue":null,"work_id":"77365e8e-fc09-4c6c-b1c8-430d4dee6440","year":2019},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.028222Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:5e22b571bcfc8efdc82f1526927c4c9677a82dd59c501d0ceac0daff6b29b7a2","observation_id":"429adb3d-0162-46f6-8c43-eb2ce9e5ab8e","resolution":{"observed_at":"2026-08-07T06:07:58.528372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:58.207231Z","title":"and Feizi, S","venue":null,"work_id":"23907de3-57fa-4cbc-8643-b52b3eb43141","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.096883Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a882218aafeb4bd821390ca3f33015d6b12338621b7c77957a105dd21bd0fb76","observation_id":"3020b2b8-3546-4637-a183-7a56134f6d80","resolution":{"observed_at":"2026-08-07T06:07:58.326541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:57.989511Z","title":"Intriguing properties of neural networks","venue":null,"work_id":"12a0c28f-a042-4972-b0f2-d205fe5bfade","year":2014},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.201490Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:39793697ddad28d5b163abcca6b2734ea08a862e8d75f284a4eed753ee52d205","observation_id":"fb68791c-1c18-4e5f-886f-0d982437dc6e","resolution":{"observed_at":"2026-08-07T06:07:58.091096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:57.727189Z","title":"and Kolter, J","venue":null,"work_id":"f90c6fb5-b961-41ac-8785-ee27b7846243","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.244337Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:e59e72d816a51a6c7184b96753c8affc946dc784d33b0eec97371522a91764b1","observation_id":"8ff0d09a-ab59-4865-80cb-bb0c68063fca","resolution":{"observed_at":"2026-08-07T06:07:57.871102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:57.456417Z","title":"and Andersen, M","venue":null,"work_id":"94a6636a-cb17-46b9-b467-703da3ad8d1b","year":2015},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.351019Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a98c09f88d2188a6acf968907067032b454b63db1f0cd4a5f5f435c941def066","observation_id":"0c1441d8-d86e-48d4-9121-4f6abdfc51e1","resolution":{"observed_at":"2026-08-07T06:07:57.606367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:57.248212Z","title":"Efficient formal safety analysis of neural networks","venue":null,"work_id":"adc2f337-65ff-40d4-a75c-a260a2ba7881","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.461835Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:4f69bcda845f178bd95dc90954b6b7c849ef5eb70996d3bd724da9f8cfe93be9","observation_id":"1e8ca4fa-45a6-495c-b8b1-b198ce95608f","resolution":{"observed_at":"2026-08-07T06:07:57.384198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:57.016456Z","title":null,"venue":null,"work_id":"e513a181-b027-49e1-8fdd-85f029f1429f","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.573521Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:ab38d9b660508ab4fad7eea48ce23b37f4245cfa5144e055f1785615f701dfac","observation_id":"ac82e60c-4d8b-4187-9aeb-ad53755b0c72","resolution":{"observed_at":"2026-08-07T06:07:57.104810Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:56.791018Z","title":"and Kolter, J","venue":null,"work_id":"21c6dd75-dcec-45e4-9b71-a32642e09609","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.645081Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:83e4ee2e7dff4507f05f48b449d1e569118b38b678c01bbe580b2a349c52874d","observation_id":"de8aeeb8-e56b-4e84-9004-bb79380924bd","resolution":{"observed_at":"2026-08-07T06:07:56.905121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:56.514236Z","title":"and Kolter, Z","venue":null,"work_id":"71411216-1c22-483f-abde-fd034ed9b39d","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.726727Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:a970ccbeae2666d2d476c3bc0fc8be7f828709f0208fb240b87058e5913ce526","observation_id":"4fee725e-f871-41ea-b6f1-3d6091be07c6","resolution":{"observed_at":"2026-08-07T06:07:56.652191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:56.310787Z","title":"Automatic perturbation analysis for scalable certified robustness and beyond","venue":null,"work_id":"6104beeb-0f2c-4a5c-b60f-2108f3a4dbe0","year":2020},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.801792Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:2d57b416157a2f7ef82eae1687773c3ca3cfff2086c8beded1cc9d49f8b801f0","observation_id":"5b928d0f-9812-4194-a6f7-02edb5fb475d","resolution":{"observed_at":"2026-08-07T06:07:56.366618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:56.204701Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":null,"work_id":"a01e064d-869e-4c6d-83d1-f4088f357049","year":2021},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.873576Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:43393a1afa4e28f86801e7b25861170939b643f92e6e084a8f2aefa5bd802865","observation_id":"b3a796ae-5c76-4d7e-9c48-86ec7b0e1541","resolution":{"observed_at":"2026-08-07T06:07:56.279828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:56.066277Z","title":"Lot: Layer-wise orthogonal training on improving l2 certified robustness","venue":null,"work_id":"47857101-1002-41d7-ab6a-2b6393d11e21","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:54.948136Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:92c8c0e5eccdc73cc473a69c401a7116e1a96eb381f2e8d181a958c3cd1851c9","observation_id":"fdbf56fc-adfd-47ca-859b-e60d08388e2e","resolution":{"observed_at":"2026-08-07T06:07:56.134215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:55.914912Z","title":"Efficient neural network robustness certification with general activation functions","venue":null,"work_id":"2298f6d5-7758-439d-9606-4ee0e5114768","year":2018},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:55.021315Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:d0f12043b764e5fcd144a175c99e07a4b3ed48fba6728555156d3dca1839cee1","observation_id":"004855d0-976e-40ad-9b1b-98192bc2466b","resolution":{"observed_at":"2026-08-07T06:07:55.991616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:55.789904Z","title":null,"venue":null,"work_id":"d321d21b-3bac-480a-b519-731d119bfc4b","year":2022},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:55.098272Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:ec53784f0713dd80fd176883c8e309209e9b9adaef4286a9a43be0f066841cce","observation_id":"cd000843-0169-469f-8bbc-861458add8e7","resolution":{"observed_at":"2026-08-07T06:07:55.861259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:55.633490Z","title":"A., and Zhang, H","venue":null,"work_id":"9a95e396-dbf4-4696-8791-417c133a6a18","year":2024},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:55.175034Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:b68055fa1d2c116a6725c72a14c0377326809b3b4f53328969a0ae9c4e2965f8","observation_id":"db61a969-f448-459b-ba6c-d8fd12e8f3ba","resolution":{"observed_at":"2026-08-07T06:07:55.702860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:07:55.251567Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:55.251567Z"},"links":{"citing_paper":"/paper/2506.06665"},"observation_digest":"sha256:3992d538f19e441c44a0f5e71cc8e7e03c774db7e57f08f65c8dba3479249e8e","observation_id":"869a7585-0a2e-4c18-b443-86dd60896ea4","resolution":{"observed_at":"2026-08-07T06:07:55.251567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.06665","last_updated":"2025-06-07T05:06:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:50:03.894547Z","submitted_at":"2025-06-07T05:06:07Z","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":45},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2506.06665."}