{"as_of":"2026-08-20T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29148420af139c6c1acf1b76c2f335b384ec91a27c998de6e1cd9d40e90b96a9","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-20T06:33:59.587034+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-15T23:38:00.932964Z","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-15T16:40:10.499229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-10T22:08:03.183528Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02977","last_updated":"2025-02-04T09:21:37Z","snapshot_observed_at":"2026-08-16T10:08:48.783685Z","submitted_at":"2025-01-06T12:37:56Z","title":"CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:08:03.183528Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2501.02977"},"observation_digest":"sha256:f6a31068ce95a61cae1c29c7889ad6ccd70c1a55e55e1ee23537429bc4a6d368","observation_id":"9c2afbb7-52c6-495f-9560-2fafa0d77f65","resolution":{"observed_at":"2026-08-10T22:08:03.183528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-10T20:26:29.149907Z","title":"Goal: A generalist combinatorial optimization agent learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-08-16T05:19:04.695947Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T20:26:29.149907Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2501.08603"},"observation_digest":"sha256:67c36756a4af0feda4c11de28acfe7aeee365a1007c42cd9b95e4ae69f429713","observation_id":"713296fa-ff02-4f5f-9b58-61c528c75461","resolution":{"observed_at":"2026-08-10T20:26:29.149907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-15T23:38:00.932964Z","title":"Goal: A generalist combinatorial optimization agent learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06290","last_updated":"2025-05-07T12:39:33Z","snapshot_observed_at":"2026-08-18T08:51:37.682042Z","submitted_at":"2025-05-07T12:39:33Z","title":"UniCO: Towards a Unified Model for Combinatorial Optimization Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:38:00.932964Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2505.06290"},"observation_digest":"sha256:c2255964a8e278a48244aa1b0fcd214aee36de0598c5f8f7e8b24e885accc299","observation_id":"5363daa4-44fe-43ef-9fbb-266dda67f399","resolution":{"observed_at":"2026-08-15T23:38:00.932964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-07T05:18:12.683868Z","title":"Goal: A generalist combinatorial optimization agent learner.arXiv preprint arXiv:2406.15079,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08424","last_updated":"2025-06-11T06:43:18Z","snapshot_observed_at":"2026-08-17T06:36:55.470163Z","submitted_at":"2025-06-10T03:55:14Z","title":"SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:18:12.683868Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2506.08424"},"observation_digest":"sha256:781312d16a4f45c62e3fb56ba5d2f3ac574bb21bf093fd77fd7e416aeaae055e","observation_id":"19d7a379-a57a-46ca-8ef6-745d16874614","resolution":{"observed_at":"2026-08-07T05:18:12.683868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-08-15T16:51:23.415820Z","title":"https://www.gurobi.com","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20330","last_updated":"2026-06-16T20:34:24Z","snapshot_observed_at":"2026-08-18T17:05:25.649573Z","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","version":5},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T16:51:23.415820Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2508.20330"},"observation_digest":"sha256:0ba21377f37cca7a9dac0888f1ef40b0731429bbf7dda259564b8abf66a570b1","observation_id":"fde5d254-6a20-44c9-89c2-26c5b18d000a","resolution":{"observed_at":"2026-08-15T16:51:23.415820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":"2406.15079","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goal: A generalist combinatorial optimiza- tion agent learner.arXiv preprint arXiv:2406.15079","venue":null,"work_id":"a8c1fd06-2b2a-4a9f-9d52-09b1d7fe2ab0","year":2024},"citing_paper":{"arxiv_id":"2603.04300","last_updated":"2026-04-08T05:23:14Z","snapshot_observed_at":"2026-08-18T17:05:26.151729Z","submitted_at":"2026-03-04T17:20:08Z","title":"LUMINA: Foundation Models for Topology Transferable ACOPF","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T16:39:39.123809Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2603.04300"},"observation_digest":"sha256:d99c9a6e2bfe2e8573c4e85c91d71804515b79debdd557e42f191ca40cd5b898","observation_id":"4b800f50-468a-4272-b513-617112be0f95","resolution":{"observed_at":"2026-05-15T16:40:10.502857Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","version":3},"cited_work":{"arxiv_id":"2406.15079","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.15079","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goal: A generalist combinatorial optimiza- tion agent learner.arXiv preprint arXiv:2406.15079","venue":null,"work_id":"a8c1fd06-2b2a-4a9f-9d52-09b1d7fe2ab0","year":2024},"citing_paper":{"arxiv_id":"2605.02026","last_updated":"2026-05-03T19:23:37Z","snapshot_observed_at":"2026-08-16T01:24:39.914214Z","submitted_at":"2026-05-03T19:23:37Z","title":"Towards Systematic Generalization for Power Grid Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T17:20:33.456156Z"},"links":{"cited_paper":"/paper/2406.15079","citing_paper":"/paper/2605.02026"},"observation_digest":"sha256:b8b5db01ad8da9ebf176070fd66f40b905a731d6ec6343bd2515db21322362bd","observation_id":"b2c95c7f-1d19-484f-be17-553aa8213941","resolution":{"observed_at":"2026-05-11T16:21:08.547215Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.15079/citation-record","integrity":"/paper/2406.15079/integrity","json":"/paper/2406.15079/citation-record.json","paper":"/paper/2406.15079"},"outbound":[],"paper":{"arxiv_id":"2406.15079","last_updated":"2025-02-25T11:44:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T17:04:44.968854Z","submitted_at":"2024-06-21T11:55:20Z","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.15079."}