{"as_of":"2026-08-18T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6bdd0195c2cb3edc0bf2f5e1863108ec3b2bd5a8643c91ae0943be4e6bedd587","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:02:24.652809Z","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-08T23:35:34.399486Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.12065","snapshot_observed_at":"2026-08-11T12:02:24.652809Z","title":"arXiv preprint arXiv:2006.12065 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.14717","last_updated":"2024-12-19T10:31:25Z","snapshot_observed_at":"2026-08-13T17:46:51.579422Z","submitted_at":"2024-12-19T10:31:25Z","title":"Computing Gram Matrix for SMILES Strings using RDKFingerprint and Sinkhorn-Knopp Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T12:02:24.652809Z"},"links":{"cited_paper":"/paper/2006.12065","citing_paper":"/paper/2412.14717"},"observation_digest":"sha256:8b2fd158625f2f44bd3bcdb7e9b4ece4835a6d03b347d9ad1e6f5b8428e360f7","observation_id":"e94f77e7-7672-4668-9c5c-6ed349fbde62","resolution":{"observed_at":"2026-08-11T12:02:24.652809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","version":4},"cited_work":{"arxiv_id":"2006.12065","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.12065","snapshot_observed_at":"2026-08-08T23:35:34.399486Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","venue":"cs.LG","work_id":"aac9c1cb-c96c-442a-ad37-f7022e1c8031","year":2020},"citing_paper":{"arxiv_id":"2502.05229","last_updated":"2025-02-06T14:14:44Z","snapshot_observed_at":"2026-08-08T23:30:08.495885Z","submitted_at":"2025-02-06T14:14:44Z","title":"L2GNet: Optimal Local-to-Global Representation of Anatomical Structures for Generalized Medical Image Segmentation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T23:35:34.313731Z"},"links":{"cited_paper":"/paper/2006.12065","citing_paper":"/paper/2502.05229"},"observation_digest":"sha256:c6ce2916c41c1bf81ab1edbb8af7369ad9a51d7541b2035fc7deab1a259cffba","observation_id":"0fec8712-6dfd-4fb7-8574-56acbc7e3936","resolution":{"observed_at":"2026-08-08T23:35:34.406768Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.12065","snapshot_observed_at":"2026-08-04T14:44:16.081973Z","title":"A trainable optimal transport embedding for feature aggregation and its relationship to attention","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.00053","last_updated":"2026-05-29T16:57:34Z","snapshot_observed_at":"2026-08-17T17:18:50.995887Z","submitted_at":"2025-09-28T05:37:29Z","title":"DPsurv: Dual-Prototype Evidential Fusion for Uncertainty-Aware and Interpretable Whole-Slide Image Survival Prediction","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T14:44:16.081973Z"},"links":{"cited_paper":"/paper/2006.12065","citing_paper":"/paper/2510.00053"},"observation_digest":"sha256:17905645650418dc28751707810d07650ec1cdb3bdd991ecfb9d32d9abe7b3b1","observation_id":"8e295d17-2acc-4e57-b5fa-29e64fce1637","resolution":{"observed_at":"2026-08-04T14:44:16.081973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.12065","snapshot_observed_at":"2026-08-01T18:39:19.538458Z","title":"A trainable optimal transport embedding for feature aggregation and its relationship to attention.arXiv preprint arXiv:2006.12065, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17244","last_updated":"2026-08-03T10:33:00Z","snapshot_observed_at":"2026-08-18T18:36:24.709825Z","submitted_at":"2026-07-19T13:25:05Z","title":"DynImmune-BERT: Dynamic Immune Repertoire Modeling with Neural ODE Driven Continuous Transformers","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T18:39:19.538458Z"},"links":{"cited_paper":"/paper/2006.12065","citing_paper":"/paper/2607.17244"},"observation_digest":"sha256:498d7fc24ae433354e18285c48d562718f7a5845e0760e598403508d87351ca2","observation_id":"19c3101f-5db4-445d-ab65-dfca64341b8b","resolution":{"observed_at":"2026-08-01T18:39:19.538458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.12065","snapshot_observed_at":"2026-08-04T04:12:47.561200Z","title":"A trainable optimal transport embedding for feature aggregation and its relationship to attention.arXiv preprint arXiv:2006.12065, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17244","last_updated":"2026-08-03T10:33:00Z","snapshot_observed_at":"2026-08-18T18:36:24.709825Z","submitted_at":"2026-07-19T13:25:05Z","title":"DynImmune-BERT: Dynamic Immune Repertoire Modeling with Neural ODE Driven Continuous Transformers","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T04:12:47.561200Z"},"links":{"cited_paper":"/paper/2006.12065","citing_paper":"/paper/2607.17244"},"observation_digest":"sha256:cb40ec5edf955e8167ecc51ed7e54e4da8988ee471eb49e344a8675f6abb728e","observation_id":"37ae00a6-80fc-4271-8865-2057504e74e0","resolution":{"observed_at":"2026-08-04T04:12:47.561200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.12065/citation-record","integrity":"/paper/2006.12065/integrity","json":"/paper/2006.12065/citation-record.json","paper":"/paper/2006.12065"},"outbound":[],"paper":{"arxiv_id":"2006.12065","last_updated":"2021-02-09T21:24:42Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T19:40:14.403332Z","submitted_at":"2020-06-22T08:35:58Z","title":"A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2006.12065."}