{"as_of":"2026-08-11T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee806e7bbd756ea6f5643d8783e69b16639e3ab1583e255e086fd7455352304c","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:04:12.294862Z","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-07T19:00:14.145156Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.11849","last_updated":"2024-10-31T11:33:24Z","snapshot_observed_at":"2026-07-31T00:10:48.357368Z","submitted_at":"2024-01-22T11:08:36Z","title":"Self-Labeling the Job Shop Scheduling Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11849","snapshot_observed_at":"2026-08-10T21:04:12.294862Z","title":"Self-labeling the job shop scheduling problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00018","last_updated":"2025-01-11T10:20:16Z","snapshot_observed_at":"2026-08-10T20:56:49.081847Z","submitted_at":"2025-01-11T10:20:16Z","title":"An Expectation-Maximization Algorithm-based Autoregressive Model for the Fuzzy Job Shop Scheduling Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:04:12.294862Z"},"links":{"cited_paper":"/paper/2401.11849","citing_paper":"/paper/2502.00018"},"observation_digest":"sha256:2c2ba94c2442df37e36cdd992a8aad6d50eb7a52b1f38635445f88df357660df","observation_id":"46e9a2a0-1be3-4271-afb7-8d47a0d2440b","resolution":{"observed_at":"2026-08-10T21:04:12.294862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11849","last_updated":"2024-10-31T11:33:24Z","snapshot_observed_at":"2026-07-31T00:10:48.357368Z","submitted_at":"2024-01-22T11:08:36Z","title":"Self-Labeling the Job Shop Scheduling Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11849","snapshot_observed_at":"2026-08-08T05:42:38.959676Z","title":"Self-labeling the job shop scheduling problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08684","last_updated":"2025-02-12T11:22:33Z","snapshot_observed_at":"2026-08-10T19:43:46.078644Z","submitted_at":"2025-02-12T11:22:33Z","title":"Self-Evaluation for Job-Shop Scheduling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T05:42:38.959676Z"},"links":{"cited_paper":"/paper/2401.11849","citing_paper":"/paper/2502.08684"},"observation_digest":"sha256:0e44ee423e3692980f2d322d1974282714e7225268c09516a5e3d1210123b4bf","observation_id":"5207b70e-e367-4f4c-8f6c-f850f21be6c8","resolution":{"observed_at":"2026-08-08T05:42:38.959676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11849","last_updated":"2024-10-31T11:33:24Z","snapshot_observed_at":"2026-07-31T00:10:48.357368Z","submitted_at":"2024-01-22T11:08:36Z","title":"Self-Labeling the Job Shop Scheduling Problem","version":3},"cited_work":{"arxiv_id":"2401.11849","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.11849","snapshot_observed_at":"2026-08-07T19:00:14.145156Z","title":"Self-Labeling the Job Shop Scheduling Problem","venue":"cs.LG","work_id":"38bfd129-3c55-4cd9-96fb-5273be9c4de7","year":2024},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.920831Z"},"links":{"cited_paper":"/paper/2401.11849","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:c339d613953e4db5b41b8ab9ebda362f0ae201a26e26e7a127107bcae5cd96cd","observation_id":"2c455bc1-ad31-4b02-95a7-a0b167af67ec","resolution":{"observed_at":"2026-08-07T19:00:14.150164Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.11849/citation-record","integrity":"/paper/2401.11849/integrity","json":"/paper/2401.11849/citation-record.json","paper":"/paper/2401.11849"},"outbound":[],"paper":{"arxiv_id":"2401.11849","last_updated":"2024-10-31T11:33:24Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T00:10:48.357368Z","submitted_at":"2024-01-22T11:08:36Z","title":"Self-Labeling the Job Shop Scheduling Problem"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2401.11849."}