{"as_of":"2026-08-09T10:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c87287ceff0045f80dd69709e62c58ade91daaa282010bcd21e2b5f0e86448b2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:56:20.467945Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:58:24.293415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.06639","last_updated":"2019-06-16T03:28:24Z","snapshot_observed_at":"2026-07-06T08:00:37.173898Z","submitted_at":"2019-06-16T03:28:24Z","title":"Reinforcement Learning Driven Heuristic Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06639","snapshot_observed_at":"2026-08-07T14:56:20.467945Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17359","last_updated":"2025-05-23T00:30:53Z","snapshot_observed_at":"2026-08-07T14:46:15.053018Z","submitted_at":"2025-05-23T00:30:53Z","title":"Towards VM Rescheduling Optimization Through Deep Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:56:20.467945Z"},"links":{"cited_paper":"/paper/1906.06639","citing_paper":"/paper/2505.17359"},"observation_digest":"sha256:54a29a386e155664df7bcec8c444ee302a50d5c0816e18f6f2d13f3a7aa2a962","observation_id":"fa4341b6-1ba2-4f89-bc29-a09823d97ba3","resolution":{"observed_at":"2026-08-07T14:56:20.467945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06639","last_updated":"2019-06-16T03:28:24Z","snapshot_observed_at":"2026-07-06T08:00:37.173898Z","submitted_at":"2019-06-16T03:28:24Z","title":"Reinforcement Learning Driven Heuristic Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06639","snapshot_observed_at":"2026-08-07T12:59:37.800927Z","title":"Reinforcement learning driven heuristic optimization.arXiv preprint arXiv:1906.06639, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2505.23131","last_updated":"2026-06-04T20:53:20Z","snapshot_observed_at":"2026-08-07T12:50:26.993514Z","submitted_at":"2025-05-29T06:04:32Z","title":"DOPPLER: Dual-Policy Learning for Device Assignment in Asynchronous Dataflow Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:59:37.800927Z"},"links":{"cited_paper":"/paper/1906.06639","citing_paper":"/paper/2505.23131"},"observation_digest":"sha256:1bab8345860b85cd6b782df1c0ece531204da2c6fe4ea4c42a7c3ba48904ed5a","observation_id":"30c66f6b-50f2-4536-9807-ade02e5b6741","resolution":{"observed_at":"2026-08-07T12:59:37.800927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06639","last_updated":"2019-06-16T03:28:24Z","snapshot_observed_at":"2026-07-06T08:00:37.173898Z","submitted_at":"2019-06-16T03:28:24Z","title":"Reinforcement Learning Driven Heuristic Optimization","version":1},"cited_work":{"arxiv_id":"1906.06639","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.06639","snapshot_observed_at":"2026-08-07T04:58:24.293415Z","title":"Reinforcement Learning Driven Heuristic Optimization","venue":"cs.LG","work_id":"e59a23b4-6925-406c-b418-d73396a1d6b3","year":2019},"citing_paper":{"arxiv_id":"2506.09404","last_updated":"2025-06-11T05:17:30Z","snapshot_observed_at":"2026-08-07T04:46:38.309559Z","submitted_at":"2025-06-11T05:17:30Z","title":"Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:58:18.306281Z"},"links":{"cited_paper":"/paper/1906.06639","citing_paper":"/paper/2506.09404"},"observation_digest":"sha256:485753da0ca1a7726297efad35c7b4ae1d18dd67ac284a8c446f544d44b3a843","observation_id":"4307d19d-6b10-49bd-8b0a-86eb1cdb1b3f","resolution":{"observed_at":"2026-08-07T04:58:24.436474Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1906.06639/citation-record","integrity":"/paper/1906.06639/integrity","json":"/paper/1906.06639/citation-record.json","paper":"/paper/1906.06639"},"outbound":[],"paper":{"arxiv_id":"1906.06639","last_updated":"2019-06-16T03:28:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:00:37.173898Z","submitted_at":"2019-06-16T03:28:24Z","title":"Reinforcement Learning Driven Heuristic Optimization"},"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 3 inbound Pith citation observations for arXiv:1906.06639."}