Pith. sign in

Paper Citation Record · LEDGER

Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2302.06455 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:20:48.043062Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-10T05:30:23.456663Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

1
pith, observed 2026-08-10T05:30:23.456663Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 8cef2f46-8e63-4e12-99b7-8bc2c9a46034 · inbound

MUC-G4: Minimal Unsat Core-Guided Incremental Verification for Deep Neural Network Compression cites this paper.

MUC-G4: Minimal Unsat Core-Guided Incremental Verification for Deep Neural Network Compression Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-07T11:20:48.043062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:20:48.043062Z digest=sha256:d35a66bba3602f1c57eea1406498afb02f5eb1054458d6c1bc04999dc385dd11

Observation 88629b8e-5e92-409b-b6d7-ebbb82056e6e · inbound

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees cites this paper.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Reference 59

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:54:44.401230Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.311927Z digest=sha256:e48b87170f5eac34d2870b3ff3386e19ab98c588ee2155d67b7c02ec14ce3fec