{"as_of":"2026-08-05T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15f7eff8229f04a03e69f853059e5d1da0d92b75b76d1e2c51e689628b632a92","coverage":[{"denominator":96,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":96,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T20:48:14.468676Z","state":"measured"},{"denominator":96,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":96,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2605.05233/citation-record","integrity":"/paper/2605.05233/integrity","json":"/paper/2605.05233/citation-record.json","paper":"/paper/2605.05233"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0053962","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages =","venue":"Lecture notes in computer science","work_id":"93c87ff3-7e2c-4238-85c4-a00dd4ccefa3","year":1998},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:ee73fc7691e639a2b89cf2f2c8ccf0a5ff678a910220a05d23ca9aa85ecceb3d","observation_id":"7f6fcfa7-6f3c-4131-9417-f06edaea36dd","resolution":{"observed_at":"2026-05-09T20:52:59.599705Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2516.113252","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e45e17cf-4c02-4815-b0de-ba1120b23aa7","year":2006},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:fa26b61b6dad2814ef40eac0350cce2ff4834dbb5d6f5abedf9df39ce9132402","observation_id":"8b2613dc-8755-4c61-9fda-74e3a4f82656","resolution":{"observed_at":"2026-05-09T20:52:59.614987Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0680.112068","doi":"10.1145/1120680.1120683","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM SIGecom Exchanges , volume =","venue":"ACM SIGecom Exchanges","work_id":"d1d0dd9c-0b8d-45b6-b384-6dfb68632f33","year":2005},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f8a44c63d448746a47644326505fc32f67db856539b150cc7a090a144aca6ec0","observation_id":"dd3c15dd-d239-4fea-a35a-9e031be5ade8","resolution":{"observed_at":"2026-05-09T20:52:59.605466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2018/13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages =","venue":null,"work_id":"98a2496e-3396-4fc3-a5df-94e5ef48e21c","year":2018},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:d667badb6c41d469f914b1e8573c72bd1bf3d513e1a200f657c9fccda9e71e1f","observation_id":"472ecd6a-f3e6-4b9a-ab10-4eb79d1333cb","resolution":{"observed_at":"2026-05-09T20:52:59.596681Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s1052623498348481","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Optimization , volume =","venue":"SIAM Journal on Optimization","work_id":"58149af7-805e-4637-ae7a-e2c69bea5df5","year":2000},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:4cb1c338c1ac956590bf3b8e5014d785c194357a5af62a7a32cb81485ea82cd7","observation_id":"58d3a4bd-5a5c-44b9-a455-d7bb5ab05b20","resolution":{"observed_at":"2026-05-09T20:52:59.602152Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0020-0190(00)00010-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Information Processing Letters","work_id":"33d66e6f-b27c-4f1b-a943-39f2789b4eb3","year":2000},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:259930db4abf9f1b76388148441e746eb92714b4d67f7df426ad57ced21f8a0a","observation_id":"8cabf022-a2e2-4305-a896-10720f2bbd9d","resolution":{"observed_at":"2026-05-09T20:52:59.617410Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:1022584312032","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Heuristics , volume =","venue":"Journal of Heuristics","work_id":"0abf0673-6a1d-448e-8b58-dd46325acf61","year":2003},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:27ec686b5702f2b920b1aa59c4b99eff70586a6572ff832f0a9697c102998d80","observation_id":"6e468111-d4de-4361-8137-b851fb0795ef","resolution":{"observed_at":"2026-05-09T20:52:59.619578Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2009.51","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"d016203d-8086-43d6-a11b-d08653911d0c","year":2009},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:53bb9b155ee7fd98282b27829ede38ff1c82ee9e610fc941ef95724dc5ecf221","observation_id":"a1a6bcb1-d9bf-4320-a65b-c86c9313c5cb","resolution":{"observed_at":"2026-05-09T20:52:59.607680Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539700382820","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Computing , volume =","venue":"SIAM Journal on Computing","work_id":"6f1f1685-5618-456b-b3a7-421aba15e175","year":2005},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:6202f9960ae9faaeea51efac9167dfc13adc9ad7f18b02eb06fe21c7c5bc7e22","observation_id":"807728fc-a31b-4b51-b716-45f23a7384a0","resolution":{"observed_at":"2026-05-09T20:52:59.609801Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-024-02145-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimization Letters , pages =","venue":"Optimization Letters","work_id":"d05e5294-72f8-4902-b6e5-27415f952869","year":2025},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:9c3f98e0e89569ba9e444132e5adee8040af3951b3caa305048f0fc04a752280","observation_id":"49a127df-e55f-452e-a177-e9a61df4efb6","resolution":{"observed_at":"2026-05-09T20:52:59.611921Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-003-1077-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica , volume =","venue":"Algorithmica","work_id":"6d3bbef7-ea03-4cb7-b5da-facbd04e8cbe","year":2004},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:e8be6d11f9041b3322a483954ec6f8d7d3a0639ccec3eb1f0d798029cb2b5e24","observation_id":"0b130e28-f662-4363-ba17-aaf746e5d59d","resolution":{"observed_at":"2026-05-09T20:52:59.626262Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02579456","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Combinatorica 1(4), 349–355 (1981).https://doi.org/10.1007/BF02579456","venue":"COMBINATORICA","work_id":"28590ed3-19c8-4717-91d2-940911248eb9","year":1981},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0c7835ed56ff47f38faf7bf060db979fc7aafc2f36f87183ea6eb1933d32ddd1","observation_id":"bc301497-d6aa-4e82-8f23-020c7ca8c165","resolution":{"observed_at":"2026-05-09T20:52:59.638087Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-57586-5_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages =","venue":"Lecture notes in computer science","work_id":"ea979190-ead9-4dc0-a5a5-ea77bd785435","year":2017},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:33d7f7ba29f36d2f8b9461ed4b75751c93d6015d97813c52240ae18cce33d481","observation_id":"ca4a2414-73c1-4b7b-a520-d7064a8501f2","resolution":{"observed_at":"2026-05-09T20:52:59.645335Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2018.05.018","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theoretical Computer Science , volume =","venue":"Theoretical Computer Science","work_id":"ecd99e11-2a93-4eb9-831d-5496b994ed80","year":2019},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:cc95be1961e7789a5e7901b929057fd503fb9efc7f74f022e1c8e34745725bba","observation_id":"89546422-530d-4040-a7ed-9a5ea5fd673b","resolution":{"observed_at":"2026-05-09T20:52:59.621843Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7531.7535","doi":"10.1145/7531.7535","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"14 Dorit S","venue":"Journal of the ACM","work_id":"95df93e6-1d04-46aa-8621-dbd53aa4c8cd","year":1987},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b0fc1ebc37c99e48db79f2d7681b7c536afe4330a47c422aa3b60ca573508093","observation_id":"bdd46c5b-e2fc-4864-a568-7ec9413b899d","resolution":{"observed_at":"2026-05-09T20:52:59.648615Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0202019","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hopcroft and Richard M","venue":"SIAM Journal on Computing","work_id":"d16f6bf8-95b3-4fc9-9be2-23fe139464d9","year":1973},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:1ba431ced1bf7decea27f83e4745a8955d370baae0ec14adc5d7caca549205f0","observation_id":"ccf8bba2-463e-47ee-8b43-18471b016186","resolution":{"observed_at":"2026-05-09T20:52:59.635829Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-11T16:49:24.891995+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T16:49:24.891995+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3727149","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Transactions on Economics and Computation , volume =","venue":"ACM Transactions on Economics and Computation","work_id":"bf77d5ef-c1cb-451a-b4f1-e54a816e140c","year":2025},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:83059f76853d92b47e9740e6ac602d6c64001a8e46646654b82c49d698149052","observation_id":"fab7df87-70b6-482b-8293-1aeeafc6fd9d","resolution":{"observed_at":"2026-05-09T20:52:59.654025Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-20614-6_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages =","venue":"Lecture notes in computer science","work_id":"bd8a6d02-cc62-4276-8925-db9d14536f65","year":2022},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:273765b141758395e291a70ee45f9870c75ca24f5f70d83642b8d07429c72348","observation_id":"6a802144-6122-4dd1-b8e3-86bed214c170","resolution":{"observed_at":"2026-05-09T20:52:59.633286Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/080731207","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Computing , volume =","venue":"SIAM Journal on Computing","work_id":"9591f3b0-76dc-465e-b5b7-333d03d8795c","year":2009},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:59a0b2380cbb04438db7e3c7f73ffde2d8605ca8742dae3f4c5933a07d1316fa","observation_id":"84b98bdf-0d03-4179-a14d-effa481c5042","resolution":{"observed_at":"2026-05-09T20:52:59.656754Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-27660-6_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages =","venue":"Lecture notes in computer science","work_id":"80715ac7-709d-4653-8752-b0a5dcb09430","year":2012},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:225afbd2b81291dea252881300b8734d146ddc0961b8adf72aa14400232f1feb","observation_id":"1e61a811-f0c4-4b6e-88a6-9d1b6e1a9ab6","resolution":{"observed_at":"2026-05-09T20:52:59.640295Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/moor.12.3.415","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minkowski's Convex Body Theorem and Integer Programming , volume =","venue":"Mathematics of Operations Research","work_id":"cc1fb843-9d11-46f5-a8bd-9d76869a62ea","year":1987},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:bbf91680a81f4c6fdeb860f8ec1a273e0ca957d0423af86905cd3cbb97d03256","observation_id":"8a7b1555-6137-45b2-8b7b-c427c18c4554","resolution":{"observed_at":"2026-05-09T20:52:59.624069Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-15T21:50:53.603325+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-15T21:50:53.603325+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-48413-4_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages =","venue":"Lecture notes in computer science","work_id":"e82756c9-876d-4645-9641-48ef1ba77c84","year":1999},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:a4ea0d4e2568352dec2a2192c3850a98ada6b4f05117fd591a2153a6038805ea","observation_id":"ff660340-d186-4396-8d40-cb468b98b3c1","resolution":{"observed_at":"2026-05-09T20:52:59.642988Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-023-01105-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica , volume =","venue":"Algorithmica","work_id":"537583a0-2116-4c1d-8692-fe731aaa3df8","year":2024},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:87a9b3f6cc85e66b7c856d44fc9f4049b7761fe614d4cceaa3099b72c3b21475","observation_id":"c8d6fe0e-9e76-48a1-ae87-a0c0da0b3474","resolution":{"observed_at":"2026-05-09T20:52:59.628435Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1987.8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Shmoys and","venue":null,"work_id":"e3a7ecec-d284-4c33-948a-db5b5a606091","year":1987},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:2cdfd0d83081a5cbef7428686596dfac616f389ed205256e23598b9e848a3ad0","observation_id":"12dfa280-2c06-44bf-9dea-7868207b2ea8","resolution":{"observed_at":"2026-05-09T20:52:59.630620Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01585745","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"26 Joseph Y-T Leung and Chung-Lun Li","venue":"Mathematical Programming","work_id":"4eb2c436-0cbe-4559-9935-dad9cb94cdab","year":1990},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b0b574f69d782e498335f69c5fc22f1d6405d3ef9090b1fc5f6e43d1be084d44","observation_id":"c02f0629-9bae-45fc-921d-15e16bef03c8","resolution":{"observed_at":"2026-05-09T20:52:59.651588Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rsa.20756","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Structures & Algorithms , volume =","venue":"Random Structures and Algorithms","work_id":"7c1e534a-ac1c-4a64-8659-1d0da148c681","year":2018},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:94a7fa0c86b5a08bb75381444061b49744c006077b14da98c59c95f2eed94c82","observation_id":"9a06bf2c-833e-42f7-8023-20b61733592a","resolution":{"observed_at":"2026-05-09T20:52:59.590898Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"2011 , publisher =","venue":null,"work_id":"b1b3f69a-ceb1-4c9d-bd59-6d5dc7b75b0d","year":2011},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b1214d62b921d3f4eff8be94968728ecd7c8e0244c89383910228f3f4e2d9756","observation_id":"c09f2300-55b3-420c-bfc9-86f2b637d512","resolution":{"observed_at":"2026-05-24T08:16:05.777749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-6377(96)00055-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Marten Maack and Klaus Jansen 25 A Examples for Section 2 Example Simple Reduction","venue":"Operations Research Letters","work_id":"052ca080-d05e-4f87-a0da-d79f3e45abfb","year":1997},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0b589c0ffc2e6a2479a89f116e1bff1926c2c07153aea5e67936fa7aac779850","observation_id":"e0e19bc7-e0fe-46f9-8629-cbfa7f547d51","resolution":{"observed_at":"2026-05-09T20:52:59.588551Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6858.59787","doi":"10.1023/b:josh.0000036858.59787.c2","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Scheduling , volume =","venue":"Journal of Scheduling","work_id":"b7b790fe-bf56-4554-8b8a-fc329f66d56a","year":2004},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:357dc56e44ff907a1c8c0e4364239791cb882f0e1136ed08d2bf1bdfc5e10dd6","observation_id":"e0223db5-bec1-4156-a3bc-9f085e233c00","resolution":{"observed_at":"2026-05-09T20:52:59.594057Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":"144e3142-c579-4b27-b7e8-0983aa49d83b","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:c8de60d2a9ea609f8c5e871e926ed321a587dbdbd5fbf12b94d4d21ff6eace1e","observation_id":"6b5dac3d-a4d1-4570-8f49-e4ebd89182d6","resolution":{"observed_at":"2026-05-24T08:16:05.757752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , volume=","venue":null,"work_id":"35bb2174-5d19-472b-9019-2349f836c80d","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:101a03ae1223e9070f59a3c4aa628d23eaa629743c3ccf0403f4666bc9afaca3","observation_id":"65c125dd-e569-4741-9287-33b6393ae89c","resolution":{"observed_at":"2026-05-24T08:16:05.829498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"ACM Transactions on Economics and Computation , volume=","venue":null,"work_id":"42457c34-9a71-4e88-b989-ae70210e2fa3","year":2025},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:3f68a5d560209d670ac837f7405f881fb0f524b5df711ff51940ff0879bfa5ba","observation_id":"b44fd84d-3c0c-4a98-a856-728832638ac8","resolution":{"observed_at":"2026-05-24T08:16:05.832888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Optimization Letters , pages=","venue":null,"work_id":"3d4b7809-238c-4b3d-a3ab-86bbf66f6759","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:5dec8b72447e14179632ca8348c73d249444b3f4417a85c0493ad4126ce7f308","observation_id":"9db6d1c2-3322-4637-a8b0-227f49f406af","resolution":{"observed_at":"2026-05-24T08:16:05.773642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"f30d8c8a-34ea-4a35-84de-fd8b677ecbd9","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0925a189399a487affdf5850b9d5dbd071b6d8545be4b434b5ea31b4c65fbf14","observation_id":"20c14b2b-afd9-4315-a57a-1123bf2eea3d","resolution":{"observed_at":"2026-05-24T08:16:05.761087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages=","venue":null,"work_id":"3ada2eac-c51a-43b0-b973-204e0ece72b5","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f62a73ed65ce427467b8614581dbfae58a2f1daa2f0b5d8ee1ee752e5d3b1e13","observation_id":"3a58bfa5-89ab-4497-8315-874f0c58da04","resolution":{"observed_at":"2026-05-24T08:16:05.789208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"67c972bf-5562-40f1-bad3-bb5504a877dd","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:566d1ebd5ace6defa6d96f1afb0387e9e655fd19671d6f354a1eee06e596bd92","observation_id":"344e279a-8c3a-4e22-9201-2d49dd1ba0e1","resolution":{"observed_at":"2026-05-24T08:16:05.802923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-10T11:47:03.988446Z","title":"1990 , publisher=","venue":null,"work_id":"fc1aa486-5444-421a-b671-1c3533498030","year":1990},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:051d06421a89c72bab5aa8c3e6c9b6752ee4861259942fe8254fe54d357def30","observation_id":"c0ac92ee-31ef-4851-9c53-9b78238ea923","resolution":{"observed_at":"2026-05-24T08:16:05.843238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"2004 , publisher=","venue":null,"work_id":"20215ea1-8f59-4326-ba44-ba7cc22be5c6","year":2004},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:bc4d6b13820afc12401b481219f304d6f26593a385aa806df4938d166ab776df","observation_id":"a87c0f4e-7d86-4c66-9209-f572c07f6730","resolution":{"observed_at":"2026-05-24T08:16:05.839930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Naval Research Logistics (NRL) , volume=","venue":null,"work_id":"81321d6e-cac1-43ad-81b6-7effd81d1e2f","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:db9b090321394d044e12a18199050e19c72692a0c478f69dcbb301650bc2c72f","observation_id":"1db13076-f34e-45f4-a440-264cb5714967","resolution":{"observed_at":"2026-05-24T08:16:05.741822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"International Journal of Operational Research , volume=","venue":null,"work_id":"0677a2dd-91ce-4b7e-ba58-ed54a63f3de7","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:330c6f664816319e0643b699521406719dee517657fd58b50b822b0986362ffb","observation_id":"75359630-b527-4ad6-a106-0369d71e2ae0","resolution":{"observed_at":"2026-05-24T08:16:05.744876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Information Processing Society of Japan Journal , volume=","venue":null,"work_id":"c34c8a73-d82d-4c7e-b9e9-fdf2098dd87a","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:1bf11eb6ce91d2690daa7c86bc68d8903d279ad9faec0d7781e91487a113261a","observation_id":"13acb7b9-897d-42d3-9fc9-d3f04c7df248","resolution":{"observed_at":"2026-05-24T08:16:05.774933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"39c0ba72-8a29-4b8a-bd50-177bd9135007","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b3973d97a1c289e933e90213643600ad5b5890c9162da36de1b2e1c0ec58ec7d","observation_id":"7df811b9-d2d3-4762-b368-137c56b59d1b","resolution":{"observed_at":"2026-05-24T08:16:05.836502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Operations Research Letters , volume=","venue":null,"work_id":"5e4ae1ed-817f-4ce7-b867-ed2aee85c05c","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:ca6fad7ad3d6cb8e61d58132f829597f6d3c44ed760b4c1cf87154d4d3844f02","observation_id":"2451eba5-0973-4c33-ac7b-bb9b58cf9169","resolution":{"observed_at":"2026-05-24T08:16:05.735081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages=","venue":null,"work_id":"6decf4d7-bc87-4d12-a13d-1305562cc8d9","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0fe159c0d5cb7fcdb2eea997e341e8af79d7d694ca779aadd0dd6b0ed82a8083","observation_id":"12e8eee8-34d2-4a93-a0fb-d7ba7d5c3e80","resolution":{"observed_at":"2026-05-24T08:16:05.801533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"f0f6d3c3-2e7a-413e-b066-6363c789e469","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:60fbe1606e0b2b3aa30111cdf9b6d11c0cc32f22a4b3bf16f81edf18c06fdbe5","observation_id":"39f3ce72-595b-4cb2-b41a-fcd827825ffc","resolution":{"observed_at":"2026-05-24T08:16:05.797544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Algorithmica , volume=","venue":null,"work_id":"05f36d82-2bc6-42fb-b188-783d6284e676","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:278cbd97fb2ff3a9d57a8458542b0a6f03b826014d899f1fa9df76cfdb99d5d5","observation_id":"a50f4eaa-dc68-467f-b489-ddacf15a6151","resolution":{"observed_at":"2026-05-24T08:16:05.732384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of Political Economy , volume=","venue":null,"work_id":"4134ed72-8e89-4af8-8836-086cdfae5038","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:febf350d55608c6ebac3e071eb1374db2c99e42807188ea3760bbbe08f27fbad","observation_id":"9ca67012-49d6-42d8-9676-ddc93792319d","resolution":{"observed_at":"2026-05-24T08:16:05.738705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of the ACM , volume=","venue":null,"work_id":"e0574d26-f945-4163-a8d2-2ecf3a7df80e","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:87fea6448f316f03b6b51b69038d24287353fe2a38f9fe0d64b365bc3e5b317f","observation_id":"ae57ac75-ba81-4a01-b3ed-5ec560fe8d29","resolution":{"observed_at":"2026-05-24T08:16:05.823131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 19th ACM Conference on Economics and Computation (EC) , pages=","venue":null,"work_id":"d026eb15-6b26-44c8-8e3b-92e5550e94b6","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:6844523b121fad2e55a6bc4410194f06035838a57500fff7c850b1ab39d7d006","observation_id":"68e0c591-0859-43ae-86f7-674180d773cc","resolution":{"observed_at":"2026-05-24T08:16:05.751047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 21st ACM Conference on Economics and Computation (EC) , pages=","venue":null,"work_id":"54f36e84-43e7-405e-b7d5-f7ac52d723c0","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:54c84e7a782890181cfce20f949261cd1fe8632a95832e5ad509bdf5ac672936","observation_id":"49e5ba56-311e-4f77-b709-9b5ba5375f6a","resolution":{"observed_at":"2026-05-24T08:16:05.768810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"c1e419ba-3be9-49b1-985e-2e7fc40a340d","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f416a0aebddef79c63e7ebf308c8de6979d68c654ef91bd681b92b061eae50a2","observation_id":"204ae778-3bdf-42d2-8c2e-947b92ba2036","resolution":{"observed_at":"2026-05-24T08:16:05.819658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Doklady Akademii Nauk SSSR , volume=","venue":null,"work_id":"299ad70f-9ce3-4ae7-a99b-30765485ca60","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:49389f717e4c32d79e2171353c3b95689c5a36b66745bc89fe2a1aea32aa0cee","observation_id":"6099a6d2-1bca-4c0a-bc4d-c0c0d88d65f2","resolution":{"observed_at":"2026-05-24T08:16:05.728852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":"54186584-e25b-4fe6-94de-7c3c5716da7a","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:3ed93483b177379f73b3fdff8ff21ad43969bef9e1a13854d9f2f8bb571fb7cb","observation_id":"db6b93c3-64bb-4710-ae67-3f70d4034fe0","resolution":{"observed_at":"2026-05-24T08:16:05.725410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"67e8589f-31d4-4e87-b277-ab7b54b42230","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:2d3900e6b1078d4f3a53675e84a182b96bd223f7a113296daa5c5d882018a344","observation_id":"de626fc5-813d-41f5-9be3-f3dd66e69c11","resolution":{"observed_at":"2026-05-24T08:16:05.732710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"2adb246e-6533-4891-bc9e-7c5da6cbf8ab","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:9c4a447b48a382ee1c46145d9a8144fe4fd6274957f3d051c32a1d58483669c7","observation_id":"a93b8cc1-c73b-4280-92e3-5625d4fafcb8","resolution":{"observed_at":"2026-05-24T08:16:05.744001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Discrete Mathematics , volume=","venue":null,"work_id":"6905fa9f-3546-428c-aaf0-5898594fbef0","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:7f5304d1ab2964346f95cf9ee73957d25ea48e58e34edb8aa7d984f9937124ba","observation_id":"c70117ae-b0e3-4b87-a6b6-aacafd432f47","resolution":{"observed_at":"2026-05-24T08:16:05.755185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"a32088da-df41-41f2-a8b8-5bdb51bac9ae","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:62e29ddd48dc71090651bc393b3720ed2b3ee32bb88af29f4419e1a92ae45f29","observation_id":"aa6e1bc5-560a-482c-b841-47cce5100a34","resolution":{"observed_at":"2026-05-24T08:16:05.780570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC) , pages=","venue":null,"work_id":"3a13bb78-e089-4bb6-ac58-1b00ed3f300d","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:707349f2313c084e1bc66c23e215b9dc73573dc2f740115ea4df7cb6ac8f25b2","observation_id":"97c8888e-76ae-41c8-9c64-d20b0c09fac6","resolution":{"observed_at":"2026-05-24T08:16:05.710625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":"91a5688f-03ce-4880-9e20-76859bf12871","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f4a2d2678c0f95bbe81bea604e34f967e1e2c133e76f4ba37240210123111983","observation_id":"d4ed710e-5949-4269-bf18-d506c19c4d64","resolution":{"observed_at":"2026-05-24T08:16:05.714472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"db2d0c3a-585f-4741-9340-5db846447c46","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:1a8ab6bbfd7733c71cbb90c02ddf7bab96840e95c0e10215bae99ee7eb9eaf56","observation_id":"67d1cd2d-70d1-4815-a765-0620a29ff9f4","resolution":{"observed_at":"2026-05-24T08:16:05.793775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10406","last_updated":"2021-03-18T17:42:20Z","snapshot_observed_at":"2026-07-06T10:51:16.166605Z","submitted_at":"2021-03-18T17:42:20Z","title":"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More","version":1},"cited_work":{"arxiv_id":"2103.10406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2103.10406 , year=","venue":null,"work_id":"7bb2578e-f9ea-4529-9a5d-9c1a6a7987f6","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"cited_paper":"/paper/2103.10406","citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:1419aa7eda594324dc84414e828875e23e5677097810efbd4b06d7548a49b4fd","observation_id":"b91154b1-02fc-4183-8b1c-bffb3da5b2d5","resolution":{"observed_at":"2026-05-11T14:56:08.326566Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10982","last_updated":"2019-06-26T11:33:22Z","snapshot_observed_at":"2026-07-06T08:02:54.458844Z","submitted_at":"2019-06-26T11:33:22Z","title":"Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack","version":1},"cited_work":{"arxiv_id":"1906.10982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.10982","snapshot_observed_at":"2026-07-04T23:44:41.973551Z","title":"arXiv preprint arXiv:1906.10982 , year=","venue":null,"work_id":"b607c89d-4ed1-415f-abd0-95f0289d13a6","year":1906},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"cited_paper":"/paper/1906.10982","citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:5ef40809bd6812b77806c75e63b6f46ead53cf46e579dca981db7ec5229c98cf","observation_id":"b1177f58-c2fa-42b3-b0a5-c248c87b7656","resolution":{"observed_at":"2026-07-04T23:44:41.973551Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"ACM Transactions on Algorithms , volume=","venue":null,"work_id":"897f25f1-f350-4cbe-99c4-c5e68a48bd74","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:ce00f333d369340a3e7b690f843039cbf103ad0974eda7bd693efa12debd7e00","observation_id":"f7f91b7e-312f-4783-b255-57494f410aa8","resolution":{"observed_at":"2026-05-24T08:16:05.706650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Information Processing Letters , volume=","venue":null,"work_id":"f5c5c96b-c422-4743-ac22-a74f5781bb77","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:5647b9277f383030a3110f8305b8516956c581076bc97fa491c913053307da09","observation_id":"538fd514-3784-47b9-976b-534319adf1cc","resolution":{"observed_at":"2026-05-24T08:16:05.789990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-10T21:47:40.160819Z","title":"1997 , publisher=","venue":null,"work_id":"ccd6d681-8436-4d60-af61-a8b2d08b3542","year":1997},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0b19da225f18b3ff228dd6e12ce6d1c9e48893dc84cabc4f050cfaec7a42d03c","observation_id":"adfc77c5-f857-4cf8-b869-378d8b80ccec","resolution":{"observed_at":"2026-05-24T08:16:05.783818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":"979e77ab-7d1e-4419-bed0-15f0d6ce535f","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:860a7af7a06ce3153acb06f3afa02e0bc088bb0d25b5a22a3eaf9b98377bbf1d","observation_id":"9927e12a-ea33-4300-b804-6647fd34a526","resolution":{"observed_at":"2026-05-24T08:16:05.769977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages=","venue":null,"work_id":"4b90b174-4eb7-4a92-8265-857bf44b0a06","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:bbbf79ffdb0a2432cc56724dc15a34c3072592e5c9322c04ed56c2587fac2f9a","observation_id":"fbc1c676-e7e1-4335-b37a-3da1bbe535c8","resolution":{"observed_at":"2026-05-24T08:16:05.693793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of Heuristics , volume=","venue":null,"work_id":"3127ae02-87f2-49de-8791-0765039bee2a","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f87695d849813ee55e1c9378d3b14b3ea2a8d9063ef42188c7ec6eae01568c6a","observation_id":"bd798786-475d-46dd-b3dc-a2c06dccbb2a","resolution":{"observed_at":"2026-05-24T08:16:05.826387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of the ACM , volume=","venue":null,"work_id":"da46d4e9-c9c8-47c6-8212-47bc9a2df152","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:25b1d6bf0fa640ce4d1645ed9df3441a21ea5afc7de649c0d004535c841733b5","observation_id":"75e23e9e-b8aa-4a69-999a-244ce1c6d539","resolution":{"observed_at":"2026-05-24T08:16:05.816060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of the ACM , volume=","venue":null,"work_id":"1771efd3-5f47-4d5c-ab52-e6e8f83966a7","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:0a189791527be124d6288c042320cb72061ed70acfc20380ead312f8ce20fc21","observation_id":"8bebd59b-bcc6-48bc-82ce-ade17d3430ec","resolution":{"observed_at":"2026-05-24T08:16:05.710282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP) , year=","venue":null,"work_id":"15984935-dcb9-45de-a5e8-c4877485c9dd","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b22714e97279b1048610e98677145167f005b0c57c57e35627f04078c6a0354f","observation_id":"6b4fc74b-0e46-4ba2-8c8f-36f876004909","resolution":{"observed_at":"2026-05-24T08:16:05.729175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":"3c65beba-0908-4906-94d6-b4e0ad110dd1","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:010a678f630432d7c5601facac3983b1b3bca94b239514e54144bdeef4851408","observation_id":"8ba58aaa-98ff-40d6-a17e-68e9aca383a1","resolution":{"observed_at":"2026-05-24T08:16:05.765015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of Combinatorial Optimization , volume=","venue":null,"work_id":"4e24b284-c029-4575-a328-92f2888cee6f","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:c58ca06be0f35fb29855469648550e68ae344f0422ad810eb6d9f6c445be64ca","observation_id":"7bf68674-c947-4bd1-bbd4-b27cabced031","resolution":{"observed_at":"2026-05-24T08:16:05.696026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 1st Symposium on Simplicity in Algorithms (SOSA) , year=","venue":null,"work_id":"c44eddaf-fa3a-4ddc-a317-1291ece245d5","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:256e44f0543a0f8d86805d8959173df214aab5a837f0da69107496e2fbef45fc","observation_id":"2336936f-7263-4e63-9a36-904e9b6f1af6","resolution":{"observed_at":"2026-05-24T08:16:05.796747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Algorithmica , volume=","venue":null,"work_id":"6cb5c183-fa64-40ce-9523-3f9d8589f14e","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:b2ddd7cdd95e0b88a5e7c8b33306f880dc32562e314e057a480a9783bae862a8","observation_id":"54a8bdb2-72ea-4129-bdce-20e53c7a2550","resolution":{"observed_at":"2026-05-24T08:16:05.685752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"INFORMS Journal on Computing , volume=","venue":null,"work_id":"0f5d2038-d30b-4f80-9fb6-62c642ddccad","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:030629a44bf42cdbce1b893f2e4290c3a07cd3a3c13e1da8bd788c09dbe2a400","observation_id":"a5567192-2dd7-4cc4-bfcf-db3513dc2fd0","resolution":{"observed_at":"2026-05-24T08:16:05.669819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8792ee77-6280-447c-b0e9-b0ba15fadfd3","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:3e60411e9f0cb922ebadf53d3fd026e476dd906a4acb347a4a03331b56d834a6","observation_id":"f430a9d2-3c41-492a-a32a-037f8fcc69ec","resolution":{"observed_at":"2026-05-24T08:16:05.663083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"ACM SIGecom Exchanges , volume=","venue":null,"work_id":"43c141e4-e6fd-42e4-8f3f-dca237cac5aa","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:4ff3608e9420768907f94595cba3c5f9bd0eff854c788bd4d88d58f8c3ce993c","observation_id":"e4932e99-e2ec-4041-a48a-4ce9c5e82832","resolution":{"observed_at":"2026-05-24T08:16:05.799591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":"a74a72c7-cc5f-4266-ba52-4533e44eaf18","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:15649c332c6aa57a7d08b763311b4eb3a4015d0e1288c260b471a89e836ed7cf","observation_id":"d47e2d5c-da96-4eeb-9ee8-37042a51b344","resolution":{"observed_at":"2026-05-24T08:16:05.652922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Algorithmica , volume=","venue":null,"work_id":"3864c08e-fcd9-4eee-af6d-742a48847af6","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:bd9e93a7408fe564ec10dfd734d166942806a02db2102cef2e0f47ada062317f","observation_id":"8a2bec4d-956c-42ea-8024-3002650c4d0c","resolution":{"observed_at":"2026-05-24T08:16:05.649403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Combinatorica , volume=","venue":null,"work_id":"cbd37f78-c2b4-4b64-a0cf-15409c8da268","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:1a5ecd4b7efcc65bf2bfe26bb9dfdfa49f89652573e3867e48d419835c8a487b","observation_id":"9497eef0-27a0-4a26-bd63-acdc9d9f8a64","resolution":{"observed_at":"2026-05-24T08:16:05.656554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Journal of Scheduling , volume=","venue":null,"work_id":"47dcc492-c609-4b0b-a878-39cca0b72189","year":2004},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:dcbe18c210657e8606f3e5dfa075680b21c8548f0a6238f76379446c587d7338","observation_id":"11cdad69-dc8e-4621-8e8d-518c6fcc926d","resolution":{"observed_at":"2026-05-24T08:16:05.812843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Mathematical Programming , volume=","venue":null,"work_id":"a8f098b3-2f69-4a77-a082-8f994ce660e3","year":1990},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:6265506cb2ec9fc8c5376a23abd38055ee91c24e246bf0bb93dbfcf2cb2739a4","observation_id":"8fc70e5b-26d7-4232-894b-535c1eef636c","resolution":{"observed_at":"2026-05-24T08:16:05.647482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Discrete Mathematics , volume=","venue":null,"work_id":"3dd8a784-b543-49c2-a7f1-f504549177cd","year":2010},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:960ccca425a6f0f19a4c64ee5011f7a4376cbf6bea9eca145845c59515b9f841","observation_id":"1d299da1-e6c3-400a-bdef-330797a8d3bf","resolution":{"observed_at":"2026-05-24T08:16:05.809902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":"62d458f5-128d-4c78-9a8b-8044e39af313","year":2020},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:8f88228c2b09144edda3a580a2dc022da30bd99e0a59c98af0fd7f7e9f776790","observation_id":"774b18c4-61a8-4e03-8bb2-3ff678c92f16","resolution":{"observed_at":"2026-05-24T08:16:05.805633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Algorithmica , volume=","venue":null,"work_id":"26e9231e-bca9-4bee-9517-069151de14bf","year":2019},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:fd919b3b6faa3baff8635a1cb41135fdc6580676a42cd6777550828928a5c5fd","observation_id":"7dc38f18-3843-46c1-baed-3b223fb9b104","resolution":{"observed_at":"2026-05-24T08:16:05.639467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"and Tardos, Eva , booktitle=","venue":null,"work_id":"49e656fe-db71-48c2-823e-2dac81a736c1","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:a0bf5788cf69e4e11308709cf0a99f80e4a9dc6834d034f1397b9ac1f048995a","observation_id":"a4ec97b5-56ee-4dea-a3e1-40f993a664da","resolution":{"observed_at":"2026-05-24T08:16:05.646051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Minkowski's Convex Body Theorem and Integer Programming , volume =","venue":null,"work_id":"47f249af-5447-45d4-94f4-1ae2a96cb499","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:3b0a74f0c1de92d5f5506704599b59cb277dad36a6334e54e4ba1d6706f9090d","observation_id":"90b416cb-35fe-49a9-9eb0-4a19197e9daf","resolution":{"observed_at":"2026-05-24T08:16:05.659758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"f80f7b6f-b12a-488e-81fc-eb42f048e670","year":1982},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:d1f18a20cb56c3fa5203850a305233c5dbe6a4f3ddc11ca2fd9afc2da3087a99","observation_id":"248ca939-9239-4c95-b985-2837902fd4d9","resolution":{"observed_at":"2026-05-24T08:16:05.793405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages=","venue":null,"work_id":"ee6cc6fd-c992-40f5-ab6c-3f4490b3850d","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:282636030629e54726c65422f21e25b3b5466be0939e2f43b14aa82a50665214","observation_id":"e9f2b108-3742-4760-a910-5098b014741a","resolution":{"observed_at":"2026-05-24T08:16:05.689174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages=","venue":null,"work_id":"51a810a7-a60f-41f9-93d0-6bc9b9ddb3a1","year":2022},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:32b8904e29b3e91f700d19ca22ae5950999eebdc645fbcf7554f4b911e4d4ef5","observation_id":"4de1017a-6875-4001-80fe-c972b4edde13","resolution":{"observed_at":"2026-05-24T08:16:05.816451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Optimization Letters , volume=","venue":null,"work_id":"55be35b0-c7f2-4ef7-b9ba-824f7311f377","year":2025},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:f2273a7843ea028c5dfb948a54c08356999b6f0bb555a54bb29dfa2bdf5b918e","observation_id":"0d05e2d8-20ec-4cc6-866c-d78aac04bf18","resolution":{"observed_at":"2026-05-24T08:16:05.699681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Theoretical Computer Science , volume=","venue":null,"work_id":"627f3723-609b-4548-82a9-b6058b7e430c","year":2019},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:e3c27a692e323c0e8f5cf8eead1ba19c87a1fd1db98a35dade0ecf02e45d9886","observation_id":"758d91a0-24fc-4e46-93a9-96270fc10832","resolution":{"observed_at":"2026-05-24T08:16:05.810185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages=","venue":null,"work_id":"281d3716-42e8-42b5-a6c9-86d48594edbe","year":2017},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:cf02ecc9030247905265375e77b3b18c68d920697838f739d5d339d498a4b7e7","observation_id":"58c1400a-4b43-4882-b1e1-cea04a34638f","resolution":{"observed_at":"2026-05-24T08:16:05.619195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T08:02:06.889369Z","title":"2011 , publisher=","venue":null,"work_id":"232334b4-6343-4705-9e97-fd63f0abd7d6","year":2011},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:14af58f54c133c187c0f2c6e5eb3cc65e50f4bd39f0f327326ec60655ed61229","observation_id":"05d0f760-ad5b-4b2a-8faf-e268b0d37092","resolution":{"observed_at":"2026-05-24T08:16:05.626616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-08T13:54:59.190366Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":"b7995209-cae1-4cfa-8a72-f7e2cdaa4faa","year":1987},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:5bb5234cb9d2103ea598751cdd973ef49c60654e609cc04f82bf5e79ab703dde","observation_id":"19ccd3ac-fdc5-4bdc-9ad5-4ac30862712b","resolution":{"observed_at":"2026-05-24T08:16:05.632782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T16:01:17.631244Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems"},"reference_resolution":{"displayed":96,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":4,"verified_exact":27,"verified_fuzzy":62},"total_outbound_references":96},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 96 of 96 outbound references and 0 inbound Pith citation observations for arXiv:2605.05233."}