{"as_of":"2026-08-08T23:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6924b481a084873b5f600a5c54a456332ea2e1d019cfbd60422972460a24a43","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-08T06:32:00.761636+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-05T14:35:01.505710Z","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:33724c8cf4a7575cf4358581ad46eb6aee1a94c31aabaa1d3189043ed565cf84","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-02T22:19:02.601187Z","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-05T14:35:01.505710Z","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:9ea6e27e20f70495901000e95dc1027cc1492f02d5b8b12f991efef4296a1e72","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-05T14:35:01.505710Z","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:dad203f782c4c761dc55d6f78a3a80eaba715a5d8eb2742bfce0e8d6d7a2744f","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-05T14:35:01.505710Z","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:f5dcca21b79f9c0a08a90812895dc3cccdaed89dc2b90e6e2d034fd943000106","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-05T14:35:01.505710Z","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:ae6802c47af3696e7e16e895bb2f0b855c7e57d7b75c1f3d9acf433913290237","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-05T14:35:01.505710Z","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:ae1cb2ebea8ef17109653fbcde8d3adfb03b78b1cb9bfd81d16765685deec0f6","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-05T14:35:01.505710Z","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:a549ef7972fbe7b7a4932e1632da6cf0e8512247485765953b49fbe213ad3178","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-05T14:35:01.505710Z","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:1daecde132728a7f9997827e66a72c52691f4336ae1ab83624b3718e7eed64e7","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-05T14:35:01.505710Z","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:d66d8e18d705303bad6c21c1a0c7af26239b28d1beaecffc6117c1ec7eec209a","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-05T14:35:01.505710Z","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:96ec643cdd3c1c5c31e0f2f37161f0f3e77346e2a065d1bc3ddba496fe20cb3e","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-05T14:35:01.505710Z","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:085f195a468f6963480ff7ebfb554184e85c584d6d29d51456bd1e0e822fa580","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-05T14:35:01.505710Z","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:d8945546486f956d54749bf28571e008d8c1e21fc88133f32e02a87dc807ac10","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-05T14:35:01.505710Z","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:90daad365bedfe551d69414e42fae310da941c51a079690204dc8939de874d5d","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-05T14:35:01.505710Z","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:c37c0011da43b0b3375cdd5b81f87f8972557766484fcc981d18adb8e9129105","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-05T14:35:01.505710Z","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:90b95fedc0e362d7db7ddaaeeee6964ed8073c7302b9ca2d0e18fc7d1906ecc8","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-05T14:35:01.505710Z","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:519c72e8f7aa0fbad0613840505bd7955eff49846b69ddb80de83d2e798480a2","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-05T14:35:01.505710Z","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:f8fc1f05149a57b22e72c777ab142a303b8e521048987ca0b53bb1724564cc93","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-05T14:35:01.505710Z","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:503ada5cf266fb60db155367eda11b4b19ab06964e870489ccd9d73b32ff16a8","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-05T14:35:01.505710Z","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:393e47af128935aa1e7a1023d30abb54d9cf37bdcd2cc5564ab7cff40cb35872","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-05T14:35:01.505710Z","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:a21d203434165a3b45523546088de08a02b5872bcd5466cc14c0cdbc9593807f","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-05T14:35:01.505710Z","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:a4d23f8b0c85be53a82744f1348b9061c37408ba0c5f45d9db14d9b6e6b12633","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-05T14:35:01.505710Z","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:dc8e0a2c2d2fd3815a058ad6949319657fa60defc2923f3b503f67fce38d6b0c","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-05T14:35:01.505710Z","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:66607eadc717f3cfd7e29b3dc059e80ce96ceb795ab20b44d33a8003e476aa53","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-05T14:35:01.505710Z","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:4e671831dc813fbe2d15c940c9acfdc16b20614418a18a88c0b1cb608b20cb85","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-05T14:35:01.505710Z","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:444f7aefeabc3eec39e9ad2745d79d95bc512e706473635469370392721c34ca","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-05T14:35:01.505710Z","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:a475def2b776ada24c0438d682d89c113469c3890ce24dd51b033a13ceeb6c08","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-05T14:35:01.505710Z","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:469e6eebedc4a88d6f56dff0d6ffe5cea3047c8dcfc250b6d66a8aed81845d8f","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-05T14:35:01.505710Z","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:5a44ececf33d31641fd2275ac87dbe4d553884fbb8b2ea9c8ad47a7f0e3489f3","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-07-31T03:46:08.320507Z","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-05T14:35:01.505710Z","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:9cb584c71e40282f04963c3f0e94ed3b7e2949d1cbc7fcd9806523439ee05df7","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-05T14:35:01.505710Z","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:baa4bfacc710ac59af0bf795d387e015069d03b81f3b991b28fd8b7bda0ada51","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-05T14:35:01.505710Z","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:82823abf2b1434c9b8cde737b6d140819214ef565e292c9b2bad49850d24c7e0","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-05T14:35:01.505710Z","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:9d0f2c5d1e222f6a93bb5be12adcde292943cf6009985e61ec1c76a9af10a92a","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-05T14:35:01.505710Z","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:4b34eddf00ea6e10dbd7ec452a4e2a8c22d4f0b4648f628b809db9b56c8a8f48","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-05T14:35:01.505710Z","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:7922f927c9ab5c6cd605bd22bf529143cfe72099587af8b99cf6b54f01c1d1a6","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-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":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-05T14:35:01.505710Z","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:05d8f8d434d77b7bb353dd9a121cd54fb04ad2087817e319cd8fceb532c0323a","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-05T14:35:01.505710Z","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:b57ffd4e8976399a9002cbf82b24db5dd3048f8e025e216db5a24c79b73578ba","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-05T14:35:01.505710Z","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:e0f2fee5e33a1f6b434ed454d85a7963914b4b787bb03716f4a8f06ee2ce7e74","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-05T14:35:01.505710Z","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:5ae6a1afbd2a8a5a189fa174a1ed48207bde63591f12c63419878760ea4e51de","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-05T14:35:01.505710Z","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:715972afd4079da72ffb5e11e1cc47653aa03538cbbc0a98cdfbb8b9fe4e8fa3","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-05T14:35:01.505710Z","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:9557d4fe44ac8b493faaf1f107d22977d20d7d19c1a8cc60962d1ccd5f62a605","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-05T14:35:01.505710Z","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:db6382cfc0ce0554f0da382fd3c73686659c6696328ffdd262c25f2c0edd1827","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-05T14:35:01.505710Z","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:d25d23c0cf62125da779e74c86590164da7df7d4919a81c0c97cfb72ed53d612","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-05T14:35:01.505710Z","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:a999b969a1166950f7c58efa96704ab425b691d55a36d082a3133c5061337ee1","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-05T14:35:01.505710Z","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:a7b929df1db0d69d605b086df4984ed7bcf33178ee92a81516142ca00fbeee13","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-05T14:35:01.505710Z","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:7680dfe748c48ab325a083d17f10de258bdedc7a966ffa76cf671a32bf282de6","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-05T14:35:01.505710Z","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:990f7cdf1ec0667ade3ab7778c8ac8590841f316fa8f9281d2c12a116a199f2f","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-05T14:35:01.505710Z","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:3b5b0f7dde6e399797e6b861b2937061c7872f5c81086d79d64756c2f4f4ce9a","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-05T14:35:01.505710Z","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:7245cb9e6f6726cffdad9730ff7284f79af073bbd05e3b0ff740e3f734ef2ec1","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-05T14:35:01.505710Z","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-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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2603.08337."}