{"as_of":"2026-08-18T00:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38cf9573e0b2b89bdff5d4c7d22fec5eeb2578bb98fb2feae6f5226d56d2270c","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:27:18.968693Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2508.07159/citation-record","integrity":"/paper/2508.07159/integrity","json":"/paper/2508.07159/citation-record.json","paper":"/paper/2508.07159"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:27:18.892498Z","title":"TransportationResearchPartB:Methodological , 34(6):515–531","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.892498Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:d521ad8bdd69d7a657ba16f2c23d8ba4e4ed3611f0ab0a16ba5fa2022e9f725a","observation_id":"0dce3fd5-ed2a-412f-bb8e-6d353475c8f9","resolution":{"observed_at":"2026-08-05T22:27:18.892498Z","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-05T22:27:18.897931Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.897931Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:cbf660f34209b52044a7741bb439e54b3e998ec64f506ef65a08c3b433dfb9fc","observation_id":"6ea80ced-eda7-4fd1-ac4a-e2b71ee12c07","resolution":{"observed_at":"2026-08-05T22:27:18.897931Z","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-05T22:27:18.902706Z","title":"and Wada, K","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.902706Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:9ccd65b3a83865e6acc6811d897f83b2d69655103bd5b6ed961508a8615a201a","observation_id":"cf3fcf47-dd8c-4c4f-a74d-155d4c546387","resolution":{"observed_at":"2026-08-05T22:27:18.902706Z","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-05T22:27:18.907450Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.907450Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:363f8cfa93e3427825974e2ebb4a29e0a439d1cd5b15c0f23b6f06e2f0960d67","observation_id":"a97e35b0-2599-480a-afbb-03b5efa6e0ff","resolution":{"observed_at":"2026-08-05T22:27:18.907450Z","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-05T22:27:18.912388Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.912388Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:092d356b7d0c785d7e090d61ee12613ebd252396aa9a7a1af24a00de657d1935","observation_id":"b3d380dd-ae51-421e-9605-ac72bb084e9e","resolution":{"observed_at":"2026-08-05T22:27:18.912388Z","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-05T22:27:18.917033Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.917033Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:2334b65344a803f50c2f69033a81aca2e6b4eb4b3230e9214f0ab1dd0cd54cdf","observation_id":"adc843f0-d4c8-4952-acba-7eefe4691097","resolution":{"observed_at":"2026-08-05T22:27:18.917033Z","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-05T22:27:18.922600Z","title":"L., Bernstein, D., Smith, T","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.922600Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:3baba4bab0527cf39db510a962dae24921d35f6a33705e20cc43cb22d4a44ae5","observation_id":"8c35a588-6642-40d6-bba9-141710741a20","resolution":{"observed_at":"2026-08-05T22:27:18.922600Z","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-05T22:27:18.927043Z","title":"L., Kim, T., Kwon, C., and Rigdon, M","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.927043Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:9dcd89aefde5a03c02a1c61c4067af81c03bd7884f684098a32b7ed863fbf79b","observation_id":"aadcd730-3474-4947-943a-21b9c37cca40","resolution":{"observed_at":"2026-08-05T22:27:18.927043Z","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-05T22:27:18.932609Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.932609Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:5b49daffb8584378270e33ca9da2b19622369b5d4e705caa7867f7693922c8fc","observation_id":"8d68c4b0-4d6b-42d1-a3c7-fa06ae5d53d3","resolution":{"observed_at":"2026-08-05T22:27:18.932609Z","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-05T22:27:18.937902Z","title":"Computingdynamicuserequilibriaonlarge-scalenetworkswithsoftware implementation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.937902Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:5bfe99b8f93d38a3a99a1d581f41992b5a111f311b12cc673956fecdd6c6f377","observation_id":"99778f23-4dd2-4271-a109-128a3e90e201","resolution":{"observed_at":"2026-08-05T22:27:18.937902Z","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-05T22:27:18.942418Z","title":"and Kocur, G","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.942418Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:60bf026a8ee4a03a052fc98141c6a358735f4b181964d03ab2753463dd4f0f20","observation_id":"87fcfdba-c02f-45b3-81b1-eab1eca46ba1","resolution":{"observed_at":"2026-08-05T22:27:18.942418Z","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-05T22:27:18.946650Z","title":"and Lam, W","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.946650Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:b77cbf3a83f4bea5d355c69025b999981e98db307567b770c93b3e182476f23a","observation_id":"811ecc20-0e61-43f1-894b-c0681dfab647","resolution":{"observed_at":"2026-08-05T22:27:18.946650Z","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-05T22:27:18.951460Z","title":"and Akamatsu, T","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.951460Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:8bcb0cd90b70aa767d2f376cdfe2aab82618c3d60ac0d95601188e5207b09c4b","observation_id":"c1e78f6c-0904-4f29-b99f-7c20328e2fb6","resolution":{"observed_at":"2026-08-05T22:27:18.951460Z","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-05T22:27:18.955688Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.955688Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:b0c5d2549877df0a5558ce4a05927ff47909f02d6593fffd13424d9a2714f2b6","observation_id":"0d0b7d44-0409-4083-b926-bb050ad3e22d","resolution":{"observed_at":"2026-08-05T22:27:18.955688Z","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-05T22:27:18.959810Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.959810Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:df3dbc8ae51f98c5626eec058612a1ed9c0dd7fa4e814be251892212e3283f18","observation_id":"3f685e3f-6725-45d0-bfe2-c1e89b4086b3","resolution":{"observed_at":"2026-08-05T22:27:18.959810Z","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-05T22:27:18.964140Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.964140Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:3e8c3f256ab1647abc182297e16b414e2e6b4023da85c72bd3ce1e38b07e186a","observation_id":"76847cc5-51b9-406c-af38-8b42a4b3625e","resolution":{"observed_at":"2026-08-05T22:27:18.964140Z","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-05T22:27:18.968693Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:27:18.968693Z"},"links":{"citing_paper":"/paper/2508.07159"},"observation_digest":"sha256:69f31b3dab5846363ffba6b6d9c4f265eda372ecd9c46ceeec3ab95b82560fff","observation_id":"7bdaef45-3084-4605-b3c7-2e953b622f4d","resolution":{"observed_at":"2026-08-05T22:27:18.968693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.07159","last_updated":"2026-06-05T02:15:29Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T13:02:45.864373Z","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2508.07159."}