{"as_of":"2026-08-16T07:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de5c27f5fbd8266a8e2e2de2ef856f31142fd2e421cf685e11f6d5bf71d3cae8","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:19:10.183818Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2507.03766/citation-record","integrity":"/paper/2507.03766/integrity","json":"/paper/2507.03766/citation-record.json","paper":"/paper/2507.03766"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2006.04.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Pitsoulis","venue":"Operations Research Letters","work_id":"56c71048-e632-4899-bfef-e2bc0f2df5a0","year":2007},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:06.853522Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:a3ca2a3778d1b85923074f827e64fba2f1d76c753a52bf3afafa8ed94aea021e","observation_id":"879db35d-2d1c-4d75-bc53-dbf49a5acf94","resolution":{"observed_at":"2026-08-06T20:19:13.532778Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:06.895403Z","title":"A strongly polynomial algorithm for bimodular integer linear programming","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:06.895403Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:92e6df1c17f54e9a40034db9ebaeee7476b0dd48ab397a8d3637db6e82aa2fd5","observation_id":"12828d2d-872e-4245-8e11-13c0bf721ea6","resolution":{"observed_at":"2026-08-06T20:19:06.895403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-85221-6_1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"On the Power of Linear Dependencies , pages 31--45","venue":"Bolyai Society mathematical studies","work_id":"298d716e-d77e-4ef0-9ba3-e6110e5ef064","year":2008},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:06.976342Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:8853291029c99aa5ffbb87a0b7e84504d304dd5547b7b42d937773be8e31d9ee","observation_id":"2564f7cf-0a28-43bc-90b2-aba49db16d48","resolution":{"observed_at":"2026-08-06T20:19:13.347841Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.4285","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Woeginger","venue":"Journal of Artificial Intelligence Research","work_id":"48a8d95f-f6ba-4c90-92d2-aab00509f295","year":2014},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.039474Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:ec2aed6bcc49d771814e3b9c4ce577b723b7c8d4374b025995e0b8ab27e20e1b","observation_id":"61b3cf65-9549-4c3a-b86e-b5a87f6585bd","resolution":{"observed_at":"2026-08-06T20:19:13.169732Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:07.100900Z","title":"On complexity of lobbying in multiple referenda","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.100900Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:fa64e86580bc520f027f8b01e455144e7d7a37e5e1c7f509c00df88b88328a21","observation_id":"f115cf7b-8b46-4885-a381-5d023f67a446","resolution":{"observed_at":"2026-08-06T20:19:07.100900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976465.101","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Block-structured integer and linear programming in strongly polynomial and near linear time","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"77d13cf0-2eb4-49da-90c6-de19adb89c67","year":2021},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.234115Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:b529f3345b42f414b0d6db570362900cbd39163eea061b8bc013615cb7ea2b9d","observation_id":"8403c1cb-1e48-46d2-b3b5-013248d0848a","resolution":{"observed_at":"2026-08-06T20:19:12.981292Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Parameterized algorithms for block-structured integer programs with large entries","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"d0d67606-130d-4fa2-b388-7c24330e130f","year":2024},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.311392Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:7acef5cb04b3ea82e57b0b6e00513814db74310185ca2ce332b0fa5f5ac76ed9","observation_id":"e7d98ee2-74db-4d87-bff5-fadf13a2fb24","resolution":{"observed_at":"2026-08-06T20:19:12.824508Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:07.398044Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.398044Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:a192886fdb335909d9e9bec9ed5c3ded39b4efeec128488bbfcdea1692404cd5","observation_id":"a9583e9c-3567-4604-a754-7a0f60aa7e23","resolution":{"observed_at":"2026-08-06T20:19:07.398044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2018.49","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Faster algorithms for integer programs with block structure","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"898a1298-32b8-4321-8800-bd84d52b14fc","year":2018},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.509222Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:9da7cf45f56d04786db346bfacffd19f6bd2f381266cacc5c6d71dd4bba40f89","observation_id":"2e5cd66f-a47e-4ca1-a3c0-909203ca775f","resolution":{"observed_at":"2026-08-06T20:19:12.614364Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-06T20:19:07.623391Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.623391Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:1ab227600818c012895450c50858f87730e36962dade9baa4ac8f150b4d83225","observation_id":"38481124-33c9-4f3a-9305-9807364feaaa","resolution":{"observed_at":"2026-08-06T20:19:07.623391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:07.719167Z","title":"Sensitivity, proximity and FPT algorithms for exact matroid problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.719167Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:dc74c3c358c30520e6f81fe62030441e2aee8ce97d176631862835c686dbec72","observation_id":"48bebfe3-b40f-4ba2-b104-1f3fbe0a3615","resolution":{"observed_at":"2026-08-06T20:19:07.719167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:07.857585Z","title":"Proximity results and faster algorithms for integer programming using the S teinitz L emma","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.857585Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:c51fecf43850f6059cea08f818fc0728e51fbb52637b464d0e7d330689d68739","observation_id":"70080244-3c6c-418c-927e-e4d84b3b6c84","resolution":{"observed_at":"2026-08-06T20:19:07.857585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2010.10.043","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Golovach, and Jan Kratochv \\' l","venue":"Theoretical Computer Science","work_id":"4fe2a376-b287-4e60-9672-2a54435f1e71","year":2011},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.984946Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:23e255381ceebe73cc0c490e69ba329509e07dda40061a8d7b21095e0dc0186b","observation_id":"13afca25-453f-4feb-8864-aa4f0a7867ed","resolution":{"observed_at":"2026-08-06T20:19:12.421716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-022-01085-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":null,"venue":"Algorithmica","work_id":"72e37778-47b4-43a8-a8c8-77e861d4c98e","year":1912},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.107999Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:28af7e85b5a6069b428a0dea77d664d6cbcc5e78d0592d7a37a2723d47bf2801","observation_id":"63478a3e-81ba-463c-88b8-ba993361de42","resolution":{"observed_at":"2026-08-06T20:19:12.261443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01086559","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Functional Analysis and Its Applications","work_id":"644140f6-d066-48e5-8ec4-78b7744c1250","year":1980},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.225778Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:9384b03ce31a4e7ec12bc91b19552b3d21298507bfd2ab9b7244b95c78c13282","observation_id":"362e5a2f-ac06-4a21-a8f6-d6ff660291f5","resolution":{"observed_at":"2026-08-06T20:19:12.097736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-011-0490-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"n-fold integer programming in cubic time","venue":"Mathematical Programming","work_id":"e9943cb8-0b25-4248-8925-4a5309b99b47","year":2013},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.316426Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:00a91e14dac86c85989679846d548f2e28fedcc08e0dd13b14b4932cbb122489","observation_id":"e9ac14c3-6a7a-459b-9360-7df326c9338b","resolution":{"observed_at":"2026-08-06T20:19:11.946583Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2409.04212","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:11.729098Z","title":"Improving the parameter dependency for high-multiplicity scheduling on uniform machines","venue":null,"work_id":"ba59d185-1169-44e8-ae87-f1bf6bb90049","year":2024},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.447419Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:1bd703fb5a759fac2ca93d2ba07896b89bf114ec4c420aa05fe25efa4c2720ac","observation_id":"7968c91f-8b89-47fe-ab9b-a7893e50285a","resolution":{"observed_at":"2026-08-06T20:19:11.785783Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/19m1303873","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"N ear-linear time algorithm for n-fold ILP s via color coding","venue":"SIAM Journal on Discrete Mathematics","work_id":"c0ae489a-8dd5-4683-839d-3ca4189af127","year":2020},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.570738Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:6b4da737abbc672cdb264412c334a3aa99fe9c739026730826f08bf3016ceebb","observation_id":"c979783c-62bd-442b-8837-a95ee0a8c5c7","resolution":{"observed_at":"2026-08-06T20:19:11.540887Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2019.43","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On integer programming and convolution","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"6fccf896-6811-450d-ab45-238a07ede81f","year":2019},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.725209Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:a2a90d85ff3d6aecb35f8977652543d6a7e4d7abdbece6d95ef8375131381833","observation_id":"90106726-93fb-4c80-90c1-cdd55176b456","resolution":{"observed_at":"2026-08-06T20:19:11.398500Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:08.836623Z","title":"On integer programming, discrepancy, and convolution","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.836623Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:e792aafe7f2213fc2d56f3cb513d8e3509452219644d543f3058e42f3a10c79a","observation_id":"d301dd76-7e02-4cf5-9710-87fdb7e07d92","resolution":{"observed_at":"2026-08-06T20:19:08.836623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:08.906757Z","title":"Minkowski's convex body theorem and integer programming","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.906757Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:a7e0773cd4ad223570ce5359494a13d1c966ec4155006e847593123e061ee2fd","observation_id":"0c0f6efe-fc5e-475c-b03f-585e7fe685cd","resolution":{"observed_at":"2026-08-06T20:19:08.906757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:08.952887Z","title":"Scheduling meets n-fold integer programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:08.952887Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:fa9508d6c9c5916979bc92c379fb96cbbbc79b8303d3f1b0c03f361292fcb7c5","observation_id":"6f887ef8-1ffb-458e-851b-fe457b02f3aa","resolution":{"observed_at":"2026-08-06T20:19:08.952887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:09.001303Z","title":"High-multiplicity n-fold IP via configuration LP","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.001303Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:bb1d765bdb5fedf6f1bad9f7df5cae3f29d44a0b77de246e0670e07603a88d2e","observation_id":"a31ed8f8-7163-4c8e-a236-936ced3d57da","resolution":{"observed_at":"2026-08-06T20:19:09.001303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-019-01402-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Combinatorial n-fold integer programming and applications","venue":"Mathematical Programming","work_id":"b17e8445-2492-438e-9098-8e26d71c5883","year":2020},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.200762Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:fb0fe73b638974eaa7cde3f25f0db218f7ff32b94373c5d44f0f4d1b16692284","observation_id":"5ab7ceb4-4f7d-41ba-aa1c-28e2fe8554f3","resolution":{"observed_at":"2026-08-06T20:19:11.207291Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3396855","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Voting and bribing in single-exponential time","venue":"ACM Transactions on Economics and Computation","work_id":"331fa7f1-c48e-478e-8b82-8e86b1ad0ebc","year":2020},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.357609Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:c5df17fdcf82dbf32f16970e73c44f4d7c3ea9c6eea8a7f3e2548426b126db9e","observation_id":"56c172d1-fa74-4e4a-b382-3b398958ca9a","resolution":{"observed_at":"2026-08-06T20:19:11.081221Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:09.457553Z","title":"A parameterized strongly polynomial algorithm for block structured integer programs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.457553Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:34403578b1b3f210023fdad26ee5f55aac1aebe347180c03036ef839fa0ef1dc","observation_id":"4654b085-775e-490a-87f0-c0af49515e4c","resolution":{"observed_at":"2026-08-06T20:19:09.457553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2023/754","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Complexity results and exact algorithms for fair division of indivisible items: a survey","venue":null,"work_id":"3ab66d03-3d9a-4905-8783-caf21ed7b20c","year":2023},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.569806Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:7bcd4d0676c972ba287f9f739cd03bebe444a6e6afcabf02cd03325c4cc7b465","observation_id":"947cf5d2-312e-488e-bd39-25d49b0e14bb","resolution":{"observed_at":"2026-08-06T20:19:10.925616Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2276.32228","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:13.696174Z","title":"Papadimitriou","venue":null,"work_id":"05b2d3ef-09aa-4e51-891e-bd720dcf105b","year":1981},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.768686Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:49d8caacd179039729557d7eebd4646571d5aceb7676eb113692c007cbfdda17","observation_id":"0070a65d-c95e-4172-93d7-a0a828f57071","resolution":{"observed_at":"2026-08-06T20:19:13.812194Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-10T21:21:34.001485Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"cited_work":{"arxiv_id":"2501.04859","doi":"10.48550/arxiv.2501.04859","metadata_source":"pith","pith_arxiv_id":"2501.04859","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","venue":"cs.DS","work_id":"61a985bb-55b9-471b-97c1-f46a1686704b","year":2025},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:09.964173Z"},"links":{"cited_paper":"/paper/2501.04859","citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:5634fbb386d74352a21aed903125e73b02ff36baccd70a860b0c05cfc639e14c","observation_id":"8cbd87bb-cee5-4f1e-a725-c4710c4c4674","resolution":{"observed_at":"2026-08-06T20:19:10.749803Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2025.83","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fine-grained equivalence for problems related to integer linear programming","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"be770a43-69f7-4c5e-93b2-5e7552d97d13","year":2025},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:10.053602Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:d92a835084109a440de258cc08128304024f667b17637e2ec4c5ad0dfe597fab","observation_id":"d2f6aafe-99e0-43ee-8496-d45c89d972bb","resolution":{"observed_at":"2026-08-06T20:19:10.561192Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0166-218x(94)90036-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"on some geometric methods in scheduling theory: A survey","venue":"Discrete Applied Mathematics","work_id":"d89a27ef-d0f5-4a3d-9ffe-14cf11d0275d","year":1994},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:10.118497Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:6dd7d2e5e1628613f0c2cf78efeadf96548c04c351b45d9caf4174781c74620b","observation_id":"989bcdb2-2291-4960-8229-3cd5a26a0551","resolution":{"observed_at":"2026-08-06T20:19:10.390382Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:19:10.183818Z","title":"Bedingt konvergente reihen und konvexe systeme","venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:10.183818Z"},"links":{"citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:245da5a540a40b187b5bef7a82a6196f512d570ebcf57c552a1169f2f6d7ad1b","observation_id":"2a59ab51-b650-4c81-b1f6-4951735a0bd3","resolution":{"observed_at":"2026-08-06T20:19:10.183818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":19,"verified_fuzzy":0},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2507.03766."}