{"as_of":"2026-08-21T03:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ebf0993f69d33eca6a203924b38d7c16588668c5ee64ce15ba9ded89b1cbe06b","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-20T06:33:59.587034+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-15T20:31:43.174089Z","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-11T15:55:11.649409Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.02594","last_updated":"2024-01-05T01:31:14Z","snapshot_observed_at":"2026-08-16T15:29:15.790890Z","submitted_at":"2024-01-05T01:31:14Z","title":"Unsupervised hard Negative Augmentation for contrastive learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02594","snapshot_observed_at":"2026-08-15T20:31:43.174089Z","title":"and Lampos, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12803","last_updated":"2025-05-19T07:32:06Z","snapshot_observed_at":"2026-08-18T00:41:55.459190Z","submitted_at":"2025-05-19T07:32:06Z","title":"Informed Mixing -- Improving Open Set Recognition via Attribution-based Augmentation","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T20:31:43.174089Z"},"links":{"cited_paper":"/paper/2401.02594","citing_paper":"/paper/2505.12803"},"observation_digest":"sha256:1f480171bbdeb73b8e1ec6ec1e73e85b61fe97a79df97786c1e91d232916f340","observation_id":"9a6e2cc9-dd51-4f32-8a35-4971d982820c","resolution":{"observed_at":"2026-08-15T20:31:43.174089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02594","last_updated":"2024-01-05T01:31:14Z","snapshot_observed_at":"2026-08-16T15:29:15.790890Z","submitted_at":"2024-01-05T01:31:14Z","title":"Unsupervised hard Negative Augmentation for contrastive learning","version":1},"cited_work":{"arxiv_id":"2401.02594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.02594","snapshot_observed_at":"2026-08-11T15:55:11.649409Z","title":"Unsupervised hard Negative Augmentation for contrastive learning","venue":"cs.CL","work_id":"937660f2-7edc-43b1-84e0-95478642aae8","year":2024},"citing_paper":{"arxiv_id":"2608.09510","last_updated":"2026-08-10T12:13:41Z","snapshot_observed_at":"2026-08-20T02:52:33.435408Z","submitted_at":"2026-08-10T12:13:41Z","title":"Build it, Break it, Repeat: Benchmarking and improving LLM-manipulated disinformation detection in social media posts","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-11T15:55:11.307321Z"},"links":{"cited_paper":"/paper/2401.02594","citing_paper":"/paper/2608.09510"},"observation_digest":"sha256:7b61274149e2663217b0f2e27cdd1add30d2a3950a52f8f6f2891dc1f4d0505f","observation_id":"ad5ba596-7e03-4e9b-b4c8-976202d1e903","resolution":{"observed_at":"2026-08-11T15:55:11.655148Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.02594/citation-record","integrity":"/paper/2401.02594/integrity","json":"/paper/2401.02594/citation-record.json","paper":"/paper/2401.02594"},"outbound":[],"paper":{"arxiv_id":"2401.02594","last_updated":"2024-01-05T01:31:14Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T15:29:15.790890Z","submitted_at":"2024-01-05T01:31:14Z","title":"Unsupervised hard Negative Augmentation for contrastive 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.02594."}