{"as_of":"2026-08-10T07:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c2d7130d8ff1c4f482b93ef1b3843f53c71ee84794ef24b4521c3f08efe6d72","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:32:50.937508Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20762/citation-record","integrity":"/paper/2607.20762/integrity","json":"/paper/2607.20762/citation-record.json","paper":"/paper/2607.20762"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3490486","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Proceedings of the 23rd ACM Conference on Economics and Computation (EC ’22)","venue":null,"work_id":"05155aa0-db83-4baf-bfae-92912d9347a3","year":2022},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:49.716061Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:32135cf441724912dcbcc70eb6822ca9c60b21341c3832698ef6185f15a515a8","observation_id":"36aadfe0-0bde-49d3-b584-dbd6cc40fdc6","resolution":{"observed_at":"2026-08-01T09:33:17.748356Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02059","last_updated":"2025-02-04T06:58:16Z","snapshot_observed_at":"2026-08-09T13:28:11.103273Z","submitted_at":"2025-02-04T06:58:16Z","title":"Optimal Routing in the Presence of Hooks: Three Case Studies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02059","snapshot_observed_at":"2026-08-01T09:32:49.759802Z","title":"arXiv preprint (2025),https://arxiv.org/abs/2502.02059","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:49.759802Z"},"links":{"cited_paper":"/paper/2502.02059","citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:489d82b7b7b70a51efeebe89b49ee95703a1eec3aa745c51c43ff934de16f656","observation_id":"8434c0f5-b284-42cb-b7c7-c4301185cc74","resolution":{"observed_at":"2026-08-01T09:32:49.759802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:49.858031Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:49.858031Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:8b1693b970e454c74bbd6939574dc008aa38310576e6cdd76c81115f7cd5715f","observation_id":"9e21ea53-499e-4ee5-8473-bd1d7a7d5f7b","resolution":{"observed_at":"2026-08-01T09:32:49.858031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.011973Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.011973Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:7da982a012e3d41175fd3e91fd469e8e4af108ea981aa29b1e98f397d2078649","observation_id":"57b444e0-a4c2-473d-9b76-195d941db27e","resolution":{"observed_at":"2026-08-01T09:32:50.011973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.130550Z","title":"In: Proceedings of the 2020 IEEE Sym- posium on Security and Privacy (S&P)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.130550Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:18d0f36a9114e9b5ba0bca6340dae60a696567f35158f1662af1f062ed081383","observation_id":"9f0413c5-4470-478c-b4bb-3ca8713fb63e","resolution":{"observed_at":"2026-08-01T09:32:50.130550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.208263Z","title":"In: International Conference on Financial Cryptography and Data Security","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.208263Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:a69353386b8ced59063d7a09155b43ce59d8ea07a3208a140cade18f768bd491","observation_id":"0792a6f0-6fdb-43b8-bad9-2bf8a87bfad2","resolution":{"observed_at":"2026-08-01T09:32:50.208263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.334447Z","title":"In: International Conference on Web and Internet Economics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.334447Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:a4b92b27307c1f45ba11e2d0d3aa63dd9ab8662092e31cbca7fab1d8384c8366","observation_id":"d8c029fd-7b41-41fb-8e4d-44d2e68e7ea0","resolution":{"observed_at":"2026-08-01T09:32:50.334447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.500285Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.500285Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:b859504ebe49590dfabb99c934273b71d99fe0625b91dff2d82a2abbef9cbdb5","observation_id":"d392b94c-f279-42cf-a87b-3fd58f4c9c52","resolution":{"observed_at":"2026-08-01T09:32:50.500285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.614466Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.614466Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:06a1e36f0d512a774e130f49dcbedf9c9774eb6acfc1b54511c50406c8e485cb","observation_id":"c84a1fb9-0b51-400f-8fbf-c5505648d48a","resolution":{"observed_at":"2026-08-01T09:32:50.614466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.721697Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.721697Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:09594b01a9235a1d6cab9ac6f97fb8901f7fb26b14235efded82526a87b69699","observation_id":"286ad799-caa5-4c5b-822b-9785e80ba99d","resolution":{"observed_at":"2026-08-01T09:32:50.721697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.844678Z","title":"Hence to achieve |bλ−λ ⋆| ≤ελ it suffices to take k≥ l log2 (λ(0) high −λ (0) low)/ελ m","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.844678Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:368ab3ec2c91f9cb4604bcf0952aa8cfd262640e70d78a3b64286ce3b3414ea1","observation_id":"19baafa8-2d32-4e69-9867-1ac79b2100a4","resolution":{"observed_at":"2026-08-01T09:32:50.844678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:32:50.937508Z","title":"Therefore to reach|S( bλ)−Q| ≤ εS it suffices that k≥ l log2 L(λ (0) high −λ (0) low)/εS m","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T09:32:50.937508Z"},"links":{"citing_paper":"/paper/2607.20762"},"observation_digest":"sha256:26b07cf2110d6dc2cd0715b70931fc17feaaab33b1b1d19e24d71d2796e0f60c","observation_id":"e4e7eda3-56ec-455c-9940-f61617725bc7","resolution":{"observed_at":"2026-08-01T09:32:50.937508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20762","last_updated":"2026-07-22T22:28:18Z","latest_version":1,"primary_category":"q-fin.TR","snapshot_observed_at":"2026-08-06T05:38:05.385629Z","submitted_at":"2026-07-22T22:28:18Z","title":"Quantifying Sub-Optimality in Routing for Automated Market Makers"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":12},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}