Pith. sign in

Paper Citation Record · LEDGER

Faster Minimization of Total Weighted Completion Time on Parallel Machines

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

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

pith.paper-citation-record.v1
2502.13631 v1

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-19T06:32:44.657259+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-16T00:31:35.754759Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T12:20:22.473884Z

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 dd7f26dd-4c47-4625-8412-7decf0239e90 · inbound

Lawler-Moore Speedups via Additive Combinatorics cites this paper.

Lawler-Moore Speedups via Additive Combinatorics Faster Minimization of Total Weighted Completion Time on Parallel Machines

Reference 14

Resolution
verified exact
arxiv_id, observed 2026-05-10T12:20:22.475386Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-10T12:20:02.378014Z digest=sha256:b1af8cbdbe826570b23bfa642db61640cf2309bbacd0abbdb59aff82c7f76e8f

Observation af710169-4156-49a2-8bd8-214162943e77 · inbound

Faster Exponential Algorithms for Multi-Machine Scheduling Problems cites this paper.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Faster Minimization of Total Weighted Completion Time on Parallel Machines

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-16T00:31:35.754759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:31:35.754759Z digest=sha256:a8a4409e33b1368d22640e49f0fead55026ecd66850466482d7fdec023619b82