Pith. sign in

Paper Citation Record · LEDGER

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms

As of 18 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2504.19852.

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

pith.paper-citation-record.v1
2504.19852 v2

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:49:10.431274Z

measured 20 of 20 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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

20 of 20 outbound references displayed

  • verified exact4
  • verified fuzzy7
  • unresolved9
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b8445e19-877d-40fe-bcc2-2d83ec6974b8 · outbound

This paper cites Addison-Wesley, 2nd edn.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Addison-Wesley, 2nd edn

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.984526Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.323133Z digest=sha256:abc79e397988da292b79c59a1bb598e6c37dd9df543ea53d6144a95ef658025b

Observation 610452ee-ce51-4739-8c55-da7fdbf6a8f4 · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 2

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:49:10.964490Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.330053Z digest=sha256:d3a197ecf0d29c47eba398c6a0a019fd972b37c3ec8f38301a3181cc656b80ca

Observation cb23c5f8-ef27-4f57-9555-b304b346b230 · outbound

This paper cites Electronic Proceedings in Theoretical Computer S cience 400, 79–95 (04 2024).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Electronic Proceedings in Theoretical Computer S cience 400, 79–95 (04 2024)

Reference 3

Resolution
verified exact
doi, observed 2026-08-16T05:49:10.569152Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.335853Z digest=sha256:4fa3930f6a96ea88078b6b835c84847e92376b24dcb07ef19da852bf0684b2bb

Observation 64de3d89-4492-40af-823a-45bdc2b02537 · outbound

This paper cites The MIT Press, 3rd edn.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms The MIT Press, 3rd edn

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.943995Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.342487Z digest=sha256:1daed23ab2095af40dd26b8d19760b19881df3c5e2fce6b280162569f614c218

Observation 863e23b2-2cbb-4b27-9654-541ebd3fbf6e · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.350348Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.350348Z digest=sha256:66b2f181e572b77337fa873e393ea45906cebe592faca5e4f13870724ff0ac3b

Observation 7540b7a5-782e-4a6d-ab4c-ad45e130a5e5 · outbound

This paper cites Journal of Functional Programming 28, e20 (2018).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Journal of Functional Programming 28, e20 (2018)

Reference 6

Resolution
verified exact
doi, observed 2026-08-16T05:49:10.552170Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.357721Z digest=sha256:6b5041901de8a1d32b664ae5ef5e9c4db9cfeaf8a5affe9c4af3bd496a7b553a

Observation 2b41a2fb-ca3c-4684-95c9-d8871f54b6c5 · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:49:10.921112Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.364312Z digest=sha256:bb029192de45e12a4a01410e8ceb9e6ab654fd80a79c8d9716c8ee805ac10655

Observation 6ec117e5-180f-4331-9215-c471f7c7bf38 · outbound

This paper cites Archive of F ormal Proofs (Jan- uary 2012), https://isa-afp.org/entries/Refine_Monadic.html, Formal proof development.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Archive of F ormal Proofs (Jan- uary 2012), https://isa-afp.org/entries/Refine_Monadic.html, Formal proof development

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.902611Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.370712Z digest=sha256:7fda82f369eb8e33c13dcc37e2ddb7a61baecb5fdfbd8fae06686be4394761dc

Observation 4f3154f6-c634-4d7e-97a1-c9b309af263c · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.378609Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.378609Z digest=sha256:48f1f2c5427a6c97ec4a52ee8023c546628b030af11e5bdcc4dfcdecae36b1f0

Observation ed8e4cc6-503e-4e93-8f34-1dc22fbc983d · outbound

This paper cites Informati on and Computation 93(1), 55–92 (1991).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Informati on and Computation 93(1), 55–92 (1991)

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.383979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.383979Z digest=sha256:bc066e6f4a6de42b2e7299090ac3600b96b288ebb4a1966fb06873bb3b7d4cea

Observation 6d545cc0-fede-499c-ab41-0ec1f0482f42 · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.388453Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.388453Z digest=sha256:74022e362e7802b03309dec102f88978a19e07e1bbdaefe5cb249de6aab6fd34

Observation b7ae1f4a-916b-402d-a23d-3678601272d9 · outbound

This paper cites In: Cohen, L., Kaliszyk, C.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms In: Cohen, L., Kaliszyk, C

Reference 12

Resolution
verified exact
doi, observed 2026-08-16T05:49:10.502576Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.393457Z digest=sha256:5860bd1836c838d937ca6a64b4e18ff6639de4e89f7bbfff6c934a6b1218764f

Observation 4137c236-6ae3-4aa2-a700-0dad21dbb8d2 · outbound

This paper cites Springer-Verlag, Berlin, Heidelberg (2002).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Springer-Verlag, Berlin, Heidelberg (2002)

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.879316Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.397494Z digest=sha256:7d14e6577e7a67049b112f854d939414774413002d3ed7d6661bfdaeb74c2250

Observation 02f0fbbf-08fa-4af3-ab85-fda1765f2749 · outbound

This paper cites Arch ive of Formal Proofs (November 2023), https://isa-afp.org/entries/KnuthMorrisPratt.html, For- mal proof development.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Arch ive of Formal Proofs (November 2023), https://isa-afp.org/entries/KnuthMorrisPratt.html, For- mal proof development

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.854129Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.402258Z digest=sha256:82e1c15006797549b865b88da4300fd219405e827c7204c357ceb91c840cf2a3

Observation 54be83e1-bcd0-492c-9d1f-decf66019d39 · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:49:10.837034Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.407737Z digest=sha256:6b562de1970833af6bd50e402635b535e8a712eb5bd938be51ed4016805b2585

Observation ac20ae40-5fc7-4016-9dc5-a67566e69d82 · outbound

This paper cites Reducing urban traffic congestion due to localized routing decisions.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Reducing urban traffic congestion due to localized routing decisions

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.411941Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.411941Z digest=sha256:be0152e71e97e87061e638d4b71f20c607d16899fade0c289c324d87099b4d7b

Observation ff95c3bf-a155-4213-a2f5-3513310bb6b9 · outbound

This paper cites https://coq.inria.fr/doc/V8.19.0/refman (2024).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms https://coq.inria.fr/doc/V8.19.0/refman (2024)

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.814728Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.417137Z digest=sha256:530e9fef2f6f0ef1650eedbdc22ab464150abc9b53eba1bbf72b5a4f45107f17

Observation 5a84dbf1-d538-46f3-96c1-133bafd0a653 · outbound

This paper cites an unresolved cited work.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Unresolved cited work

Reference 18

Resolution
verified exact
doi, observed 2026-08-16T05:49:10.487839Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.421295Z digest=sha256:3a83ca735e9d8e675f46141e18f0ba1a565dd358dc3dd361bc4294c28076a70e

Observation 8d75cf04-fab4-41ea-badb-0ff8ed024845 · outbound

This paper cites MIT Press, Cambridge, MA, USA (1993).

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms MIT Press, Cambridge, MA, USA (1993)

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:49:10.790191Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-16T05:49:10.426305Z digest=sha256:1972247647663c99e86167d6c4ad47a68fd4c45915a6aed53c063569de04bf17

Observation 1cc98e22-3e94-4613-8f0d-07e863a2ea01 · outbound

This paper cites Encode the $\forall\exists$ Relational Hoare Logic into Standard Hoare Logic.

A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms Encode the $\forall\exists$ Relational Hoare Logic into Standard Hoare Logic

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-16T05:49:10.431274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:49:10.431274Z digest=sha256:8de533fbdbc1a7c794a8b6cc78f22a41fba6ca04dc7a57d88d19feb68956aeb3

Pith citing papers

No inbound Pith citation observations are available.