{"as_of":"2026-08-02T17:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffff64c2417a4d3be94b1d544d6c692e410ad90597f3fb8bda59276e1bfd73ab","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T15:14:14.504070Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-02T06:30:47.504484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.22543/citation-record","integrity":"/paper/2607.22543/integrity","json":"/paper/2607.22543/citation-record.json","paper":"/paper/2607.22543"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T15:14:13.847656Z","title":"Incremental construction of minimal acyclic finite-state automata","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:13.847656Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:e9f2211489efdbd918901262dc20663662fa2274197a4d3a6490f1d26c55b685","observation_id":"aba1d981-772a-4d64-9bd3-d665e3fc4c7a","resolution":{"observed_at":"2026-08-02T15:14:13.847656Z","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-02T15:14:13.904876Z","title":"Trie memory","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:13.904876Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:e94211f409c1d6486871a2b78bcfdaf5ff45bf72ea9787c402f8ef65b7a0f645","observation_id":"5f87c4b1-fcb8-49e2-8560-800387b5faa7","resolution":{"observed_at":"2026-08-02T15:14:13.904876Z","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-02T15:14:14.003344Z","title":"Experiencing SAX: A novel symbolic representa- tion of time series","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.003344Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:b512272299905effb1093ea386792455a0083acd85b577863ee8d6c93c563098","observation_id":"d7823715-548f-45ed-a427-ee337995d30c","resolution":{"observed_at":"2026-08-02T15:14:14.003344Z","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-02T15:14:14.098563Z","title":"Weighted finite-state transducers in speech recognition","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.098563Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:fc26064b15dbf36ff733353d2a379993f07a57d2e1c5ce10c4ff53d15f99e47f","observation_id":"0c49d1a7-fc04-42d6-99ba-c7dc92eed9c2","resolution":{"observed_at":"2026-08-02T15:14:14.098563Z","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-02T15:14:14.208356Z","title":"Hidden Markov map matching through noise and sparseness, in: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.208356Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:2a5ccd39a15808d33a0208350184192247b7aeaa6ea4026731621e10f71ed61d","observation_id":"231c99ed-f6cd-4feb-8af6-fb23cd37d7af","resolution":{"observed_at":"2026-08-02T15:14:14.208356Z","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-02T15:14:14.282502Z","title":"Current map-matching algorithms for trans- port applications: State-of-the-art and future research directions","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.282502Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:b701abb3d9a71bb375cc8f92e9e256039063369905b0b7b172a152ecc3c57dfd","observation_id":"2112720b-f1ce-46f8-a821-708c5ea00bfc","resolution":{"observed_at":"2026-08-02T15:14:14.282502Z","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-02T15:14:14.392855Z","title":"Fast string correction with Levenshtein automata","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.392855Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:fb7b7e59ebee4bfc17a163c1e730da4a5771a3216b48718325519856e7db1d0b","observation_id":"76dd04f8-d9ed-4205-b85a-a6026d4755a4","resolution":{"observed_at":"2026-08-02T15:14:14.392855Z","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-02T15:14:14.504070Z","title":"Fast map matching, an algorithm integrating hidden Markov model with precomputation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T15:14:14.504070Z"},"links":{"citing_paper":"/paper/2607.22543"},"observation_digest":"sha256:a63e373ceb861933f2a2ca0c8da1c62eda93d1e17280d295ea73440d5e77d1e4","observation_id":"6304c791-8ca6-4d92-93b8-b6c5048058b9","resolution":{"observed_at":"2026-08-02T15:14:14.504070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22543","last_updated":"2026-04-30T07:36:53Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-02T15:14:10.046976Z","submitted_at":"2026-04-30T07:36:53Z","title":"Route Based Map Matching via a Structured Codebook and Token Sequence Decoding"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":8},"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-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+00:00","source":"retraction_watch"}],"thesis":"As of 2 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2607.22543."}