{"as_of":"2026-08-09T15:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b97ef44b7df8698c9f127847657d98339d8874960836b38f1f0e185fde4627f8","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:54:44.156711Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T10:07:55.786931Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","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-06T14:54:44.156711Z","title":"Improved branch and bound for neural network verification via lagrangian decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.156711Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:dcf1c64baaaecd96f1052a171afc02b421707c30935355a366bade53fd646bf6","observation_id":"024baced-ad56-48f9-aaf9-e4d28adf75fe","resolution":{"observed_at":"2026-08-06T14:54:44.156711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","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-06T11:04:59.538322Z","title":"Improved branch and bound for neural network verification via lagrangian decomposition.arXiv preprint arXiv:2104.06718, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.23197","last_updated":"2025-07-31T02:43:57Z","snapshot_observed_at":"2026-08-07T21:16:00.646593Z","submitted_at":"2025-07-31T02:43:57Z","title":"Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:04:59.538322Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2507.23197"},"observation_digest":"sha256:1e121f92bba14f9ede32f213be2f680c45f86114924f6392d9dfd2bec2425bac","observation_id":"c919df03-248c-48e4-accb-55d306fe93ee","resolution":{"observed_at":"2026-08-06T11:04:59.538322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","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":"2104.06718","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.06718","snapshot_observed_at":"2026-07-03T10:07:55.786931Z","title":"Improved branch and bound for neural network verification via lagrangian decomposition,","venue":null,"work_id":"1f49487d-3f51-4eb4-af0e-ea024934f99a","year":2021},"citing_paper":{"arxiv_id":"2512.00164","last_updated":"2026-05-08T11:21:01Z","snapshot_observed_at":"2026-07-06T22:37:16.933664Z","submitted_at":"2025-11-28T19:05:39Z","title":"Faster Verified Explanations for Neural Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T03:31:10.191431Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2512.00164"},"observation_digest":"sha256:72ecff823f4f6e5564c7bb2c03c9250977ec6c77cf84aefc6267c5d7c176d8cc","observation_id":"d504316d-5301-4c71-8023-7be006c713b6","resolution":{"observed_at":"2026-05-17T03:31:28.444342Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T10:59:29.035923Z","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-02T19:17:08.510534Z","title":"arXiv preprint arXiv:2104.06718 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.03043","last_updated":"2026-07-20T13:07:52Z","snapshot_observed_at":"2026-08-06T03:32:29.981336Z","submitted_at":"2026-03-03T14:36:46Z","title":"IoUCert: Robustness Verification for Anchor-based Object Detectors","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T19:17:08.510534Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2603.03043"},"observation_digest":"sha256:475f085a372465638d74d40b4fdae32fa00cac1b0077f6b395e922273b49f8a6","observation_id":"b7cfa4bf-4616-4454-93c9-0f2c2f34b5db","resolution":{"observed_at":"2026-08-02T19:17:08.510534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","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":"2104.06718","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.06718","snapshot_observed_at":"2026-07-03T10:07:55.786931Z","title":"Improved branch and bound for neural network verification via lagrangian decomposition,","venue":null,"work_id":"1f49487d-3f51-4eb4-af0e-ea024934f99a","year":2021},"citing_paper":{"arxiv_id":"2606.12490","last_updated":"2026-06-10T11:30:37Z","snapshot_observed_at":"2026-08-02T18:32:03.971235Z","submitted_at":"2026-06-10T11:30:37Z","title":"Robustness Verification of Recurrent Neural Networks with Abstraction Refinement","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T10:16:46.361017Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2606.12490"},"observation_digest":"sha256:bc64e97d7cc53d0ba5cb88690e847efe6f2f0a30aad5b3617c11d196c52e3576","observation_id":"4ff28550-66a6-4a22-b8cf-eb5e525b07df","resolution":{"observed_at":"2026-07-03T10:07:55.788358Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T10:59:29.035923Z","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-01T15:48:08.923988Z","title":"De Palma, R","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18195","last_updated":"2026-07-20T17:36:05Z","snapshot_observed_at":"2026-08-08T08:49:08.389127Z","submitted_at":"2026-07-20T17:36:05Z","title":"Certified Training for Convolutional Perturbations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T15:48:08.923988Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2607.18195"},"observation_digest":"sha256:863a13432835d50d5a2b7331e77115289b952d334c2ec517f953e697e29e425c","observation_id":"258d3cb9-e43d-42ad-a4c8-7e870b446953","resolution":{"observed_at":"2026-08-01T15:48:08.923988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","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-03T16:43:38.046439Z","title":"arXiv preprint arXiv:2104.06718 (2021).https://doi","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28954","last_updated":"2026-07-31T02:16:55Z","snapshot_observed_at":"2026-08-08T14:30:29.744593Z","submitted_at":"2026-07-31T02:16:55Z","title":"Mining Verdict Boundaries for Neural Network Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T16:43:38.046439Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2607.28954"},"observation_digest":"sha256:ab35ce5be7a90f11e39622201ecbb68c2ceaced3e2fb4977d10c8a3b100c24d6","observation_id":"48e319a8-17b7-4dfb-89ed-5746860dac22","resolution":{"observed_at":"2026-08-03T16:43:38.046439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.06718/citation-record","integrity":"/paper/2104.06718/integrity","json":"/paper/2104.06718/citation-record.json","paper":"/paper/2104.06718"},"outbound":[],"paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","submitted_at":"2021-04-14T09:22:42Z","title":"Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2104.06718."}