{"as_of":"2026-08-08T10:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:acf284b42e215945c1ba1ed0baaca2f13dfb59f8090075d503f20b9323e3aeb9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:05:23.481216Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T06:16:20.379382Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.17089","last_updated":"2023-09-29T09:36:37Z","snapshot_observed_at":"2026-08-07T13:02:58.068201Z","submitted_at":"2023-09-29T09:36:37Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17089","snapshot_observed_at":"2026-08-06T05:05:23.481216Z","title":"Falkner and Lars Schmidt-Thieme","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.02510","last_updated":"2025-08-04T15:17:08Z","snapshot_observed_at":"2026-08-06T05:05:21.355196Z","submitted_at":"2025-08-04T15:17:08Z","title":"On Distributional Dependent Performance of Classical and Neural Routing Solvers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T05:05:23.481216Z"},"links":{"cited_paper":"/paper/2309.17089","citing_paper":"/paper/2508.02510"},"observation_digest":"sha256:c400b2b17d3be3652274444def52ef3f14000e0e14dc707f4f90193d472ca833","observation_id":"b8062873-b87b-4bca-86ae-29ac4a6b4138","resolution":{"observed_at":"2026-08-06T05:05:23.481216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17089","last_updated":"2023-09-29T09:36:37Z","snapshot_observed_at":"2026-08-07T13:02:58.068201Z","submitted_at":"2023-09-29T09:36:37Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","version":1},"cited_work":{"arxiv_id":"2309.17089","doi":"10.48550/arxiv.2309.17089","metadata_source":"pith","pith_arxiv_id":"2309.17089","snapshot_observed_at":"2026-08-05T06:16:20.379382Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","venue":"cs.LG","work_id":"ea53e037-f1e1-4817-938a-c9046c405572","year":2023},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-05T05:42:48.928201Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.211950Z"},"links":{"cited_paper":"/paper/2309.17089","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:c44bcdee4ed40df4c3eecad49b417484f3e10a5404ebdf44cc77de01733cab0e","observation_id":"8d1fc078-e815-4b22-9f2a-772c29375a32","resolution":{"observed_at":"2026-08-05T05:42:52.851199Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.17089/citation-record","integrity":"/paper/2309.17089/integrity","json":"/paper/2309.17089/citation-record.json","paper":"/paper/2309.17089"},"outbound":[],"paper":{"arxiv_id":"2309.17089","last_updated":"2023-09-29T09:36:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:02:58.068201Z","submitted_at":"2023-09-29T09:36:37Z","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2309.17089."}