{"as_of":"2026-08-10T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c3fd196e9b433bcd5394d86985257e67fbb213b0bdd5d2c442caf95fdba35a8","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T16:21:24.453467Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2502.01192/citation-record","integrity":"/paper/2502.01192/integrity","json":"/paper/2502.01192/citation-record.json","paper":"/paper/2502.01192"},"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-09T16:21:25.205408Z","title":"Constraint integer programming","venue":null,"work_id":"73f7b0f0-66ef-4e59-b02f-358f96720bfe","year":2007},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.281734Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:2b2992d6cda6a49fd25fc2198c8194517aec605901389642f39c19ca483cacc3","observation_id":"74ada2c3-f257-4493-8d35-db78f517819c","resolution":{"observed_at":"2026-08-09T16:21:25.209909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.191087Z","title":"The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs","venue":null,"work_id":"b8221cba-3b98-4296-bb43-104e2149c282","year":2010},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.287075Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:c08585937e0f653516719eec12e9a9ab013f5776ee7517981d60c48a930d8b03","observation_id":"fea36375-07eb-4a74-a162-4aa254797e2c","resolution":{"observed_at":"2026-08-09T16:21:25.195816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.175656Z","title":"On capacitated network design cut–set polyhedra","venue":null,"work_id":"71fa5cb2-2ce7-46f5-9a07-1b1b8455d190","year":2002},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.291772Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:f28e5be6008a5672736a8471bc9784831c65dcc0c31c747c4562ebda0611aed0","observation_id":"5883ef06-f2c7-4dd8-a2ad-f9fcd5401d37","resolution":{"observed_at":"2026-08-09T16:21:25.181137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.159757Z","title":"Disjunctive programming","venue":null,"work_id":"602dd7b9-0e1f-43ca-b112-09f96424529e","year":1979},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.296446Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:40a21f49e25b4ef68b08bd309fa25071adc712f840e9ffa80efd43beaa64017b","observation_id":"4519708b-ca35-48dd-91c2-436a966bb01b","resolution":{"observed_at":"2026-08-09T16:21:25.164668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.145227Z","title":"Partitioning procedures for solving mixed-variables pro- gramming problems","venue":null,"work_id":"379ff4ad-03f1-4911-9166-bb1f1ef6137c","year":1962},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.301263Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:2a53c2909ed9948b18fe7637cbf33e77597e60afbb38930bf8b573d1c1324e5f","observation_id":"160547fe-3d75-41aa-bbef-a0d496db305c","resolution":{"observed_at":"2026-08-09T16:21:25.149852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.130966Z","title":"Heuristic algorithms in global MINLP solvers","venue":null,"work_id":"0847470f-8578-46ca-a9b6-b2f6dd440ca4","year":2015},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.305894Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:c6e1a30a21fcd9650483f13225e29b188706299474d23e03129bddb5e9edb4b7","observation_id":"87bfe141-aa9b-474d-824a-362835297449","resolution":{"observed_at":"2026-08-09T16:21:25.135424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.116635Z","title":"Capacitated network design—polyhedral structure and computation","venue":null,"work_id":"1865af20-cab0-4ed0-895e-61ca216ecf4b","year":1996},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.310917Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:ceae1b90decd29f0bfd7daee784bc4adcd0d8d0b3f512212575fba638879101b","observation_id":"2c01fc8a-4061-49c9-9911-b35ac8043b08","resolution":{"observed_at":"2026-08-09T16:21:25.121339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-08-09T15:59:40.427485Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-09T16:21:24.315272Z","title":"Pfetsch, Franziska Schl¨ osser, Felipe Serrano, Yuji Shi- nano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Liding Xu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.315272Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:d64ead2fba007d2656f527b472e3aa7596b4bc8f0e14333c32bbadcab89bd1f1","observation_id":"2d2ab426-6cf1-460b-8a8d-726a6785517e","resolution":{"observed_at":"2026-08-09T16:21:24.315272Z","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-09T16:21:25.101585Z","title":"Projected Chv´ atal–Gomory cuts for mixed integer linear programs","venue":null,"work_id":"2692ee2f-226c-4d52-801d-f96986838b41","year":2008},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.320125Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:c535557b2afcbc7ad8cbfe24c345982e65a2e5d618664e393eda144850cd10d6","observation_id":"a75e1c4a-9ddf-4553-a1b2-08426f9745d7","resolution":{"observed_at":"2026-08-09T16:21:25.106256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.324528Z","title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency infor- mation","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.324528Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:a017bf39fe5cb53146b1192e7f97730c2676e7bf1eca2dbd4e02ea2a681fde36","observation_id":"02aff0ae-a72b-4025-be0f-0c3020af4b71","resolution":{"observed_at":"2026-08-09T16:21:24.324528Z","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-09T16:21:25.076198Z","title":"Decoding by linear programming","venue":null,"work_id":"84399432-4ea4-4213-be4e-3d44e157bf82","year":2005},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.328842Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:7d4b2b76fa4db308c514558414c6ef617f681959d5f65c92188796c34c31e392","observation_id":"5178fe29-b661-4192-8428-cfbe1f405943","resolution":{"observed_at":"2026-08-09T16:21:25.080541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.061501Z","title":"Enhancing sparsity by reweighted ℓ1 minimization","venue":null,"work_id":"a3766939-7687-4281-9e21-30f9c8d65ec6","year":2008},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.333361Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:179cdfb97c173066db07201fe6303b1cbf13d23b1ec15ec7e120473f8b3e3449","observation_id":"80a6f8f4-43f9-46c6-92e0-636b9e1dd999","resolution":{"observed_at":"2026-08-09T16:21:25.066432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.047075Z","title":"{0, 1/2}-Chv´ atal-Gomory cuts.Math- ematical Programming, 74:221–235, 1996","venue":null,"work_id":"b768da6d-f265-4db9-a82c-45d8a42b4966","year":1996},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.337831Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:4a5424006133d24b2787b51de0af9a44345a231e1e9c3f5a9b463105b4b5b4c9","observation_id":"84a9bc0f-45db-4f43-8455-54b4275aa7e3","resolution":{"observed_at":"2026-08-09T16:21:25.051875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.032536Z","title":"On the separation of maximally violated mod-k cuts","venue":null,"work_id":"35ba508d-13b8-44b2-9411-40823e4737bb","year":2000},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.342041Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:c688e7db734aa91abdde0427b333cb2d1929405d2e61436df6fdcd40b49a7b37","observation_id":"c89643bd-0c0e-4341-8ff9-9a525f3d2b7a","resolution":{"observed_at":"2026-08-09T16:21:25.037221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:25.017411Z","title":"A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of mathematical imaging and vision , 40:120–145, 2011","venue":null,"work_id":"b6a03cd3-a55a-46c2-afd7-f7728e0ae64a","year":2011},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.346210Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:5a0258c152f6742da761da659f6bf8874096fd340f0b0fc897032e87db5e2308","observation_id":"62752143-1c44-42d3-ba65-84a2af8f96a4","resolution":{"observed_at":"2026-08-09T16:21:25.022099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.350432Z","title":"Atomic decomposition by basis pursuit","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.350432Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:5fecc23bb50ae58b57d5bd9e033b51f1cbb100febefe86576a9b6169f16d3260","observation_id":"cf1144fd-3577-419a-9731-ad896d0044ce","resolution":{"observed_at":"2026-08-09T16:21:24.350432Z","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-09T16:21:24.992344Z","title":"Separation algorithms for cutting planes based on mixed integer row relaxations","venue":null,"work_id":"560d3dbf-73ba-456e-be74-87c0297ab890","year":2009},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.354817Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:76afc967128aad20c656a2f7810831b71504b7002ddf68bb9bc1b250fbfcb3ec","observation_id":"e6020172-b641-4c89-9dcf-4c7785894ab0","resolution":{"observed_at":"2026-08-09T16:21:24.996997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.977965Z","title":"Edmonds polytopes and a hierarchy of combinatorial problems","venue":null,"work_id":"43ebd430-9fe1-4bf6-9562-4352ca0ca8a6","year":1973},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.359001Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:0a0ca13db8af499bde679ebd5ea36308ff96376bb2679d25e688ded97907a5b8","observation_id":"b426702b-ec78-4f51-9453-b680dcb42f0d","resolution":{"observed_at":"2026-08-09T16:21:24.982550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.963910Z","title":"Chv´ atal clo- sures for mixed integer programming problems","venue":null,"work_id":"99cf5417-c6ee-41ba-bc9a-f6cea5997e8b","year":1990},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.363473Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:4b6f6e82493b94aaf4d60539c526b6b8fda96353db617603fcc560d7c5f3ed3f","observation_id":"1fb099a6-ec14-4a27-b517-c45af592a400","resolution":{"observed_at":"2026-08-09T16:21:24.968510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.949878Z","title":"Valid inequalities for mixed integer linear programs.Math- ematical programming, 112(1):3–44, 2008","venue":null,"work_id":"73defb7b-3fc8-45b1-9efa-f9955ccaea96","year":2008},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.367962Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:88120d611ff5358bdfdb2179ce891112443a254c070be0387cc07b4103ab6faf","observation_id":"5c0714cf-6db5-4412-a9da-cb935abed1aa","resolution":{"observed_at":"2026-08-09T16:21:24.954538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.936420Z","title":"Applied regression analysis","venue":null,"work_id":"f850b513-41bb-44bb-868d-e805cc1bc36e","year":1998},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.372604Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:9b7c4f7dc8fa38547b542f549557895f496de61177a5ddf99fe3d0a0c70075c6","observation_id":"0ed77c86-6c32-402a-a3fa-50cfc254c433","resolution":{"observed_at":"2026-08-09T16:21:24.940603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.922655Z","title":"Optimizing over the first Chv´ atal closure","venue":null,"work_id":"3eb90b68-11b2-4f22-898b-7658b89f724a","year":2007},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.376799Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:4f4f571a72e8e3b04c0f041e98473a70af728f136d1c82959ba650438835b15a","observation_id":"0ab893c4-30df-4212-9e4d-ca3b4239a9ea","resolution":{"observed_at":"2026-08-09T16:21:24.927177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.908177Z","title":"MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library","venue":null,"work_id":"39ed6200-e133-49f0-93d4-e276a0f27c08","year":2017},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.381043Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:5e31c74330424f0b5c745c1b74c7f2da85927578f9047f93f81d6b7655ccff58","observation_id":"2d929b6f-0904-4edd-af76-f983c9f6a534","resolution":{"observed_at":"2026-08-09T16:21:24.913154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.894136Z","title":"An algorithm for the mixed integer problem","venue":null,"work_id":"ba5575f4-01de-476a-9c29-1ce55ab88533","year":1960},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.385163Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:fa803590d0ce31f22cada27ee0c7c54504c2c6237c803615a698ac601db0626d","observation_id":"1abe2cd3-8f99-4051-b066-9f13b59074b3","resolution":{"observed_at":"2026-08-09T16:21:24.898792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.879642Z","title":"An implementation of a separation procedure for mixed integer rounding inequalities","venue":null,"work_id":"6ebe9f61-7ef9-4997-af55-e374908f569e","year":2005},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.389616Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:d52c99e5781af86c3589e750d5a7fd78647ef289fdce00bea7c9ef1d8797072a","observation_id":"36f09a83-8b9d-4e83-9436-c9926b67b0f3","resolution":{"observed_at":"2026-08-09T16:21:24.884204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.865179Z","title":"Lifted flow cover inequalities for mixed 0-1 integer programs","venue":null,"work_id":"52dac865-c0a4-4147-bf99-f90f1abdb178","year":1999},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.394106Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:44171b2cd8d1be5509d3d547da049b574ae65087bc303d1f752d89565bcdab10","observation_id":"4d9428d9-734a-47cf-9f99-35d76357cacb","resolution":{"observed_at":"2026-08-09T16:21:24.869786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08692","last_updated":"2017-07-29T23:46:57Z","snapshot_observed_at":"2026-07-06T05:52:55.114145Z","submitted_at":"2017-07-27T03:04:28Z","title":"Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08692","snapshot_observed_at":"2026-08-09T16:21:24.398526Z","title":"Extended compar- isons of best subset selection, forward stepwise selection, and the lasso","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.398526Z"},"links":{"cited_paper":"/paper/1707.08692","citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:4b7ec87ddbde85d14ba40a4830412940cec16a7738b67936a86e76c6c98cc103","observation_id":"fc1e0169-a237-4d4c-a7ad-65d525ef4804","resolution":{"observed_at":"2026-08-09T16:21:24.398526Z","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-09T16:21:24.851068Z","title":"The impact of model selection on inference in linear regression","venue":null,"work_id":"21965404-1cb1-4ca2-84d7-f6a74d48d313","year":1990},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.403256Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:cfe191f956a03edd182cb9c61b83667fbf210cc271c6deb910c1eaab82cfed98","observation_id":"fb25fcfb-4b46-486e-969f-ec63c64d97e7","resolution":{"observed_at":"2026-08-09T16:21:24.855738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.836638Z","title":"On lifted cover inequalities: A new lifting procedure with unusual properties","venue":null,"work_id":"ae3d6897-e2e1-4672-928d-828675291bce","year":2019},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.407851Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:8e984ec5918bd048cc43cc3eeddd6fe5d804b7912e083bfdfe99ce3952c5005e","observation_id":"60e7c01a-ff96-4f26-8429-76b9a55ad828","resolution":{"observed_at":"2026-08-09T16:21:24.841545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.821342Z","title":"Performance variability in mixed-integer programming","venue":null,"work_id":"59484305-a598-4d0c-907e-e36eab5d9211","year":2013},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.412457Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:dc4c6c906e1076895a99ba76ae25c55fe7fb5e8e0fffcfc6dddb04fb5dd46885","observation_id":"6b3fa9c5-c837-41a6-b634-6e44c53db055","resolution":{"observed_at":"2026-08-09T16:21:24.826385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.805903Z","title":"The 0-1 knapsack problem with a single continuous variable","venue":null,"work_id":"dc561290-d548-46c9-9070-392ebdfe55fe","year":1999},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.416927Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:3235418fa264c0f052e8f459d4705d2be154727b713f974ea51bfa75289a4a2f","observation_id":"02592a36-538b-406d-988c-eed71670b5df","resolution":{"observed_at":"2026-08-09T16:21:24.810604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.791335Z","title":"Aggregation and mixed integer rounding to solve MIPs","venue":null,"work_id":"8572f587-0476-4fc9-a2e2-1542b42bc736","year":2001},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.421542Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:ec91dec9d7920364a762486c0832eae7ae3bb63ca76e4b6c16dceda081ccdf99","observation_id":"ce801138-6030-4b24-9fff-a400471433ce","resolution":{"observed_at":"2026-08-09T16:21:24.795852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.15110","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:21:24.658882Z","title":"Cut-based conflict analysis in mixed integer programming","venue":null,"work_id":"3e9b312f-872c-4c25-9f09-7187a0f2b853","year":2024},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.426192Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:efe79cee25cae6dbedd530a9b5f14618777e594ebef577153ba10813eee62b68","observation_id":"af408ab9-91a4-4a9d-9cbd-4228d1a6dca5","resolution":{"observed_at":"2026-08-09T16:21:24.669612Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.776712Z","title":"The cosparse analysis model and algorithms","venue":null,"work_id":"472c5a08-666d-4012-9143-229ae2ac85f8","year":2013},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.430806Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:433679aaf06ae433e02ff5ede9cc198a53e4652c03abdda8f0c75d408b3232ec","observation_id":"bd98f974-7bae-40a5-baac-3129d983757f","resolution":{"observed_at":"2026-08-09T16:21:24.781200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.762348Z","title":"A recursive procedure to generate all cuts for 0–1 mixed integer programs.Mathematical Programming, 46(1):379– 390, 1990","venue":null,"work_id":"ab6d3da2-445d-4e57-8c2f-4067ed542e51","year":1990},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.435077Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:a740006b6d0636e1d69390131bd5541298fbb1442a164964f68faa1202fdbde5","observation_id":"3a060cca-3742-484b-87b8-668238aec9b7","resolution":{"observed_at":"2026-08-09T16:21:24.767094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.748450Z","title":"Prediction error and its estimation for subset-selected models","venue":null,"work_id":"4af2fb33-3bc9-487e-a5f5-7367357743dd","year":1991},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.439616Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:197e9d17f584280870411c9dd34f198daf0286b8e98fabb830eaeb83e9220b8a","observation_id":"5cf9ea17-176d-449c-8029-4f2f0c4607d4","resolution":{"observed_at":"2026-08-09T16:21:24.752998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.444627Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.444627Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:c72d148fef28c317ca0aaa5a0fbf5fc633824fb2752110c42ee55b27fbb74035","observation_id":"a181cd92-16fc-4520-8b1d-7e954f664381","resolution":{"observed_at":"2026-08-09T16:21:24.444627Z","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-09T16:21:24.725337Z","title":"Cardinality minimization, constraints, and regularization: a survey","venue":null,"work_id":"45bf1d33-80ea-4805-a0fd-9a9bc4e6c8b7","year":2024},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.449120Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:e6bd0e3b488987d6b641a96c64e39825613ca7b5a33807d9973372d73c208e62","observation_id":"faaa4256-08d5-4949-abf6-da84fc38f27a","resolution":{"observed_at":"2026-08-09T16:21:24.729922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:21:24.711064Z","title":"Implementation of cutting plane separators for mixed integer programs","venue":null,"work_id":"03ad26b0-6fe3-47ca-ac8d-8b4db8d4cf6f","year":2006},"citing_paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T16:21:24.453467Z"},"links":{"citing_paper":"/paper/2502.01192"},"observation_digest":"sha256:eccd61cc79a42f05cebdde1cb3f59ed82bc8978fef51a2356ca17c6841962659","observation_id":"a3e545db-04fd-426c-a0e5-75db64b79558","resolution":{"observed_at":"2026-08-09T16:21:24.715644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01192","last_updated":"2025-02-04T10:30:49Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T10:57:56.845620Z","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":33},"total_outbound_references":39},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2502.01192."}