{"as_of":"2026-08-19T05:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97b3e73c353a85c9ab5f8f0d25dce236278394fbb0c66da3179d872faba4cee6","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:31:35.825460Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2608.12224/citation-record","integrity":"/paper/2608.12224/integrity","json":"/paper/2608.12224/citation-record.json","paper":"/paper/2608.12224"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2022.01.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.137829Z","title":"Scheduling lower bounds via AND subset sum","venue":null,"work_id":"e4493651-7900-4a59-a7dc-1e303e054a0c","year":2022},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.669099Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:5982bb38aad0cda8e7073923bc2795bf1b3768e44678a2579dc75631cbf731c5","observation_id":"1252de4e-b642-43d7-94c1-eb45e49055a8","resolution":{"observed_at":"2026-08-16T00:31:36.142405Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.675644Z","title":"Fast deterministic chromatic number under the asymptotic rank conjecture","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.675644Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3916bd97c3ead2eef7c314e9e8fd099f07212b8f77ac0dd65dd38551620113b6","observation_id":"fb46af24-7f53-417a-9537-fe5e5c576e1b","resolution":{"observed_at":"2026-08-16T00:31:35.675644Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.680622Z","title":"o rklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets M \\","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.680622Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:708c77b1ae87cbaf9f94ad950c5de60859d56baeb9fed16efb95a30433029b9c","observation_id":"fcedd87e-c67d-4f85-8f51-516da9e64b49","resolution":{"observed_at":"2026-08-16T00:31:35.680622Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.685953Z","title":"Set partitioning via inclusion-exclusion","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.685953Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:05e65ad323d2704f5896b4a28347d88819b869027d343f763d7e84ea7f3ce5f9","observation_id":"b377a0e6-6af8-4e03-b4a3-438edb0626bd","resolution":{"observed_at":"2026-08-16T00:31:35.685953Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.691330Z","title":"The asymptotic rank conjecture and the set cover conjecture are not both true","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.691330Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:a77e5bf4225e35b307f9dfe792e5d165b6ad51cbe55362256c9a84dd5b232610","observation_id":"388e94e2-3b8b-4c4b-9b0e-ad9ecb2dd738","resolution":{"observed_at":"2026-08-16T00:31:35.691330Z","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":"10.4230/lipics.icalp.2026.36","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.766199Z","title":"Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms","venue":null,"work_id":"f1a9771c-4aa0-438b-ba51-f5054b861778","year":2026},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.695170Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:e0bf3339c8cab9ed492e2a3931898d8ffd822036dedbdd5959f04dea97139393","observation_id":"d4b854c3-1989-4738-8048-8f1ad928b7b1","resolution":{"observed_at":"2026-08-16T00:31:36.769855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978964.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.111079Z","title":"Faster convolutions: Yates and strassen revisited","venue":null,"work_id":"83b1a0b2-ea29-4b5e-8246-bad18976b345","year":2026},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.699077Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:1de6e25c596eee3b5693270d10be4502df962c59ce852f9daba7d96113b45002","observation_id":"4d77a65e-a7fe-416f-b411-bd4b4161a741","resolution":{"observed_at":"2026-08-16T00:31:36.114624Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.703139Z","title":"Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.703139Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:984ee2e1a3e73b9acf82f6605e41c0ab4670faa491fc43ab84c859e4d8884920","observation_id":"fddbb453-a51e-4e23-8526-7a374ddc64c4","resolution":{"observed_at":"2026-08-16T00:31:35.703139Z","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":"10.1007/s00453-022-00928-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Faster minimization of tardy processing time on a single machine","venue":"Algorithmica","work_id":"8d121320-5d85-48e8-97ae-4ab2e5c5e93b","year":2022},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.707312Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3fec8b3e0bab2eb803bcd8921ff5091587cf1f074ca525d954d92ca7d6cbff12","observation_id":"a6bbfc8e-92b4-4ccc-97bb-f077754d52ef","resolution":{"observed_at":"2026-08-16T00:31:36.103822Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.711359Z","title":"Bruno, Edward G","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.711359Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:6dbf142337100fce8a1853aaef0bb892b156fcda2178314e9828d5d89f3408d8","observation_id":"581281b5-cc55-4d05-873e-68d3d17e1360","resolution":{"observed_at":"2026-08-16T00:31:35.711359Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.714923Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.714923Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:844b7b0518f5d029df2f1723502bcfb635fa2008f72fc887231889e9aa2d68f2","observation_id":"74064143-28f5-4164-85a2-288c26bd112b","resolution":{"observed_at":"2026-08-16T00:31:35.714923Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.718698Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.718698Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:5234e6f2026cad50fc0cd33ce7829ddcf353e8cedc39aef2960864a45e61c188","observation_id":"13b6168f-76b0-466b-8891-c5c23cb85b93","resolution":{"observed_at":"2026-08-16T00:31:35.718698Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.722389Z","title":"Cover and Joy A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.722389Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3f99cc1f5ba9d0061749a9702160197da74911dfc8635e7dc010987c8ab7e7a7","observation_id":"94aedbf7-c98b-4424-9465-d7b0b8808789","resolution":{"observed_at":"2026-08-16T00:31:35.722389Z","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":"10.1287/moor.15.3.483","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.074916Z","title":null,"venue":null,"work_id":"2323cc1c-fe2c-4cfe-a6a7-9af527e03d16","year":1990},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.726702Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:cea089e606990c7676c154871ce6122fca0f3c33e90e54839b52f430178099e0","observation_id":"bb925632-4e51-4c8c-98d5-b37f5b206ead","resolution":{"observed_at":"2026-08-16T00:31:36.078986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2026.85","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.062346Z","title":"Faster Algorithms for k-Orthogonal Vectors in Low Dimension","venue":null,"work_id":"96e2826e-2d1c-482c-aad2-1c8f1600e50d","year":2026},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.730872Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:c531da37b4d8bca14f9ed44dd6496e1565105bd4e8bcbca66480e5144500233f","observation_id":"241b2dc5-8c47-4836-a7de-2eba32bfd1b7","resolution":{"observed_at":"2026-08-16T00:31:36.067053Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/theoretics.25.14","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.049745Z","title":"Minimizing tardy processing time on a single machine in near-linear time","venue":null,"work_id":"1e968180-942f-4234-bceb-3d439d940815","year":2025},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.734806Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:0770a08bc65a747a6c9c176bf925ed7f215a26d67a89c9eae7360320fda70442","observation_id":"a2367b8f-ea98-4912-9ef1-240e64db70db","resolution":{"observed_at":"2026-08-16T00:31:36.054213Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0166-218x(81)90008-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.037309Z","title":"Fast approximation algorithm for job sequencing with deadlines","venue":null,"work_id":"30173a2f-c77b-4634-a669-659ca6da8290","year":1981},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.738607Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:b58d39bed21282d9a1495670a5c2673f2b162bb3f3ed5fa2f6ab972e1045f93c","observation_id":"5c7e3ca7-e836-4f2f-8b17-1d43d77e9f9c","resolution":{"observed_at":"2026-08-16T00:31:36.041636Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.742500Z","title":"Graham, Eugene L","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.742500Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:580bfafd26a63d3f9986f8d1449d49b97a04bd96be59774f4664f8e920e3fdf7","observation_id":"2e59b92a-c8b2-4927-bdfc-f3be7b70eb7b","resolution":{"observed_at":"2026-08-16T00:31:35.742500Z","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":"10.1016/0304-3975(87)90101-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.016849Z","title":"Guibas, Jorge Stolfi, and Kenneth L","venue":null,"work_id":"452ddd3d-e443-4d78-8d72-da3effafad0f","year":1987},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.746262Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:664bcb3b0c7bedf799ddb99b870b123e0e355d6cac8a71720a044da4a360cf03","observation_id":"7e1717af-49e1-4cd2-a75e-371b1d2d1cf4","resolution":{"observed_at":"2026-08-16T00:31:36.020879Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2024.68","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.004649Z","title":"Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard","venue":null,"work_id":"9b12bc2e-dd20-47d0-8ffd-8284ba83cf68","year":2024},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.750155Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:5674d4f642cadf70c44f255ad55239e46fdcd5bd76df9d1710f673e9aa7402f6","observation_id":"3b900fb3-e74b-4e03-979f-8392bed15ab9","resolution":{"observed_at":"2026-08-16T00:31:36.008752Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13631","last_updated":"2025-02-19T11:09:35Z","snapshot_observed_at":"2026-08-16T12:57:01.650291Z","submitted_at":"2025-02-19T11:09:35Z","title":"Faster Minimization of Total Weighted Completion Time on Parallel Machines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13631","snapshot_observed_at":"2026-08-16T00:31:35.754759Z","title":"Faster minimization of total weighted completion time on parallel machines","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.754759Z"},"links":{"cited_paper":"/paper/2502.13631","citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:67dee11953f49514d53c27642329be3b8ada46469bb347f1789401dd6404d0f7","observation_id":"af710169-4156-49a2-8bd8-214162943e77","resolution":{"observed_at":"2026-08-16T00:31:35.754759Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.759301Z","title":"Minimizing the weighted number of tardy jobs via (max,+)-convolutions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.759301Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:e003c637cf78b0e2514e2e65c75482dc7b24bc63c6044c8b5b947d02c5fb968e","observation_id":"eab214d6-797b-48e7-94c1-aac31d0184ce","resolution":{"observed_at":"2026-08-16T00:31:35.759301Z","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":"10.1137/140952636","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.979934Z","title":"Bounding the running time of algorithms for scheduling and packing problems","venue":null,"work_id":"2dbaee24-f8a8-46d5-8b01-f70e21f7ae4a","year":2016},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.763043Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:fbca4db98da9decc1c5f1a7afaf8c5d41e1dca45c470f09624b230e854ae4721","observation_id":"a7309a04-27a9-4ed1-9105-1bfa06f7a0eb","resolution":{"observed_at":"2026-08-16T00:31:35.984255Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.767023Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.767023Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:803c1225b2a2ef22c8219e3792307de2d58772dc99e0de47122720e08cea06fe","observation_id":"c9774428-f9c6-4d85-9baf-cc975e67d571","resolution":{"observed_at":"2026-08-16T00:31:35.767023Z","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":"10.1137/1.9781611977554.ch112","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.957401Z","title":"On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs","venue":null,"work_id":"3b8d4a38-28e5-4a18-bd8d-ac840e3f4b68","year":2023},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.770496Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:eb47e7d583d2a27e0f8fd5ac780509c7dcf2169bc5b49d294394e858a09a03b8","observation_id":"ceee7f23-ae2a-4339-b3ce-deca9f70cf1b","resolution":{"observed_at":"2026-08-16T00:31:35.962010Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.773663Z","title":"Scheduling meets n-fold integer programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.773663Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:9a47ecdde01ea175c32fe3df5a24f0d835688ace0c0b628bbe2aaa8b24329d63","observation_id":"2071f7f1-4488-4352-8ffc-cebab3bd4a26","resolution":{"observed_at":"2026-08-16T00:31:35.773663Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.776659Z","title":"Lawler, Jan Karel Lenstra, Alexander H","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.776659Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:0d3d73b1ac79f54eb30b66340a3492f71924e51e5750e95f8866e2d829780933","observation_id":"8a8a3357-f582-494d-a4b9-aaa7087ed548","resolution":{"observed_at":"2026-08-16T00:31:35.776659Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.780174Z","title":"Lawler and J","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.780174Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:4ee0a6a14fc91f057b12921e001b10e7441ffa4be96f4a35195fed672ec3a278","observation_id":"5b7dafe5-f188-42aa-84bc-1023aa88dc20","resolution":{"observed_at":"2026-08-16T00:31:35.780174Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.784034Z","title":"Lenstra, A.H.G","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.784034Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:77c4acb9f545657a697781b981be7c2d5894eb64f1c82c57781004d5c33f4a6b","observation_id":"a2bf1b0a-2e4b-4136-870a-a25f66b7d6e3","resolution":{"observed_at":"2026-08-16T00:31:35.784034Z","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-16T00:31:36.752462Z","title":"Exponential algorithms for scheduling problems","venue":null,"work_id":"b8fc5a2b-b445-4be9-bf3e-6e699c27b411","year":2014},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.787371Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:5e6adb144b5cede07a562d60db2f1fbcef52838a1c54abdf6ef725fab50a0985","observation_id":"4bc64171-8a62-470c-be87-0e2a87a4563f","resolution":{"observed_at":"2026-08-16T00:31:36.756530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/mnsc.16.5.295","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.917548Z","title":null,"venue":null,"work_id":"bebd02b2-08d2-4b5f-8071-bdd0af485931","year":1970},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.791031Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:1e5e6636f93b9236a7cc1c179fd5dd9a6d42ee0e762381b249ed504c7c8a8ce5","observation_id":"5c1d7341-3f20-46bf-ba5b-d71812265529","resolution":{"observed_at":"2026-08-16T00:31:35.921179Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/mnsc.15.1.102","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.905543Z","title":"Michael Moore","venue":null,"work_id":"6878458d-90a9-4ede-a035-9101e2a8e8ed","year":1968},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.794738Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:4b71d14dea8e2c75d25d8f98e5fdeca6ca38b8f25621754864ffd9cf5e541dae","observation_id":"feb3d258-864b-40c5-bc4b-1267defea449","resolution":{"observed_at":"2026-08-16T00:31:35.909438Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2016.69","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.893648Z","title":"Finding large set covers faster via the representation method","venue":null,"work_id":"30dc188a-8e07-4c31-94f8-b88c7c4e84e3","year":2016},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.798368Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:f3fd13576066416d4f7ba0c9f82d821ba560231c9eda1ef29952cc5672a9b4c4","observation_id":"19bd15b7-f72c-406c-8a1d-678132536d84","resolution":{"observed_at":"2026-08-16T00:31:35.898074Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.802282Z","title":"Fine-grained complexity of NP -complete problems","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.802282Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:395fa62f097293f5e7aa545135422b696bdd97c606ae8bbee8963fdeb2a55996","observation_id":"895ae3d0-d38c-41df-950d-fb07d463fa8f","resolution":{"observed_at":"2026-08-16T00:31:35.802282Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.805841Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.805841Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3dd06fe8ab172cb079c8c58d2990927d11ae48d824596e8d72f091585c189ffe","observation_id":"cfbeb51c-add4-4d20-bdc7-b700866dcb32","resolution":{"observed_at":"2026-08-16T00:31:35.805841Z","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":"9423.35943","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:36.292538Z","title":null,"venue":null,"work_id":"bd6cbc46-e0e7-4fba-abd3-ecdf1efe13ba","year":1977},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.809700Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3f24274b710f53ea1a5a9974167c755d7dbe29617561b3e5526b0d26ad3d69de","observation_id":"c5927e3f-e6b1-4e60-a0df-0f092d51771f","resolution":{"observed_at":"2026-08-16T00:31:36.298969Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(79)90055-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.875092Z","title":"Preparata and David E","venue":null,"work_id":"4c53e7a8-ffcb-4616-abfa-88ab6b6d01ce","year":1979},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.813649Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:7df00531c5fb89cfb587fa1a8391935a8b977a188306967d6447a84370fd7bb3","observation_id":"d34dc886-8675-4774-ad51-744119e560a1","resolution":{"observed_at":"2026-08-16T00:31:35.878812Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/mnsc.12.5.437","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.862031Z","title":"Rothkopf","venue":null,"work_id":"569f7834-9b02-4b39-a196-7091a1de56cf","year":1966},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.817642Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:37d7e53cd4273c130d296143ac7d2b983e95c1ea32a46a816227015e59b661d1","observation_id":"98bf9cf7-1f5d-49e9-bb08-cb01fd1f8d86","resolution":{"observed_at":"2026-08-16T00:31:35.867135Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:31:35.821618Z","title":"Algorithms for scheduling independent tasks","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.821618Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:738af4bc157e777334f68db6d19aaa5517fbc7e5dd557591f90111198155736a","observation_id":"aebfcb2f-f0ef-4e6a-9e42-6ef96938d9b5","resolution":{"observed_at":"2026-08-16T00:31:35.821618Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:31:35.825460Z","title":null,"venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.825460Z"},"links":{"citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:3cfc8182d039b8e1ed8500296c10da912f8fe9d72842aa8a9cc8362cb473e6c6","observation_id":"e9e78abf-8ffe-4104-9ac3-f23db1ff77da","resolution":{"observed_at":"2026-08-16T00:31:35.825460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T00:10:00.416730Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":21,"verified_exact":17,"verified_fuzzy":1},"total_outbound_references":40},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2608.12224."}