{"as_of":"2026-08-08T07:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58e94182ee3e22349933f57c6c62a17d925aa52ba4ca4035c052ab8c9d0aeff4","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:23:43.106125Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T09:35:40.822501Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":"1811.06128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-07-01T09:35:40.822501Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"478bd050-6eb2-4307-b329-584010abe196","year":2020},"citing_paper":{"arxiv_id":"1907.05912","last_updated":"2019-07-17T18:48:17Z","snapshot_observed_at":"2026-08-02T19:43:07.399666Z","submitted_at":"2019-07-12T18:22:09Z","title":"MIPaaL: Mixed Integer Program as a Layer","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T22:13:04.164352Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/1907.05912"},"observation_digest":"sha256:82a77544ea12f1cebce569caca963e3c8e4f12db6b8aca7337c0f0177f21da22","observation_id":"a6c6d012-c938-4ab5-8cac-8b2d6de8f739","resolution":{"observed_at":"2026-05-24T22:15:00.958932Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-08-06T17:23:43.106125Z","title":"Bengio, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.11063","last_updated":"2025-07-15T07:55:09Z","snapshot_observed_at":"2026-08-06T17:14:56.435561Z","submitted_at":"2025-07-15T07:55:09Z","title":"A Distance Metric for Mixed Integer Programming Instances","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:23:43.106125Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2507.11063"},"observation_digest":"sha256:44badb6f9b51008716bec7447a120c855dd0206af28155013401760b07383da5","observation_id":"9dbcb393-6660-4285-ab66-82ed187bb7db","resolution":{"observed_at":"2026-08-06T17:23:43.106125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-08-05T20:29:13.429108Z","title":"Bengio, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10520","last_updated":"2025-08-14T10:45:44Z","snapshot_observed_at":"2026-08-08T02:22:22.624722Z","submitted_at":"2025-08-14T10:45:44Z","title":"Nonlocal Monte Carlo via Reinforcement Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:13.429108Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2508.10520"},"observation_digest":"sha256:f80713529a91f505324c52707a5e88701e3dccf57eb4865af33db70c45667959","observation_id":"c5287097-a267-485b-a472-0735db529b38","resolution":{"observed_at":"2026-08-05T20:29:13.429108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":"1811.06128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-07-01T09:35:40.822501Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"478bd050-6eb2-4307-b329-584010abe196","year":2020},"citing_paper":{"arxiv_id":"2605.04243","last_updated":"2026-05-05T19:30:06Z","snapshot_observed_at":"2026-07-06T23:17:04.200299Z","submitted_at":"2026-05-05T19:30:06Z","title":"Temporal Reasoning Is Not the Bottleneck: A Probabilistic Inconsistency Framework for Neuro-Symbolic QA","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T17:45:44.270122Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2605.04243"},"observation_digest":"sha256:5c20e81fee7a889a0f0d0830af35a40734c694b734b3f6a9204aee763844de41","observation_id":"d090cffc-3afd-4a4b-ac0a-3a966cf19a0a","resolution":{"observed_at":"2026-05-11T17:16:07.831644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":"1811.06128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-07-01T09:35:40.822501Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"478bd050-6eb2-4307-b329-584010abe196","year":2020},"citing_paper":{"arxiv_id":"2606.07562","last_updated":"2026-05-25T17:06:26Z","snapshot_observed_at":"2026-08-02T22:00:50.595323Z","submitted_at":"2026-05-25T17:06:26Z","title":"The Montparnasse Algorithm for RNA Design","version":1},"reference_index":259,"source":"arxiv_source","source_observed_at":"2026-06-29T19:34:04.075773Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2606.07562"},"observation_digest":"sha256:744c7ff664b4bbe830ef96628685ad733fae9805e3e91e0b375de1282b9f009d","observation_id":"a7c95073-67ab-4671-b3a7-368766c91cb1","resolution":{"observed_at":"2026-06-29T19:43:55.181819Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":"1811.06128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-07-01T09:35:40.822501Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"478bd050-6eb2-4307-b329-584010abe196","year":2020},"citing_paper":{"arxiv_id":"2606.30415","last_updated":"2026-06-29T15:01:18Z","snapshot_observed_at":"2026-08-01T15:56:02.188610Z","submitted_at":"2026-06-29T15:01:18Z","title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-30T06:20:32.505136Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2606.30415"},"observation_digest":"sha256:57fa883b60b994ca2a70fa179f3a61747d29e555b066e136932abbfb731fe398","observation_id":"bafd3997-cd96-410e-9554-252691771e10","resolution":{"observed_at":"2026-06-30T06:24:19.235672Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":"1811.06128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-07-01T09:35:40.822501Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":"478bd050-6eb2-4307-b329-584010abe196","year":2020},"citing_paper":{"arxiv_id":"2606.31282","last_updated":"2026-06-30T07:58:19Z","snapshot_observed_at":"2026-08-03T12:21:43.483908Z","submitted_at":"2026-06-30T07:58:19Z","title":"Revisiting the Volume Hypothesis","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-01T06:25:10.589828Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2606.31282"},"observation_digest":"sha256:899afefb6fc05eb02edab007479385f04b51081ed04a1ccf773dbc21b79dddff","observation_id":"55864b40-8f27-451a-950d-545b696f938c","resolution":{"observed_at":"2026-07-01T09:35:40.824877Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1811.06128/citation-record","integrity":"/paper/1811.06128/integrity","json":"/paper/1811.06128/citation-record.json","paper":"/paper/1811.06128"},"outbound":[],"paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:14:49.436513Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:1811.06128."}