{"as_of":"2026-08-10T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce23d03543fe229d3feca8f5f1bb19c97704662740aca7d569ab94f885750934","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T18:38:45.068351Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"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/2603.08337/citation-record","integrity":"/paper/2603.08337/integrity","json":"/paper/2603.08337/citation-record.json","paper":"/paper/2603.08337"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:38:39.824588Z","title":"Dex to cex volume ratio hits new high of 20%: Trading implications,","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:39.824588Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:744c649857a9a23a2af2021e548f5bfaead683e7fb76519af6926e1b3f79d92d","observation_id":"2d9f7ca8-bbfb-478e-a157-dbf8b2ac75f0","resolution":{"observed_at":"2026-08-02T18:38:39.824588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13772","last_updated":"2024-05-21T20:59:06Z","snapshot_observed_at":"2026-08-10T09:20:02.859639Z","submitted_at":"2023-07-25T19:12:29Z","title":"Fragmentation and optimal liquidity supply on decentralized exchanges","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13772","snapshot_observed_at":"2026-08-02T18:38:39.934063Z","title":"Liquidity fragmentation on decentralized exchanges,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:39.934063Z"},"links":{"cited_paper":"/paper/2307.13772","citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:8a54142078ec99d820a9633182a340cd4216676d0014feb6da39f4b3917108ce","observation_id":"54e0d34c-147a-44be-ba6a-406764d16c5d","resolution":{"observed_at":"2026-08-02T18:38:39.934063Z","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-02T18:38:40.062429Z","title":"Dexs volume in ethereum,","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.062429Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:c906cc1b7ff5a1ae8dfedab4f339877d8086c7d265fb3ce4b4b2e96ac0869cb5","observation_id":"2c80186d-bfa6-4e52-8178-8e9f8683b5f1","resolution":{"observed_at":"2026-08-02T18:38:40.062429Z","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-02T18:38:40.196290Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.196290Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:785983c1a899d7cdd16fed437dc72fca7b2dd824ec874b986358d5c4ca6e051c","observation_id":"d1a7591e-4a78-4916-8e64-04d761e58197","resolution":{"observed_at":"2026-08-02T18:38:40.196290Z","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-02T18:38:40.287629Z","title":"Uniswap v2 core,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.287629Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:aef686f788ff184e40c3cf9633d06190f55b9866dbfd45a89fc4d0e2d5bf6588","observation_id":"7c4477d9-7150-4041-a3b5-58f35be8a528","resolution":{"observed_at":"2026-08-02T18:38:40.287629Z","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-02T18:38:40.375172Z","title":"Cryptocurrency 24h trading volume,","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.375172Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:80863c6066922f983e1507a2d3dfa20ac302e8d5678d6a14fb7c4fe00013f4e0","observation_id":"57fdd857-cc62-4491-9568-b8d20cfed1a8","resolution":{"observed_at":"2026-08-02T18:38:40.375172Z","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-02T18:38:40.481750Z","title":"Numerical Stability Challenges in Uniswap V3 and Curve Pools,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.481750Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:19144f7b02efe5bffbe421468bc77ae4ded6d4b8926bcfe815e51b15cee2206b","observation_id":"ab37b1dc-8eb3-42af-950e-4f7e432d1d67","resolution":{"observed_at":"2026-08-02T18:38:40.481750Z","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-02T18:38:40.634508Z","title":"Power laws in economics and finance,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.634508Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:884f03e7ee189a7df2d0964dc285d68fb011bb9461896fcd55038d3e581d108f","observation_id":"08b596ca-2184-4a3b-8b53-db098c4e7b50","resolution":{"observed_at":"2026-08-02T18:38:40.634508Z","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-02T18:38:40.734655Z","title":"Truemper,Optimal flows in networks with positive gains","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.734655Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:2ccb1cf00d23f620a500fbf98f6962f2e462207025bcd142709c7c1071152707","observation_id":"9f44af6b-851e-4f9d-a915-d79718b4123e","resolution":{"observed_at":"2026-08-02T18:38:40.734655Z","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-02T18:38:40.867378Z","title":"Minimization of functions having lipschitz continuous first partial derivatives,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:40.867378Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:2cdb6c940261c85dd2c26949aad4e97785815a6854601d06d8c410a91abc16ae","observation_id":"ae58976a-1d02-4239-9970-e56df3d06721","resolution":{"observed_at":"2026-08-02T18:38:40.867378Z","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-02T18:38:41.049778Z","title":"Routing a swap,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.049778Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:9e5c0f3828938e6f6f3e5d6f8a5934d66dac360c7524cbec0b00eb5f22513ca0","observation_id":"9ec283ee-e2ac-401a-a698-6109c0859f25","resolution":{"observed_at":"2026-08-02T18:38:41.049778Z","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-02T18:38:41.165820Z","title":"Bitcoin: A peer-to-peer electronic cash system,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.165820Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:edbb9a8276b0bf58db17d6f32376e858c95aca711f2f1cd670887476051b5701","observation_id":"e9415f71-3283-4610-b372-9e1574d6e9b2","resolution":{"observed_at":"2026-08-02T18:38:41.165820Z","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-02T18:38:41.246360Z","title":"Ethereum: A secure decentralised generalised trans- action ledger,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.246360Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:8fc790ed8fc2e00ff72350f137de55409f0492ef9bc917a7d0eb5dc67d4d4084","observation_id":"ff5f06da-8377-4c19-ae72-e6cd4f99a51f","resolution":{"observed_at":"2026-08-02T18:38:41.246360Z","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-02T18:38:41.345950Z","title":"Formalizing and securing relationships on public networks,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.345950Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:9952dad6a1ba3168d7be28f426eeb900d46a072688b2f91314beb9fb3e706957","observation_id":"a1067d9a-e14b-4e43-958d-d1b3fbbb138c","resolution":{"observed_at":"2026-08-02T18:38:41.345950Z","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-02T18:38:41.467238Z","title":"Decentralized finance: On blockchain-and smart contract- based financial markets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.467238Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:574e154ac68d5dbf9b5ff671ca25bedf462b7884a764ab414fe512ed44ce8df8","observation_id":"d985262f-212e-4c63-a7c1-39e38bdb0e5d","resolution":{"observed_at":"2026-08-02T18:38:41.467238Z","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-02T18:38:41.542515Z","title":"Defi protocols for loanable funds: Interest rates, liquidity and market efficiency,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.542515Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:698276e249093a9d00796c8c13ffed0ed88b81fc1d8aa6b993e79baa119cf72d","observation_id":"0aabad14-9b74-4d13-8717-de504a9afdd4","resolution":{"observed_at":"2026-08-02T18:38:41.542515Z","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-02T18:38:41.604971Z","title":"SoK: Decentralized Finance (DeFi),","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.604971Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:79cfc8fe65de614181129679361c470b33218c40d57ee295dabd39f46a319b83","observation_id":"495a8df4-4a22-4ebc-82ee-1bfdf4050bec","resolution":{"observed_at":"2026-08-02T18:38:41.604971Z","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-02T18:38:41.662144Z","title":"Uniswap v3 core,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.662144Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:c52e041376e120c06efc72e5b92af4815cf0b04570dd9b5989ce55db20ac8035","observation_id":"ef1d5388-04f0-4103-9637-69bea297fba9","resolution":{"observed_at":"2026-08-02T18:38:41.662144Z","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-02T18:38:41.733882Z","title":"Stableswap-efficient mechanism for stablecoin liquidity,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.733882Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:bcf6601deab699d5a4128f1241ab2b170ff9c0771d76182991928073598c0d4e","observation_id":"634f7c0c-1e02-4711-9404-91f59bbad4cb","resolution":{"observed_at":"2026-08-02T18:38:41.733882Z","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-02T18:38:41.812704Z","title":"A non-custodial portfolio manager, liquidity provider, and price sensor,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.812704Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:ed8c53c05c8addd391e226d67afa4d851aca299c0cede9c3da381e4040ac3fec","observation_id":"3653c264-46bc-4eff-b876-84640e7fb5e7","resolution":{"observed_at":"2026-08-02T18:38:41.812704Z","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-02T18:38:41.873888Z","title":"An analysis of uniswap markets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.873888Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:43566055f30eff1f57348bae73801abc2e88ecd5436df04abaaaa5e9cf01ae63","observation_id":"eb5a2f0c-3404-4fa9-a46b-095a0799c52f","resolution":{"observed_at":"2026-08-02T18:38:41.873888Z","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-02T18:38:41.928407Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:41.928407Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:382843f90145f421c696c06b35dff5170cd40cdbb06351be89aed201e28b1e5a","observation_id":"800d7020-d5f0-4f4c-9ccf-87c73743578f","resolution":{"observed_at":"2026-08-02T18:38:41.928407Z","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-02T18:38:42.070738Z","title":"Curve - pool - 3pool,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.070738Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:45ea955700283d545502de33ae3ac96cf8ac953a89bd8ef265c20a20f74b4df7","observation_id":"04114e12-2255-410c-abea-6ab8145b4b19","resolution":{"observed_at":"2026-08-02T18:38:42.070738Z","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-02T18:38:42.187962Z","title":"Global order routing on exchange networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.187962Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:a231c3852ed120406cd5af86f2e70a898cae05dcb7c47dbf8b57f2236cb7b364","observation_id":"6212bfdf-8078-4b1a-9921-3a14db9c0ca1","resolution":{"observed_at":"2026-08-02T18:38:42.187962Z","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-02T18:38:42.402182Z","title":"An algorithm for finding shortest routes from all source nodes to a given destination in general networks,","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.402182Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:8f5d502a229c99f99cbaaca580fd6c6c64a1360262d4025b55790f370bb4b17a","observation_id":"638e7d33-e5b2-4a7a-b8e0-0cff45bea512","resolution":{"observed_at":"2026-08-02T18:38:42.402182Z","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-02T18:38:42.575520Z","title":"Optimal routing for constant function market makers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.575520Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:7c52696670a5d6b2073fcd8dea575bf20404d060744a45bf57f93165471d7425","observation_id":"5ce5ffec-b34e-42f4-96f0-1d3c44725e75","resolution":{"observed_at":"2026-08-02T18:38:42.575520Z","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-02T18:38:42.706829Z","title":"Constant function market makers: Multi-asset trades via convex optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.706829Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:a926bbd3c9c23b6d270182c566dc756ea558b62435ecb6d6187983a87b53cf25","observation_id":"5f4bd57a-5771-4e22-9ce8-19787fa1cf8c","resolution":{"observed_at":"2026-08-02T18:38:42.706829Z","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-02T18:38:42.965633Z","title":"An efficient algorithm for optimal routing through constant function market makers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:42.965633Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:1da968e734138d41abe756a9ed2049088526b8cc6c3f3703f8b51d44c65c7ee0","observation_id":"bf097cf7-4cfb-4b47-8c78-3ec266b96b11","resolution":{"observed_at":"2026-08-02T18:38:42.965633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00765","last_updated":"2024-05-18T20:06:20Z","snapshot_observed_at":"2026-08-10T01:21:03.868662Z","submitted_at":"2024-03-31T18:36:27Z","title":"Convex Network Flows","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00765","snapshot_observed_at":"2026-08-02T18:38:43.056220Z","title":"Convex network flows,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.056220Z"},"links":{"cited_paper":"/paper/2404.00765","citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:05784e69909cc2f8bc86b94b4c7bfc502a9f28fd5e9edc5a1aef851308f1ec77","observation_id":"23e0e95e-b7b1-4edc-99b2-419ac5d52df9","resolution":{"observed_at":"2026-08-02T18:38:43.056220Z","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-02T18:38:43.124787Z","title":"Faster algorithms for the shortest path problem,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.124787Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:740de3610bec5c8e688b2636d3d034ff202bd15e0dcb65820e884f1c879b3119","observation_id":"5ec0e0e1-9b36-4629-93df-f5abd12e9264","resolution":{"observed_at":"2026-08-02T18:38:43.124787Z","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-02T18:38:43.188740Z","title":"On the global linear convergence of frank-wolfe optimization variants,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.188740Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:53fba417f687b7938ec1f004471da56a95f12aafa88ccae314044faeb51348fc","observation_id":"54802a88-e6b7-4b27-9f0b-974619a3a1c4","resolution":{"observed_at":"2026-08-02T18:38:43.188740Z","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-02T18:38:43.278793Z","title":"Sushiswap,","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.278793Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:4dd3802e9c852cd7076fc84bbe64c080ce3b94897bd8002cbb0d625979accb72","observation_id":"50b93c7f-9216-4465-a007-aa0b18acd3c3","resolution":{"observed_at":"2026-08-02T18:38:43.278793Z","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-02T18:38:43.341353Z","title":"Pancakeswap,","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.341353Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:9cb934f779a36942e0f25425947f08e219b050fc84aee3bf61a2b93c6943359e","observation_id":"24968d49-677e-4c5a-88cb-81d7bce2f060","resolution":{"observed_at":"2026-08-02T18:38:43.341353Z","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-02T18:38:43.398090Z","title":"(2024) Fee-on-transfer & rebase tokens: An erc-20 security bug you need to know","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.398090Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:994a3264d0b28cd0dd3dcef24b516f9ac89223c9345b1b0bb23bd72081e0424f","observation_id":"7465792c-7d17-4367-bdb5-22d43ea2d948","resolution":{"observed_at":"2026-08-02T18:38:43.398090Z","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-10T09:15:51.113659Z","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-10T09:16:03.508570Z","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:5b0a0216411c65d952628caf5e477a7b8f8816e8b2d273feae0c567aaf61d47d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:38:43.704607Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.704607Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:f16494143616f772871d57716cc2ec028b7eb80e670fd1c1ec6214f7ab59c92a","observation_id":"2e904ea8-e1ee-4ce9-ab33-e7cfd4977f17","resolution":{"observed_at":"2026-08-02T18:38:43.704607Z","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-02T18:38:43.810144Z","title":"Gurobi Optimization,Gurobi Optimizer Reference Manual, 2025","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-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.810144Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:11df65d703b5326b7f53b86358f6a0f1d18102e361d92f35addef6aac44ab295","observation_id":"73fd6a40-75d7-45b0-911f-2299d9139b79","resolution":{"observed_at":"2026-08-02T18:38:43.810144Z","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-02T18:38:43.976152Z","title":"A next-generation on-chain liquidity provider powered by pro-active market maker algorithm,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.976152Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:97feacd1bd69a2cba9f689f757302c84dcfe97e65af82f0c68fb15296efb5b4c","observation_id":"21146e48-d8bb-4f64-a964-6cc34445b74c","resolution":{"observed_at":"2026-08-02T18:38:43.976152Z","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-02T18:38:44.129301Z","title":"(2024) Fusion swap documentation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.129301Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:8d31b2fa79ec87b7a0be832cee1fa2ac336aae922d6657b224d6f7d872b7be87","observation_id":"d9a64b75-d518-402c-89da-9c6e0c4a9b8b","resolution":{"observed_at":"2026-08-02T18:38:44.129301Z","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-02T18:38:44.241962Z","title":"(2024) Classic swap documentation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.241962Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:90f6e70d0296799dfa47f9e8b7ddeaac5075d98b7c54505839adad5dd2f2714c","observation_id":"5015af42-4263-4167-96b4-3d2a32455843","resolution":{"observed_at":"2026-08-02T18:38:44.241962Z","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-02T18:38:44.412926Z","title":"Centralized exchanges vs. decentralized exchanges in cryp- tocurrency markets: A systematic literature review,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.412926Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:549c42d097a76cc24bbc169b80d5bdef9796b8566d56de9affc0c06668c97371","observation_id":"0adc7042-416a-4a16-8f53-1bb3d3721504","resolution":{"observed_at":"2026-08-02T18:38:44.412926Z","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-02T18:38:44.591862Z","title":"Pcsp: Efficiently answering label- constrained shortest path queries in road networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.591862Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:370484bd36e5834a9db36d0ccb8578fb491e4157b7b6f4f8ae0d94b7c9e69ce8","observation_id":"068a4f32-8435-4049-be14-fad854bdf302","resolution":{"observed_at":"2026-08-02T18:38:44.591862Z","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-02T18:38:44.643554Z","title":"Efficient label- constrained shortest path queries on road networks: A tree decompo- sition approach,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.643554Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:b5ee5ab35cbdab82f912e8721736b5e8851c6745f896b0889f39c008ba76e6f2","observation_id":"ee56909a-5684-4a60-9fc6-035085f1079b","resolution":{"observed_at":"2026-08-02T18:38:44.643554Z","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-02T18:38:44.717339Z","title":"Approximate skyline index for constrained shortest pathfinding with theoretical guarantee,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.717339Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:7fb6dd44fe73f2265c2b89226c9dcda86eb429ce9a9014b033b0b0682c7265e1","observation_id":"489eef22-9aba-41ab-9584-255abe523d8c","resolution":{"observed_at":"2026-08-02T18:38:44.717339Z","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-02T18:38:44.785798Z","title":"An experimental evaluation and guideline for path finding in weighted dynamic network,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.785798Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:af8e5ef8e5ccff7459212c549e4bdeed5ddc97fe5acfea1cb0f18177dc0799f8","observation_id":"a9dde054-f334-458e-83bd-e72ff1a705c0","resolution":{"observed_at":"2026-08-02T18:38:44.785798Z","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-02T18:38:44.831038Z","title":"Linear programming and extensions,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.831038Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:e7e40ed6a02545f285526c67d03264dbc9d0ed2c4d275d466bb3f601592078b8","observation_id":"ac93077f-c62f-46f9-8ecb-d0ec88bd90ca","resolution":{"observed_at":"2026-08-02T18:38:44.831038Z","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-02T18:38:44.909337Z","title":"A strongly polynomial algorithm for generalized flow maximization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.909337Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:fa05e364eee3dfb81e71f8d833ca911f8bc80438d8a77692581aa2704e003507","observation_id":"f9d7d238-98f7-4fa5-b0ed-c3ea18edc363","resolution":{"observed_at":"2026-08-02T18:38:44.909337Z","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-02T18:38:44.974237Z","title":"Maximum network flows with concave gains,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:44.974237Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:28593e27e6b0e113c0b62bce3f6722142517ec7dc86d74219a9156e5d298930a","observation_id":"a70638ce-3662-4172-9504-0b0e02879271","resolution":{"observed_at":"2026-08-02T18:38:44.974237Z","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-02T18:38:45.068351Z","title":"sweet spot","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:45.068351Z"},"links":{"citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:6d0fe0560a8cc3999e15ede829b67b136473b6565277a60d6036ee0d0f8b9504","observation_id":"3d6f48e4-19cf-47c9-98e2-38bb6ca327ec","resolution":{"observed_at":"2026-08-02T18:38:45.068351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-10T09:16:03.508570Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2603.08337."}