{"as_of":"2026-08-08T17:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f6158cfdd43839e402e464f2b914bc864e3865afcd0fd99f737cf89674b04d09","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:09:06.756849Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":60,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-07T11:09:06.756849Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers.arXiv preprint arXiv:2011.13824, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.756849Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:5b9f0e68f72f52f4b09905d96558a4ce82a81e210135fff66b342ef74a1345b5","observation_id":"2767abf3-9192-4cef-a3f2-d5180c25c90d","resolution":{"observed_at":"2026-08-07T11:09:06.756849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-06T17:43:23.040910Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.10635","last_updated":"2025-07-14T12:28:32Z","snapshot_observed_at":"2026-08-07T06:15:08.489906Z","submitted_at":"2025-07-14T12:28:32Z","title":"Formal Verification of Variational Quantum Circuits","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:23.040910Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2507.10635"},"observation_digest":"sha256:c4ad5bd956d57f327179c276e515a198f3c8343c344c5c07e9c02630553a61f9","observation_id":"ae1d90d7-9770-4730-a2af-b1ac1909edcd","resolution":{"observed_at":"2026-08-06T17:43:23.040910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-03T08:39:45.848507Z","title":null,"venue":null,"work_id":null,"year":2020},"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":177,"source":"pdf_text","source_observed_at":"2026-08-03T08:39:45.848507Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2601.16510"},"observation_digest":"sha256:0fc51b7b26c1c442b999ff2db481aebc7e383635b84fb36c2ca988ba934d2618","observation_id":"12978dff-ecb1-4a67-8347-79233638af96","resolution":{"observed_at":"2026-08-03T08:39:45.848507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2604.23474","last_updated":"2026-04-25T23:54:41Z","snapshot_observed_at":"2026-07-06T23:09:43.659053Z","submitted_at":"2026-04-25T23:54:41Z","title":"GeoCert: Certified Geometric AI for Reliable Forecasting","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T08:15:10.739078Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2604.23474"},"observation_digest":"sha256:122cc3bc533c1c55b243435d0571c4bd175e6f4f5fc7ec3184a02bff1758699f","observation_id":"2ca7604c-5be6-4b21-a691-d2f8cdb5c51c","resolution":{"observed_at":"2026-05-11T20:41:13.924127Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2605.10621","last_updated":"2026-05-11T14:16:13Z","snapshot_observed_at":"2026-07-06T23:22:32.858399Z","submitted_at":"2026-05-11T14:16:13Z","title":"Hierarchical End-to-End Taylor Bounds for Complete Neural Network Verification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-12T04:46:50.715051Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2605.10621"},"observation_digest":"sha256:4e526b0668c0aa1b38d6658036e8d707426ae63df0946897f8d5f4885f458ab6","observation_id":"55f45111-59c0-4ed5-8464-1b91f1f97119","resolution":{"observed_at":"2026-05-12T05:56:26.877290Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2605.13845","last_updated":"2026-05-14T17:00:29Z","snapshot_observed_at":"2026-07-06T23:25:21.032938Z","submitted_at":"2026-05-13T17:59:40Z","title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","version":1},"reference_index":130,"source":"arxiv_source","source_observed_at":"2026-05-14T17:29:39.346689Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2605.13845"},"observation_digest":"sha256:fd1d58ab42e18e9bf4c565df43e371ac3b51bf2fe57e1ff61436cc5134340018","observation_id":"df594802-bcf5-496d-9e7f-c805a21033e7","resolution":{"observed_at":"2026-05-14T17:32:30.581466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2605.13845","last_updated":"2026-05-14T17:00:29Z","snapshot_observed_at":"2026-07-06T23:25:21.032938Z","submitted_at":"2026-05-13T17:59:40Z","title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","version":2},"reference_index":130,"source":"arxiv_source","source_observed_at":"2026-05-15T05:40:16.030363Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2605.13845"},"observation_digest":"sha256:dc6c15b4895faa222c800d07eb0b8b7e1f9f02423c7a67ad17c103ebe860db2c","observation_id":"d9485b93-b743-4a4d-8e6c-1e8616f9a5fe","resolution":{"observed_at":"2026-05-15T05:45:05.048925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2605.17153","last_updated":"2026-05-16T20:56:52Z","snapshot_observed_at":"2026-07-06T23:28:12.114488Z","submitted_at":"2026-05-16T20:56:52Z","title":"Stress-Testing Neural Network Verifiers with Provably Robust Instances","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-20T14:48:54.688641Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2605.17153"},"observation_digest":"sha256:2f230bc812dda4434892c1c3dab85d91ad30f277c0f7721f774d628361f90e28","observation_id":"13a55bfe-f73a-4b0d-bc18-d92ace8861ba","resolution":{"observed_at":"2026-05-20T14:53:23.488250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2605.30155","last_updated":"2026-06-02T17:20:50Z","snapshot_observed_at":"2026-07-06T23:39:29.458653Z","submitted_at":"2026-05-28T16:15:13Z","title":"Neural Network Verification using Partial Multi-Neuron Relaxation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T00:00:52.891222Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2605.30155"},"observation_digest":"sha256:507aebd4a577551068801780b239e333891e4524c05ede3631ae5c65afa831dc","observation_id":"423706a3-21c0-46bd-a359-aeeae437162b","resolution":{"observed_at":"2026-06-29T00:02:49.696269Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":"2011.13824","doi":"10.48550/arxiv.2011.13824","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":"arXiv (Cornell University)","work_id":"b4078de3-9ab8-4e6e-bb28-b13437e218f6","year":2020},"citing_paper":{"arxiv_id":"2606.25239","last_updated":"2026-06-23T23:56:21Z","snapshot_observed_at":"2026-07-06T23:59:42.289674Z","submitted_at":"2026-06-23T23:56:21Z","title":"Tensor-Based Batch Fuzzing with Adaptive Perturbation Scaling for Deep Neural Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-25T22:32:53.911412Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2606.25239"},"observation_digest":"sha256:e6f04fe82d967ebf345adb15e2df9b87f77ea74567e292f0dd35101ce9b7574f","observation_id":"f8c872d7-2ad1-46b9-b9e6-8a5246b58005","resolution":{"observed_at":"2026-06-25T22:38:32.943515Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.13824/citation-record","integrity":"/paper/2011.13824/integrity","json":"/paper/2011.13824/citation-record.json","paper":"/paper/2011.13824"},"outbound":[],"paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2011.13824."}