{"as_of":"2026-08-04T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34de26472e028174c9800657c88007bd1846416756b3b7e5025b9bd0f14eab28","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T15:07:17.377437Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.00331","last_updated":"2024-03-06T08:58:24Z","snapshot_observed_at":"2026-08-03T22:06:54.177772Z","submitted_at":"2024-03-01T07:22:57Z","title":"WindGP: Efficient Graph Partitioning on Heterogenous Machines","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.00331","snapshot_observed_at":"2026-08-02T15:07:17.377437Z","title":"Sycophancy in large language models: A review.arXiv preprint arXiv:2403.00331, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14099","last_updated":"2026-05-01T17:02:19Z","snapshot_observed_at":"2026-08-03T15:03:10.442087Z","submitted_at":"2026-05-01T17:02:19Z","title":"Just Keep Prompting: Evaluating Repetitive Socratic Prompting in VLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T15:07:17.377437Z"},"links":{"cited_paper":"/paper/2403.00331","citing_paper":"/paper/2607.14099"},"observation_digest":"sha256:614f3ff737386b44411e6161592b4d4d57f2278634b877bebb9293bcb8d437a3","observation_id":"ce438f5b-dde3-4e9c-8cf9-4c98c34098d2","resolution":{"observed_at":"2026-08-02T15:07:17.377437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.00331/citation-record","integrity":"/paper/2403.00331/integrity","json":"/paper/2403.00331/citation-record.json","paper":"/paper/2403.00331"},"outbound":[],"paper":{"arxiv_id":"2403.00331","last_updated":"2024-03-06T08:58:24Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-03T22:06:54.177772Z","submitted_at":"2024-03-01T07:22:57Z","title":"WindGP: Efficient Graph Partitioning on Heterogenous Machines"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.00331."}