{"as_of":"2026-08-22T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:551c100d7479b0225a498ac8c4d82b62f04fab4a1cba4b79c3e57cfc7e993d64","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-22T06:32:14.747728+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-11T23:01:21.123898Z","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-11T23:01:21.170280Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.08550","last_updated":"2025-01-25T04:50:05Z","snapshot_observed_at":"2026-08-16T13:26:05.717715Z","submitted_at":"2024-08-16T06:33:56Z","title":"String Diagram of Optimal Transports","version":2},"cited_work":{"arxiv_id":"2408.08550","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.08550","snapshot_observed_at":"2026-08-11T23:01:21.170280Z","title":"String Diagram of Optimal Transports","venue":"cs.AI","work_id":"7d36c29d-76ff-43da-a04f-b3c423c2b71b","year":2024},"citing_paper":{"arxiv_id":"2412.03120","last_updated":"2025-01-12T08:12:17Z","snapshot_observed_at":"2026-08-22T02:06:59.177464Z","submitted_at":"2024-12-04T08:39:45Z","title":"Sinkhorn Algorithm for Sequentially Composed Optimal Transports","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T23:01:21.123898Z"},"links":{"cited_paper":"/paper/2408.08550","citing_paper":"/paper/2412.03120"},"observation_digest":"sha256:20e83229fad18c839b6a40a645b4456ca3ec6e221debb34839cd0a22c2ff0a1f","observation_id":"484c81cb-92fb-4c62-be41-1015b27f71b9","resolution":{"observed_at":"2026-08-11T23:01:21.174187Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.08550/citation-record","integrity":"/paper/2408.08550/integrity","json":"/paper/2408.08550/citation-record.json","paper":"/paper/2408.08550"},"outbound":[],"paper":{"arxiv_id":"2408.08550","last_updated":"2025-01-25T04:50:05Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T13:26:05.717715Z","submitted_at":"2024-08-16T06:33:56Z","title":"String Diagram of Optimal Transports"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2408.08550."}