{"as_of":"2026-08-10T10:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e3be06d04f405153a0c3894c7955bec3c0a59324c7b913ef2455873c1115a16","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-10T06:31:04.303077+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-04T20:55:41.556605Z","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-20T07:18:07.109340Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-08-04T20:55:41.556605Z","title":"Llms can schedule,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08269","last_updated":"2026-07-17T08:53:46Z","snapshot_observed_at":"2026-08-08T15:31:01.848037Z","submitted_at":"2025-09-10T04:05:54Z","title":"A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving","version":6},"reference_index":118,"source":"pdf_text","source_observed_at":"2026-08-04T20:55:41.556605Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2509.08269"},"observation_digest":"sha256:c89ed4a9f2ddcce66d4a819cfe4416d042c55812b18ed14e9da21c0111e8a4b9","observation_id":"9732cc93-5219-4706-a398-eaa9e9709cf4","resolution":{"observed_at":"2026-08-04T20:55:41.556605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":"2408.06993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Llms can schedule","venue":null,"work_id":"244edbc5-745e-45e4-94f0-59a15b736466","year":2024},"citing_paper":{"arxiv_id":"2604.10989","last_updated":"2026-04-13T04:47:20Z","snapshot_observed_at":"2026-07-06T22:59:27.499664Z","submitted_at":"2026-04-13T04:47:20Z","title":"MAFIG: Multi-agent Driven Formal Instruction Generation Framework","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T15:55:09.238676Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2604.10989"},"observation_digest":"sha256:bf0029ccd43e71bccc45b4b79a8774b44e848ca578c6949e0af5f6d972a10a19","observation_id":"ecc70ed2-39f8-4333-890b-2674e5dada3d","resolution":{"observed_at":"2026-05-11T09:36:08.885485Z","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":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":"2408.06993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Llms can schedule","venue":null,"work_id":"244edbc5-745e-45e4-94f0-59a15b736466","year":2024},"citing_paper":{"arxiv_id":"2605.07214","last_updated":"2026-05-08T04:02:28Z","snapshot_observed_at":"2026-08-02T12:32:35.324467Z","submitted_at":"2026-05-08T04:02:28Z","title":"HMACE: Heterogeneous Multi-Agent Collaborative Evolution for Combinatorial Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-11T01:49:50.520222Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2605.07214"},"observation_digest":"sha256:9964ca4154a4586c96777886dda474ddb43b8862feb85b1e517ab4549225ed46","observation_id":"319914a5-ff65-4769-add6-295b34869c8c","resolution":{"observed_at":"2026-05-11T01:50:51.181459Z","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":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":"2408.06993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Llms can schedule","venue":null,"work_id":"244edbc5-745e-45e4-94f0-59a15b736466","year":2024},"citing_paper":{"arxiv_id":"2605.13221","last_updated":"2026-05-13T09:13:19Z","snapshot_observed_at":"2026-07-06T23:24:47.309044Z","submitted_at":"2026-05-13T09:13:19Z","title":"An Agentic AI Framework with Large Language Models and Chain-of-Thought for UAV-Assisted Logistics Scheduling with Mobile Edge Computing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T20:10:43.849486Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2605.13221"},"observation_digest":"sha256:6ff27ab8d5ae51e8a286bab4ef75b22d655e70de3766b995de676dd79b1b4610","observation_id":"18a03fa4-cf10-48f2-a5f1-855a906a1635","resolution":{"observed_at":"2026-05-14T20:12:55.725070Z","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":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":"2408.06993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Llms can schedule","venue":null,"work_id":"244edbc5-745e-45e4-94f0-59a15b736466","year":2024},"citing_paper":{"arxiv_id":"2605.19119","last_updated":"2026-05-18T21:11:03Z","snapshot_observed_at":"2026-08-07T18:29:28.977996Z","submitted_at":"2026-05-18T21:11:03Z","title":"GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-20T07:14:39.757279Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2605.19119"},"observation_digest":"sha256:3edf56fcc17962e347d39be4a1e8fae00b055b9373142fed01346cf6df8b965e","observation_id":"f18195b6-6eb4-4545-a423-1cd390527376","resolution":{"observed_at":"2026-05-20T07:18:07.111377Z","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":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-07-30T23:22:38.889216Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26710","last_updated":"2026-07-29T09:53:50Z","snapshot_observed_at":"2026-08-07T07:33:44.018574Z","submitted_at":"2026-07-29T09:53:50Z","title":"PowerAtlas: Towards Electricity-Computing Co-Scheduling for Power Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T23:22:38.889216Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2607.26710"},"observation_digest":"sha256:cb41ad065907342d131c23590b1506d4f379dbcce8c79c995b134a7a3010c1c9","observation_id":"96b04339-6f4f-44d8-a49a-0f12b0550e0b","resolution":{"observed_at":"2026-07-30T23:22:38.889216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06993","snapshot_observed_at":"2026-08-01T03:07:29.903824Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27698","last_updated":"2026-07-30T05:30:09Z","snapshot_observed_at":"2026-08-09T23:10:00.024892Z","submitted_at":"2026-07-30T05:30:09Z","title":"Guiding Large Language Models with Genetic Programming-Evolved Heuristic Knowledge for Dynamic Multi-Mode Project Scheduling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T03:07:29.903824Z"},"links":{"cited_paper":"/paper/2408.06993","citing_paper":"/paper/2607.27698"},"observation_digest":"sha256:4d3966a0735c454f9cf4e635cc7edb11487b9eb6bed797ec3ca1c5d005d25499","observation_id":"8a67470f-dc8b-444e-be16-2e1c0c61f590","resolution":{"observed_at":"2026-08-01T03:07:29.903824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.06993/citation-record","integrity":"/paper/2408.06993/integrity","json":"/paper/2408.06993/citation-record.json","paper":"/paper/2408.06993"},"outbound":[],"paper":{"arxiv_id":"2408.06993","last_updated":"2024-08-13T15:53:58Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T14:12:48.349818Z","submitted_at":"2024-08-13T15:53:58Z","title":"LLMs can Schedule"},"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-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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2408.06993."}