{"as_of":"2026-08-10T16:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b30479c4df880df437f38a4ccf31aa4801d5952d5dcfe512d2ac4b6bf274d02f","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T18:50:14.375126Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"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/2607.07762/citation-record","integrity":"/paper/2607.07762/integrity","json":"/paper/2607.07762/citation-record.json","paper":"/paper/2607.07762"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:57:32.159106Z","title":null,"venue":null,"work_id":"256e3958-c770-48f7-8119-ae9d87563508","year":2026},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:b5aaef30dd9599c805dc00bd07399ff613977c42932ce1652dd1293f3757041f","observation_id":"3b23f131-08bd-4d81-b5ae-bc22bd98f2bc","resolution":{"observed_at":"2026-07-10T18:57:32.160555Z","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":{"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":"1510.06083","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.06083","snapshot_observed_at":"2026-07-10T18:57:31.650759Z","title":"Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection","venue":"cs.LG","work_id":"44af17ef-312e-43cc-b39c-24023ffd0fa0","year":2015},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/1510.06083","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:b1c4f15c28272495846553f2d3a2e8eb7b7f280a183b4ac983ad1294e2b51ce0","observation_id":"e8beffaa-590b-41c3-8c6f-197ca01fff44","resolution":{"observed_at":"2026-07-10T18:57:31.652505Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":"1503.02531","doi":"10.1109/cvpr52733.2024.01515","metadata_source":"pith","pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Distilling the Knowledge in a Neural Network","venue":"stat.ML","work_id":"d927ab1f-17b8-4002-9d09-c3d55764fbad","year":2015},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:7e4558e8cabd7340de1fbe57d2e500a4b6ce63f80f8425b6b3ba2a41632b01b8","observation_id":"511503ea-d096-4d8b-8503-36ed0031a200","resolution":{"observed_at":"2026-07-10T18:57:31.661743Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2310.17772","last_updated":"2025-08-25T21:43:21Z","snapshot_observed_at":"2026-07-06T16:39:12.627366Z","submitted_at":"2023-10-26T20:37:29Z","title":"Learning Optimal Classification Trees Robust to Distribution Shifts","version":3},"cited_work":{"arxiv_id":"2310.17772","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.17772","snapshot_observed_at":"2026-07-10T18:57:31.648107Z","title":"Learning Optimal Classification Trees Robust to Distribution Shifts","venue":"cs.LG","work_id":"bda82d39-e17f-4e05-9484-2c7bbf20b38c","year":2023},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/2310.17772","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:706c42cb76dc39c5f9a78f77276506658d04e758ae9755e59022dc94f1515a93","observation_id":"f591889f-5bf3-4d51-9291-ab9afe78b14f","resolution":{"observed_at":"2026-07-10T18:57:31.649545Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-07-10T18:57:32.153017Z","title":"Ma, J., Wang, J., Xuan, Q., Wang, Z","venue":null,"work_id":"713644b8-9566-4612-834f-c04e74410d26","year":2025},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:d09e9a31db50c73c152c474360017e4222e9316353262fb093e9d0dcfa2e3a19","observation_id":"8fc71b77-144c-48ef-8acb-42f6a64e9175","resolution":{"observed_at":"2026-07-10T18:57:32.154205Z","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":"2602.04551","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:57:31.653538Z","title":"McDonald, T., Tsay, C., Schweidtmann, A","venue":null,"work_id":"806acdc4-2d81-4de2-96b0-5f64e9f7bfe0","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:02b7c8b8a12c91862dff4f576c9ea2c28e86dd668a351cdf8012e522c314f9d0","observation_id":"2f4aa829-c778-485d-abe4-d4e093edbf0e","resolution":{"observed_at":"2026-07-10T18:57:31.655369Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:57:32.151213Z","title":"Parmentier, A., Vidal, T","venue":null,"work_id":"5506e697-4ed6-464b-bfe2-3b7e86d0ef00","year":2021},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:333ba2f4cab9db5fd78c760c1d8bcc303e07cef3d016e4cfeba5cb3b0b0616e6","observation_id":"29e1b8a0-2855-4cb5-80dc-4b3d210b5f04","resolution":{"observed_at":"2026-07-10T18:57:32.152326Z","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-07-10T18:57:32.154891Z","title":"Why should I trust you?","venue":null,"work_id":"a5328a7a-42e8-4bf5-931d-1d49ac48f850","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:fc875b1abd1fbf48e0a0233c3d1a60d37ff41b781df375ae20e707c3099ece3b","observation_id":"e711edfd-5193-411d-be07-5ce24c8f9505","resolution":{"observed_at":"2026-07-10T18:57:32.156128Z","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-07-10T18:57:32.156776Z","title":"Ruoss, A., Balunovic, M., Fischer, M., Vechev, M","venue":null,"work_id":"508dad54-7c7e-4c69-ae58-63e43d7ddf23","year":2020},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:0061b2f352fd83f158da10444cd20ef91f5e4e34c1ed968a554f2956ff7716ba","observation_id":"2a4345da-d99c-4637-874d-d47afb20290d","resolution":{"observed_at":"2026-07-10T18:57:32.158273Z","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-07-10T18:57:32.165355Z","title":"Sun, Q., Justin, N., G´ omez, A., Vayanos, P","venue":null,"work_id":"b38eb044-cd93-4fc4-bd0f-6883fe15622a","year":2025},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:8ccc4dd622bccad1cf10c9eab0f6d999d2675e4d8abc69645d01569a4dce8ba7","observation_id":"160e2ef8-655e-4a1d-9463-cc2163c295d6","resolution":{"observed_at":"2026-07-10T18:57:32.166535Z","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":"2409.12788","last_updated":"2026-08-06T11:43:28Z","snapshot_observed_at":"2026-08-09T23:11:52.745760Z","submitted_at":"2024-09-19T13:55:29Z","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","version":3},"cited_work":{"arxiv_id":"2409.12788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12788","snapshot_observed_at":"2026-07-10T18:57:31.645844Z","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","venue":"cs.LG","work_id":"54ecef2f-2ff5-4d91-b60b-86ef7d65384a","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/2409.12788","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:7664722bf36e2c050afb6187cd3b7f5778ac288d14a0b4d9053be17ad2c99b5f","observation_id":"69aca67d-d26c-4615-b202-7edf52f30982","resolution":{"observed_at":"2026-07-10T18:57:31.647199Z","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-07-10T18:57:32.163320Z","title":"Vos, D., Verwer, S","venue":null,"work_id":"c106a884-1334-4b76-b281-e6626bdd29f7","year":2022},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:afd60903400dc67514de34a6b57e3f07b24d51fb62c8533d59ed836ec1d8ef79","observation_id":"5383501d-93dd-4769-aa59-7cabc01e27ca","resolution":{"observed_at":"2026-07-10T18:57:32.164637Z","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-07-10T18:57:32.161301Z","title":null,"venue":null,"work_id":"4662c2f6-c357-40f3-b761-e0c133a1468f","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:c05cfee862ccf79b545672047912628538ff810156dc8d18fc57a069a2476a96","observation_id":"db3c6e15-e894-48eb-a3df-88ec2ce7f9e3","resolution":{"observed_at":"2026-07-10T18:57:32.162588Z","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":{"arxiv_id":"2405.04025","last_updated":"2024-12-23T02:40:18Z","snapshot_observed_at":"2026-08-07T17:41:34.718199Z","submitted_at":"2024-05-07T05:58:44Z","title":"A Unified Post-Processing Framework for Group Fairness in Classification","version":2},"cited_work":{"arxiv_id":"2405.04025","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.04025","snapshot_observed_at":"2026-07-10T18:57:31.655991Z","title":"A Unified Post-Processing Framework for Group Fairness in Classification","venue":"cs.LG","work_id":"ae8c77e9-0323-4030-bc5b-196b83fdd575","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/2405.04025","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:5da49acb60583776c613983dd4c4c46d352173d196dc79ee1aff53e7cd0e1c02","observation_id":"fff050f7-9608-4766-97de-a3c1b0345f32","resolution":{"observed_at":"2026-07-10T18:57:31.658151Z","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":{"arxiv_id":"2011.11001","last_updated":"2020-11-22T12:30:27Z","snapshot_observed_at":"2026-07-06T10:16:44.651413Z","submitted_at":"2020-11-22T12:30:27Z","title":"Fairness-guided SMT-based Rectification of Decision Trees and Random Forests","version":1},"cited_work":{"arxiv_id":"2011.11001","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.11001","snapshot_observed_at":"2026-07-10T18:57:31.648383Z","title":"Fairness-guided SMT-based Rectification of Decision Trees and Random Forests","venue":"cs.LG","work_id":"38feb825-515e-4c23-9d6b-346afd66e8e6","year":2020},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/2011.11001","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:7daa0531224805dfc575c35338f486a8012e956e519f9b139278a81dbe766e25","observation_id":"12b14847-46fc-4230-9973-4a006d0f3a9c","resolution":{"observed_at":"2026-07-10T18:57:31.649735Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2607.07762","last_updated":"2026-07-08T15:27:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":2,"verified_exact":3,"verified_fuzzy":6},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.07762."}