{"as_of":"2026-08-08T21:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3812e0c30f226693df0eb44e03bfe78315b375972c79a5c0e5f8a2b75478fa71","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:03:05.351089Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T11:54:38.423068Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":"2306.17100","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-06-30T11:54:38.423068Z","title":null,"venue":null,"work_id":"6e9c6554-f4e4-44ef-8ba8-59bbc5ab568c","year":2024},"citing_paper":{"arxiv_id":"2411.14411","last_updated":"2026-04-06T16:01:44Z","snapshot_observed_at":"2026-08-02T07:48:55.322538Z","submitted_at":"2024-11-21T18:46:23Z","title":"Multi-Agent Environments for Vehicle Routing Problems","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-23T17:14:04.287133Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2411.14411"},"observation_digest":"sha256:4236cdac68eecc21bb2ea2e4ec46e8526b3a6a383f58698b1ba5fe5893185f99","observation_id":"577c570d-6401-426c-a907-f12d9c42f40d","resolution":{"observed_at":"2026-05-23T17:15:43.652664Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-08T19:03:05.351089Z","title":"Rl4co: an extensive reinforcement learning for combina- torial optimization benchmark","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05537","last_updated":"2025-02-08T12:00:30Z","snapshot_observed_at":"2026-08-08T18:53:19.650452Z","submitted_at":"2025-02-08T12:00:30Z","title":"Sequential Stochastic Combinatorial Optimization Using Hierarchal Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T19:03:05.351089Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2502.05537"},"observation_digest":"sha256:e369e077f9447ee9b21b0af8ba579ed19d26945d447ded36a53055cfbb5235d8","observation_id":"fc86a519-a3bf-44ae-8b0b-2c73b28e54d1","resolution":{"observed_at":"2026-08-08T19:03:05.351089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-07T19:00:13.910344Z","title":"arXiv preprint arXiv:2306.17100 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.910344Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:0e0629d253fd9d7d3b96c6cd9dd13c4c465ca97b8f86de58acffeaa7738a228b","observation_id":"3691a9cd-791f-4cc4-bcaa-b0b353b5cceb","resolution":{"observed_at":"2026-08-07T19:00:13.910344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-07T05:18:12.672425Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08424","last_updated":"2025-06-11T06:43:18Z","snapshot_observed_at":"2026-08-07T05:09:15.787542Z","submitted_at":"2025-06-10T03:55:14Z","title":"SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T05:18:12.672425Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2506.08424"},"observation_digest":"sha256:02faf5f99ee1fbf6445c9b923d9c9629ebf6abee19560f70cbd3cca60b90b891","observation_id":"44c83f64-be6a-46bd-b7b2-48cc55bcb1af","resolution":{"observed_at":"2026-08-07T05:18:12.672425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-05T04:50:32.214536Z","title":"Rl4co: an extensive reinforcement learning for combinatorial optimization benchmark,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05946","last_updated":"2025-09-07T06:46:03Z","snapshot_observed_at":"2026-08-07T19:21:09.227690Z","submitted_at":"2025-09-07T06:46:03Z","title":"Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial","version":1},"reference_index":187,"source":"pdf_text","source_observed_at":"2026-08-05T04:50:32.214536Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2509.05946"},"observation_digest":"sha256:fb4344318ca0790617e58de2100e57affb436b0cf91826f2fb33fc52aa609a83","observation_id":"0ab2884f-543f-40f6-beb9-8426ec43656c","resolution":{"observed_at":"2026-08-05T04:50:32.214536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":"2306.17100","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-06-30T11:54:38.423068Z","title":null,"venue":null,"work_id":"6e9c6554-f4e4-44ef-8ba8-59bbc5ab568c","year":2024},"citing_paper":{"arxiv_id":"2605.25235","last_updated":"2026-05-24T19:46:30Z","snapshot_observed_at":"2026-07-06T23:35:11.987278Z","submitted_at":"2026-05-24T19:46:30Z","title":"Constraint-Anchored Attribution: Feasibility-Certified Counterfactuals and Bonferroni-PAC Sufficient Subsets for Neural CO Policies","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T11:49:22.620795Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2605.25235"},"observation_digest":"sha256:a441e8194c8411ec206191fc81434efe700f0813cf0c9adf73b8d9f2a54318f6","observation_id":"9646f662-11cc-4532-bb0e-7f54b0aaac81","resolution":{"observed_at":"2026-06-30T11:54:38.424829Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2306.17100/citation-record","integrity":"/paper/2306.17100/integrity","json":"/paper/2306.17100/citation-record.json","paper":"/paper/2306.17100"},"outbound":[],"paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark"},"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 6 inbound Pith citation observations for arXiv:2306.17100."}