{"as_of":"2026-08-10T07:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e62534d3a8ad38bd06e21c049cf8f4e3000acf521cda984d83c0120393a523b8","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-10T06:31:04.303077+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-06T18:38:58.838494Z","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-05-11T02:45:58.355349Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.01152","last_updated":"2021-07-02T15:50:43Z","snapshot_observed_at":"2026-08-09T15:43:20.812340Z","submitted_at":"2021-07-02T15:50:43Z","title":"Simpler, Faster, Stronger: Breaking The log-K Curse On Contrastive Learners With FlatNCE","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.01152","snapshot_observed_at":"2026-08-06T18:38:58.838494Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.08064","last_updated":"2026-06-06T18:51:46Z","snapshot_observed_at":"2026-08-06T18:26:57.432317Z","submitted_at":"2025-07-10T16:47:25Z","title":"PUMA: Layer-Pruned Language Model for Efficient Unified Multimodal Retrieval with Modality-Adaptive Learning","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:38:58.838494Z"},"links":{"cited_paper":"/paper/2107.01152","citing_paper":"/paper/2507.08064"},"observation_digest":"sha256:35a6629e1efe0e19067fe118796bb0c5d044677e611f3875ecd731381a40e7d9","observation_id":"1ce6fe69-5fe2-48d3-b97e-06bc40f37ef4","resolution":{"observed_at":"2026-08-06T18:38:58.838494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.01152","last_updated":"2021-07-02T15:50:43Z","snapshot_observed_at":"2026-08-09T15:43:20.812340Z","submitted_at":"2021-07-02T15:50:43Z","title":"Simpler, Faster, Stronger: Breaking The log-K Curse On Contrastive Learners With FlatNCE","version":1},"cited_work":{"arxiv_id":"2107.01152","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.01152","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simpler, faster, stronger: Breaking the log- k curse on contrastive learners with flatnce.arXiv preprint arXiv:2107.01152","venue":null,"work_id":"df058109-49dd-4107-a9e5-4dd26f723e2b","year":2021},"citing_paper":{"arxiv_id":"2605.07211","last_updated":"2026-05-08T03:58:43Z","snapshot_observed_at":"2026-08-06T10:08:03.963609Z","submitted_at":"2026-05-08T03:58:43Z","title":"HARMONY: Bridging the Personalization-Generalization Gap by Mitigating Representation Skew in Heterogeneous Split Federated Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-11T02:42:40.417350Z"},"links":{"cited_paper":"/paper/2107.01152","citing_paper":"/paper/2605.07211"},"observation_digest":"sha256:b481d01d0fb62f6f0ba7ef5f62bcf8d1e37cf79dbbd1030385f3d64c807d187f","observation_id":"d207bc29-91ec-42da-ae8d-17f600f34600","resolution":{"observed_at":"2026-05-11T02:45:58.374981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.01152/citation-record","integrity":"/paper/2107.01152/integrity","json":"/paper/2107.01152/citation-record.json","paper":"/paper/2107.01152"},"outbound":[],"paper":{"arxiv_id":"2107.01152","last_updated":"2021-07-02T15:50:43Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T15:43:20.812340Z","submitted_at":"2021-07-02T15:50:43Z","title":"Simpler, Faster, Stronger: Breaking The log-K Curse On Contrastive Learners With FlatNCE"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2107.01152."}