{"as_of":"2026-08-08T13:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13a6e8a612bd268bf9ea3be877ed0c073ccb876b09a93d5157b18a42356edbbe","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:58:25.834542Z","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-05-11T03:50:58.077828Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-07T14:58:25.834542Z","title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model.arXiv preprint arXiv:2302.00244, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-08T13:31:47.967420Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:25.834542Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:e57b09e99219212f93bde5d1317d40fa99e4d0e209b1427f152c51e959a0dcff","observation_id":"4da25c35-3555-4eff-92a5-d6ef4e4b7d5a","resolution":{"observed_at":"2026-08-07T14:58:25.834542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-05T19:46:24.593329Z","title":"Learning cut selection for mixed- integer linear programming via hierarchical sequence model.arXiv preprint arXiv:2302.00244,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.11848","last_updated":"2025-08-16T00:01:51Z","snapshot_observed_at":"2026-08-05T19:46:12.535980Z","submitted_at":"2025-08-16T00:01:51Z","title":"Adversarial Robustness in Distributed Quantum Machine Learning","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-05T19:46:24.593329Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2508.11848"},"observation_digest":"sha256:0e128368f5ad212f68d3cc5d801ba40c82086b08b2a0db708fc0fea8d2922d77","observation_id":"bc2e3f90-9559-4e16-9985-07b685e6dea3","resolution":{"observed_at":"2026-08-05T19:46:24.593329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":"2302.00244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2302.00244 , year =","venue":null,"work_id":"69ad0612-51d5-43e0-a1ba-d39e11cc061b","year":null},"citing_paper":{"arxiv_id":"2605.07239","last_updated":"2026-05-08T04:52:59Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:52:59Z","title":"Sample Complexity of Stochastic Optimization with Integer Variables","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:5946da66f3e380ff79d3367b397e07d8b1c6e10dd1968174b3cc35ef7e95a306","observation_id":"43fee51f-666b-4b0d-9c89-81d1940e0372","resolution":{"observed_at":"2026-05-11T03:50:58.079706Z","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":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-02T14:20:11.925323Z","title":"arXiv preprint arXiv:2302.00244 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18252","last_updated":"2026-05-12T09:03:05Z","snapshot_observed_at":"2026-08-08T12:55:13.476105Z","submitted_at":"2026-05-12T09:03:05Z","title":"MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T14:20:11.925323Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2607.18252"},"observation_digest":"sha256:6ff9d80ecb28aefd2f6189e3977decb56724e3b111e82ce2d92af955bf503fdb","observation_id":"2746ca36-f9a9-4102-88ee-d54a3e032438","resolution":{"observed_at":"2026-08-02T14:20:11.925323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00244","snapshot_observed_at":"2026-08-01T14:08:06.109752Z","title":"Learningcutselectionformixed-integerlinear programming via hierarchical sequence model.arXiv preprint arXiv:2302.00244 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18874","last_updated":"2026-07-21T09:06:23Z","snapshot_observed_at":"2026-08-08T13:15:06.315536Z","submitted_at":"2026-07-21T09:06:23Z","title":"Reinforcement Learning for Delivery Drone-Based Participatory Sensing in Dynamic Environments","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T14:08:06.109752Z"},"links":{"cited_paper":"/paper/2302.00244","citing_paper":"/paper/2607.18874"},"observation_digest":"sha256:9c7ba0a841064f71de7c80b020d6aa7049f5e44406774682e5756529d06d807c","observation_id":"fca8d2ab-fb19-4083-aab0-41032f6f59f4","resolution":{"observed_at":"2026-08-01T14:08:06.109752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.00244/citation-record","integrity":"/paper/2302.00244/integrity","json":"/paper/2302.00244/citation-record.json","paper":"/paper/2302.00244"},"outbound":[],"paper":{"arxiv_id":"2302.00244","last_updated":"2023-02-01T04:59:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T06:00:46.746997Z","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model"},"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 5 inbound Pith citation observations for arXiv:2302.00244."}