{"as_of":"2026-08-23T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4687dae8d68c4ed84df6f2e12ce75a378d6a4a0fee5974ef2ff3ece52b9cf4fd","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-23T06:30:58.430688+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-30T22:26:56.725953Z","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-01T14:05:45.918801Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.04609","last_updated":"2025-04-06T20:37:25Z","snapshot_observed_at":"2026-08-18T06:36:15.653671Z","submitted_at":"2025-04-06T20:37:25Z","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","version":1},"cited_work":{"arxiv_id":"2504.04609","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04609","snapshot_observed_at":"2026-07-01T14:05:45.918801Z","title":"Weiss, Gianluca Janka, Ann M","venue":null,"work_id":"ae429f6a-f211-48bf-88bb-5e1ecf4648e0","year":2025},"citing_paper":{"arxiv_id":"2605.09782","last_updated":"2026-06-29T12:50:04Z","snapshot_observed_at":"2026-08-15T05:41:00.723430Z","submitted_at":"2026-05-10T22:00:42Z","title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-12T03:11:33.689342Z"},"links":{"cited_paper":"/paper/2504.04609","citing_paper":"/paper/2605.09782"},"observation_digest":"sha256:0e16209f3f9f3b54796feb9a9c78929a7e88bc23ccd839571bd52b3bebd1eb64","observation_id":"91937953-c398-4321-9fa4-6953f8f6e489","resolution":{"observed_at":"2026-05-12T07:26:26.687884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04609","last_updated":"2025-04-06T20:37:25Z","snapshot_observed_at":"2026-08-18T06:36:15.653671Z","submitted_at":"2025-04-06T20:37:25Z","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","version":1},"cited_work":{"arxiv_id":"2504.04609","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04609","snapshot_observed_at":"2026-07-01T14:05:45.918801Z","title":"Weiss, Gianluca Janka, Ann M","venue":null,"work_id":"ae429f6a-f211-48bf-88bb-5e1ecf4648e0","year":2025},"citing_paper":{"arxiv_id":"2605.09782","last_updated":"2026-06-29T12:50:04Z","snapshot_observed_at":"2026-08-15T05:41:00.723430Z","submitted_at":"2026-05-10T22:00:42Z","title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T22:44:53.213829Z"},"links":{"cited_paper":"/paper/2504.04609","citing_paper":"/paper/2605.09782"},"observation_digest":"sha256:90fd2e801af7bfeeb502c7342be02d84b40a05ae469ea58d8e106d6397f33fe1","observation_id":"e3986947-9108-48d2-ba7b-340558f68181","resolution":{"observed_at":"2026-05-20T22:49:10.909524Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04609","last_updated":"2025-04-06T20:37:25Z","snapshot_observed_at":"2026-08-18T06:36:15.653671Z","submitted_at":"2025-04-06T20:37:25Z","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","version":1},"cited_work":{"arxiv_id":"2504.04609","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04609","snapshot_observed_at":"2026-07-01T14:05:45.918801Z","title":"Weiss, Gianluca Janka, Ann M","venue":null,"work_id":"ae429f6a-f211-48bf-88bb-5e1ecf4648e0","year":2025},"citing_paper":{"arxiv_id":"2605.09782","last_updated":"2026-06-29T12:50:04Z","snapshot_observed_at":"2026-08-15T05:41:00.723430Z","submitted_at":"2026-05-10T22:00:42Z","title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T22:26:56.725953Z"},"links":{"cited_paper":"/paper/2504.04609","citing_paper":"/paper/2605.09782"},"observation_digest":"sha256:a7cc9f1f835fddfc9755bf2e58a4a3945b230741bed62526540d70dab658cad0","observation_id":"3bf1d041-ca4f-4a57-9f93-d24f070b3d3b","resolution":{"observed_at":"2026-07-01T14:05:45.920728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.04609/citation-record","integrity":"/paper/2504.04609/integrity","json":"/paper/2504.04609/citation-record.json","paper":"/paper/2504.04609"},"outbound":[],"paper":{"arxiv_id":"2504.04609","last_updated":"2025-04-06T20:37:25Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-18T06:36:15.653671Z","submitted_at":"2025-04-06T20:37:25Z","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.04609."}