{"as_of":"2026-08-08T18:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b37516ac2538289216a92a13c1986af6794e586b7e7cfb910782342938f23da9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T04:48:32.407118Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T04:48:33.425906Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.15809","last_updated":"2025-04-22T11:45:49Z","snapshot_observed_at":"2026-08-07T16:00:15.995663Z","submitted_at":"2025-04-22T11:45:49Z","title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges","version":1},"cited_work":{"arxiv_id":"2504.15809","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.15809","snapshot_observed_at":"2026-08-06T04:48:33.425906Z","title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges","venue":"q-fin.CP","work_id":"2aa53520-9f24-424f-b82f-528d56ae3612","year":2025},"citing_paper":{"arxiv_id":"2508.03217","last_updated":"2025-08-05T08:45:38Z","snapshot_observed_at":"2026-08-06T17:46:04.143998Z","submitted_at":"2025-08-05T08:45:38Z","title":"Measuring DEX Efficiency and The Effect of an Enhanced Routing Method on Both DEX Efficiency and Stakeholders' Benefits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T04:48:32.407118Z"},"links":{"cited_paper":"/paper/2504.15809","citing_paper":"/paper/2508.03217"},"observation_digest":"sha256:f5fc7abadd49578664e6855cece6692acd55442a39582d2b0e2de0abce727e22","observation_id":"9c339756-7cbb-4b70-8e23-8f71cd525372","resolution":{"observed_at":"2026-08-06T04:48:33.542466Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15809","last_updated":"2025-04-22T11:45:49Z","snapshot_observed_at":"2026-08-07T16:00:15.995663Z","submitted_at":"2025-04-22T11:45:49Z","title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15809","snapshot_observed_at":"2026-08-02T18:38:43.542263Z","title":"A line graph-based framework for identifying optimal routing paths in decentralized exchanges,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-05T14:35:01.505710Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.542263Z"},"links":{"cited_paper":"/paper/2504.15809","citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:f963a62c8c18fdfce661a2ee60a2de92f98af9f2afad7870958db75ed68d3083","observation_id":"707c9ec6-b774-4f72-b492-5cd89878b810","resolution":{"observed_at":"2026-08-02T18:38:43.542263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15809","last_updated":"2025-04-22T11:45:49Z","snapshot_observed_at":"2026-08-07T16:00:15.995663Z","submitted_at":"2025-04-22T11:45:49Z","title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15809","snapshot_observed_at":"2026-08-02T15:38:01.323439Z","title":"Zhang, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22540","last_updated":"2026-04-25T23:02:09Z","snapshot_observed_at":"2026-08-02T15:38:00.220922Z","submitted_at":"2026-04-25T23:02:09Z","title":"Multi-Path Routing in Decentralized Exchange Networks: Convex Allocation and an Improving-Path Certificate","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T15:38:01.323439Z"},"links":{"cited_paper":"/paper/2504.15809","citing_paper":"/paper/2607.22540"},"observation_digest":"sha256:c9729917ca453f01571824e8674cd92f28186b3d368488aeba6751e33ddd34ae","observation_id":"1ffcbfb0-8182-48e7-abe5-83d8478a6c1b","resolution":{"observed_at":"2026-08-02T15:38:01.323439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15809/citation-record","integrity":"/paper/2504.15809/integrity","json":"/paper/2504.15809/citation-record.json","paper":"/paper/2504.15809"},"outbound":[],"paper":{"arxiv_id":"2504.15809","last_updated":"2025-04-22T11:45:49Z","latest_version":1,"primary_category":"q-fin.CP","snapshot_observed_at":"2026-08-07T16:00:15.995663Z","submitted_at":"2025-04-22T11:45:49Z","title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.15809."}