{"as_of":"2026-08-10T02:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72528d53d80a650bb276d74d3bd5c6d6ca3b72d270a8fff895cc969420d35476","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-06-27T19:21:22.978335Z","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-03T03:37:35.775710Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.01963","last_updated":"2019-08-21T21:53:52Z","snapshot_observed_at":"2026-08-03T06:36:10.414106Z","submitted_at":"2018-10-03T20:43:31Z","title":"Learning Scheduling Algorithms for Data Processing Clusters","version":4},"cited_work":{"arxiv_id":"1810.01963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.01963","snapshot_observed_at":"2026-07-03T03:37:35.775710Z","title":null,"venue":null,"work_id":"9d3dbb09-4145-4dc8-a7ff-a8742f8ca154","year":2018},"citing_paper":{"arxiv_id":"1906.08879","last_updated":"2019-06-20T22:08:51Z","snapshot_observed_at":"2026-07-06T08:01:50.383586Z","submitted_at":"2019-06-20T22:08:51Z","title":"Placeto: Learning Generalizable Device Placement Algorithms for Distributed Machine Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T19:22:03.575460Z"},"links":{"cited_paper":"/paper/1810.01963","citing_paper":"/paper/1906.08879"},"observation_digest":"sha256:1baf746de38d4a68f50e081b2f11bc0418cb68d4183d1b488cb43feabf1d0931","observation_id":"6b2d27a7-fd81-4b80-9a5d-a1b4f4a24818","resolution":{"observed_at":"2026-05-25T19:26:09.773197Z","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":"1810.01963","last_updated":"2019-08-21T21:53:52Z","snapshot_observed_at":"2026-08-03T06:36:10.414106Z","submitted_at":"2018-10-03T20:43:31Z","title":"Learning Scheduling Algorithms for Data Processing Clusters","version":4},"cited_work":{"arxiv_id":"1810.01963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.01963","snapshot_observed_at":"2026-07-03T03:37:35.775710Z","title":null,"venue":null,"work_id":"9d3dbb09-4145-4dc8-a7ff-a8742f8ca154","year":2018},"citing_paper":{"arxiv_id":"2606.07923","last_updated":"2026-06-06T01:16:58Z","snapshot_observed_at":"2026-07-06T23:47:29.065892Z","submitted_at":"2026-06-06T01:16:58Z","title":"Larch: Learned Query Optimization for Semantic Predicates","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T19:21:22.978335Z"},"links":{"cited_paper":"/paper/1810.01963","citing_paper":"/paper/2606.07923"},"observation_digest":"sha256:d6629270af9c6d4a7ce9ab746c711a4c30632d09f4d9d17b6c501926672e97a1","observation_id":"c54815bf-e202-4921-b4ea-095d56c0bc13","resolution":{"observed_at":"2026-07-02T21:57:26.195336Z","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":"1810.01963","last_updated":"2019-08-21T21:53:52Z","snapshot_observed_at":"2026-08-03T06:36:10.414106Z","submitted_at":"2018-10-03T20:43:31Z","title":"Learning Scheduling Algorithms for Data Processing Clusters","version":4},"cited_work":{"arxiv_id":"1810.01963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.01963","snapshot_observed_at":"2026-07-03T03:37:35.775710Z","title":null,"venue":null,"work_id":"9d3dbb09-4145-4dc8-a7ff-a8742f8ca154","year":2018},"citing_paper":{"arxiv_id":"2606.09120","last_updated":"2026-06-08T07:14:46Z","snapshot_observed_at":"2026-08-02T15:11:56.789255Z","submitted_at":"2026-06-08T07:14:46Z","title":"AutoPilot: Learning to Steer High Speed Robust BFT","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-27T15:02:56.762226Z"},"links":{"cited_paper":"/paper/1810.01963","citing_paper":"/paper/2606.09120"},"observation_digest":"sha256:f710cd0699eeb52c2d889e0614b1e85aa100a0a695cd480a0b5d8b57324bc6f3","observation_id":"d78f45a8-9517-436b-b484-d79977010de2","resolution":{"observed_at":"2026-07-03T03:37:35.777596Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1810.01963/citation-record","integrity":"/paper/1810.01963/integrity","json":"/paper/1810.01963/citation-record.json","paper":"/paper/1810.01963"},"outbound":[],"paper":{"arxiv_id":"1810.01963","last_updated":"2019-08-21T21:53:52Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T06:36:10.414106Z","submitted_at":"2018-10-03T20:43:31Z","title":"Learning Scheduling Algorithms for Data Processing Clusters"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1810.01963."}