{"as_of":"2026-08-08T10:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3fa4efcac728daafd942427cba492d5f284ae9d3cf203b9c6b4639d2c84370d2","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:26:04.305630Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2505.22212/citation-record","integrity":"/paper/2505.22212/integrity","json":"/paper/2505.22212/citation-record.json","paper":"/paper/2505.22212"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:17.630804Z","title":"INFORMS J","venue":null,"work_id":"220d5fd2-e014-4171-bd1b-8127d7a20d68","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:57.709285Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:6de8adb0b5f2f00c8f4570ec7f172201395d123942914c5ba89ef739109a985f","observation_id":"8db2ca4f-60fa-4122-b3a6-0fd3f5bbe747","resolution":{"observed_at":"2026-08-07T13:26:17.723788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:17.320557Z","title":"Prentice Hall, Inc., Englewood Cliffs, New Jersey (1993)","venue":null,"work_id":"7b9a3c9a-7e84-446d-b8af-09af3ab74db6","year":1993},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:57.766583Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:5f5b873f3974d2601adc202503317d4a55f6eb100ba3a4b415bc4de95d8fcbdc","observation_id":"8a2d9e8b-fced-4afe-b390-280c1b590eb0","resolution":{"observed_at":"2026-08-07T13:26:17.431865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:17.119043Z","title":"European Journal of Operational Research190(1), 1–21 (2008)","venue":null,"work_id":"4f3bdfd1-ca04-4065-8592-1cab4e653029","year":2008},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:57.855529Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:b4314d4219f736282e9b9934ab18d7b6eefaa542a5da01b995ff6c80090a3fca","observation_id":"c0895c68-094d-45ff-9f22-f6d47a805ba1","resolution":{"observed_at":"2026-08-07T13:26:17.226331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:16.803057Z","title":null,"venue":null,"work_id":"8e28001b-aea4-4478-ad49-c7c7acc155e2","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:57.895392Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:c6049a2d15b10bf891af280ee64c669ee5ab8c74a5e6b3b8e108b4b91a3084e0","observation_id":"bded45ff-d0b5-456b-acc8-4a9debb74a97","resolution":{"observed_at":"2026-08-07T13:26:16.932119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:16.552028Z","title":null,"venue":null,"work_id":"8d9cade5-6dd1-4b2b-b0c2-f1c7a214c78c","year":2011},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:57.987149Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:0c1b914b2e88f1c2f6fd2a4b1130c9f0a59f997604e4cf83fd2e0c6bb8a397b1","observation_id":"0190aee6-791b-4f26-b54b-585ba5450a53","resolution":{"observed_at":"2026-08-07T13:26:16.648283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:16.393381Z","title":null,"venue":null,"work_id":"1d1274f9-32a6-4e6f-a3d2-62132ab44117","year":2007},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.049058Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:666af37b7f770f0277c444d84bc569617046bc05cf03d2989c561cf41069243d","observation_id":"754e0e2a-700b-44d6-8ddf-191a45cf2f9c","resolution":{"observed_at":"2026-08-07T13:26:16.432406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:16.198896Z","title":"Springer (2008)","venue":null,"work_id":"a80774d3-bb93-4713-8d7c-c877e5739fda","year":2008},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.137005Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:8f4fa48c026a5b3e53385ee6a2ac798ac02b4989e8d9762b5c5a159fe14f7071","observation_id":"fb2e3fa8-f57e-4fa3-a98f-9b2f3a895fb3","resolution":{"observed_at":"2026-08-07T13:26:16.290113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:15.948336Z","title":"The Annals of Statistics44(2), 813–852 (2016)","venue":null,"work_id":"9d1389d3-1a52-4ef7-a0b6-50f8db4f914a","year":2016},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.179102Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:9ef16d2efbb670a3708192b583164681fcd86820598d3dbc94fa32893ec0f62b","observation_id":"d6a3716b-7a3d-490d-ba35-f0ab44fdfd44","resolution":{"observed_at":"2026-08-07T13:26:16.077164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:15.675249Z","title":"In: Automated Planning and Scheduling, ICAPS 2005","venue":null,"work_id":"048b1137-5fba-468e-98b4-4ee8855aaaa2","year":2005},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.213416Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:01d87baa5557d222cfb3c4ddc657fe9324c62d82f7d80688211ea678af87d548","observation_id":"4a1dc406-5ebf-4eef-8e5c-6c9c4ee20130","resolution":{"observed_at":"2026-08-07T13:26:15.799346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:15.464206Z","title":"In: Mohar, B., Shinkar, I., O’Donnell, R","venue":null,"work_id":"0c530784-34e9-4472-b0c1-194d83a6bc9c","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.297232Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:29eaf620dd17578cfe8ffa05846a1607909e0d4be4aaf28435eef9ee3e95ef72","observation_id":"5da59acb-c140-49d4-b113-65b6df129cce","resolution":{"observed_at":"2026-08-07T13:26:15.575101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:15.305147Z","title":"In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Den- ver, CO, USA, October 31 - November 3, 2022","venue":null,"work_id":"32381b43-8d03-4802-9775-3b2f97d97410","year":2022},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.344743Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:3be70273c8be03533ceb9cf823a0e11d1ec8ea92c73e17fc56f53fee572a3a06","observation_id":"bb557075-1ba2-4a5a-a7d3-373703332861","resolution":{"observed_at":"2026-08-07T13:26:15.388873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:15.183634Z","title":"In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017","venue":null,"work_id":"827155b6-2a76-44ba-8c0e-e3814d5f687f","year":2017},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.417545Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:521fdc6c8c9d4ece7e79ea1f36eda9d7f615c29f89fefcdf9d37871071d0dde4","observation_id":"ecfa0920-8934-4488-9624-2f370c63e81e","resolution":{"observed_at":"2026-08-07T13:26:15.236753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:14.967814Z","title":"In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021","venue":null,"work_id":"42a342eb-3d35-40fb-8e82-7711310e357d","year":2021},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.472693Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:f1735a432a7aea27001b0bd3bf5fb26ccae402035e193918fed6e1136b79921d","observation_id":"0ebf1524-1c6f-4677-b1e4-947d4373f205","resolution":{"observed_at":"2026-08-07T13:26:15.016141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:14.786895Z","title":"In: 29th Annual European Symposium on Algorithms, ESA 2021","venue":null,"work_id":"59e808d6-fbb6-4424-97ff-bc0adc7e2e00","year":2021},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.520046Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:952b8fd2e306942f9833dd4caf5b7da6c468c7eef7a0dd32f9f8b86b6973fa3b","observation_id":"7dbcdaa7-e5f0-41dd-a49b-92968b115eee","resolution":{"observed_at":"2026-08-07T13:26:14.876839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:14.617256Z","title":"In: Woodruff, D.P","venue":null,"work_id":"c4d6fa7b-cf39-49ad-a776-60cdec75934b","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.609481Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:fb0a72f0569971c25652db2cd19da7d345cd1166580a726c6b827b09696d1bcd","observation_id":"4053d5ed-7d1d-4c75-a77f-b06ff75a2a59","resolution":{"observed_at":"2026-08-07T13:26:14.710951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:14.190720Z","title":null,"venue":null,"work_id":"2ebd5707-a940-4569-95ac-2c618677e8f6","year":2013},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.803558Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:475aadeebeae7e1a0068bac170b5591cd93acc2c9a14c92f4265f7eaee15b3a5","observation_id":"9823575e-21a6-4369-87ce-b968b99b8d2b","resolution":{"observed_at":"2026-08-07T13:26:14.286960Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.995039Z","title":"Discrete Optimization5(2), 231–241 (2008), in Memory of George B","venue":null,"work_id":"e8ecc72f-77fa-4949-80b4-56a085b614cb","year":2008},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.864750Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:e74232f74d8f9f24950bfd053b12b62a3a56a84d66e1dfa827b37019ec696bd2","observation_id":"8efa05e1-5f6e-4d07-bf40-17c127b62753","resolution":{"observed_at":"2026-08-07T13:26:14.082236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.834597Z","title":"In: Woodruff, D.P","venue":null,"work_id":"74b5a3b6-4349-4a47-af3e-65a3244be46d","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.917125Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:67bf644c967da41da1732b327bedda5bb1cbf533f50018eade0aa7b019429b01","observation_id":"7929247a-17d8-4a48-a554-8bd6bfa1db2e","resolution":{"observed_at":"2026-08-07T13:26:13.917435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.661071Z","title":"In: Khuller, S., Williams, V.V","venue":null,"work_id":"abc9a351-8b6f-440e-8852-090bac2ea47b","year":2021},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.992745Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:60d12d6249d833ab7df2fdf27a2e6788119d5ef8a8eaf04eebeae259a1ec7c94","observation_id":"2dfc100d-5b05-44c5-a118-2541b4b8e702","resolution":{"observed_at":"2026-08-07T13:26:13.788461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.458801Z","title":"In: 45th International Colloquium on Au- tomata, Languages, and Programming, ICALP 2018","venue":null,"work_id":"c23eeda0-78ff-40ac-abc8-37baf6029efa","year":2018},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.088375Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:62c8edcc4ad5932a3a7db606a8a89b4fb404a9bd421d9b044e2b6a3ab27549db","observation_id":"ade9cc0d-c5d1-4b3d-8db4-b8d2672a841d","resolution":{"observed_at":"2026-08-07T13:26:13.557081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T07:43:19.750560Z","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-07T13:25:59.195132Z","title":"CoRRabs/1904.01361 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.195132Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:14cc9b902c073be185fa1da584538a252678ea3bccd19a5d684ffef9c32ff836","observation_id":"fcac3ed5-c353-4e64-9b7c-09c7be57c7f1","resolution":{"observed_at":"2026-08-07T13:25:59.195132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.243564Z","title":null,"venue":null,"work_id":"482737dd-3d2a-4cf1-acd9-86564f5b0cd5","year":2023},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.307750Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:c346a056105f03fbf6ebacd02380eaeb1c2f8ce60c47735565bebd848739ecc3","observation_id":"02136ddd-6aae-4a41-b3e9-f32d1e69a3b2","resolution":{"observed_at":"2026-08-07T13:26:13.372220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:13.112730Z","title":"Mathe- matics of Operations Research0(0) (2024)","venue":null,"work_id":"0b379e23-5ae7-4407-a1f1-7e8cc849dd25","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.373490Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:8e3d80629ca40bde2ce5aa196a8c3929f9189a414b4eb96ff94162657fa6f977","observation_id":"34ecf45d-9621-442c-9aff-3faa39380c63","resolution":{"observed_at":"2026-08-07T13:26:13.152023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2501.02347","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:04.634322Z","title":"CoRRabs/2501.02347 (2025)","venue":null,"work_id":"61a00a25-5bd2-45a2-bce0-c9cba056207d","year":2025},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.432684Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:899317f4c4916d73723d850b87a7e7df0db8bb2da47eb6886314b6e8f163b124","observation_id":"8cadf929-d0bb-4929-8c7f-eb647ce2ed39","resolution":{"observed_at":"2026-08-07T13:26:04.660758Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:12.952643Z","title":null,"venue":null,"work_id":"ead6bc13-0ebc-4567-9c37-23a075b85dd8","year":2005},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.487912Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:a5296e4fc22efb81445101fb3b11698dcb2da9a35344c855e471f9f7633b5763","observation_id":"8469273e-68de-47e3-b1fd-430cb71da7ba","resolution":{"observed_at":"2026-08-07T13:26:13.044453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:12.703714Z","title":null,"venue":null,"work_id":"b9ae7204-b89f-413a-973b-f28720c764e8","year":2022},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.546841Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:6c3cc24864721d5b89c5f9c4e0c3a62c24ca2dcebe93c85a444b9d28122f5a25","observation_id":"244c11d6-361d-4e11-8dc5-6bf6730b1e1f","resolution":{"observed_at":"2026-08-07T13:26:12.817237Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:12.548508Z","title":null,"venue":null,"work_id":"b1ffb229-97c9-4c2b-889a-20a327db6b32","year":1975},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.630991Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:ce9f79d64169223f7035a3318a33f71b625f8cd44efa350dc3560a3ec16d9721","observation_id":"2a14e61f-eb94-4fd1-81f1-3ffa716dfd12","resolution":{"observed_at":"2026-08-07T13:26:12.626375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:12.289331Z","title":null,"venue":null,"work_id":"c2b6e3a0-a430-4cc2-a16e-9314220f05a1","year":1993},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.735480Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:6d14f26b4dcb40b5d5e0018e5cd19fd75d92f79a0ea1da0a3e47225a1d860cd0","observation_id":"5c3d53c9-b08e-4791-bbb8-f38eebc9246a","resolution":{"observed_at":"2026-08-07T13:26:12.410636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:12.060297Z","title":"Mathematical Programming145(1-2, Ser","venue":null,"work_id":"0c2c6b9c-139d-4283-9e7b-3e945f86aabf","year":2014},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.814334Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:f716571ae7bae9175348148410ef5d512cb7a9b010eb01f2e2201738ec0321bb","observation_id":"7363f002-0caf-4b07-932b-744e960182d9","resolution":{"observed_at":"2026-08-07T13:26:12.155160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:11.861109Z","title":null,"venue":null,"work_id":"9134f183-06ee-4430-a581-3a2d521f759f","year":2013},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.946520Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:fa43295d79ab7ee5b5fa80821720ce9e83d610b76cc0c98426c157bcc401fe88","observation_id":"17a4651a-5a6f-4268-958b-9dae80a7bc43","resolution":{"observed_at":"2026-08-07T13:26:11.909305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:11.621387Z","title":"Mathematical Programming94, 323–341 (2003)","venue":null,"work_id":"a7723c61-f736-422d-b3e4-182a9249888c","year":2003},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.013510Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:f90ac1e99c05376cb0cde93f4793465e9d874c8e750f0d3dcf3c998e4d7853b6","observation_id":"7059498f-713f-43d1-a3a5-15a799877d8a","resolution":{"observed_at":"2026-08-07T13:26:11.746961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:11.409016Z","title":null,"venue":null,"work_id":"c0b8aacb-0937-449e-b004-b13afa83390d","year":1994},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.116983Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:7cfa69f8642e7fb770df891c390ced7e581da830227655d0667acc63f1a70419","observation_id":"73e0138c-421f-45fa-be8c-0ee73545d1af","resolution":{"observed_at":"2026-08-07T13:26:11.518671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:11.177650Z","title":"Journal of the ACM37(4), 843–862 (1990)","venue":null,"work_id":"28696d0c-96e9-48e1-b12d-75d7d5d750c9","year":1990},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.227710Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:b7ddfce359910ec900aa052286832918c4ef90aae7e786e46bdb6c5efc51760b","observation_id":"c9d223a0-38ce-46bc-bdf1-5249793f7add","resolution":{"observed_at":"2026-08-07T13:26:11.280857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:11.018566Z","title":"In: Vygen, J., Byrka, J","venue":null,"work_id":"e57fd403-9f02-449c-a12a-514f5e313541","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.357804Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:ef46d88d027dbab47dd9417605923c20a9533ae12ade590b9377d2c241497310","observation_id":"fed64d38-22f2-45f0-a53f-81754c6f1f57","resolution":{"observed_at":"2026-08-07T13:26:11.102787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:10.828775Z","title":null,"venue":null,"work_id":"656e8095-6bd2-484c-8f95-32d8e4d01e0a","year":2023},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.476079Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:45395cd83cec2cf520ea82a9c0759495bc97896ef8acdbd0bf2bbfd9e55ac7a0","observation_id":"275877ae-a4a5-4fe2-b3a8-cbee3f97e400","resolution":{"observed_at":"2026-08-07T13:26:10.911574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:10.648110Z","title":null,"venue":null,"work_id":"a8cbefe2-92b6-49a0-bdef-7ebb0fa01fb5","year":2022},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.529477Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:1a6c843bf1c7a98693e9796a2c9d417bf5b85e396f0e17b1d29be8a72f6fd48e","observation_id":"78b4bec7-f6c8-48fb-8fbc-b6b2e1e586f5","resolution":{"observed_at":"2026-08-07T13:26:10.768324Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:10.521193Z","title":null,"venue":null,"work_id":"70a43355-1ccc-4c82-b7f9-d630fb13b30e","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.621140Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:a82e459c881c37661104ac3449bbda7c7d94072a59cde663bf3ff65f14c897b9","observation_id":"0e5b6125-1b41-45c7-8758-5fdd1555fd29","resolution":{"observed_at":"2026-08-07T13:26:10.591996Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:10.336543Z","title":"In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D","venue":null,"work_id":"4ffb5351-26f0-4d7f-b453-4fc2bcf09994","year":1972},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.743472Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:c21f67634ac4d0c9e3d50735b3092caae9988029bbb927b11c14a5c91a5b7a06","observation_id":"2f86accb-3f37-48d1-b3b7-3d18dfdca153","resolution":{"observed_at":"2026-08-07T13:26:10.441690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:10.210944Z","title":null,"venue":null,"work_id":"2a57dd90-65d4-4fca-999f-b07ee38be607","year":2022},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.827771Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:31176f09d647eb27a81cbbd825a0092403b0982e286bb4eea14d5a779f9423a3","observation_id":"947a5e4f-c045-4749-9447-993910dafa0a","resolution":{"observed_at":"2026-08-07T13:26:10.259173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:09.987225Z","title":"In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022","venue":null,"work_id":"cbdaf65d-ea7a-4592-ba7e-61b620094892","year":2022},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:00.929431Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:91c4e4f877bf2834316f64de73065bf76e610ac611efdc82eeaf3a00abf1334d","observation_id":"03640cfc-b3c8-4c77-b71e-793f327dfee4","resolution":{"observed_at":"2026-08-07T13:26:10.126983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.07326","last_updated":"2019-09-16T16:40:11Z","snapshot_observed_at":"2026-07-06T08:22:09.027149Z","submitted_at":"2019-09-16T16:40:11Z","title":"Multitype Integer Monoid Optimization and Applications","version":1},"cited_work":{"arxiv_id":"1909.07326","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.07326","snapshot_observed_at":"2026-08-07T13:26:04.396828Z","title":"Multitype Integer Monoid Optimization and Applications","venue":"cs.DS","work_id":"bedacaf9-fe8c-4cbb-a8f8-cf639a4ab076","year":2019},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:01.076589Z"},"links":{"cited_paper":"/paper/1909.07326","citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:81e4eb511110321e44731fe83d099eb00323ec9f7883b9a8cff655b49e6f827c","observation_id":"5a70f44a-eb07-4737-b3d4-610f4c1d4dcd","resolution":{"observed_at":"2026-08-07T13:26:04.423022Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:08.245938Z","title":"Mathematical Programming200(1), 199–227 (Jun 2023)","venue":null,"work_id":"1431ad9f-45e0-4bc0-b8a6-221e24009c34","year":2023},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:01.147364Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:b308d9f9f81b6a7c5a82313574c13e83d2e49430091375c9dfa92613d071d709","observation_id":"bc32764b-010c-4c6d-a94a-f226b328ba1f","resolution":{"observed_at":"2026-08-07T13:26:09.058514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:07.420549Z","title":null,"venue":null,"work_id":"17af7e36-1dd2-429d-935e-024a35e49997","year":2018},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:01.258896Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:b4298cdada634773b402b9e4b189dc55d6dc64d6b2985660a9b79a3d796acb70","observation_id":"6cefa236-0e23-4526-8416-300053948b00","resolution":{"observed_at":"2026-08-07T13:26:07.676421Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:07.044364Z","title":null,"venue":null,"work_id":"69a5dc61-22d2-4aa8-ae8a-7fd4473f54d8","year":2021},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:01.634463Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:8ae025582dea78f2133faaea52d5376e2ed1057964709f89b80caecda94a2cfa","observation_id":"1aacb225-1fde-495f-bd59-f4c75dac3d82","resolution":{"observed_at":"2026-08-07T13:26:07.234376Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:06.841971Z","title":null,"venue":null,"work_id":"08023989-7006-4ab3-86f9-83f67bcf6597","year":2023},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:01.964734Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:9b6950c328d82581e79a12b49efd7b55daf6e8579e6b5e919415581478bc7730","observation_id":"3ac41006-d080-45b4-ada0-283c4c108a88","resolution":{"observed_at":"2026-08-07T13:26:06.941611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:06.590478Z","title":null,"venue":null,"work_id":"52635ae5-18a3-4f4d-9cc5-143f062864cd","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:02.778907Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:3213e2a6bc97b10eaf5cf7c45848baf089b7905c253fb9a2518c451fae3d098b","observation_id":"d5eb516c-9096-47fe-8a94-924caff44ea6","resolution":{"observed_at":"2026-08-07T13:26:06.722597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:06.457570Z","title":"ACM Trans","venue":null,"work_id":"fbb6aeb4-a9b9-4991-8731-021c3f81d29c","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.476847Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:530a4089a5210cf787e8cc1afc7d991409c6225d716eecc57566d8e77a6e69f5","observation_id":"fb9f5195-5e54-4fe9-b2b7-ad7b0dd8af49","resolution":{"observed_at":"2026-08-07T13:26:06.516656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:06.272269Z","title":"ACM Trans","venue":null,"work_id":"767892e4-4a3e-4f3d-bfad-b6a3355649e8","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.768075Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:16d52aaf7d6518171cc19e6cc94ffc8ee8a5a576fb0910e6b9702b53577b9a6b","observation_id":"7fe3303d-a55f-4d5a-be62-6805e77463bb","resolution":{"observed_at":"2026-08-07T13:26:06.354846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:06.070221Z","title":"INFORMS J","venue":null,"work_id":"ce0b0dbd-8eb6-4d95-9977-70403e0b4d9f","year":2020},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.809425Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:f97698c7cc89a87986d924eea710f45a8692b3f71da4261200184f006f711d53","observation_id":"d3419b8c-7a6f-48b7-b1e6-dc7675504a52","resolution":{"observed_at":"2026-08-07T13:26:06.121225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.934542Z","title":"In: Proc","venue":null,"work_id":"4c2fd4ea-5dda-46f5-87c3-0dd7dce46c4d","year":2018},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.841528Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:52714e89f82232bc913bb7462ba34d5d081abb9aa5da36e5178f0a2f32847dda","observation_id":"95b32785-fd6b-4388-8c51-fccce55f615e","resolution":{"observed_at":"2026-08-07T13:26:06.006316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.843673Z","title":null,"venue":null,"work_id":"05fe5239-785d-45e1-9e23-e8b4fa5bdeff","year":2011},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.887621Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:4ca4f818b7c9ae5b54dc981f6a3dfec6fc3b1fed14e7897b15ed0750683d23d8","observation_id":"ba6d0023-def9-4a41-9b2e-43dfc60f1d9a","resolution":{"observed_at":"2026-08-07T13:26:05.881211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.720039Z","title":"European Journal of Operational Research141(2), 241–252 (2002)","venue":null,"work_id":"12c08b65-5de8-4fad-8910-6cebfd50b056","year":2002},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.919152Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:6a31dd7a15709c141bb54577cda6fd5e8072e1fd67b358dcf8434b8ada55c0eb","observation_id":"b4de6a85-441b-4149-acde-7bd5b295804d","resolution":{"observed_at":"2026-08-07T13:26:05.764343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.530635Z","title":null,"venue":null,"work_id":"244aa8df-b720-48b7-b827-b4beb29869d5","year":2004},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:03.955755Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:a23df5f92af15d5f10baf15f51e15f2b76f9bdf64dc61d25385caa474c0e3eff","observation_id":"f1e00474-2ec4-466a-ac9f-ec3ff058dd51","resolution":{"observed_at":"2026-08-07T13:26:05.650184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.351719Z","title":null,"venue":null,"work_id":"053d5c5c-3e46-454d-9c33-3ca887dad6d2","year":1992},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.019629Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:ff860e81dcd5262135545d863c64026cbf1ade0878095c035ca7150ea29cc7f4","observation_id":"7662d439-021a-4303-98cf-5e48f2487511","resolution":{"observed_at":"2026-08-07T13:26:05.480738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.206219Z","title":"Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","venue":null,"work_id":"141b2cf5-69fb-4e66-836c-bf707b233d82","year":2010},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.094893Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:c1fd875d1041109a7c0926d0c40b08c52c9866412584594fc610d886a1bba72c","observation_id":"a42ed35c-fad7-4f87-8d5c-cc08c7342d65","resolution":{"observed_at":"2026-08-07T13:26:05.274651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:05.059116Z","title":"In: Esparza, J., Fraigniaud, P., Husfeldt, T., Kout- soupias, E","venue":null,"work_id":"e69f6a36-73a8-43a0-b64e-e6e4aa3a2383","year":2014},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.167044Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:4a2e3f9c2083616c899f216b56794da7782f6ad3478c7ed5534287ff3f03e81a","observation_id":"eeaf38ba-3f4c-4766-8d00-f28f89f0034a","resolution":{"observed_at":"2026-08-07T13:26:05.135149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:04.973192Z","title":"Statistica Neerlandica50(3), 404–416 (1996)","venue":null,"work_id":"293229e3-ead9-4f84-9d6c-d0c74447a15e","year":1996},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.213904Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:21c85ce521c2f7f8a282fa461bf0b7ef54f476e208d411837e16f40e67dbb50a","observation_id":"4132c65a-a93c-4647-992e-096273f55a33","resolution":{"observed_at":"2026-08-07T13:26:05.020857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:04.860484Z","title":"(eds.): The Vehicle Routing Problem","venue":null,"work_id":"530340bf-53c7-41ab-9396-672fb951bf65","year":2001},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.254435Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:e83a7543fdc2b92518c0f3d300a6cfdf3cdc5370dbb614c46a8fd9afc004886a","observation_id":"1c4d4112-b680-402a-bdda-357f57e1a644","resolution":{"observed_at":"2026-08-07T13:26:04.916036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:04.729592Z","title":"In: International Joint Conference on Artificial Intelligence, IJCAI 99","venue":null,"work_id":"4add8265-5bea-4309-b3cf-2a5d7971ad41","year":1999},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:04.305630Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:216bc69022b2c69269a1c4d87753e6ee9d1e9592df6b20de858e935f2caf3e83","observation_id":"3b11cbea-41ed-4c3a-af8b-6d54edbeda10","resolution":{"observed_at":"2026-08-07T13:26:04.794153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:14.397367Z","title":null,"venue":null,"work_id":"bb9bda58-f5e7-4731-81bf-79ea50d26cc4","year":2024},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:58.704824Z"},"links":{"citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:5fe80d8824fe49023504d954873b69ab3574eaf9daed616c16814093c8fd7b55","observation_id":"8ab7d01a-fdb7-4b38-8bc2-3060866196f1","resolution":{"observed_at":"2026-08-07T13:26:14.513589Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T13:10:21.065908Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":1,"unresolved":23,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":60},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2505.22212."}