{"as_of":"2026-08-09T12:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72914fb4a9d87474929409b6a69b0f897ac94d29c1fba7fedf03c2e98668461a","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-09T06:31:02.800959+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-07T13:14:55.877315Z","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-07T13:14:58.568009Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.06283","last_updated":"2019-01-18T14:52:34Z","snapshot_observed_at":"2026-07-06T07:27:34.469555Z","submitted_at":"2019-01-18T14:52:34Z","title":"Improving Sequence-to-Sequence Learning via Optimal Transport","version":1},"cited_work":{"arxiv_id":"1901.06283","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.06283","snapshot_observed_at":"2026-08-07T13:14:58.568009Z","title":"Improving Sequence-to-Sequence Learning via Optimal Transport","venue":"cs.CL","work_id":"cd92d698-42f6-412c-ad6c-f399e24297d4","year":2019},"citing_paper":{"arxiv_id":"2505.22299","last_updated":"2025-05-29T04:07:47Z","snapshot_observed_at":"2026-08-07T13:08:18.516042Z","submitted_at":"2025-05-28T12:37:09Z","title":"Logical Consistency is Vital: Neural-Symbolic Information Retrieval for Negative-Constraint Queries","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:14:55.877315Z"},"links":{"cited_paper":"/paper/1901.06283","citing_paper":"/paper/2505.22299"},"observation_digest":"sha256:4f7d35218ad88f76181a4b191edc1cb585bf8478487373075cfcebdc1fe689ff","observation_id":"c13dd890-3454-4cde-8793-763dd5e788e6","resolution":{"observed_at":"2026-08-07T13:14:58.665236Z","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/1901.06283/citation-record","integrity":"/paper/1901.06283/integrity","json":"/paper/1901.06283/citation-record.json","paper":"/paper/1901.06283"},"outbound":[],"paper":{"arxiv_id":"1901.06283","last_updated":"2019-01-18T14:52:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T07:27:34.469555Z","submitted_at":"2019-01-18T14:52:34Z","title":"Improving Sequence-to-Sequence Learning via Optimal Transport"},"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 1 inbound Pith citation observation for arXiv:1901.06283."}