{"as_of":"2026-08-09T11:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c31711358153499c0d318d43de1a0101685cf652d9d82be0d7497f29df3944bf","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":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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:25:02.404749Z","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-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2412.13235","last_updated":"2026-05-03T15:47:09Z","snapshot_observed_at":"2026-07-06T20:08:48.064792Z","submitted_at":"2024-12-17T16:18:06Z","title":"Logic-Constrained Shortest Paths for Flight Planning","version":4},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-23T06:39:45.014006Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2412.13235"},"observation_digest":"sha256:2874a1a6eae73a11fb249000062579f76ec90ec12174025b1f78bc15ce9d2004","observation_id":"dce924c3-c411-4c41-ab20-32be3e94a93d","resolution":{"observed_at":"2026-05-23T06:42:39.058928Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-06T20:25:02.404749Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.03159","last_updated":"2026-05-25T02:45:33Z","snapshot_observed_at":"2026-08-06T20:14:38.185145Z","submitted_at":"2025-07-03T20:32:08Z","title":"MathOptAI.jl: Embed trained machine learning predictors into JuMP models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:02.404749Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2507.03159"},"observation_digest":"sha256:9570731106cc0e7d3612fa8e703a517e21dee2c040e6cce9164c26126876bbe0","observation_id":"8d3144a8-084a-4b2b-8fb1-aa71299b10c7","resolution":{"observed_at":"2026-08-06T20:25:02.404749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-06T17:39:08.506481Z","title":"Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Liding Xu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10391","last_updated":"2025-07-14T15:30:36Z","snapshot_observed_at":"2026-08-06T17:29:48.699817Z","submitted_at":"2025-07-14T15:30:36Z","title":"Instance-Optimized String Fingerprints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:39:08.506481Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2507.10391"},"observation_digest":"sha256:e1e3455e1d751a01e2738f5b73d4a15eec6d8582f060bd8dcb3afffe10fcf051","observation_id":"3731fbae-b8c4-445e-ad11-c28d472a35a5","resolution":{"observed_at":"2026-08-06T17:39:08.506481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-06T05:26:46.017839Z","title":"Bolusani, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.02006","last_updated":"2025-08-04T02:50:59Z","snapshot_observed_at":"2026-08-06T05:26:44.617171Z","submitted_at":"2025-08-04T02:50:59Z","title":"Exact algorithms for quadratic optimization over roots of unity","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T05:26:46.017839Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2508.02006"},"observation_digest":"sha256:ffbefcccfe3688ba4bad6471442f8b671e35004231c1ef3e9856517d4c11e8d5","observation_id":"ae4ca0d1-eb5c-46c9-b51d-157791524e00","resolution":{"observed_at":"2026-08-06T05:26:46.017839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-03T09:01:07.964672Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T06:00:33.568434Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:07.964672Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:59aebab57cb7d49d5e111d26f89bd0091838b07947e25f2ab601fecf681d6d11","observation_id":"b1934216-173c-4798-aeb5-91c78e86acab","resolution":{"observed_at":"2026-08-03T09:01:07.964672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-03T01:04:06.859014Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.10739","last_updated":"2026-07-02T12:03:32Z","snapshot_observed_at":"2026-08-07T14:51:23.015943Z","submitted_at":"2026-02-11T10:59:32Z","title":"Equity by Design? On the Trade-Offs in Fairness-Driven Recommendation in Heterogeneous Two-Sided Markets","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T01:04:06.859014Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2602.10739"},"observation_digest":"sha256:bcf33abe67196ce9cfb797da8c4738fc6adad089c91c8d232e3f96b9b312f477","observation_id":"ffe4a35c-d9b2-4718-869f-0e27647a544f","resolution":{"observed_at":"2026-08-03T01:04:06.859014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-02T23:16:43.933864Z","title":"The scip optimiza- tion suite 9.0.arXiv preprint arXiv:2402.17702,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14516","last_updated":"2026-07-21T08:53:51Z","snapshot_observed_at":"2026-08-09T07:31:56.117192Z","submitted_at":"2026-02-16T07:07:30Z","title":"Efficient Multi-round LLM Inference over Disaggregated Serving","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T23:16:43.933864Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2602.14516"},"observation_digest":"sha256:8cb4f4ab82309c08f7a11434da28b7a977600f21675e65852db228d7c066b1b0","observation_id":"3a04a370-a51b-4fbc-8faf-556e64023072","resolution":{"observed_at":"2026-08-02T23:16:43.933864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2604.03871","last_updated":"2026-04-04T21:34:54Z","snapshot_observed_at":"2026-08-06T22:35:43.972494Z","submitted_at":"2026-04-04T21:34:54Z","title":"Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-13T16:50:37.170135Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2604.03871"},"observation_digest":"sha256:918d8f35d77bfa5f7b2c00775aec2a3d11209b2f79b9125eabb34b40c9896aaa","observation_id":"627fea63-f60d-4f89-bbc6-8ab504cf17c2","resolution":{"observed_at":"2026-05-13T16:53:00.136062Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2604.11758","last_updated":"2026-06-06T02:00:14Z","snapshot_observed_at":"2026-08-02T21:41:53.083555Z","submitted_at":"2026-04-13T17:30:49Z","title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T16:32:42.471275Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2604.11758"},"observation_digest":"sha256:5600be821f59e7b1901e18800f75238249cb7502550367782d8a7dcb66cfce6c","observation_id":"fc143744-c521-4595-b0a7-2bf01f429f4c","resolution":{"observed_at":"2026-05-11T08:41:00.199705Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-12T21:46:26.290743Z","title":"The SCIP optimization suite 9.0,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11758","last_updated":"2026-06-06T02:00:14Z","snapshot_observed_at":"2026-08-02T21:41:53.083555Z","submitted_at":"2026-04-13T17:30:49Z","title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T21:46:26.290743Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2604.11758"},"observation_digest":"sha256:5f45b27e5faec54c7c90d4b82537be6124d60942d0f8202b22370685ab2767ca","observation_id":"36a5c2a3-dcc7-489d-b64a-f07602efa578","resolution":{"observed_at":"2026-07-12T21:46:26.290743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2604.16804","last_updated":"2026-05-06T17:41:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-18T03:24:54Z","title":"AutoOR: Scalably Post-training LLMs to Autoformalize Operations Research Problems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T07:02:02.992871Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2604.16804"},"observation_digest":"sha256:0d979c9ea9743ff191e3dd412d4e378bbc34ceb3542f4c22a7f2938ed5035571","observation_id":"b07a6992-6e98-4c48-b4dc-0899106c813d","resolution":{"observed_at":"2026-05-10T07:11:53.595732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2605.08639","last_updated":"2026-05-09T03:18:50Z","snapshot_observed_at":"2026-07-06T23:20:52.521341Z","submitted_at":"2026-05-09T03:18:50Z","title":"ReLibra: Routing-Replay-Guided Load Balancing for MoE Training in Reinforcement Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-12T01:38:03.841465Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2605.08639"},"observation_digest":"sha256:1e906edac93ea5f64f380ed62b54a7b4725a3c048b68b566f96be718fb17f2fa","observation_id":"c5a7f206-30f3-45e5-bddc-ea9dca27d731","resolution":{"observed_at":"2026-05-12T01:46:14.793302Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2606.10836","last_updated":"2026-06-09T13:25:01Z","snapshot_observed_at":"2026-08-06T11:30:01.838255Z","submitted_at":"2026-06-09T13:25:01Z","title":"Bounding the Null Space: Interval-Based Uncertainty Quantification for Non-Identifiable Groundwater Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T10:59:55.323874Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2606.10836"},"observation_digest":"sha256:96bb11532a08d7f0b87bee8f0a998f28db1d482e6afcd2015a9db8465f676a4d","observation_id":"c7f9c21f-85b2-4a1a-a16d-cf8f69780897","resolution":{"observed_at":"2026-07-03T08:07:45.534657Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":"2402.17702","doi":"10.48550/arxiv.2402.17702","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv:2402.17702","venue":null,"work_id":"a3c42063-f08e-4420-9673-8fb0cd8f81b5","year":2024},"citing_paper":{"arxiv_id":"2607.01552","last_updated":"2026-07-02T00:20:09Z","snapshot_observed_at":"2026-08-02T20:06:32.293518Z","submitted_at":"2026-07-02T00:20:09Z","title":"Symbolic Discovery of Iterative Algorithms: A Continuous Latent Space Bayesian Optimization Framework","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-03T01:03:55.733169Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2607.01552"},"observation_digest":"sha256:ff4100da71a5551d6293e469adbb74b0b04fcdd8e8e6d133709521bb32aeff82","observation_id":"4ea68d66-db7e-4a4b-a505-10db43b7ee46","resolution":{"observed_at":"2026-07-03T01:07:29.687975Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-01T12:29:26.165184Z","title":"Bolusani et al.,The SCIP Optimization Suite 9.0, Technical Report, Zuse Institute Berlin, 2024, arXiv:2402.17702.https://scipopt.org","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19550","last_updated":"2026-07-21T20:01:08Z","snapshot_observed_at":"2026-08-01T12:29:24.438151Z","submitted_at":"2026-07-21T20:01:08Z","title":"New lower bounds for binary constant-weight codes: $A(23,6,10)\\geq 2979$ and $A(24,6,10)\\geq 4214$","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T12:29:26.165184Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2607.19550"},"observation_digest":"sha256:b385c06bb2e302f98c9043786db9eb4660628bb9ccba4a5b9927d87d1057f878","observation_id":"c513a86d-6f67-47e6-a7d3-bf7539f7a92d","resolution":{"observed_at":"2026-08-01T12:29:26.165184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.17702/citation-record","integrity":"/paper/2402.17702/integrity","json":"/paper/2402.17702/citation-record.json","paper":"/paper/2402.17702"},"outbound":[],"paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2402.17702."}