Paper Citation Record · LEDGER

On the Complexity of Computing Outputs of a Metric Turing Machine

As of 15 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2608.00283.

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

pith.paper-citation-record.v1
2608.00283 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T01:06:40.830700Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+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

14 of 14 outbound references displayed

verified exact0
verified fuzzy0
unresolved14
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a005455e-ca26-4017-b96a-39449a19c267 · outbound

This paper cites SIAM Journal on Computing13(3), 461–487 (1984).

On the Complexity of Computing Outputs of a Metric Turing Machine SIAM Journal on Computing13(3), 461–487 (1984)

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:39.969996Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d324b39-cf95-48a5-8094-3e73e7af06ce · outbound

This paper cites Journal of Computer and System Sciences30(3), 395–413 (1985).

On the Complexity of Computing Outputs of a Metric Turing Machine Journal of Computer and System Sciences30(3), 395–413 (1985)

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.025413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11868479-92fd-44b1-ab06-dd22af27a029 · outbound

This paper cites Journal of Computer and System Sciences48(1), 116–148 (1994).

On the Complexity of Computing Outputs of a Metric Turing Machine Journal of Computer and System Sciences48(1), 116–148 (1994)

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.121728Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80fca671-6dd7-4807-a56f-fa705362038c · outbound

This paper cites Dok- lady Rossiiskoi akademii nauk.

On the Complexity of Computing Outputs of a Metric Turing Machine Dok- lady Rossiiskoi akademii nauk

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.179240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48b7a605-6928-4f65-9d63-5324afa83fac · outbound

This paper cites Acta Infor- matica26(4), 363–379 (1989).

On the Complexity of Computing Outputs of a Metric Turing Machine Acta Infor- matica26(4), 363–379 (1989)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.222476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e77326ef-311a-4daa-bb39-e8bcad2b6d00 · outbound

This paper cites Journal of Computer and System Sciences36(3), 490–509 (1988).

On the Complexity of Computing Outputs of a Metric Turing Machine Journal of Computer and System Sciences36(3), 490–509 (1988)

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.274357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60b4ada2-0066-412f-a941-4ba9fbc713dc · outbound

This paper cites an unresolved cited work.

On the Complexity of Computing Outputs of a Metric Turing Machine Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.346382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7eb30f6a-ed19-4877-b73f-b67f099063bf · outbound

This paper cites Journal of Computer and System Sciences48(2), 357–381 (1994).

On the Complexity of Computing Outputs of a Metric Turing Machine Journal of Computer and System Sciences48(2), 357–381 (1994)

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.425386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4454be8d-a037-494c-9967-cb5f1f2777f7 · outbound

This paper cites Journal of Computer and System Sciences49(1), 1–17 (1994).

On the Complexity of Computing Outputs of a Metric Turing Machine Journal of Computer and System Sciences49(1), 1–17 (1994)

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.499287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e188d3a0-220f-49ca-a9b8-ddf525df0123 · outbound

This paper cites Theoretical Computer Science100(1), 205–221 (1992).

On the Complexity of Computing Outputs of a Metric Turing Machine Theoretical Computer Science100(1), 205–221 (1992)

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.553802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a842167-f171-443b-a882-bbd50b77601c · outbound

This paper cites Theoretical computer science8(2), 189–201 (1979).

On the Complexity of Computing Outputs of a Metric Turing Machine Theoretical computer science8(2), 189–201 (1979)

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.611517Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c72ea2fb-a434-44dd-bd81-7e4039855bc2 · outbound

This paper cites In: Annual Sym- posium on Theoretical Aspects of Computer Science.

On the Complexity of Computing Outputs of a Metric Turing Machine In: Annual Sym- posium on Theoretical Aspects of Computer Science

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.680956Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 810cf63a-fc16-4a19-9cfd-06eea9c5b96a · outbound

This paper cites Interna- tional Journal of Foundations of Computer Science4(04), 293–307 (1993).

On the Complexity of Computing Outputs of a Metric Turing Machine Interna- tional Journal of Foundations of Computer Science4(04), 293–307 (1993)

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.743042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edcc3f5a-1f23-4762-bfa8-a7086c408529 · outbound

This paper cites Univ., Inst.

On the Complexity of Computing Outputs of a Metric Turing Machine Univ., Inst

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T01:06:40.830700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.