{"as_of":"2026-08-10T20:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e8af76384b71d686bf2e6af2e545e901a8779570ea43c24d3ab68c992ec673a","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:23:47.675608Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"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/2608.01385/citation-record","integrity":"/paper/2608.01385/integrity","json":"/paper/2608.01385/citation-record.json","paper":"/paper/2608.01385"},"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-06T00:24:01.914747Z","title":"A strong conic quadratic reformulation for machine- job assignment with controllable processing times.Operations Research Letters, 37(3):187–191, 2009","venue":null,"work_id":"6240729f-be2c-4706-b025-a8ededc0c1e8","year":2009},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.430516Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:c9a5c56ade66ecb680b5b53e2e741c9d61e1e59ca05e6032f0986a73379587a3","observation_id":"3f70a1ca-ccde-47f4-b4a7-d82e5292f7f7","resolution":{"observed_at":"2026-08-06T00:24:02.034478Z","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-06T00:24:01.714720Z","title":"Strong formulations for quadratic optimization with m-matrices and indicator variables.Mathematical Programming, 170(1):141–176, 2018","venue":null,"work_id":"31fd5538-04cd-44fd-a0e7-a503ae567eb0","year":2018},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.524447Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:a3f7e2ccce3871876bf44c4faa76fef9d5d619f815bc9e5d2b0907e4b4175d39","observation_id":"913b110b-1ae8-4125-ae8b-2d9a7e9ec8d1","resolution":{"observed_at":"2026-08-06T00:24:01.786404Z","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-06T00:24:01.404764Z","title":"Rank-one convexification for sparse regression.Journal of Machine Learning Research, 26(35):1–50, 2025","venue":null,"work_id":"7daf46f7-f9dc-42d7-a725-9ac9895e48e6","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.620563Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:03279dcfda7be7f43e0d55e40dfeb94aeff2a9081dc8bbf05fa86281f8c9b30c","observation_id":"3293092d-226f-45fd-91f5-6c754f9b92a5","resolution":{"observed_at":"2026-08-06T00:24:01.516819Z","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-06T00:23:41.694494Z","title":"Disjunctive programming: Properties of the convex hull of feasible points.Discrete Applied Mathematics, 89(1-3):3–44, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.694494Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:f4f2a0c5859a91471484d145cde6f48691b1ea723396ac6281ff1d3a4ac1d57e","observation_id":"d2341214-8ac3-408a-971e-3e66bc8eeeaf","resolution":{"observed_at":"2026-08-06T00:23:41.694494Z","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-06T00:24:01.081631Z","title":"Bestsubsetselectionviaamodernoptimization lens.Annals of Statistics, pages 813–852, 2016","venue":null,"work_id":"e7fee38e-c735-4ab3-9afb-3f5ae48bf9d9","year":2016},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.790611Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:9c03638463b2009a579e04704740bbbe786c974f74fcd9a01959034190f0aea8","observation_id":"c7605d8b-4872-4e14-b842-80de08d76028","resolution":{"observed_at":"2026-08-06T00:24:01.160351Z","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-06T00:24:00.702510Z","title":"Sparse high-dimensional regression.The Annals of Statistics, 48(1):300–323, 2020","venue":null,"work_id":"e8a46913-c601-4b33-8f38-edbb9a2bb767","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.866097Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:ec7328c4cb0b12f1ab115ab2be46c8112f86fbe0a8d57a6e810759371b229b22","observation_id":"17b7a286-360a-4d95-9a89-b7004823c25c","resolution":{"observed_at":"2026-08-06T00:24:00.848433Z","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-06T00:24:00.382944Z","title":"A parametric approach for solving convex quadratic optimization with indicators over trees.Mathematical Programming, pages 1–46, 2025","venue":null,"work_id":"abf692cc-a8b0-4d61-b8da-aec0f7314475","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:41.936067Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:6547405c1c22e711827bf570a19d7665c824cea4c4393327803fae58444d371e","observation_id":"fdcf0dc3-fdfb-4cd0-a9d6-35008755d3a7","resolution":{"observed_at":"2026-08-06T00:24:00.564866Z","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":"2603.02103","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:49.059470Z","title":"Solving convex quadratic optimization with indicators over structured graphs.arXiv preprint arXiv:2603.02103, 2026","venue":null,"work_id":"a77c34bd-1a6c-4d2c-85aa-ec4754fca6d9","year":2026},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.034140Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:92ccd2ca628c9b8262f04f51622f9d0b401f30c93521ade215fd7cf02d93dbc9","observation_id":"d995221b-177a-4858-8ab2-a82021a93f51","resolution":{"observed_at":"2026-08-06T00:23:49.168900Z","resolver_source":"raw_fallback","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-06T00:24:00.129306Z","title":"Computational study of a family of mixed-integer quadratic programming problems","venue":null,"work_id":"40fd4998-e621-4448-a33a-b6a2a8bc982f","year":1996},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.108791Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:89b87be81d010f55d90c767a3adb7e7501fdb2df43bf4eab8ec0b214c8a8e7ec","observation_id":"f1038d93-6faf-4107-a227-6e3a57612480","resolution":{"observed_at":"2026-08-06T00:24:00.279655Z","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":"2411.11722","last_updated":"2024-11-18T16:53:07Z","snapshot_observed_at":"2026-08-09T00:45:43.045257Z","submitted_at":"2024-11-18T16:53:07Z","title":"Solving convex QPs with structured sparsity under indicator conditions","version":1},"cited_work":{"arxiv_id":"2411.11722","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.11722","snapshot_observed_at":"2026-08-06T00:23:48.768812Z","title":"Solving convex QPs with structured sparsity under indicator conditions","venue":"math.OC","work_id":"9b95f89b-2c88-489c-b78e-bc9262e77899","year":2024},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.217714Z"},"links":{"cited_paper":"/paper/2411.11722","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:3ed5f0dc740e6983efc75d14b99e4f518f1bdef50d70002ccb94566208736c44","observation_id":"ea54bfd4-8f0f-40bf-8ae6-5095dbace30e","resolution":{"observed_at":"2026-08-06T00:23:48.881928Z","resolver_source":"local_arxiv","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-06T00:23:59.905137Z","title":"LP formulations for polynomial optimization problems.SIAM Journal on Optimization, 28(2):1121–1150, 2018","venue":null,"work_id":"b2dd1903-acb1-4109-ab93-b12182f214e1","year":2018},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.314179Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:1de8c724f8b17fbcf8b6ce3e8a7f187926886ac079dd76544083f0f21eaddbe6","observation_id":"532a0d15-7c1b-4b98-a36f-e89b5652daf2","resolution":{"observed_at":"2026-08-06T00:24:00.049409Z","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-06T00:23:59.697864Z","title":"An algorithmic framework for convex mixed integer nonlinear programs.Discrete optimization, 5(2):186–204, 2008","venue":null,"work_id":"a3f03d2e-1007-4a85-a4cb-72a146e5c544","year":2008},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.399036Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b552a9e983273b802a7dad1b510609c919535aa32c1341a947fb2ba17777318f","observation_id":"34809195-6008-4409-afb9-ce1691a32b11","resolution":{"observed_at":"2026-08-06T00:23:59.828859Z","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-06T00:23:59.459795Z","title":"Algorithms and software for convex mixed integer nonlinear programs","venue":null,"work_id":"39cdd0d3-1032-4217-99da-c4c9cbb385a2","year":2011},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.454850Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:d4e73630101fdcd86a34f8617058729eaf94f6fd88c826883ae8fe12f107fa99","observation_id":"cd4cebf0-eed1-4a6b-9f45-6c5de9e7ba5d","resolution":{"observed_at":"2026-08-06T00:23:59.538454Z","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-06T00:23:59.230876Z","title":"Human activity recognition from accelerometer data using a wearable device","venue":null,"work_id":"4104293d-2e0d-4708-9dd9-49e247c22010","year":2011},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.529854Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:2e8fad6342d53cfe0a42dabacdad2e4f1864ad65f6c10ffce38f1ac53657c834","observation_id":"04f3d67e-0dcf-4084-9438-9e933d0b9f3c","resolution":{"observed_at":"2026-08-06T00:23:59.363395Z","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-06T00:23:59.008587Z","title":"Personalization and user verification in wearable systems using biometric walking patterns.Personal and Ubiquitous Computing, 16(5):563–580, 2012","venue":null,"work_id":"15977255-fc1f-4334-a721-5942290bc0a3","year":2012},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.669565Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:a35eba92e8aed957350edd39595c85f1d9da87b9c15bb43f2fbc5b553db70ded","observation_id":"604e3909-8aaa-4db6-b8e1-120b961e4986","resolution":{"observed_at":"2026-08-06T00:23:59.121549Z","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-06T00:23:58.747057Z","title":"Convex programming for disjunctive convex optimization.Mathemat- ical Programming, 86(3):595–614, 1999","venue":null,"work_id":"0dca02ed-01c4-4280-84ea-86208662c364","year":1999},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.783055Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:51a28351a03eb0c8cc5576c1e61757886cefcd7c8658517357f49bd5559757b7","observation_id":"8cc4f19a-b937-423b-b510-683139156e82","resolution":{"observed_at":"2026-08-06T00:23:58.851980Z","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-06T00:23:58.593516Z","title":"Complexity of unconstrained minimization","venue":null,"work_id":"fc859f93-0953-421f-9bf5-aceb30354440","year":2014},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.869471Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b08d2730950f9adaa1b78a6d2eb2658adb8310eae524226bd9dbdacfa6f4b674","observation_id":"ebba2b49-00a6-421b-846e-9bcf356b3366","resolution":{"observed_at":"2026-08-06T00:23:58.648738Z","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-06T00:23:58.460077Z","title":"Outer approximation with conic certificates for mixed-integer convex problems.Mathematical Programming Computation, 12:249–293, 2020","venue":null,"work_id":"862b6855-2319-426d-bd7e-5ce113cf999e","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:42.948529Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:cb42bba653da49fc08f74edc21b4d13f7259501bbd22cb69b10b20ffd91b0094","observation_id":"1b99d233-2856-4672-a516-c7372e4906d0","resolution":{"observed_at":"2026-08-06T00:23:58.493687Z","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-06T00:23:43.029657Z","title":"Learning sparse classifiers: Continuous and mixed integer optimization perspectives.Journal of Machine Learning Research, 22(135):1–47, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.029657Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b32f43ceb27731d6838545a4a865b6733ee54a5d48f626293ff8d05ff320ff97","observation_id":"78908bc9-056e-44d1-b87e-586ce75d0560","resolution":{"observed_at":"2026-08-06T00:23:43.029657Z","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-06T00:23:58.216571Z","title":"Subset selection in sparse matrices.SIAM Journal on Optimization, 30(2):1173–1190, 2020","venue":null,"work_id":"4b85ccc8-514b-4249-bc0e-818ed08ae875","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.146369Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:17c068c6c361ee9f6e76cd17f442e7c75249c2a37f03caa89591e6ff421552f4","observation_id":"af3c8936-bce0-4480-8d55-bbcfe4ab868c","resolution":{"observed_at":"2026-08-06T00:23:58.364751Z","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":"1510.06083","last_updated":"2015-10-20T22:55:48Z","snapshot_observed_at":"2026-08-10T08:41:40.698318Z","submitted_at":"2015-10-20T22:55:48Z","title":"Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.06083","snapshot_observed_at":"2026-08-06T00:23:43.186702Z","title":"Regularization vs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.186702Z"},"links":{"cited_paper":"/paper/1510.06083","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:dc6f6c40a94a38a5f85285eae377311a82d6aa6e2c743d5f7f713a0be66786b5","observation_id":"171a92c0-15e6-4fde-90d7-bb9eb727e76c","resolution":{"observed_at":"2026-08-06T00:23:43.186702Z","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-06T00:23:57.916221Z","title":"An outer-approximation algorithm for a class of mixed- integer nonlinear programs.Mathematical programming, 36(3):307–339, 1986","venue":null,"work_id":"456c186e-7dd4-4241-8872-f19d4ffdd9e2","year":1986},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.283132Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b54f0c9fcdf6ea1538389fb237a4d1e005cacfb5c4a8d9416baee0b28f4192ba","observation_id":"eca884ec-1c06-43f6-bb30-7f9ddb1c805d","resolution":{"observed_at":"2026-08-06T00:23:58.099088Z","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-06T00:23:57.568148Z","title":"Scalable inference of sparsely-changing Gaussian Markov random fields.Advances in Neural Information Processing Systems, 34:6529–6541, 2021","venue":null,"work_id":"cf16b8f7-b350-4456-91cb-01b538ab4858","year":2021},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.377885Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:4f65d27c2633c692e96ee61a62692a43f6b354f2b8d55ffbc943123f6aab411d","observation_id":"1d36b91a-863f-4f92-a7ec-4b7a052f4f0b","resolution":{"observed_at":"2026-08-06T00:23:57.813132Z","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":"2307.13750","last_updated":"2023-07-25T18:19:50Z","snapshot_observed_at":"2026-08-08T13:35:14.000983Z","submitted_at":"2023-07-25T18:19:50Z","title":"Solution Path of Time-varying Markov Random Fields with Discrete Regularization","version":1},"cited_work":{"arxiv_id":"2307.13750","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.13750","snapshot_observed_at":"2026-08-06T00:23:48.506063Z","title":"Solution Path of Time-varying Markov Random Fields with Discrete Regularization","venue":"math.OC","work_id":"bd9ce9eb-e5cd-4719-a157-7cf4d77abdc2","year":2023},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.486927Z"},"links":{"cited_paper":"/paper/2307.13750","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:f35bec3bfe3c3b87e5cad33ad180a644c891a4b10086420d72e536ddfb3a7100","observation_id":"ce71938e-a0a5-4e33-9682-7fba3e788a75","resolution":{"observed_at":"2026-08-06T00:23:48.640359Z","resolver_source":"local_arxiv","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-06T00:23:57.318691Z","title":"Approximated perspective relaxations: a project and lift approach.Computational Optimization and Applications, 63(3):705–735, 2016","venue":null,"work_id":"88226aee-b854-4ec6-8358-0ff8f1e39277","year":2016},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.575949Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:1c0513b67633b126bf1c18ee69e7e242f7062f6570b5d80410b90d3acc65059b","observation_id":"ac38facf-0ad2-4124-82be-bc4ac9e8a310","resolution":{"observed_at":"2026-08-06T00:23:57.419062Z","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-06T00:23:57.129646Z","title":"Improving the approximated projected perspec- tive reformulation by dual information.Operations Research Letters, 45(5):519–524, 2017","venue":null,"work_id":"47bc63da-7ad3-4f9c-bc5c-b02141e0ffc9","year":2017},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.658108Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:5f8e260315e9fc4b5168e51043dcf1f69429196b37de84bd3e3e7a6e7991f8eb","observation_id":"b220d591-d1c0-4e78-bad3-d903fd16052e","resolution":{"observed_at":"2026-08-06T00:23:57.262246Z","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-06T00:23:56.867765Z","title":"Perspective cuts for a class of convex 0–1 mixed integer pro- grams.Mathematical Programming, 106(2):225–236, 2006","venue":null,"work_id":"2afd2906-e72c-47ac-a6f9-5ffa5b7afb25","year":2006},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.756006Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:f4f879ddb982d33cb8c250d9c729ec6b197ea90270914b9007fed68fa64a22df","observation_id":"a4383bb2-9536-4219-aa77-a1b4d1c11a0d","resolution":{"observed_at":"2026-08-06T00:23:56.982111Z","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-06T00:23:56.615458Z","title":"SDP diagonalizations and perspective cuts for a class of non- separable MIQP.Operations Research Letters, 35(2):181–185, 2007","venue":null,"work_id":"776ed9ac-44de-469f-b5e4-e5cb747377ae","year":2007},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.830585Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:649b8ea6554d49daa2a3f20062e8cfaa49a1616d4288d21fac9efa1940f699f0","observation_id":"8efffd9b-84ed-4b5e-8729-7bb4e851683c","resolution":{"observed_at":"2026-08-06T00:23:56.785371Z","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-06T00:23:56.409876Z","title":"Projected perspective refor- mulations with applications in design problems.Operations research, 59(5):1225–1232, 2011","venue":null,"work_id":"0e8a095e-1bd9-4f0d-8b5f-8d08b3422793","year":2011},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:43.909051Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b7ca485ddc82318e1c52378415fb3c73227ab8058db37dfcc622fa91e498f294","observation_id":"05ac338e-efcc-496f-995f-d28c574e2ef8","resolution":{"observed_at":"2026-08-06T00:23:56.492469Z","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-06T00:23:56.175291Z","title":"Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs.Mathematics of Operations Research, 45(1):15–33, 2020","venue":null,"work_id":"dc7cf1b4-c490-4eb2-b5fd-c4735928ddbe","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.018167Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:74002e49af81637e5a5fd860c82ab69762c77d2e5d2bfe6197fc8ebe4d5ae952","observation_id":"1f3f38bb-a415-4d38-b26b-4ff05f48982d","resolution":{"observed_at":"2026-08-06T00:23:56.261969Z","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-06T00:23:55.820658Z","title":"The number of maximal independent sets in connected graphs.Journal of Graph Theory, 11(4):463–470, 1987","venue":null,"work_id":"327d4a45-1002-4027-8675-a83cb22681f1","year":1987},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.093020Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:108050f81a022bec30667dcf8b9e0a8e0c1a6c0fd22e586a29927a352521b6cf","observation_id":"0549295a-9e5a-4485-9147-535520240bb9","resolution":{"observed_at":"2026-08-06T00:23:55.999231Z","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-06T00:23:55.590133Z","title":"Improved linear integer programming formulations of nonlinear integer problems.Man- agement Science, 22(4):455–460, 1975","venue":null,"work_id":"c6c5524f-e4b0-4a26-9844-ac9aa7e6cfa4","year":1975},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.166777Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:81f10d66ede4e472d6671b37cf216be90c197f1f894f84a774fd0fa8d02431d0","observation_id":"eb8a3e92-1ba7-4d52-b19a-174ee9e2835c","resolution":{"observed_at":"2026-08-06T00:23:55.705263Z","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-06T00:23:55.313405Z","title":"Outlier detection in time series via mixed-integer conic quadratic optimization.SIAM Journal on Optimization, 31(3):1897–1925, 2021","venue":null,"work_id":"01b42e5d-974a-4538-8e2e-09966bc004bf","year":1925},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.219987Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:2c08ee150176459dc2feee918cbf313708ec627f2754614643d28ec361366791","observation_id":"20d56d26-b333-4d1c-a542-4b2239955e4c","resolution":{"observed_at":"2026-08-06T00:23:55.465170Z","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":"2405.03051","last_updated":"2024-05-05T20:49:52Z","snapshot_observed_at":"2026-08-10T18:54:05.780482Z","submitted_at":"2024-05-05T20:49:52Z","title":"Real-time solution of quadratic optimization problems with banded matrices and indicator variables","version":1},"cited_work":{"arxiv_id":"2405.03051","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03051","snapshot_observed_at":"2026-08-06T00:23:48.247506Z","title":"Real-time solution of quadratic optimization problems with banded matrices and indicator variables","venue":"math.OC","work_id":"efd6038c-ba48-4af9-adbd-7721a38ec7a7","year":2024},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.316172Z"},"links":{"cited_paper":"/paper/2405.03051","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:66306d1488adf51b889d662567db7b73472880578d0858379ff2b2b617867b2c","observation_id":"d6de9149-a95e-4185-b7ca-ca0ad986b21e","resolution":{"observed_at":"2026-08-06T00:23:48.366631Z","resolver_source":"local_arxiv","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-06T00:23:55.106472Z","title":"Outlier detection in regression: conic quadratic formulations.INFORMS Journal on Computing, 2025","venue":null,"work_id":"21d987d1-d805-47bb-a643-4c8b2f0dbbe3","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.402331Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:7d92df940df531076c0bd8e646babacd55b09208f893d4773e8d3eedffa014dc","observation_id":"e2de60c7-fdcb-4c8f-8998-aeba1113be29","resolution":{"observed_at":"2026-08-06T00:23:55.220196Z","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-06T00:23:54.987030Z","title":"Generalized convex disjunctive programming: Nonlinear convex hull relaxation.Computational optimization and applications, 26(1):83–100, 2003","venue":null,"work_id":"c785c3bf-5824-47ed-8da1-6ef9f797945a","year":2003},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.452251Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:59d607f8c7e0571f51e06b9f3e936a65cdf2d8befb071c4742811f845f028e72","observation_id":"57d8e72e-940e-4298-8b1f-6775f04f3a38","resolution":{"observed_at":"2026-08-06T00:23:55.041001Z","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-06T00:23:54.840937Z","title":"Perspective reformulations of mixed integer nonlinear programs with indicator variables.Mathematical Programming, 124(1):183–205, 2010","venue":null,"work_id":"1465dc66-3ed3-412d-8fd4-6d55a14d68a1","year":2010},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.552191Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:cc4067f4717435d273df02ee73483159e180de833000f304f27c344c627d955a","observation_id":"c9d051bf-5b2b-425c-837f-c419b2806ec6","resolution":{"observed_at":"2026-08-06T00:23:54.926417Z","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-06T00:23:54.727600Z","title":"2×2-convexifications for convex quadratic opti- mization with indicator variables.Mathematical Programming, 202(1):95–134, 2023","venue":null,"work_id":"8a6e93a9-bddf-49f3-b4e7-0a30c70772d0","year":2023},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.684855Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:10e6f4c52163ddee3dfa6fbd51f6b385414230bee47f548cf1ae54b9ae4fb07c","observation_id":"8b6d2724-7276-4bd0-a64d-3b3809700072","resolution":{"observed_at":"2026-08-06T00:23:54.771574Z","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-06T00:23:44.735670Z","title":"Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms.Operations Research, 68(5):1517–1537, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.735670Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:61283ae4d4f751a6f22d2437b23e05207587063b96cbdae826a29d9377e745c5","observation_id":"6d2756d6-df30-4c13-8ca0-44207992e1c7","resolution":{"observed_at":"2026-08-06T00:23:44.735670Z","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-06T00:23:54.604150Z","title":"Sparse regression at scale: Branch-and-bound rooted in first-order optimization.Mathematical Programming, 196(1):347–388, 2022","venue":null,"work_id":"01edffdf-a2d3-47c5-970e-b98d720bfb32","year":2022},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.841885Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:35168c4e85a2a98d6bea5347c2873c7897b36879ae79ad9d85ccb8dd1468d547","observation_id":"5b46efa5-62be-4523-a478-10ac7ad54892","resolution":{"observed_at":"2026-08-06T00:23:54.662977Z","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-06T00:23:54.472186Z","title":"Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix.Mathematical Programming, 204(1):517–566, 2024","venue":null,"work_id":"057f1751-7b5c-4832-a452-813db98f6e30","year":2024},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.924744Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:d999495b24553b82bd0699de8af5525d01a98fa8074c7b3811ec4faa09c4d505","observation_id":"e7fdb70d-be36-493d-a891-ccec3ca13635","resolution":{"observed_at":"2026-08-06T00:23:54.543955Z","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-06T00:23:54.340420Z","title":"A combinatorial approach for small and strong formulations of disjunctive constraints.Mathematics of Operations Research, 44(3):793–820, 2019","venue":null,"work_id":"ef25514a-addd-4559-ae64-9face6a34a10","year":2019},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:44.981159Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:4d4d9aa30e1f63031d6faaa4644224541447f9e2eef6ff7ee45e3b314b38f730","observation_id":"73f90c3b-f9d3-424b-88af-6f42929cdaca","resolution":{"observed_at":"2026-08-06T00:23:54.414253Z","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-06T00:23:54.217598Z","title":"A geometric way to build strong mixed-integer programming formulations.Operations Research Letters, 47(6):601–606, 2019","venue":null,"work_id":"fa72e38d-329c-4d33-ada1-c28a729834d8","year":2019},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.083302Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:539b2c5d58a415bcc32ba5c1558e3a510392275abdb1905093efbdec22f10521","observation_id":"72adfca8-3e03-4617-9684-921790300d27","resolution":{"observed_at":"2026-08-06T00:23:54.286297Z","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-06T00:23:54.086096Z","title":null,"venue":null,"work_id":"482137ae-22f7-4678-b70b-34165e9a6cca","year":2017},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.129427Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:b38f10c3dd8fb3f72b0333ab1e9fc04f78d86cd5614873cf57c15e5ac71bb3a6","observation_id":"d89d626e-7bcc-4d50-807e-7bfe745bb936","resolution":{"observed_at":"2026-08-06T00:23:54.153067Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:23:53.891482Z","title":"On minimal valid inequalities for mixed integer conic programs.Mathematics of Operations Research, 41(2):477–510, 2016","venue":null,"work_id":"91fff0f0-f84f-4d3c-bb22-cf61d49e0317","year":2016},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.187209Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:e78e0e8932be85b26a2b298b0ff0bfa7f38be30430fe20342739456c2eefd695","observation_id":"c61f2bcd-9602-46a9-8987-80c856326d1c","resolution":{"observed_at":"2026-08-06T00:23:53.979091Z","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-06T00:23:53.692307Z","title":"Two-term disjunctions on the second-order cone.Mathematical Programming, 154(1):463–491, 2015","venue":null,"work_id":"d4c4b787-edf0-445b-b9d9-946cd99400b6","year":2015},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.247871Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:6351018f686f66d43957c8a71a09620172b8e762b02ac790ec43c7e894f71a05","observation_id":"9af3cdb0-4de6-4161-8fb9-42198595fb72","resolution":{"observed_at":"2026-08-06T00:23:53.763156Z","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-06T00:23:53.535182Z","title":"Consistent second-order conic integer programming for learning Bayesian networks.Journal of Machine Learning Research, 24(322):1–38, 2023","venue":null,"work_id":"3eea52ca-93aa-4e6f-9a21-8a4bc82883ce","year":2023},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.311472Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:cf7ec90d6794fd6d9ffcd3470e263004e6b347e65b315878b60736b364fd71d1","observation_id":"9bc985bf-e29f-4482-adb3-b236f99c95c0","resolution":{"observed_at":"2026-08-06T00:23:53.603248Z","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-06T00:23:53.410607Z","title":"Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators.Mathematical Programming, pages 1–27,","venue":null,"work_id":"c381591f-9ea2-4344-8488-b8f1c67f3906","year":null},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.408111Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:6ec704c143fbc96f745780bd2a9a497dfdbde28d0e99f1cc4680844a6c7bcd53","observation_id":"2ed38401-ffe7-4d99-96e1-0a7ef07c232c","resolution":{"observed_at":"2026-08-06T00:23:53.451100Z","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-06T00:23:53.278501Z","title":"A graph-based decomposition method for convex quadratic optimization with indicators.Mathematical Programming, 200(2):669– 701, 2023","venue":null,"work_id":"0b588e45-2c5a-47bd-ab1d-48c7ab6674de","year":2023},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.468214Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:c5ea51ba06a4caee5dce78c577f59288f8822484bd2b2d8717cf664d10694c7e","observation_id":"f5ea6fcc-c84e-4efb-899d-e40367c5e3aa","resolution":{"observed_at":"2026-08-06T00:23:53.323231Z","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-06T00:23:53.136106Z","title":"Polyhedral approximation in mixed-integer convex optimization.Mathematical Programming, 172(1):139–168, 2018","venue":null,"work_id":"1e94b3cb-b939-492f-b447-d0aeabd92445","year":2018},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.547587Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:814180865f653bacf036d1ee37949f0e6575a69f138bb313f90d5dac2e1d92d1","observation_id":"72284a4c-13fd-4dc9-a642-c46a1aec5e40","resolution":{"observed_at":"2026-08-06T00:23:53.200988Z","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-06T00:23:52.989316Z","title":"Finding low-rank solutions of sparse linear matrix inequalities using convex optimization.SIAM Journal on Optimization, 27(2):725– 758, 2017","venue":null,"work_id":"216200a6-cda7-4f90-9c5a-28a5690ab8b0","year":2017},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.631817Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:57d53db2c1d18e13b1bdea928fe3ec9f73341430cebbeab8cef1d1925140f741","observation_id":"a8794e2c-84de-4ae6-ac17-f9fd45293cdd","resolution":{"observed_at":"2026-08-06T00:23:53.060154Z","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-06T00:23:52.867606Z","title":"Integer programming for learning directed acyclic graphs from continuous data.INFORMS Journal on Optimization, 3(1):46–73, 2021","venue":null,"work_id":"e5c740a9-88d7-4305-9f62-70ef1d9b3481","year":2021},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.729157Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:fb0f4f23f1140c97e4e946bd0befdf968b10034b96bc37d4dde69a66f4cdfa10","observation_id":"9b0ba320-3fcb-4b79-a9a1-5647c717f17e","resolution":{"observed_at":"2026-08-06T00:23:52.937021Z","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-06T00:23:52.709324Z","title":"Subset selection with shrinkage: Sparse linear modeling when the snr is low.Operations Research, 71(1):129–147, 2023","venue":null,"work_id":"049d0702-fece-41be-86b5-1e08ebd39256","year":2023},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.768918Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:0437d2568bcef97e5f53fff985ddc501fbb885fe420d5928ce6891b7f4ebc13e","observation_id":"32681e66-d2a6-49c0-b7df-29c115501430","resolution":{"observed_at":"2026-08-06T00:23:52.809264Z","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":"2604.11584","last_updated":"2026-04-14T14:29:21Z","snapshot_observed_at":"2026-07-06T22:59:59.220594Z","submitted_at":"2026-04-13T15:00:53Z","title":"Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements","version":2},"cited_work":{"arxiv_id":"2604.11584","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.11584","snapshot_observed_at":"2026-08-06T00:23:48.018102Z","title":"Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements","venue":"math.OC","work_id":"54f17f1a-68b1-4703-b9af-d8c9900eeace","year":2026},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.862014Z"},"links":{"cited_paper":"/paper/2604.11584","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:3ad5d6ecee165bee9ee77baf33d9703a8469a2c06d32f548a267dc85a5296a33","observation_id":"9335cccd-f0f2-433a-9236-93f9ceba698a","resolution":{"observed_at":"2026-08-06T00:23:48.129219Z","resolver_source":"local_arxiv","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-06T00:23:52.585850Z","title":"A mixed- integer programming approachfor unit commitment inmicro-grid with incentive-based demand response and battery energy storage system.Energies, 15(19):7192, 2022","venue":null,"work_id":"6c266f91-7c8c-4ae7-9dcb-744beca7abf2","year":2022},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:45.927004Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:8003feaa54568637844a2dbf7a4321a0fbc09d8ae5e0072df90ec77b78f51c9f","observation_id":"a52a9637-425d-44af-b58e-b8546f21c74f","resolution":{"observed_at":"2026-08-06T00:23:52.650022Z","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-06T00:23:52.431420Z","title":"Bayesian network learning via topological order.Journal of Machine Learning Research, 18(99):1–32, 2017","venue":null,"work_id":"974a347e-7df3-46d0-bd6e-d99c70257593","year":2017},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.033834Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:4e5e6f52a15363c1fc3082af7351f428afa9e1ffffe21baf18a5a9ed82743f72","observation_id":"4bc78d2c-f758-4472-8a45-a98fbe07ba2e","resolution":{"observed_at":"2026-08-06T00:23:52.496032Z","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-06T00:23:52.155964Z","title":"An LP/NLP based branch and bound algorithm for convex minlp optimization problems.Computers & chemical engineering, 16(10-11):937–947, 1992","venue":null,"work_id":"e952de4e-fc9f-4435-8252-4f90809fa5ea","year":1992},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.100015Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:4dfa554d19719010381b3eb9a11b0ea72c235029c61374cf469df0bcad41a732","observation_id":"ed7d872a-6c85-4b87-bfd6-13353fcbb0b9","resolution":{"observed_at":"2026-08-06T00:23:52.281148Z","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":"2507.23106","last_updated":"2025-07-30T21:13:26Z","snapshot_observed_at":"2026-08-09T21:42:22.777363Z","submitted_at":"2025-07-30T21:13:26Z","title":"Efficient inference of dynamic gene regulatory networks using discrete penalty","version":1},"cited_work":{"arxiv_id":"2507.23106","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.23106","snapshot_observed_at":"2026-08-06T00:23:47.773127Z","title":"Efficient inference of dynamic gene regulatory networks using discrete penalty","venue":"stat.AP","work_id":"35603122-cc51-448f-81ff-50e3afe48d01","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.224409Z"},"links":{"cited_paper":"/paper/2507.23106","citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:f1e5aee4439814fb7896157bad088726f0ed4983465e82436b251e9b112bf5f8","observation_id":"887b3c2a-d877-41f5-860c-81855ee5fdf1","resolution":{"observed_at":"2026-08-06T00:23:47.894340Z","resolver_source":"local_arxiv","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-06T00:23:51.838552Z","title":"Mixed integer linear programming formulation techniques.SIAM Review, 57(1):3– 57, 2015","venue":null,"work_id":"7d462983-99fb-4083-a7ea-73344f4b9769","year":2015},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.357566Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:6fedbc131ae792f89901141df72940564d2317f83715f3367e19e1d9f3ce5078","observation_id":"5bf2cb95-52cd-415d-80ea-2ed71ffb92a2","resolution":{"observed_at":"2026-08-06T00:23:51.994355Z","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-06T00:23:51.599064Z","title":"Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity.SIAM Journal on Optimization, 17(1):218–242, 2006","venue":null,"work_id":"b21b7df9-4201-408f-8fa8-5703d17a0af2","year":2006},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.507730Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:478dec3ef838be93beb1bc284162b33831d40f154d5dad6e5552407be9f57535","observation_id":"89fa6651-500f-4475-9e91-1273f779b53a","resolution":{"observed_at":"2026-08-06T00:23:51.698224Z","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-06T00:23:51.363771Z","title":"On the convexification of constrained quadratic optimization problems with indicator variables","venue":null,"work_id":"ec3b9a14-9c8e-499f-b0fd-f59bf84ef717","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.625071Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:0dcd067c4be78f5e7b0641ce65c95eff3c26fb672aadddea8cb8d4fd78fcab4d","observation_id":"439ed746-aa97-429c-afd4-4aa2ea45594a","resolution":{"observed_at":"2026-08-06T00:23:51.481319Z","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-06T00:23:51.109575Z","title":"Ideal formulations for constrained convex optimization problems with indicator variables.Mathematical Programming, 192(1):57–88, 2022","venue":null,"work_id":"f1f4712c-7c43-4dfc-ad7d-66ebe6290468","year":2022},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.742162Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:8c853d2740b51826b80017ccc265325dfb9a78bcc2d17aa2aac2bd3b583607a3","observation_id":"eaaebb1d-da93-435e-a540-494881e7c2e9","resolution":{"observed_at":"2026-08-06T00:23:51.226242Z","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-06T00:23:50.853718Z","title":"The number of maximal independent sets in a tree.SIAM Journal on Algebraic Discrete Methods, 7(1):125–130, 1986","venue":null,"work_id":"54cb6acc-1387-49d7-923a-fdd4e7b59e1f","year":1986},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.837927Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:a9ad80c68d14e8a1b4c54a92e583d507d770ae7b8f65dd0270aaf3a9174ea124","observation_id":"18751a55-d563-448d-a3f6-acb5a9a3c52e","resolution":{"observed_at":"2026-08-06T00:23:50.955429Z","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-06T00:23:50.614305Z","title":"Scalable algorithms for the sparse ridge regression.SIAM Journal on Optimization, 30(4):3359–3386, 2020","venue":null,"work_id":"51ddef9d-bcc7-4b23-a466-ba34b1c11676","year":2020},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:46.974358Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:a7a45c80059879d305e108a98300676be1706730027a496785b9822b53177a3c","observation_id":"6291e9b4-d7ec-4b59-bfac-e2273b6e949a","resolution":{"observed_at":"2026-08-06T00:23:50.734196Z","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-06T00:23:50.405082Z","title":"An asymptotically optimal coordinate descent algorithm for learning Bayesian networks from Gaussian models.Journal of Machine Learning Research, 26(250):1–30, 2025","venue":null,"work_id":"8fac3920-c571-4437-8329-1e7a4213d7fc","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:47.133145Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:eeb04e28b1e12e6681f40031e33673c13151958d35de8a9a08210dd0ada6bc9c","observation_id":"046e1998-ec27-4501-b6f7-3131cb03af6f","resolution":{"observed_at":"2026-08-06T00:23:50.508108Z","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-06T00:23:50.085837Z","title":"Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models.Biometrika, 112(3):asaf032, 04 2025","venue":null,"work_id":"d84eedda-e74a-4bc1-b276-946e1cc3d4d8","year":2025},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:47.282246Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:9a98e5508150a527e19bcf8a2d0c7865c72a0be55407ce3b070b55ec97119683","observation_id":"1fb3aab4-7065-4f0a-8dcc-656752fe3440","resolution":{"observed_at":"2026-08-06T00:23:50.230207Z","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-06T00:23:49.871158Z","title":"Facing up to arrangements: Face-count formulas for partitions of space by hyper- planes.Memoirs of the American Mathematical Society, 1(154):1–102, 1975","venue":null,"work_id":"b57e845a-d3fe-49b0-a05e-3818cb53fd5a","year":1975},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:47.433401Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:d4ee8dc744b259e9e9e51be606b7ea20f4613f3eaeb0d606433e93ed12a79ecf","observation_id":"3404e7e1-7271-42ca-bc44-07f5f7bad69d","resolution":{"observed_at":"2026-08-06T00:23:49.968861Z","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-06T00:23:49.577038Z","title":null,"venue":null,"work_id":"002d5a66-10d9-4094-8a7c-43706cdca7ac","year":2014},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:47.552448Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:d0207a13daada92684d832636dcb7d13bed71163237730a1968ac233c54645a1","observation_id":"3bdf1fda-1499-470e-ac08-5f9bfb1d3c3f","resolution":{"observed_at":"2026-08-06T00:23:49.732713Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:23:49.309551Z","title":"Deleting outliers in robust regression with mixed integer programming.Acta Mathematicae Applicatae Sinica, 21(2):323–334, 2005","venue":null,"work_id":"f039a452-1140-447a-bf64-9e92a4f2cf68","year":2005},"citing_paper":{"arxiv_id":"2608.01385","last_updated":"2026-08-02T17:07:02Z","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:47.675608Z"},"links":{"citing_paper":"/paper/2608.01385"},"observation_digest":"sha256:e992a6362722b0a1c5f2aeaf203ac1559847b2ad826521361fef0f886a6094d6","observation_id":"4ad5742a-9e7e-4abd-8e27-04808a2f2145","resolution":{"observed_at":"2026-08-06T00:23:49.439400Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":"2608.01385","last_updated":"2026-08-02T17:07:02Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T23:04:14.942223Z","submitted_at":"2026-08-02T17:07:02Z","title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":6,"verified_fuzzy":56},"total_outbound_references":69},"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 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2608.01385."}