Pith. sign in

Paper Citation Record · LEDGER

More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2204.01623.

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

pith.paper-citation-record.v1
2204.01623 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-21T06:32:19.484+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-04T06:16:36.775219Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-06-28T19:32:35.361989Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 3b10c523-aab1-4de3-b5d2-5dfcc361f104 · inbound

Simple generators of rational function fields cites this paper.

Simple generators of rational function fields More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-04T06:16:36.775219Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:16:36.775219Z digest=sha256:c3d0bd246dad68dcfa7dba884a9919f07cd488892882e0aab4d958e9825ac81e

Observation beb80e55-cc0f-43da-9d7f-6b51988a1f7a · inbound

Verifying global identifiability of parametric linear ODE models is NP-hard cites this paper.

Verifying global identifiability of parametric linear ODE models is NP-hard More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability

Reference 13

Resolution
verified exact
arxiv_id, observed 2026-06-28T19:32:35.363472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-06-28T19:03:03.415167Z digest=sha256:3e8fdc23cc6cf6cd5b805926f0771ec83bd7afdad40e99e5fc2256a2ca88402e