{"as_of":"2026-08-12T08:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db495c3e006222109125dd0c0ddb0b1495bd9f42f6f0f01f7de50a7a3bf431a2","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-12T06:34:41.77262+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-11T20:23:19.642032Z","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-10T22:40:12.871453Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.10573","last_updated":"2022-04-04T22:31:36Z","snapshot_observed_at":"2026-08-12T07:35:07.820958Z","submitted_at":"2020-07-21T02:56:05Z","title":"Domain Generalization via Optimal Transport with Metric Similarity Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10573","snapshot_observed_at":"2026-08-11T20:23:19.642032Z","title":"Domain generalization via optimal transport with metric similarity learning,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.05842","last_updated":"2024-12-08T07:37:05Z","snapshot_observed_at":"2026-08-11T20:15:05.062410Z","submitted_at":"2024-12-08T07:37:05Z","title":"DREAM: Domain-agnostic Reverse Engineering Attributes of Black-box Model","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T20:23:19.642032Z"},"links":{"cited_paper":"/paper/2007.10573","citing_paper":"/paper/2412.05842"},"observation_digest":"sha256:d9a40615af9c61000984ffffdbef1937bedfc0a38db11d18cfa32a2c689bd0bc","observation_id":"78c84a2f-2e91-43b8-bcb2-944b6aab16cc","resolution":{"observed_at":"2026-08-11T20:23:19.642032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10573","last_updated":"2022-04-04T22:31:36Z","snapshot_observed_at":"2026-08-12T07:35:07.820958Z","submitted_at":"2020-07-21T02:56:05Z","title":"Domain Generalization via Optimal Transport with Metric Similarity Learning","version":2},"cited_work":{"arxiv_id":"2007.10573","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.10573","snapshot_observed_at":"2026-08-10T22:40:12.871453Z","title":"Domain Generalization via Optimal Transport with Metric Similarity Learning","venue":"cs.CV","work_id":"6051338e-b80d-403c-b37f-fc17a1ed1428","year":2020},"citing_paper":{"arxiv_id":"2501.01109","last_updated":"2025-01-02T07:14:23Z","snapshot_observed_at":"2026-08-11T13:56:26.295337Z","submitted_at":"2025-01-02T07:14:23Z","title":"BatStyler: Advancing Multi-category Style Generation for Source-free Domain Generalization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:40:12.636327Z"},"links":{"cited_paper":"/paper/2007.10573","citing_paper":"/paper/2501.01109"},"observation_digest":"sha256:54cda4d791e114001fee00bc91fff5e9963b440e3040aaff9f6f9a38eeb50b8a","observation_id":"576496d6-ddc3-449e-8f1b-d13e5523c374","resolution":{"observed_at":"2026-08-10T22:40:12.875482Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.10573/citation-record","integrity":"/paper/2007.10573/integrity","json":"/paper/2007.10573/citation-record.json","paper":"/paper/2007.10573"},"outbound":[],"paper":{"arxiv_id":"2007.10573","last_updated":"2022-04-04T22:31:36Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-12T07:35:07.820958Z","submitted_at":"2020-07-21T02:56:05Z","title":"Domain Generalization via Optimal Transport with Metric Similarity Learning"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2007.10573."}