{"as_of":"2026-08-08T20:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45cb92b8f2960c0d9488cc8d9f8ff2870a64997509a9a5d840bfc49dcfc240c5","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-08T06:32:00.761636+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-07T14:18:38.569906Z","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-07T14:18:43.171320Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.08520","last_updated":"2024-11-04T06:32:35Z","snapshot_observed_at":"2026-07-06T17:01:21.970309Z","submitted_at":"2023-12-13T21:15:29Z","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)","version":2},"cited_work":{"arxiv_id":"2312.08520","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.08520","snapshot_observed_at":"2026-08-07T14:18:43.171320Z","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)","venue":"cs.AI","work_id":"5f37e49d-9619-412c-b9b3-dac18980f0c5","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.569906Z"},"links":{"cited_paper":"/paper/2312.08520","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:aa7ce990a608b50b47a5ed9776f74922003262f2dd2850a3bf7f629256c2fc28","observation_id":"51ba5196-d008-4311-a6b1-a48c0fa2aa29","resolution":{"observed_at":"2026-08-07T14:18:43.252097Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.08520/citation-record","integrity":"/paper/2312.08520/integrity","json":"/paper/2312.08520/citation-record.json","paper":"/paper/2312.08520"},"outbound":[],"paper":{"arxiv_id":"2312.08520","last_updated":"2024-11-04T06:32:35Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T17:01:21.970309Z","submitted_at":"2023-12-13T21:15:29Z","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.08520."}