Paper Citation Record · LEDGER

Classifying the complexity of models of arithmetic

As of 7 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2507.12025.

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

pith.paper-citation-record.v1
2507.12025 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:12:08.666238Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

verified exact3
verified fuzzy7
unresolved5
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e75600d0-080e-4a39-bb5a-aca9121e38ad · outbound

This paper cites an unresolved cited work.

Classifying the complexity of models of arithmetic Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:12:10.804855Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation bd9439b3-c570-4210-b85f-b385a19c9611 · outbound

This paper cites Scott complexity of countable structures.

Classifying the complexity of models of arithmetic Scott complexity of countable structures

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T17:12:07.579787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97263114-c090-4d23-9c3b-99b7d5ecb985 · outbound

This paper cites Admissible Sets and Structures.

Classifying the complexity of models of arithmetic Admissible Sets and Structures

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:10.620003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fef84760-18f0-4f9b-84cc-27f39e7adb30 · outbound

This paper cites Models and Types of Peano’s Arithmetic.

Classifying the complexity of models of arithmetic Models and Types of Peano’s Arithmetic

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:10.435249Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation eae83e92-273a-46e6-a51d-319daec9ad6d · outbound

This paper cites Scott analysis, linear orders and almost periodic functions.

Classifying the complexity of models of arithmetic Scott analysis, linear orders and almost periodic functions

Reference 5

Resolution: verified exact; doi, observed 2026-08-06T17:12:09.242825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 849c5a5b-2aef-4f7d-ad0e-7c9cf1d25b07 · outbound

This paper cites Theω-Vaught’s conjecture.

Classifying the complexity of models of arithmetic Theω-Vaught’s conjecture

Reference 6

Resolution: malformed identifier; no resolver link, observed 2026-08-06T17:12:07.844530Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d65e05c-77c4-476c-9a05-022cd352a73d · outbound

This paper cites Scott Sentence Complexities of Linear Orderings.

Classifying the complexity of models of arithmetic Scott Sentence Complexities of Linear Orderings

Reference 7

Resolution: verified exact; doi, observed 2026-08-06T17:12:09.050006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6079e56d-7256-4fda-9134-c8274a8762c1 · outbound

This paper cites Borel functors and infinitary interpretations.

Classifying the complexity of models of arithmetic Borel functors and infinitary interpretations

Reference 8

Resolution: verified exact; doi, observed 2026-08-06T17:12:08.853165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 56efa1de-e5ff-4790-ade4-283f286dfef2 · outbound

This paper cites Finite-quantifier equivalence.

Classifying the complexity of models of arithmetic Finite-quantifier equivalence

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:10.258671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8d5a6637-5087-49c6-b201-69724b813f08 · outbound

This paper cites an unresolved cited work.

Classifying the complexity of models of arithmetic Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-06T17:12:08.213626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41b7b309-2757-4fa5-a224-dd2f6e39b4bf · outbound

This paper cites A robuster Scott rank.

Classifying the complexity of models of arithmetic A robuster Scott rank

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-06T17:12:08.281703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a34fcbd2-3e6f-4eb0-bb47-ef5bd3afeedb · outbound

This paper cites Computable structure theory: Beyond the arithmetic.

Classifying the complexity of models of arithmetic Computable structure theory: Beyond the arithmetic

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:10.081742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5ba0bb21-d670-473f-a7a8-38e207076b2e · outbound

This paper cites Computable Structure Theory: Within the Arithmetic.

Classifying the complexity of models of arithmetic Computable Structure Theory: Within the Arithmetic

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-06T17:12:08.428093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19a90702-760d-459d-8955-9329b1cbd01d · outbound

This paper cites The structural complexity of models of arith- metic.

Classifying the complexity of models of arithmetic The structural complexity of models of arith- metic

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:09.915736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f0aa14de-e8bf-4cec-bce9-7c0da38bbd6f · outbound

This paper cites Logic with denumerably long formulas and finite strings of quantifiers.

Classifying the complexity of models of arithmetic Logic with denumerably long formulas and finite strings of quantifiers

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:09.705481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation adff03c1-da60-468b-85c1-e88116c92202 · outbound

This paper cites RecursivelySaturatedNonstandardModelsofArithmetic.

Classifying the complexity of models of arithmetic RecursivelySaturatedNonstandardModelsofArithmetic

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:12:09.536668Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.