{"as_of":"2026-08-16T13:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31a67ad05918f1450eb9df1e32df3fdeb6052d25554b0c5b8ab26460e012c903","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:43:25.896449Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:19:09.964173Z","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-07T06:16:28.064256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"cited_work":{"arxiv_id":"2501.04859","doi":"10.48550/arxiv.2501.04859","metadata_source":"pith","pith_arxiv_id":"2501.04859","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","venue":"cs.DS","work_id":"61a985bb-55b9-471b-97c1-f46a1686704b","year":2025},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.964173Z"},"links":{"cited_paper":"/paper/2501.04859","citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:5634fbb386d74352a21aed903125e73b02ff36baccd70a860b0c05cfc639e14c","observation_id":"8cbd87bb-cee5-4f1e-a725-c4710c4c4674","resolution":{"observed_at":"2026-08-06T20:19:10.749803Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.04859/citation-record","integrity":"/paper/2501.04859/integrity","json":"/paper/2501.04859/citation-record.json","paper":"/paper/2501.04859"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:27.288550Z","title":"Knapsack with small items in near-quadr atic time","venue":null,"work_id":"c5952eab-ba59-4d1a-9e6f-b1429bf1abb0","year":2024},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.429727Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:e5a5437e0c706edc05ecc441dffb3381e59a8c0ea4dc761f36c6c64e38d2114a","observation_id":"3f7e493f-db70-4eaa-a738-e36d3bf22a83","resolution":{"observed_at":"2026-08-10T21:43:27.297758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01741","last_updated":"2024-09-23T13:50:32Z","snapshot_observed_at":"2026-08-16T11:26:13.557240Z","submitted_at":"2022-03-03T14:33:45Z","title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","version":2},"cited_work":{"arxiv_id":"2203.01741","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.01741","snapshot_observed_at":"2026-08-10T21:43:26.226812Z","title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","venue":"cs.DS","work_id":"d968b202-1fd1-4547-adb5-b4e60cac2fe3","year":2022},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.457909Z"},"links":{"cited_paper":"/paper/2203.01741","citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:f05c551f002e08fbe561044c673c474469863c90e7d6c7194e4bfd86401e46a1","observation_id":"8b94cbc7-1ad4-41ef-8b2b-a25995d23250","resolution":{"observed_at":"2026-08-10T21:43:26.235263Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:27.246566Z","title":"On the optima lity of approx- imation schemes for the classical scheduling problem","venue":null,"work_id":"6403ccf7-291c-4399-a971-21561e7c1f44","year":2014},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.466069Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:1876871d93304e096705000c90b0bb666155059a3ed37754929781e6b2bd325f","observation_id":"213a85c6-bebf-4ef7-80e7-42b62fbeaf0c","resolution":{"observed_at":"2026-08-10T21:43:27.267013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:27.171443Z","title":"Fas ter algorithms for bounded knapsack and bounded subset sum via fine-grained pro ximity results","venue":null,"work_id":"bd2a872e-a5cb-4483-b6ab-90c253b29aef","year":2024},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.471024Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:653ad86c7fd8f7725775de8d67beb00fa4ca257994c1f86306eae333faa64757","observation_id":"5cc9e839-fcaf-4ad2-9628-53631e839a66","resolution":{"observed_at":"2026-08-10T21:43:27.197856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:27.005724Z","title":"Block-structured integer and linear program- ming in strongly polynomial and near linear time","venue":null,"work_id":"09368180-755b-40a2-b650-89fa45b7c17f","year":2021},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.517170Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:9202e93fb58d9e8e86547be2cf016f31ff3b9aff9b94fe0671b3c69ec8feada1","observation_id":"cefa586d-e344-4deb-90e2-f2a14da988de","resolution":{"observed_at":"2026-08-10T21:43:27.083053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.974173Z","title":"Proximity results and faster al- gorithms for integer programming using the steinitz lemma","venue":null,"work_id":"d20e530a-6af1-443e-a86a-f47b19d5e9cc","year":2019},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.556799Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:f978092e1a936479d7afded61827be82d23b0a39da7a318ec3e36a1621cd81c8","observation_id":"2167da3a-755b-414a-9d76-68efbd5ee5a3","resolution":{"observed_at":"2026-08-10T21:43:26.979209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.958002Z","title":"Polynomiality for b in packing with a constant number of item types","venue":null,"work_id":"4efdec55-64d1-44c7-ac35-8dce09f910f9","year":2020},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.623800Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:d33f7def192208a12e0458da5d813a18a908b575913ec6b3b31f3a31a4f8f133","observation_id":"04d3e626-935a-49ad-81b8-06ee1bb61f4d","resolution":{"observed_at":"2026-08-10T21:43:26.962960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.898240Z","title":"An eptas for scheduling jobs on uniform pro cessors: using an milp relaxation with a constant number of integral variable s","venue":null,"work_id":"ba9b45c6-203b-4889-bb61-19fdd452cb43","year":2010},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.670909Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:81bbab0d26387f499b036910b375322a82c8c7776934ec64a15588088a18ccb4","observation_id":"09af0118-ffb9-4804-9d50-9aa3040d668f","resolution":{"observed_at":"2026-08-10T21:43:26.945899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.04212","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.161145Z","title":"Improving the parameter dependency for high-multiplicity scheduling on uniform machines","venue":null,"work_id":"0cd206dc-1ce8-4110-8a99-610e970e2f9c","year":2024},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.705563Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:cedccdb38b3a7bc2d20aad19cdee20e97d0c4584ecda092d317a1376ec5a7a42","observation_id":"b9aedec1-755f-4c87-9aa3-8c25919b0661","resolution":{"observed_at":"2026-08-10T21:43:26.197220Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.778577Z","title":"Clo sing the gap for makespan scheduling via sparsification techniques","venue":null,"work_id":"adac80b4-00a8-4cd6-abb3-ce55884c9882","year":2020},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.747021Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:e7e067d4fd420df79965d255170f9ce6a2022d9b3aad7c80ad6cb26980e58efc","observation_id":"48947684-a491-4d97-ba83-e551c9e33461","resolution":{"observed_at":"2026-08-10T21:43:26.854699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.612166Z","title":"On integer programmin g, discrepancy, and convolution","venue":null,"work_id":"1f31ff90-f2a4-465f-9784-109a90770b90","year":2023},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.754598Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:9f76944b6b5acbcb4f121c63a9dd1a5ee0c33bc9b8cb2d3fcd906ae0475e4766","observation_id":"e6ee1d8b-0974-40d0-9925-115e0dbf9c46","resolution":{"observed_at":"2026-08-10T21:43:26.694245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.580567Z","title":"0-1 knapsack in nearly quadratic time","venue":null,"work_id":"70c4330b-a905-475f-9e81-21293eef59b8","year":2024},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.763814Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:5dc055fd80c49b8d777bad553a61a6963f2f66ae9c6c25f4c54ecd321d51b46d","observation_id":"162885dc-9744-423c-9063-7132dc513531","resolution":{"observed_at":"2026-08-10T21:43:26.586050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.563304Z","title":"Scheduling meets n-fol d integer program- ming","venue":null,"work_id":"6b7d2302-e70b-4693-bda5-a834d5a644bf","year":2018},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.770009Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:86864484eff9bea28764a354ecdea9e46b51e0131ae9a350b5f9ae03c17ec83f","observation_id":"2fa829c7-12df-468c-aeee-a0998b64a579","resolution":{"observed_at":"2026-08-10T21:43:26.568413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.522999Z","title":"Complexity of sched uling few types of jobs on related and unrelated machines","venue":null,"work_id":"d71c87f2-39db-4376-960b-555db5dc7fa6","year":2020},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.783591Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:befcce26e3488298df312d7017788a97d4e075475166891a00a38634f54152cd","observation_id":"c967fd03-0dd1-4c29-bc65-92f708a74b96","resolution":{"observed_at":"2026-08-10T21:43:26.540127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.433717Z","title":"Scheduling and fixed- parameter tractabil- ity","venue":null,"work_id":"19f894dd-266d-4d44-96f8-e9ca17fa69f2","year":2015},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.788480Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:038618dc6f0837b916bf103e61897cb2240391f83a056e358e5f1ef688344252","observation_id":"21594b91-e5b4-410b-bc10-a61c5dd167e6","resolution":{"observed_at":"2026-08-10T21:43:26.497609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.415734Z","title":"Knaps ack and subset sum with small items","venue":null,"work_id":"1f5d3bca-8507-4f6d-97ed-cb9578e674e0","year":2021},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.795205Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:3c09c07de66266b1b813720fb234108d1d0418cb320e29b761d919d92aad9034","observation_id":"6bde9937-c232-4581-b5b7-b7f4856fa238","resolution":{"observed_at":"2026-08-10T21:43:26.420771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.362184Z","title":"Fine-grained equi valence for problems related to integer linear programming","venue":null,"work_id":"90661f51-a3b5-47a2-9d94-1dec0f3d57f7","year":2025},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.824698Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:fe6b0d883c31ed41932cc4438062ff07510fb9c6ee403563d516ff951a95f791","observation_id":"595b50a8-8f75-4105-a771-1615dca2b025","resolution":{"observed_at":"2026-08-10T21:43:26.389333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:43:26.249857Z","title":"Approximate solution of some problems of scheduling theory","venue":null,"work_id":"4cb0d1e2-9fa6-4131-8bb8-7f1236d0ab0b","year":1978},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.896449Z"},"links":{"citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:e8e561ea600814c1d1e278457dd49762836ee5f23d31df61bd2bae0ebfeb509f","observation_id":"e42b59ef-d57a-42c4-a537-f31046dceaee","resolution":{"observed_at":"2026-08-10T21:43:26.287897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":16},"total_outbound_references":18},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2501.04859."}