{"as_of":"2026-08-08T02:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb27ef999a94ca393888f8cd0a4236331ca36c507e6408e44c2fc90dfc803331","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:56:28.954169Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T17:53:58.019212Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06893","snapshot_observed_at":"2026-08-02T17:53:58.019212Z","title":"Online job assignment.arXiv preprint arXiv:2506.06893,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.019212Z"},"links":{"cited_paper":"/paper/2506.06893","citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:4f19b8e7b1084b0dcbe29b0ca0bb501fc6dd4fcff2afa140d102f06d8a8b81d9","observation_id":"f8774732-7b61-4885-9b77-7be8f73ef009","resolution":{"observed_at":"2026-08-02T17:53:58.019212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.06893/citation-record","integrity":"/paper/2506.06893/integrity","json":"/paper/2506.06893/citation-record.json","paper":"/paper/2506.06893"},"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-07T05:56:29.934911Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":"ddefaf2e-1faa-45a0-ad55-4a49120cb960","year":null},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.696455Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:baa1fbc3db68c8f447e421f44ab48ffad947087fd1d3ea15bd6f70569b1bf966","observation_id":"eed1c313-ee82-4bde-bf75-71e0dd65f670","resolution":{"observed_at":"2026-08-07T05:56:29.939193Z","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-07T05:56:29.921871Z","title":"write newline","venue":null,"work_id":"0d2457a5-d33d-4cc9-8300-42ec96bb990b","year":null},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.701606Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:6da9ac0ceb7e66fd595cc9abe739d2d8471c3709bc4b91626217e2bce59c1b0b","observation_id":"9dfd94dd-d952-4ff3-bc60-68baebdb7f44","resolution":{"observed_at":"2026-08-07T05:56:29.926290Z","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-07T05:56:29.908763Z","title":"Combinatorial auctions with restricted complements","venue":null,"work_id":"6ed110ea-41bc-4eb0-b293-02ece04081a9","year":2012},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.707109Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:5c6c4a3b7081a4f157ac46d0190f06558f3c0e3c543828b9a90a7eb54f4edbf0","observation_id":"7b75116b-51e8-464d-b206-860dc64a286b","resolution":{"observed_at":"2026-08-07T05:56:29.913065Z","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-07T05:56:29.895278Z","title":"Online vertex-weighted bipartite matching and single-bid budgeted allocations","venue":null,"work_id":"918b346a-118f-4c83-83e2-28250c5ac57a","year":2011},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.712172Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:20bd36f06c851bc6a8c33c07e17e79164570e94d8b4d0c5bd7aaa41ef543fe4a","observation_id":"4edda3a6-686e-4ce5-b911-c728f8fd74b5","resolution":{"observed_at":"2026-08-07T05:56:29.899791Z","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-07T05:56:29.881749Z","title":"Real-time personalized order holding","venue":null,"work_id":"ea86eca5-4232-4372-9714-398f31534c45","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.716643Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:ab4e3701d3eb69194b14a2ae0efd00976e076f4dbc7370bc7820677297bfd021","observation_id":"805f9082-f035-4c54-98b3-a3299a948062","resolution":{"observed_at":"2026-08-07T05:56:29.886109Z","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-07T05:56:29.867056Z","title":"A nonparametric framework for online stochastic matching with correlated arrivals","venue":null,"work_id":"d104ba58-105a-4fdc-81be-d80b35d88f83","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.721061Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:453803f320d2c83755dc1a8e080224b521bffdc15ffbd9d6fda8ee7387ff410f","observation_id":"1a50928d-8ea1-4206-9b05-8528896f77be","resolution":{"observed_at":"2026-08-07T05:56:29.871676Z","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-07T05:56:29.852592Z","title":null,"venue":null,"work_id":"6e8e9972-dfbf-4391-95d3-5cd4b81ebf1c","year":1993},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.725509Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:842212bf191525f1ae002e2c651d4c0f88e71267e8d7d9ef6a2918a080957ff1","observation_id":"d4f359dd-19c3-4902-8fb1-0eed3d2ab7d3","resolution":{"observed_at":"2026-08-07T05:56:29.857048Z","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-07T05:56:29.838386Z","title":"Plotkin, Kirk Pruhs, and Orli Waarts","venue":null,"work_id":"e52a0116-0d40-49a2-83b8-1b06c422401f","year":1997},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.729622Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:9b1841990b526e11c6c3d6ecd97b569ac02d363425f06b99b56ad0008bbaab9c","observation_id":"5b335af9-871f-4edc-8927-cd814bbe1814","resolution":{"observed_at":"2026-08-07T05:56:29.843000Z","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-07T05:56:29.824218Z","title":"Truthful online scheduling with commitments","venue":null,"work_id":"3240a837-8cc9-46bf-b5dc-80ca8be8cc0a","year":2015},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.734259Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:8b2fcaf735a420062bf1da340e556d371dc8c78b992eaa5ed01fe58c175e3169","observation_id":"55c0cfcf-ad7f-4d71-bbaf-621cf11a8257","resolution":{"observed_at":"2026-08-07T05:56:29.828875Z","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-07T05:56:29.811061Z","title":null,"venue":null,"work_id":"9e26a865-f9c0-49fe-a730-383d864965a5","year":2016},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.738672Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:674e6a063a592075c8411098d810b731c69a8ecc1a38c7b2fe70f612940e8804","observation_id":"d6bc077f-3f5a-452a-92bd-198530889948","resolution":{"observed_at":"2026-08-07T05:56:29.815580Z","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-07T05:56:29.797678Z","title":"Ball and Maurice Queyranne","venue":null,"work_id":"deb0d062-34b6-4624-80d7-061f888760d1","year":2009},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.742796Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:f61cf5d8dabaf62fc8c537b7bfa9d782402864e3a87461245eb4b5fec3aaa7ee","observation_id":"0eed7998-61d6-44fb-bc38-7c3bcc4a6028","resolution":{"observed_at":"2026-08-07T05:56:29.802029Z","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-07T05:56:29.783702Z","title":"Improved approximation algorithms for multidimensional bin packing problems","venue":null,"work_id":"5a608c86-f9fd-41c1-86c8-ad4e8b8861fe","year":2006},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.747229Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:4bcee48c0b9e004ed6cbb34685d1118a92a32ab70f0475d9d308b807365fa4c3","observation_id":"d29b7aba-9e66-44ae-803d-3cacd2e3c715","resolution":{"observed_at":"2026-08-07T05:56:29.788097Z","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-07T05:56:29.770103Z","title":"Incentive compatible mulit-unit combinatorial auctions: A primal dual approach","venue":null,"work_id":"520fe238-d068-4559-89df-aac7d733e5dd","year":2015},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.751419Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:ef26a1002641dce6ad01af73c4455214a9312e2a9fa671365db8b449a9db7c10","observation_id":"69809128-3a70-42ba-840f-5273c98a40c3","resolution":{"observed_at":"2026-08-07T05:56:29.774453Z","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-07T05:56:29.755923Z","title":"Online primal-dual algorithms for covering and packing","venue":null,"work_id":"82376292-d79b-4fa3-9ecc-12e6593ae49d","year":2009},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.755871Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:9547e04a6bc48a794709cefe4b9111fcecd238d035b4413b3094f71922c1e5d8","observation_id":"b873ad37-9433-40ef-a1d6-ba262c8956f6","resolution":{"observed_at":"2026-08-07T05:56:29.760679Z","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-07T05:56:29.741934Z","title":"Online primal-dual algorithms for maximizing ad-auctions revenue","venue":null,"work_id":"5ff7cc62-1451-4cc9-a48a-b877053210b7","year":2007},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.760057Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:7255e71db3bc3f1bbb04f01f7328ca467362b45cf9e80a95d8983cbc4f028247","observation_id":"eb1b0d20-cec7-43fd-b4fa-b87c90de0471","resolution":{"observed_at":"2026-08-07T05:56:29.746590Z","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-07T05:56:29.728684Z","title":"Bounding the power of preemption in randomized scheduling","venue":null,"work_id":"32cdc10c-19ed-4e04-8c59-b9b6b80340df","year":1995},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.764171Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:b50abd599c903796617bda6ab57d2ecec71dec285e0bfedad3aa52e1ed918344","observation_id":"a8935bcf-d3a9-4619-aa48-0faecec8805d","resolution":{"observed_at":"2026-08-07T05:56:29.733124Z","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-07T05:56:29.715190Z","title":"Devanur, Alexander E","venue":null,"work_id":"89d23746-1bda-4867-8e4c-5beef3ec432b","year":2017},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.768306Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:f3fe8587fbc449ae3f8afb76e88f71b144fd81260eb54e5b2ccd78aa8540ec5c","observation_id":"0fb7eb18-9c73-4f8d-94b0-584aae67425c","resolution":{"observed_at":"2026-08-07T05:56:29.719532Z","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-07T05:56:29.701461Z","title":"Benjamin Miller, and Yifeng Teng","venue":null,"work_id":"ca654211-b4ab-40a0-8c5c-c226cafafaa7","year":2019},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.772791Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:ac72e32377c149c0e2d59778f436ff3c4a3b5980ee93b62d3a9b0bf87f7bc40e","observation_id":"5724fdfe-a06e-43ce-8e5a-74f8784c2594","resolution":{"observed_at":"2026-08-07T05:56:29.705878Z","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-07T05:56:28.777036Z","title":"Learning-augmented online bipartite fractional matching","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.777036Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:f4b3358d6e522a2d0b67ffa214046003f03cc1246d8498fb3d10624dfba6c16f","observation_id":"5e95dd3b-4fc8-4283-91c7-db8a3af13252","resolution":{"observed_at":"2026-08-07T05:56:28.777036Z","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-07T05:56:29.686442Z","title":"Online bipartite matching with reusable resources","venue":null,"work_id":"eaefada8-aa05-4fb3-8d77-fe24d532c077","year":2024},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.781392Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:a8557974a09cc4e31fc44777adfa5d6a6ce73abb9ad3b045995cbeccaaab8979","observation_id":"76093f70-6183-4a85-876d-8e319d5dfc3c","resolution":{"observed_at":"2026-08-07T05:56:29.691829Z","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-07T05:56:29.672958Z","title":"Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A","venue":null,"work_id":"032d12b8-bcf4-4233-8bdf-7c6e2a506b99","year":2019},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.785354Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:ae2cf28b9361a7ddec7825ebe7ffff3e539fb56323f02a1dc854b75682206f41","observation_id":"efa70f89-dad2-4a24-a767-0f2487c55e08","resolution":{"observed_at":"2026-08-07T05:56:29.677443Z","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-07T05:56:29.659341Z","title":"The trim problem","venue":null,"work_id":"83d15736-0868-4ed4-9d8f-0514014953e6","year":1957},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.789550Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:b89d5f369a6a4ddb5e78f6a5e11a2f6b2922edb63679d426d46380ddfee750a8","observation_id":"6ba18aa4-ee7d-4dfb-9381-959aaca40bd5","resolution":{"observed_at":"2026-08-07T05:56:29.663780Z","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-07T05:56:29.644369Z","title":"Online resource allocation with buyback: Optimal algorithms via primal-dual","venue":null,"work_id":"aba9cc59-2a7a-4d08-a738-ae1f031e969f","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.793673Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:27181500e49f52677a5fea6ae3c40a0923c02a802f08d0a3e641f3dc7e48174a","observation_id":"0574ec7e-ca71-4b0d-9f0f-6257ca25b944","resolution":{"observed_at":"2026-08-07T05:56:29.649503Z","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-07T05:56:29.629519Z","title":"Mirrokni, S","venue":null,"work_id":"a6e67730-c25c-4d5a-8082-9d98c960a401","year":2009},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.797637Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:bb84cc06d9d904b11cf59e5be74b3d590d34fe7803233c7f8cf4642fcf441a8b","observation_id":"2a5cc0f8-7644-4569-9181-f0871b185595","resolution":{"observed_at":"2026-08-07T05:56:29.634047Z","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-07T05:56:29.614694Z","title":"Batching and optimal multistage bipartite allocations","venue":null,"work_id":"ef91047a-08ae-4466-9381-8f2788d40777","year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.801694Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:93e25818d352857bbb896afc9f32cac453414ca73f83ed7ac440f54f29639875","observation_id":"314a3e65-b757-4093-9127-7cfa2a6a32a9","resolution":{"observed_at":"2026-08-07T05:56:29.619501Z","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-07T05:56:29.600695Z","title":"Linear programming based online policies for real-time assortment of reusable resources","venue":null,"work_id":"414a6283-6399-439d-90f9-e9d46656d2d1","year":2019},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.805739Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:e5665b6143fdd5544581802a4844c3cdbf901ddb1b2ce546096c2e717827931c","observation_id":"f4a6c528-802c-46da-b675-156f08573b89","resolution":{"observed_at":"2026-08-07T05:56:29.605360Z","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-07T05:56:29.586576Z","title":"Robustness of online inventory balancing algorithm to inventory shocks","venue":null,"work_id":"db54ea49-bd64-4b9c-9351-f4f5a4c50b47","year":2021},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.809740Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:c5ee3ead1f9942c20e32ac209054cc04070ce83bf58eb92e50520bc7f9b31380","observation_id":"9a4e708f-7158-49a8-af59-38b71a80174e","resolution":{"observed_at":"2026-08-07T05:56:29.591062Z","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-07T05:56:29.572417Z","title":"Online learning and capacity management in cloud-cost optimization","venue":null,"work_id":"2fbe3706-a8c0-44c3-b820-48e914a053dc","year":2024},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.814201Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:b65513771a79001ccaf2899204bd121ad87a91d6faff9135108a79b6327fd12e","observation_id":"f9f719fd-0100-4928-879d-6011ed970d94","resolution":{"observed_at":"2026-08-07T05:56:29.576948Z","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-07T05:56:28.818325Z","title":"Real-time optimization of personalized assortments","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.818325Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:e3275d9f0a13ba46d9fdc4da426a2dc11a1c4c563db7b1d032afbe621ee2656a","observation_id":"765f2e29-5850-4542-9989-6a8f370cc3c2","resolution":{"observed_at":"2026-08-07T05:56:28.818325Z","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-07T05:56:29.549075Z","title":"Iyengar, David Simchi - Levi, Rajan Udwani, and Shuangyu Wang","venue":null,"work_id":"5f5af11e-a9a6-4f5f-89c4-c72bd996dda8","year":2022},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.822328Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:b4de26b0f7048d6e73a6d96944e8f87553d35ad09b9fbc02c087177f77b1b9e9","observation_id":"cf25a678-516a-4d8f-b7ba-cf0fb8f50638","resolution":{"observed_at":"2026-08-07T05:56:29.553405Z","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-07T05:56:29.535739Z","title":"Online matching with stochastic rewards: Optimal competitive ratio via path-based formulation","venue":null,"work_id":"2b325bb1-86f5-48e2-831c-61ded2e6d526","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.826441Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:176d93da20e16627dfad00d190326ba2d4f9068830a9de28d861743b4d3ed777","observation_id":"7b44903b-705e-41dd-8ff8-8ef95bf106ac","resolution":{"observed_at":"2026-08-07T05:56:29.540146Z","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-07T05:56:29.522342Z","title":"Asymptotically optimal competitive ratio for online allocation of reusable resources","venue":null,"work_id":"b551abd8-4440-4d9e-ac72-980fb3087480","year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.830953Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:d62128994e46ff5cf4b170ccfc4f0085389f68fe76156940383f69222b8ea7fb","observation_id":"fe458d43-e2bf-4dc8-957e-71f787cf136a","resolution":{"observed_at":"2026-08-07T05:56:29.526735Z","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-07T05:56:29.509072Z","title":"Dynamic server provisioning to minimize cost in an iaas cloud","venue":null,"work_id":"1009036b-569d-4a07-88c9-49469c6db13a","year":2011},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.835012Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:72be6b4e68ec46cfe98014244a9077596ffc68aa5e330762abc4541f3d044480","observation_id":"3b4d8a57-2242-41d9-8b94-b3e6ab4a79ac","resolution":{"observed_at":"2026-08-07T05:56:29.513456Z","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-07T05:56:29.495918Z","title":"Online stochastic matching, poisson arrivals, and the natural linear program","venue":null,"work_id":"ee16936f-28c0-4dfb-a4fd-e15ad74ad577","year":2021},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.839246Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:37eac4e9e62d6528b86d44809e26107899069ed4c594fffa50a7bc56258111f7","observation_id":"52c12b70-3b07-4491-b6a6-ad26603d65c9","resolution":{"observed_at":"2026-08-07T05:56:29.500386Z","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-07T05:56:29.481824Z","title":"Online primal dual meets online matching with stochastic rewards: Configuration LP to the rescue","venue":null,"work_id":"7124ff16-5c6d-485a-a6d7-b439ffbc9938","year":2024},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.843374Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:e8cb182f3f9861441ad6bafa4914df4d70a96754d47bfe5da72b0a3a1b521cd2","observation_id":"79f59d82-7836-49a7-8602-e9a54c54d144","resolution":{"observed_at":"2026-08-07T05:56:29.486937Z","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-07T05:56:29.466885Z","title":"Online matching with stochastic rewards: Advanced analyses using configuration linear programs","venue":null,"work_id":"4b366665-6d42-4af7-82c4-05b3f81ec316","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.847943Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:b0e772c051393fdc0786c51bb675e2757d2c54630138f4a663d6c50e17c64c9a","observation_id":"e76b3b6f-4bf4-4c27-a748-8ab0ed504b76","resolution":{"observed_at":"2026-08-07T05:56:29.471777Z","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-07T05:56:29.452732Z","title":"Adwords in a panorama","venue":null,"work_id":"20c7f34b-374e-4ce3-b64b-cc2c1e998ba4","year":2024},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.852296Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:7bf948bb191cbb19f81c2e95005a9c6c056aaf42ff930751283e0e3c3015f58a","observation_id":"2fdc1b7e-a694-42de-9699-efd9d46db75d","resolution":{"observed_at":"2026-08-07T05:56:29.457231Z","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-07T05:56:29.437556Z","title":"Online reusable resource allocations with multi-class arrivals","venue":null,"work_id":"02b6760c-71ca-4135-89bd-ffe09572ff20","year":2022},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.856640Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:539a2ef4e782046e83a04213e3e45bd383a73c209f8bdc88b874e33de80566a9","observation_id":"01ca2292-ac6b-4e35-bbf0-98db2f3ad2f1","resolution":{"observed_at":"2026-08-07T05:56:29.442914Z","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-07T05:56:29.423179Z","title":"Vazirani","venue":null,"work_id":"321565f9-c613-4aef-809b-a0ad83ea4a76","year":2003},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.862102Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:4b25b18e0da22b2a9799140a5604fe84c5d315a335f38ec9542025caf7ca716a","observation_id":"151c899a-e81a-4ba6-a405-6c4fa1fc1ea7","resolution":{"observed_at":"2026-08-07T05:56:29.428227Z","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-07T05:56:29.409790Z","title":"Online learning and pricing for service systems with reusable resources","venue":null,"work_id":"031c10d6-6a62-4146-a7a4-133a92fd6f8f","year":2024},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.866357Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:3797c752933a1b7098389b0c68bf7f1801d9d671c06ac7e1fc2553e182e3cd2a","observation_id":"7813f659-8baf-40e9-a61a-53140f1d075e","resolution":{"observed_at":"2026-08-07T05:56:29.414279Z","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-07T05:56:29.396507Z","title":"An optimal deterministic algorithm for online b-matching","venue":null,"work_id":"209d9086-21c1-4405-a02e-ee437de59346","year":2000},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.870789Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:a739460ccf02bbb116052e68d5c1a39fbdca72beb7d54e44030ec22ff2645e97","observation_id":"1d10c296-89ed-4faa-ae21-d87b31b701dc","resolution":{"observed_at":"2026-08-07T05:56:29.400977Z","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-07T05:56:29.382892Z","title":"Karp, Umesh V","venue":null,"work_id":"d886a432-ae23-4433-b89e-4508ce088f69","year":1990},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.875023Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:5340124c0302fc0a427556acfb05ffe69cfd26dde96aa2977b3f3265fbfc3098","observation_id":"52168286-c603-4e62-a85b-72b0940ec793","resolution":{"observed_at":"2026-08-07T05:56:29.386927Z","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-07T05:56:29.369676Z","title":"Kash, Peter B","venue":null,"work_id":"a7db3ea0-7309-4bde-9b91-8eab576da6cd","year":2019},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.879117Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:0deeac58f5d62029ca84c9b74c65765b2a46f9dfc05be8998a4761893f85061f","observation_id":"de383460-c1b6-4882-8853-44f640c36bb6","resolution":{"observed_at":"2026-08-07T05:56:29.373756Z","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-07T05:56:29.356355Z","title":"Lipton and Andrew Tomkins","venue":null,"work_id":"6a966747-3f3c-432f-8b3a-f1364605e091","year":1994},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.883682Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:5bb99106994e9842c36b2ee7e708b5b29992ab92cc33c79ad684392c44a4c20e","observation_id":"1625ec22-5cf8-40ce-9926-60d1faee7943","resolution":{"observed_at":"2026-08-07T05:56:29.360529Z","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-07T05:56:29.343018Z","title":"Efficient online scheduling for deadline-sensitive jobs: Extended abstract","venue":null,"work_id":"aaa1567e-b87f-43c9-979e-19af6aeefd82","year":2013},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.887843Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:0f72b888a720b6d3daee665bcb4452a35d9045404bca8006a837238c23f17fd1","observation_id":"cf66c43e-6e76-49c4-9465-55e8a9496702","resolution":{"observed_at":"2026-08-07T05:56:29.347351Z","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-07T05:56:29.329025Z","title":"Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios","venue":null,"work_id":"219abf17-ce68-4cad-af45-7f4ca5cb2eee","year":2020},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.891932Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:7f8d36b4238b6b9f74d11fac9acae073b35b32632c8e0547dc4d59d9588f4fe5","observation_id":"605be68a-fd06-4a4f-929f-363e72005d8a","resolution":{"observed_at":"2026-08-07T05:56:29.333164Z","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-07T05:56:29.315231Z","title":"Allocating online advertisement space with unreliable estimates","venue":null,"work_id":"aa6bd925-e7cd-46a9-8cca-2d924b7e29ed","year":2007},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.896142Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:4f326e96ac279995ce3c05b2cb95b2a3ee006cc08d28387c46ab82bb2cffbb96","observation_id":"e43a41c6-74ad-4705-8af7-c1bdda1dc029","resolution":{"observed_at":"2026-08-07T05:56:29.319533Z","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-07T05:56:29.300920Z","title":"Online algorithms for matching platforms with multichannel traffic","venue":null,"work_id":"b695cf3f-51ad-44de-a7d6-0f4499b5056f","year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.900310Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:f043bab9d4c9fe9a5d8c72534b87b39d9785005f770f3a83be0908dc369d3710","observation_id":"7da8ef0d-37a5-440a-9fbb-29614238ea40","resolution":{"observed_at":"2026-08-07T05:56:29.305599Z","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-07T05:56:29.284945Z","title":"Vazirani, and Vijay V","venue":null,"work_id":"77b1bdad-088a-4a3b-b53c-5bb00755911a","year":2007},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.904690Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:8770cec25e4c61fc0655b3994b00f45b2a61bf9bfdd7e9de564443d56a44d016","observation_id":"ab3eb71b-5c90-49bf-ad28-5f18e4e2a5f7","resolution":{"observed_at":"2026-08-07T05:56:29.290571Z","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-07T05:56:29.269584Z","title":"Online primal-dual algorithms with configuration linear programs","venue":null,"work_id":"52209f63-352c-4bd5-808d-098286ef3cef","year":2020},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.909038Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:76844ea4855ce8de12b41f4f7e2992f5c74b1497494a097b94ab636c1109938e","observation_id":"212e8bcc-6994-4049-b392-6def98f77f13","resolution":{"observed_at":"2026-08-07T05:56:29.274335Z","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-07T05:56:29.255723Z","title":"Revenue management with heterogeneous resources: Unit resource capacities, advance bookings, and itineraries over time intervals","venue":null,"work_id":"b0c1a571-4fe9-4a2d-bbb4-449aba7a6f4a","year":2023},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.913064Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:ac6d53b9363016f1d4c6c50bac44c31f2a42b24d058a7566d1b281bac214bc53","observation_id":"c1363e18-aa76-480c-86de-9ef212aab55c","resolution":{"observed_at":"2026-08-07T05:56:29.260408Z","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-07T05:56:29.241398Z","title":"On greedy-like policies in online matching with reusable network resources and decaying rewards","venue":null,"work_id":"978bf0d7-45c9-4b32-801f-16b69fcdac8b","year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.918197Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:18f53128b1d680cd605496dbfe7f52454a1acf01e637c4fcc3f1bff23a643585","observation_id":"19307abd-4fcc-49f1-a984-09a5238cfec3","resolution":{"observed_at":"2026-08-07T05:56:29.245984Z","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-07T05:56:29.226322Z","title":"Adwords with unknown budgets and beyond","venue":null,"work_id":"528d53bb-65ef-4ff8-9571-e74b4ce4b206","year":2025},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.922155Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:2624366fa7effae3fe8ad739c1e7f5c45b9e7200125a200f686fb13a058e8520","observation_id":"b364c18e-14a4-4234-8214-e4098d96132a","resolution":{"observed_at":"2026-08-07T05:56:29.231809Z","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-07T05:56:29.212667Z","title":"On the configuration-lp for scheduling on unrelated machines","venue":null,"work_id":"c875e95e-58c1-4544-b7f3-595f8de97430","year":2014},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.925930Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:013ffc406db95200160e73f1c50c78e09e7105d7ae92559cce6660421bbca6eb","observation_id":"7f4722d0-0ab6-47de-af98-c254a8a736f1","resolution":{"observed_at":"2026-08-07T05:56:29.217173Z","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-07T05:56:29.197973Z","title":"Selling reserved instances in cloud computing","venue":null,"work_id":"24444638-a2d5-4f4c-a96f-40830a087934","year":2015},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.929707Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:8ddc87ae478e6b6a105856f9a1b8c3d2490992e39a28340ec43c35fcb3fb6503","observation_id":"55dd6771-2aeb-4e7b-89ca-855cf598a648","resolution":{"observed_at":"2026-08-07T05:56:29.202421Z","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-07T05:56:29.181895Z","title":"Dynamic cloud resource reservation via cloud brokerage","venue":null,"work_id":"3280a81a-ae5d-4432-8f84-9a3609c6e528","year":2013},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.933468Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:1ac96fe8ac17088272af6312e0b60742719ae71842e17102fbe8ac42763bdd0e","observation_id":"1ff8513c-6b04-4466-a1a6-d57423a47b74","resolution":{"observed_at":"2026-08-07T05:56:29.187303Z","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-07T05:56:29.166463Z","title":"Probabilistic computations: Toward a unified measure of complexity (extended abstract)","venue":null,"work_id":"9193cb36-04d2-4290-a0d7-336cb4172643","year":1977},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.937596Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:30a2aafdaa7c622a14ea3a0d5087f6f3c25f955b484c485ce948145a4535ac0f","observation_id":"a314657e-cac5-433c-8548-87d8c18496a7","resolution":{"observed_at":"2026-08-07T05:56:29.171522Z","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-07T05:56:29.152044Z","title":"An online mechanism for dynamic VM provisioning and allocation in clouds","venue":null,"work_id":"de0298e3-9c6a-46cc-8b65-758d4b0b5272","year":2012},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.941638Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:797af59b1cb0b1b4d2f627638f0810412ef79b0325124d8c0d7bfc40f4861223","observation_id":"a3c4fece-9a8d-43f4-b3c1-574595b5a557","resolution":{"observed_at":"2026-08-07T05:56:29.156796Z","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-07T05:56:29.137066Z","title":"Vasilakos, and Jiangchuan Liu","venue":null,"work_id":"cabac33f-a972-4d2c-8171-fc63239bb203","year":2016},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.946075Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:a1901c21321e7b8d4260bd01b6d3a92e26ec222b0afc07fa8d628cddabb98cd7","observation_id":"b23abf92-4f66-44b2-ba45-fa8116bd0174","resolution":{"observed_at":"2026-08-07T05:56:29.142062Z","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-07T05:56:29.122480Z","title":"Randomized mechanisms for selling reserved instances in cloud computing","venue":null,"work_id":"8dd8ac58-7d8c-47c6-b735-21c2ca0513f8","year":2017},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.950274Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:d7d0046912082345b6944713ebc32420f00af523565127daafddd26b5c0ee3b9","observation_id":"cf703d1b-e814-4f98-8584-c93161979069","resolution":{"observed_at":"2026-08-07T05:56:29.127111Z","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-07T05:56:29.105551Z","title":"Online resource scheduling under concave pricing for cloud computing","venue":null,"work_id":"fd74dd13-9558-4add-9112-7a8b8b838c10","year":2016},"citing_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T05:56:28.954169Z"},"links":{"citing_paper":"/paper/2506.06893"},"observation_digest":"sha256:6268cf2a827f3235d40df2b397a0f3eec4bb63c50497b8840730f481f22f3fa8","observation_id":"984bf41e-b451-453d-839e-4016ef503809","resolution":{"observed_at":"2026-08-07T05:56:29.112789Z","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":"2506.06893","last_updated":"2025-06-07T18:46:51Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":57},"total_outbound_references":61},"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 8 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 1 inbound Pith citation observation for arXiv:2506.06893."}