{"as_of":"2026-08-10T07:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eaad1d7147125b3ac3472a43af88eb47cbfddcd4f8bee29441062df44d9109ab","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:21:56.074477Z","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-06T14:52:43.735591Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.08595","last_updated":"2020-08-04T01:10:35Z","snapshot_observed_at":"2026-07-06T09:21:13.394167Z","submitted_at":"2020-05-18T11:14:23Z","title":"Efficient Wait-k Models for Simultaneous Machine Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08595","snapshot_observed_at":"2026-08-09T18:21:56.074477Z","title":"Efficient wait-k models for simultaneous machine translation","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.00634","last_updated":"2025-02-05T12:36:08Z","snapshot_observed_at":"2026-08-09T18:12:09.414930Z","submitted_at":"2025-02-02T02:47:09Z","title":"SimulPL: Aligning Human Preferences in Simultaneous Machine Translation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T18:21:56.074477Z"},"links":{"cited_paper":"/paper/2005.08595","citing_paper":"/paper/2502.00634"},"observation_digest":"sha256:4823f6c4f944e4dda3e823a0c451f6e8081b5e586773e6fe8b3fc35888fc298c","observation_id":"a4fead28-6af6-4693-b209-e7f25838bd21","resolution":{"observed_at":"2026-08-09T18:21:56.074477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08595","last_updated":"2020-08-04T01:10:35Z","snapshot_observed_at":"2026-07-06T09:21:13.394167Z","submitted_at":"2020-05-18T11:14:23Z","title":"Efficient Wait-k Models for Simultaneous Machine Translation","version":2},"cited_work":{"arxiv_id":"2005.08595","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08595","snapshot_observed_at":"2026-08-06T14:52:43.735591Z","title":"Efficient Wait-k Models for Simultaneous Machine Translation","venue":"cs.CL","work_id":"02c56ba5-c350-4292-9ea7-4912fb988373","year":2020},"citing_paper":{"arxiv_id":"2507.17527","last_updated":"2025-07-27T05:17:25Z","snapshot_observed_at":"2026-08-08T10:18:26.773169Z","submitted_at":"2025-07-23T14:07:41Z","title":"Seed LiveInterpret 2.0: End-to-end Simultaneous Speech-to-speech Translation with Your Voice","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T14:52:42.972649Z"},"links":{"cited_paper":"/paper/2005.08595","citing_paper":"/paper/2507.17527"},"observation_digest":"sha256:6914c7a3fcb47399a066c439dbe3a3a546d461fb0fc9b4b78781c428f7d538e5","observation_id":"75423757-986b-44a0-ac56-598ba72a714e","resolution":{"observed_at":"2026-08-06T14:52:43.739828Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2005.08595/citation-record","integrity":"/paper/2005.08595/integrity","json":"/paper/2005.08595/citation-record.json","paper":"/paper/2005.08595"},"outbound":[],"paper":{"arxiv_id":"2005.08595","last_updated":"2020-08-04T01:10:35Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T09:21:13.394167Z","submitted_at":"2020-05-18T11:14:23Z","title":"Efficient Wait-k Models for Simultaneous Machine Translation"},"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 2 inbound Pith citation observations for arXiv:2005.08595."}