Pith. sign in

Paper Citation Record · LEDGER

Self-Labeling the Job Shop Scheduling Problem

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.11849.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2401.11849 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T05:42:38.959676Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T19:00:14.145156Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 5207b70e-e367-4f4c-8f6c-f850f21be6c8 · inbound

Self-Evaluation for Job-Shop Scheduling cites this paper.

Self-Evaluation for Job-Shop Scheduling Self-Labeling the Job Shop Scheduling Problem

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-08T05:42:38.959676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T05:42:38.959676Z digest=sha256:6fe4023a9afb11f9ec3023118b035edbd951705cabee34b1e0febfffe03d050c

Observation 2c455bc1-ad31-4b02-95a7-a0b167af67ec · inbound

Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding cites this paper.

Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding Self-Labeling the Job Shop Scheduling Problem

Reference 5

Resolution
metadata mismatch
local_arxiv, observed 2026-08-07T19:00:14.150164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T19:00:13.920831Z digest=sha256:8c2e9e704aa3b917eb5af7456a6a9bad1c2b839d07b3f2aac84747ca684a8186