{"as_of":"2026-08-07T19:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6aea895c217c8b5ae38b93e953a80d937b730f60bc040a8eb6efa0f77e92d9d8","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:13:07.973349Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.01086/citation-record","integrity":"/paper/2509.01086/integrity","json":"/paper/2509.01086/citation-record.json","paper":"/paper/2509.01086"},"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-05T13:13:53.011371Z","title":"Brief announcement: Green paging and parallel paging","venue":null,"work_id":"7064d8bc-772a-47b7-b6bf-047e1e0f3eed","year":2020},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.265931Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:10174e9d84ecee8951598efd3b249666afd94c7550958102f0eb58b6a1544520","observation_id":"5aa802ef-ac8e-4ec2-b61e-12b7d7febdaa","resolution":{"observed_at":"2026-08-05T13:13:53.078642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.857616Z","title":"Tight bounds of parallel paging and green paging","venue":null,"work_id":"5cb39347-4650-44d6-a645-2e2afe21bc08","year":2021},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.275552Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:9a9cecc19f42bbc971f8b774afc9d4994d1127b6f5dc7e5bd04917323e65e766","observation_id":"ba422c23-4716-4e1c-b609-69a81c41568a","resolution":{"observed_at":"2026-08-05T13:13:52.948405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.716392Z","title":"Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato","venue":null,"work_id":"e2e7d951-6ed6-4aab-a927-eead23cba417","year":2022},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.283807Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:fe64fe78dc689ccda26b722c9354f54daa6110526aa18ca43a16cc7466a96c34","observation_id":"306596c1-f573-424f-ad7a-7dc7c77b0b54","resolution":{"observed_at":"2026-08-05T13:13:52.774618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.569698Z","title":"Task scheduling techniques in cloud computing: A literature survey","venue":null,"work_id":"e2b64a4d-c53b-4e5d-b93b-a9d4f94627c6","year":2019},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.291089Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:2f2782cf81c2f73d3a801c1e9db45b772cb45d488867b39b8291bc31cb281805","observation_id":"92caf5e3-4d0a-4078-8b12-490533e58282","resolution":{"observed_at":"2026-08-05T13:13:52.614031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.435383Z","title":"Strip packing with precedence constraints and strip packing with release times","venue":null,"work_id":"9e1c0bd5-4ffc-4033-940c-0618673c9d7c","year":2006},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.306794Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:6147130d26b69ceb76b7924dbafec5070d401c707101fdc349ebe7dffce0a4e4","observation_id":"c3cf50cb-7cb9-4cb4-81d8-87d34619d665","resolution":{"observed_at":"2026-08-05T13:13:52.494953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.314233Z","title":"On-line scheduling with precedence constraints","venue":null,"work_id":"cee71edc-57db-4b7b-853a-e607f9bdadc2","year":2002},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.317891Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:a931666ce4927b48b21ab5684ba95b6cd78e0ffc8ddf78f74496d9417de13d70","observation_id":"786b5229-1e5c-4d25-8f6c-c2464f7f0801","resolution":{"observed_at":"2026-08-05T13:13:52.361099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.189074Z","title":"Shelf algorithms for two-dimensional packing problems","venue":null,"work_id":"21521be7-0a05-41f1-b9f7-c57067c8abf1","year":1983},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.330931Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:28d43e3a68581c3233a652ebf7ee9c8d1ebc8b140aae532e4a8d6a77c94f7675","observation_id":"0a5cff45-0033-424f-a1bf-b98ebce53602","resolution":{"observed_at":"2026-08-05T13:13:52.246313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:52.029563Z","title":"An approximate algorithm for the partitionable independent task scheduling problem","venue":null,"work_id":"a38e0bcf-40e6-43d5-9360-3367d9545f38","year":1990},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.342775Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:f2588725b243572a6571483f19e40fccffcb20928ffbd6eca2a5d586fbc0df8a","observation_id":"bf4110e2-42cb-4d20-84d3-a3553293ce05","resolution":{"observed_at":"2026-08-05T13:13:52.104962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:51.865051Z","title":"An approximation algorithm for the shortest common supersequence problem: an experimental analysis","venue":null,"work_id":"36682a4e-a7ad-4cfa-932f-418147e5ac96","year":2001},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.352952Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:ea9d24c8e3257ebf06a630110a93fc674809dc9fc9d871ca1df5f0f0e63b8327","observation_id":"0d0f9232-3a0e-49af-9f5f-f4d325e184c6","resolution":{"observed_at":"2026-08-05T13:13:51.920300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:51.703189Z","title":"Scheduling cilk multithreaded parallel programs on processors of different speeds","venue":null,"work_id":"ceef8ee5-3ce0-49f3-a161-4d38666c7cc7","year":2000},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.367628Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:77744286c40334186d214b097c4c3d48d70bf3b2f8f5ef366f673412f857e138","observation_id":"7dc428e0-64b5-4e88-a7e7-79864e2b9d22","resolution":{"observed_at":"2026-08-05T13:13:51.791819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:51.525957Z","title":"Hoard: A scalable memory allocator for multithreaded applications","venue":null,"work_id":"308e6506-2092-4e03-b946-f4bddc4ad3d3","year":2000},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.374825Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:aebdfc3232540fb9e616addee2497b9d77052da28c62014f382d2b94c4d5bb40","observation_id":"1d1cf30a-6b15-4659-a418-d8dbbd94f83e","resolution":{"observed_at":"2026-08-05T13:13:51.611368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:51.352033Z","title":"Bhatia, S","venue":null,"work_id":"57ee0913-a4c9-497e-95fe-275196871592","year":1995},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.383231Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:0a47eec1b8a8f7b5050840b9f90f1d5a929323705ec402c7facd3f16e38bec79","observation_id":"83d78cfc-5a66-42e0-98d0-ebdeb51228cf","resolution":{"observed_at":"2026-08-05T13:13:51.432589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:51.176090Z","title":"Cilk: An efficient multithreaded runtime system","venue":null,"work_id":"4e1f8e00-94b2-4214-9681-fa65567f713e","year":1995},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.407199Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:c87e793f90d5c7d8edecc14506c45510b5c8817582e1a14df5b2f573ace18634","observation_id":"0df02ac4-38cf-4ee0-9bdc-b3e26988b79e","resolution":{"observed_at":"2026-08-05T13:13:51.229991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.995822Z","title":"Space-efficient scheduling of multithreaded computations","venue":null,"work_id":"08b0af1a-bc48-4436-9ffb-d25dedec2840","year":1993},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.416070Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:ce0ab423649763ae40fc06decb4d85f3027ec5af53d37c899104660fbd1043d3","observation_id":"67a55c20-7e63-4124-b901-9c1e19840517","resolution":{"observed_at":"2026-08-05T13:13:51.070847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.726815Z","title":"Scheduling multithreaded computations by work stealing","venue":null,"work_id":"ca647960-a086-4ad2-8ccb-4c06832a6b9f","year":1999},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.422971Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:f8fd33246c3cf3677bb317d2af4a47c2802458c88d8f7abccf60444e1911cc19","observation_id":"231c6b30-1b30-41ef-a66f-21bd8a5c78ce","resolution":{"observed_at":"2026-08-05T13:13:50.831530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.580922Z","title":"Resource-constrained project scheduling: Notation, classification, models, and methods","venue":null,"work_id":"a1f6c139-1ecb-4860-b293-e528cede2645","year":1999},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.432529Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:b431b464e3bf3bd4c9fa168991083b7c8d888e67526a590a1a934731f55efc79","observation_id":"9f8fd24f-0f6f-4f54-8110-61714f73cd42","resolution":{"observed_at":"2026-08-05T13:13:50.645221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.409642Z","title":"On multidimensional packing problems","venue":null,"work_id":"512db842-7922-4ec4-b718-9c8e5ab94ee3","year":2004},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.441147Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:1089bfe0ebbd0a5d9ce9ae2c2b885d8f2ffbd3faa118a29d182f379b34226b42","observation_id":"3f04cf8c-2cf0-4b15-84cb-b356c4c8570c","resolution":{"observed_at":"2026-08-05T13:13:50.503990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.224235Z","title":"A 3.42-approximation algorithm for scheduling malleable tasks under precedence constraints","venue":null,"work_id":"e640333d-c733-47f8-bd35-fe494229da03","year":2013},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.447823Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:a470853db9a54cd4bebb7bc52eab180ce7e2e7c5d557404946d514eccbb02baf","observation_id":"224f1154-253b-4492-9ac5-e831bfab3983","resolution":{"observed_at":"2026-08-05T13:13:50.293252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:50.055223Z","title":"Approximation and online algorithms for multidimensional bin packing: A survey","venue":null,"work_id":"59444356-9573-4120-9adf-893ab5ac66f0","year":2017},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.454123Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:96f6d934ff206b29410f8e3ce16b1a52f4bdf3e7aaeb97ebddda9bdb2f8661d3","observation_id":"87c94f0c-b494-4e0e-b2f3-cb035e95e625","resolution":{"observed_at":"2026-08-05T13:13:50.111738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:05.464114Z","title":"Introduction to algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.464114Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:cefe4da6c0d73344e70d22a152ea457af3ce9ebd4ca7564ef21dd6370e02714a","observation_id":"4b34e116-c9fa-426f-aec4-929f9fdebef9","resolution":{"observed_at":"2026-08-05T13:13:05.464114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:49.932178Z","title":"Shelf algorithms for on-line strip packing","venue":null,"work_id":"24f0a728-2477-4971-a59e-c34144065f31","year":1997},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.472126Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:c2b49552ad2a755c75cb4ee20fbcdd3e077be9c97c262edc213c5633c6302aa8","observation_id":"b0d750d6-1826-48aa-9021-09855c21d107","resolution":{"observed_at":"2026-08-05T13:13:49.974260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.833952Z","title":"How to manage high-bandwidth memory automatically","venue":null,"work_id":"1e7cea14-51ad-42fe-a9cd-3099055aba4e","year":2020},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.483185Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:75d796e35f6720043ef95c514ae065ffb0ae95559c24e03e8c74ef79d4b966b9","observation_id":"52639df5-875a-4240-be01-dafa3a2d104e","resolution":{"observed_at":"2026-08-05T13:13:49.864905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.727308Z","title":"Approximation hardness of resource scheduling","venue":null,"work_id":"e463258a-0cfd-49ea-b4a3-4e159f1eb2ba","year":2025},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.491287Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:4d45de26337b86016322a45c93970708d759c075abbc44a7c2f721886f0fdd07","observation_id":"baabd87c-5234-4aa8-b26a-a8d96afa70d9","resolution":{"observed_at":"2026-08-05T13:13:49.779029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.645271Z","title":"Data races and the discrete resource-time tradeoff problem with resource reuse over paths","venue":null,"work_id":"c2769195-8903-453a-9f7e-12dac21500ad","year":2019},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.499589Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:2cd4f63d7478f3d3ac15538d014ecf078ab18023fd4b84db82ce953d7a314fd6","observation_id":"4cbc9d98-e1e5-4f94-8b61-fc9b9bc5672a","resolution":{"observed_at":"2026-08-05T13:13:49.682284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.566848Z","title":"Bender, Jonathan W","venue":null,"work_id":"f2033603-a11a-4712-be01-b656c26f9cfe","year":2022},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.510254Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:219216b9f03e47dc125962f5f294acd97ec149c02e3ba0724b256d2f600f96b3","observation_id":"ecd7e629-a301-4285-97d8-0f12577c46f6","resolution":{"observed_at":"2026-08-05T13:13:49.593239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.491097Z","title":"Approximation algorithms for scheduling with resource and precedence constraints","venue":null,"work_id":"d5a5b371-2ad9-440b-b0a7-96f3e25a4d9c","year":2018},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.521069Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:b60d345c6e9e24085e6ce6dce87c5c910c795734c980601f4d94929c15207936","observation_id":"d1c12ee9-edcb-43fc-8bf7-fe54d481585a","resolution":{"observed_at":"2026-08-05T13:13:49.513319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.411309Z","title":"Approximation algorithms for capacitated k-median and scheduling with resource and precedence constraints","venue":null,"work_id":"f7301392-3d75-4e18-9c82-9ace4f7a8a46","year":null},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.534734Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:d3e79973b71835636c1ee68d22364df83b969322e3eea4fcb095955e4f84eab6","observation_id":"2d505fa7-b416-484e-a25c-5bc696f09324","resolution":{"observed_at":"2026-08-05T13:13:49.445826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.298490Z","title":"Dynamic sharing of gpus in cloud systems","venue":null,"work_id":"a7de91e5-9534-4db5-a0e8-ea790e484857","year":2013},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.551546Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:34143d0845304a7916273e6bcc5e722650969ce968e02e7320fde9fd1d86a142","observation_id":"fff31e0d-1ba4-468c-8ddb-0ca6c037de56","resolution":{"observed_at":"2026-08-05T13:13:49.343255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.157039Z","title":null,"venue":null,"work_id":"2956a3cd-daa9-4c2e-afdc-7c9b24e9f30e","year":1989},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.573296Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:cc902f84c79a00502b423015a98c35d4fc24ec22d99f46c6e18b2ea5f722535e","observation_id":"927354b0-60b9-4af1-8f8f-f3dec17ce756","resolution":{"observed_at":"2026-08-05T13:13:49.261540Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:49.016682Z","title":"Lower bounds for on-line scheduling with precedence constraints on identical machines","venue":null,"work_id":"94c89caf-095b-4187-a2f6-06dc4887e985","year":1998},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.609585Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:fff5eca0e9fa776e4229109ff4bba65797cf70729b2db0fec46778f387471ae1","observation_id":"f8249c2a-77c7-4d1a-9215-75b17f265810","resolution":{"observed_at":"2026-08-05T13:13:49.106526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.837008Z","title":"A note on on-line scheduling with precedence constraints on identical machines","venue":null,"work_id":"44b71fd5-da0a-4ffe-84c5-73204e36eb89","year":2000},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.623180Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:a8bcdebae1bc2827b3dee46bf0f2b24ec08ce643527730e4163de90710edf9d0","observation_id":"49f6d5b7-5d50-4c99-ac3e-0ab931d5b594","resolution":{"observed_at":"2026-08-05T13:13:48.890978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.737010Z","title":"Optimal online scheduling of parallel jobs with dependencies","venue":null,"work_id":"b575aa77-b183-48a4-a537-8660f817dc0a","year":1993},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.649235Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:060c9adeaf3f0cc1f81c7324a6ef2b2276fb77b8b5414a46a73ad1427df5154f","observation_id":"6135099c-a544-4b22-818f-0367dc02aa1e","resolution":{"observed_at":"2026-08-05T13:13:48.791522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.616004Z","title":"The implementation of the cilk-5 multithreaded language","venue":null,"work_id":"a0c23ad3-ad10-4fbe-81d0-aa980ae2e77f","year":1998},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.664253Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:fb116b1c855d5cae62543fe98a6a7509481a0b7eff95d327f0f5105c52394b39","observation_id":"c6f1b327-53b3-4b92-9f46-47bfb9729951","resolution":{"observed_at":"2026-08-05T13:13:48.661012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.531395Z","title":null,"venue":null,"work_id":"1013a14e-0e42-40da-8140-62308d8aaa72","year":1975},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.680528Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:98651a6f8948f52b77a9e101f8a242c69c26b254db7973569b4c9d63054ebb73","observation_id":"3c5c8484-f1e6-484b-9d77-6317b8c10aa9","resolution":{"observed_at":"2026-08-05T13:13:48.580534Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.440826Z","title":"Improved approximation results on the shortest common supersequence problem","venue":null,"work_id":"943023e4-342c-4035-8f24-ef9b9ee19ead","year":2009},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.701337Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:e5cc2814b2d0e8067c09c141444a752ed68cb5450692480e8e5c0c13b41e1900","observation_id":"d6e91294-8c96-44bd-9c69-3fa8e8d944bc","resolution":{"observed_at":"2026-08-05T13:13:48.475692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.356242Z","title":"Bounds for certain multiprocessing anomalies","venue":null,"work_id":"d303f082-8f86-4ea0-a175-458f90a80fd4","year":1966},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.716582Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:2b0eaeed82698a6c1609d7a875523c54c3b91f4931634011decce22aab2dbb1b","observation_id":"8a30f0e2-12d6-4284-a67a-536a3c5b9982","resolution":{"observed_at":"2026-08-05T13:13:48.386394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.257303Z","title":"Scheduling to minimize average completion time: Off-line and on-line approximation algorithms","venue":null,"work_id":"669bd0a3-ea0d-4891-ac1e-1950dcee9c08","year":1997},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.733682Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:d5e5d8d2a98425b31013d55d0bb2bcb34cd57379264d71e5b2ce8c8a01f869e4","observation_id":"a4826cf8-03b8-4027-b2ee-32d99673be1a","resolution":{"observed_at":"2026-08-05T13:13:48.295108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:48.174605Z","title":"Strip packing vs","venue":null,"work_id":"18ae2624-9b98-474b-b1ee-c509e46fd8a0","year":2007},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.750324Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:3b7678880edf258d249bc10e70444202493e391f5be703597d1da7c384f92a9e","observation_id":"92b3daee-1b30-43fa-86b7-8d9bfe9a0a31","resolution":{"observed_at":"2026-08-05T13:13:48.210805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:47.983684Z","title":"Online algorithm for parallel job scheduling and strip packing","venue":null,"work_id":"c3346c6a-70a3-40be-9d76-41d8049c0515","year":2007},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.765216Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:dd8e259de9219ad892509f0ffbe3a20573e703dfbcf5c4790e7d4ea09400fc2e","observation_id":"6c9d22b9-e166-44ca-9e2c-7fdd1aeafd20","resolution":{"observed_at":"2026-08-05T13:13:48.091948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:16.966969Z","title":"Tight bounds for online vector scheduling","venue":null,"work_id":"f720b9e0-8a3e-4851-9b5e-705525b7ca9b","year":2015},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.785056Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:e2d39b7a727f030366cc2547e2829fc12f26c53c566a2f215762e6801ec29a87","observation_id":"ad93e69c-2f16-49ed-b04c-8d25bddff2bd","resolution":{"observed_at":"2026-08-05T13:13:47.935362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:15.029092Z","title":"Linear-time approximation schemes for scheduling malleable parallel tasks","venue":null,"work_id":"34807a5a-9bd6-4f96-8030-ea54a8cbe7a1","year":2002},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.862727Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:aa6ec1be9bd0575fa6f0fb91a6199eb7fbacfa94bd0bcbcf6edc6725ad9e1e8a","observation_id":"37d080b0-1e02-4e5a-884c-f3ce3a4f2895","resolution":{"observed_at":"2026-08-05T13:13:16.219777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:12.357964Z","title":"Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme","venue":null,"work_id":"4e992bb8-9538-4e2a-a18d-e0817c2deb51","year":2004},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:05.957848Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:c124374a6cc9facf49df4afa9a9151d946fc1a92e653c5060b8d139438f27cc7","observation_id":"4e7845cc-0edc-4198-a3cb-8d719c99015c","resolution":{"observed_at":"2026-08-05T13:13:13.344318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:12.060013Z","title":"Approximation schemes for machine scheduling with resource (in-) dependent processing times","venue":null,"work_id":"8b6eefcd-7aa9-4a03-808b-135064819927","year":2019},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.039323Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:4e07514b6d65f6d671c68135acb3cd1e310172feef96bc5cd69c0dc03bb642da","observation_id":"75c617de-d089-4778-830a-38ca32baafe2","resolution":{"observed_at":"2026-08-05T13:13:12.145633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:11.755602Z","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","venue":null,"work_id":"aed1835a-6e8c-4593-a0cf-c806f85c5517","year":2006},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.125299Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:b6f7af4af1c7dd8595ef915dab5fa44db462964e7b7eadb9ef23ee2e1644ed27","observation_id":"5da8c53e-c773-477c-9f8b-02c3ee9d49e4","resolution":{"observed_at":"2026-08-05T13:13:11.886825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:11.339230Z","title":"On the approximation of shortest common supersequences and longest common subsequences","venue":null,"work_id":"c7ed74a3-ada3-4dfc-849d-5242460caa67","year":1995},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.181936Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:e0a58904fe03b3f5dcf7304fdfc56cc91fbd5e1f081f790b9d86cbc50fcb64e6","observation_id":"0e2753d9-0815-4e3e-baf3-72c523f217bf","resolution":{"observed_at":"2026-08-05T13:13:11.562259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:11.140772Z","title":"Scheduling tasks with precedence constraints on hybrid multi-core machines","venue":null,"work_id":"2fd3af83-77ec-4846-b5f7-cfab878e40d5","year":2015},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.233944Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:88a66650c7efec6ea66a5457deca6b7eab75a69bf7064df9406cae2a3164a1f5","observation_id":"6328196a-6586-432e-8d4a-4f851fcb74a3","resolution":{"observed_at":"2026-08-05T13:13:11.203826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:11.005261Z","title":"An integrated survey of deterministic project scheduling","venue":null,"work_id":"5f2833ce-de22-4835-854c-af3ca11f1aff","year":2001},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.332179Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:7712c07742844de15ba3f420ca1be5967a5070b134b81f84c4157b25a8db5485","observation_id":"c1e00369-8849-433f-9079-45838a32e5a4","resolution":{"observed_at":"2026-08-05T13:13:11.090974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:10.792195Z","title":"Minimalistic predictions to schedule jobs with online precedence constraints","venue":null,"work_id":"f7678fdf-6cd1-47d4-a6b4-fedfe9a769d4","year":2023},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.408650Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:7f1e6595f1d53100c95b5779fed672297c73407922aeca234dec1a99d9c28816","observation_id":"10693a1d-e9bc-4419-9dcd-7236caf61716","resolution":{"observed_at":"2026-08-05T13:13:10.882831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:10.612587Z","title":null,"venue":null,"work_id":"15678c42-0efe-48ea-a043-8ec69b287909","year":1978},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.491126Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:26e6ff2213a3e7760b2544d8b24ff8f2c1bfd7773bc12990facb0103fab7c268","observation_id":"68443b60-12e1-48ff-9a79-ac953ee0507e","resolution":{"observed_at":"2026-08-05T13:13:10.684952Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:10.474938Z","title":"An approximation algorithm for scheduling trees of malleable tasks","venue":null,"work_id":"8bf0d846-3408-435b-8a39-4fb2b8707f80","year":2002},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.577269Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:45d1099f18de51a82423eca3731a985642553c77358564df6d0d9453484c143e","observation_id":"ca018e10-da3b-4dcf-b4d7-588c9f0cafe9","resolution":{"observed_at":"2026-08-05T13:13:10.525451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:10.312159Z","title":"Scheduling malleable and nonmalleable parallel tasks","venue":null,"work_id":"2c0b12fd-856c-4c83-89e6-28674684d2ce","year":1994},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.668856Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:9460aff41f75a8e628b08374d68e4dcacda6e7c2b46f72a967f611c0f8e7ae0f","observation_id":"cb0ff80e-9048-48a5-a6cb-ceb191662bc4","resolution":{"observed_at":"2026-08-05T13:13:10.376429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:10.150201Z","title":"(acyclic) job shops are hard to approximate","venue":null,"work_id":"91769b78-6aed-4dac-88bc-862b88f874c8","year":2008},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.745799Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:f3b87842b2afaccbdb6544e1a4171143d05ff1721a010d78ea744f17b3a72e31","observation_id":"26ce4dd3-6d8f-42cb-ba4f-4ab14658a587","resolution":{"observed_at":"2026-08-05T13:13:10.226061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.978848Z","title":"Stochastic online scheduling with precedence constraints","venue":null,"work_id":"93952213-87e9-498e-a306-4dec68d2f68e","year":2009},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.808218Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:0b6ea50d98a0fc264e8290e8ff311777dde69952a668bef09936873ab5d05df3","observation_id":"06afba35-f0da-45f5-ac2b-1ca00d5b9795","resolution":{"observed_at":"2026-08-05T13:13:10.056001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.810252Z","title":"Randomized algorithms","venue":null,"work_id":"3bc0955a-f315-4586-a469-f37849b5365e","year":1995},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.900744Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:0a890c6964d13f23129314adc5dea51ce7d06653141882bf706202fe1a55311a","observation_id":"1cd465e4-8d3f-4c84-b9f6-bc6db5d7da09","resolution":{"observed_at":"2026-08-05T13:13:09.880542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.705096Z","title":"Efficient approximation algorithms for scheduling malleable tasks","venue":null,"work_id":"6fae25fd-4fc9-4e5b-9a4b-239328845a93","year":1999},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:06.982838Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:efd65e31a19cc20d3cc53317f3e096bd4d6fd0fc93d60d940471a77d2cb92768","observation_id":"30843fc6-9675-482a-927c-27db71c301ba","resolution":{"observed_at":"2026-08-05T13:13:09.742278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.567377Z","title":"Scheduling with an orthogonal resource constraint","venue":null,"work_id":"6a921fb9-71e6-46a6-a99b-00a0162c33d5","year":2015},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.060357Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:5108556a3e2f20983a81a3f86c9bb35ae4e85be5bb1808d1f7f811405d7f9dcb","observation_id":"cb0e1a1d-1e55-4906-a7e9-4049c9403903","resolution":{"observed_at":"2026-08-05T13:13:09.614065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.401331Z","title":"Duella P","venue":null,"work_id":"2ed73288-e74e-4307-b9ab-cc003023328a","year":null},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.165723Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:2606ba3a51daa860eeeb33fb9da6a82c6e9e6d8dd06746c33f50f92980d6321a","observation_id":"2d93d51d-f689-454c-9a89-7e140c59ed61","resolution":{"observed_at":"2026-08-05T13:13:09.469558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.217189Z","title":"Multi-resource list scheduling of moldable parallel jobs under precedence constraints","venue":null,"work_id":"0d321a78-2739-4e6c-8bee-792e1420e4e8","year":2021},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.294031Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:9492d3c97f5860c95a2ffc06db8b7a6f1a9fb944ee05e061503de9801a68dd40","observation_id":"4955fd7d-fe8e-476d-b662-6671b5271483","resolution":{"observed_at":"2026-08-05T13:13:09.277965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:09.026197Z","title":"A new algorithm for online scheduling of rigid task graphs with near-optimal competitive ratio","venue":null,"work_id":"94554f42-b90a-4842-b394-d6ce876c866e","year":2025},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.387966Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:c5b733d69af12d41057833b1f67c8bcf29baeee44473c5468f70b66a40d10438","observation_id":"2be7c19b-d462-488a-b311-3562e883d854","resolution":{"observed_at":"2026-08-05T13:13:09.106204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.891108Z","title":"Approximation bounds for a general class of precedence constrained parallel machine scheduling problems","venue":null,"work_id":"636d0578-2060-4c60-bc35-9339650555e9","year":2006},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.479246Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:85cffdae4fbe61ff5de9dd0909f8ab8e7bf0eb3244cca1296daa5761b076d765","observation_id":"c147b370-52ac-4b11-919f-5d6b4dae5928","resolution":{"observed_at":"2026-08-05T13:13:08.950351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.764923Z","title":"The shortest common supersequence problem over binary alphabet is np-complete","venue":null,"work_id":"e8ff34bd-f84c-45e0-88c9-f44463704c25","year":1981},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.592218Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:3b739b7a83f2e5050582654da6a8f65efa6272029fae3a2f91e7745986302194","observation_id":"ed8ef870-d266-4425-92a4-2c2ba9b7dddb","resolution":{"observed_at":"2026-08-05T13:13:08.816271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.650988Z","title":"Scalable locality-conscious multithreaded memory allocation","venue":null,"work_id":"54b11060-1d54-481a-81bb-60dcda15b897","year":2006},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.677765Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:f956f8ab2c6b1b3379bce6a88df8791846eed65f098d1144cdc4c42d1bdb64dd","observation_id":"dd5efe37-8cde-403c-b064-37832d78ec94","resolution":{"observed_at":"2026-08-05T13:13:08.697082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.527316Z","title":"Conditional hardness of precedence constrained scheduling on identical machines","venue":null,"work_id":"6128815f-8cce-4ca4-8e96-4f0e10b7f8a9","year":2010},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.756704Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:f2f0216ab7c53ffcf11ced4a920485b28bd36d086b86c177443c5f596fe5535f","observation_id":"459c38da-6453-4573-9916-0d0df319a0bf","resolution":{"observed_at":"2026-08-05T13:13:08.582394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.370619Z","title":"Introduction to cloud computing","venue":null,"work_id":"a3777c8f-a8ed-44dc-bcf0-6deffc5852c5","year":2011},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.831368Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:40abe89ae2a965acb7d14e38c62e384ec3663c574e2bdf83f506e94bf2440b8f","observation_id":"d7877185-4e1e-420f-8e88-3c9a56fbcb6f","resolution":{"observed_at":"2026-08-05T13:13:08.442262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.237317Z","title":"A note on online strip packing","venue":null,"work_id":"69caae77-a3e4-45e6-a467-0b9a62a52fc9","year":2009},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.893411Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:7261f9f81bc15be401daa0fb489a7d78f5c6ec4fc28c5c61e039fb86f5c6b020","observation_id":"af7bf085-339a-4038-bdd5-7488d5dd64ad","resolution":{"observed_at":"2026-08-05T13:13:08.273758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T13:13:08.094135Z","title":"Multimedia cloud computing","venue":null,"work_id":"dc34cead-e058-4c30-a078-e14408e5a766","year":2011},"citing_paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T13:13:07.973349Z"},"links":{"citing_paper":"/paper/2509.01086"},"observation_digest":"sha256:c2cb34bfbc57e0c8c95bb8abf72c9d077b46ed441b58bca22601d9b86ed1f1ab","observation_id":"d89a1ca8-c91a-46bb-baee-e8f20eeee0f5","resolution":{"observed_at":"2026-08-05T13:13:08.154576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.01086","last_updated":"2025-09-01T03:18:20Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T16:10:15.020480Z","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":62},"total_outbound_references":66},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2509.01086."}