Paper Citation Record · LEDGER

Quantifying Sub-Optimality in Routing for Automated Market Makers

As of 10 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2607.20762.

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

pith.paper-citation-record.v1
2607.20762 v1

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T09:32:50.937508Z

measured 12 of 12 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 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

12 of 12 outbound references displayed

verified exact1
verified fuzzy0
unresolved11
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 36aadfe0-0bde-49d3-b584-dbd6cc40fdc6 · outbound

This paper cites In: Proceedings of the 23rd ACM Conference on Economics and Computation (EC ’22).

Quantifying Sub-Optimality in Routing for Automated Market Makers In: Proceedings of the 23rd ACM Conference on Economics and Computation (EC ’22)

Reference 1

Resolution: verified exact; doi, observed 2026-08-01T09:33:17.748356Z

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.

Observation 8434c0f5-b284-42cb-b7c7-c4301185cc74 · outbound

This paper cites Optimal Routing in the Presence of Hooks: Three Case Studies.

Quantifying Sub-Optimality in Routing for Automated Market Makers Optimal Routing in the Presence of Hooks: Three Case Studies

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:49.759802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e21ea53-499e-4ee5-8473-bd1d7a7d5f7b · outbound

This paper cites an unresolved cited work.

Quantifying Sub-Optimality in Routing for Automated Market Makers Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:49.858031Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57b444e0-a4c2-473d-9b76-195d941db27e · outbound

This paper cites an unresolved cited work.

Quantifying Sub-Optimality in Routing for Automated Market Makers Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.011973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f0413c5-4470-478c-b4bb-3ca8713fb63e · outbound

This paper cites In: Proceedings of the 2020 IEEE Sym- posium on Security and Privacy (S&P).

Quantifying Sub-Optimality in Routing for Automated Market Makers In: Proceedings of the 2020 IEEE Sym- posium on Security and Privacy (S&P)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.130550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0792a6f0-6fdb-43b8-bad9-2bf8a87bfad2 · outbound

This paper cites In: International Conference on Financial Cryptography and Data Security.

Quantifying Sub-Optimality in Routing for Automated Market Makers In: International Conference on Financial Cryptography and Data Security

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.208263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8c029fd-7b41-41fb-8e4d-44d2e68e7ea0 · outbound

This paper cites In: International Conference on Web and Internet Economics.

Quantifying Sub-Optimality in Routing for Automated Market Makers In: International Conference on Web and Internet Economics

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.334447Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d392b94c-f279-42cf-a87b-3fd58f4c9c52 · outbound

This paper cites an unresolved cited work.

Quantifying Sub-Optimality in Routing for Automated Market Makers Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.500285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c84a1fb9-0b51-400f-8fbf-c5505648d48a · outbound

This paper cites an unresolved cited work.

Quantifying Sub-Optimality in Routing for Automated Market Makers Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.614466Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 286ad799-caa5-4c5b-822b-9785e80ba99d · outbound

This paper cites an unresolved cited work.

Quantifying Sub-Optimality in Routing for Automated Market Makers Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.721697Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19baafa8-2d32-4e69-9867-1ac79b2100a4 · outbound

This paper cites Hence to achieve |bλ−λ ⋆| ≤ελ it suffices to take k≥ l log2 (λ(0) high −λ (0) low)/ελ m.

Quantifying Sub-Optimality in Routing for Automated Market Makers Hence to achieve |bλ−λ ⋆| ≤ελ it suffices to take k≥ l log2 (λ(0) high −λ (0) low)/ελ m

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.844678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4e7eda3-56ec-455c-9940-f61617725bc7 · outbound

This paper cites Therefore to reach|S( bλ)−Q| ≤ εS it suffices that k≥ l log2 L(λ (0) high −λ (0) low)/εS m.

Quantifying Sub-Optimality in Routing for Automated Market Makers Therefore to reach|S( bλ)−Q| ≤ εS it suffices that k≥ l log2 L(λ (0) high −λ (0) low)/εS m

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T09:32:50.937508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.