{"as_of":"2026-08-10T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b1a596ac40d0ce59352d77cd81aa2130047cb1758d471484614658cebe18d9f7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:20:48.043062Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.06455","last_updated":"2023-02-10T04:31:28Z","snapshot_observed_at":"2026-07-06T14:51:19.104522Z","submitted_at":"2023-02-10T04:31:28Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06455","snapshot_observed_at":"2026-08-07T11:20:48.043062Z","title":"CoRR abs/2302.06455 (2023) Title Suppressed Due to Excessive Length 21","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04268","last_updated":"2025-06-03T12:42:15Z","snapshot_observed_at":"2026-08-09T02:50:05.500453Z","submitted_at":"2025-06-03T12:42:15Z","title":"MUC-G4: Minimal Unsat Core-Guided Incremental Verification for Deep Neural Network Compression","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:20:48.043062Z"},"links":{"cited_paper":"/paper/2302.06455","citing_paper":"/paper/2506.04268"},"observation_digest":"sha256:d35a66bba3602f1c57eea1406498afb02f5eb1054458d6c1bc04999dc385dd11","observation_id":"8cef2f46-8e63-4e12-99b7-8bc2c9a46034","resolution":{"observed_at":"2026-08-07T11:20:48.043062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06455","last_updated":"2023-02-10T04:31:28Z","snapshot_observed_at":"2026-07-06T14:51:19.104522Z","submitted_at":"2023-02-10T04:31:28Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks","version":1},"cited_work":{"arxiv_id":"2302.06455","doi":"10.48550/arxiv.2302.06455","metadata_source":"pith","pith_arxiv_id":"2302.06455","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks","venue":"cs.AI","work_id":"013d67bd-8f88-4780-ba77-51de41dcdd09","year":2023},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-10T05:39:38.023239Z","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":59,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.311927Z"},"links":{"cited_paper":"/paper/2302.06455","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:e48b87170f5eac34d2870b3ff3386e19ab98c588ee2155d67b7c02ec14ce3fec","observation_id":"88629b8e-5e92-409b-b6d7-ebbb82056e6e","resolution":{"observed_at":"2026-08-06T14:54:44.401230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.06455/citation-record","integrity":"/paper/2302.06455/integrity","json":"/paper/2302.06455/citation-record.json","paper":"/paper/2302.06455"},"outbound":[],"paper":{"arxiv_id":"2302.06455","last_updated":"2023-02-10T04:31:28Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T14:51:19.104522Z","submitted_at":"2023-02-10T04:31:28Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2302.06455."}