{"as_of":"2026-08-18T07:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf0499b4fe31d973e4497599280d893513b87e709a090fb42feda398622ac5eb","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:01:30.991326Z","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-07-03T11:28:04.473201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.02424","last_updated":"2023-05-03T20:31:13Z","snapshot_observed_at":"2026-08-18T06:42:13.431218Z","submitted_at":"2023-05-03T20:31:13Z","title":"Backdoor Learning on Sequence to Sequence Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02424","snapshot_observed_at":"2026-08-11T14:01:30.991326Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12563","last_updated":"2024-12-17T05:46:50Z","snapshot_observed_at":"2026-08-17T05:47:53.534686Z","submitted_at":"2024-12-17T05:46:50Z","title":"Task-Agnostic Language Model Watermarking via High Entropy Passthrough Layers","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T14:01:30.991326Z"},"links":{"cited_paper":"/paper/2305.02424","citing_paper":"/paper/2412.12563"},"observation_digest":"sha256:7dbfcc6aafcfc41bdd32987e14ddf02acbc41c017d5c705f3c5cb0698253e4de","observation_id":"489fb54e-3bf6-4fc3-982f-1ddf2157778e","resolution":{"observed_at":"2026-08-11T14:01:30.991326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02424","last_updated":"2023-05-03T20:31:13Z","snapshot_observed_at":"2026-08-18T06:42:13.431218Z","submitted_at":"2023-05-03T20:31:13Z","title":"Backdoor Learning on Sequence to Sequence Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02424","snapshot_observed_at":"2026-08-04T22:33:33.775424Z","title":"Backdoor learning on sequence to sequence models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07287","last_updated":"2025-09-08T23:44:00Z","snapshot_observed_at":"2026-08-17T20:59:00.743309Z","submitted_at":"2025-09-08T23:44:00Z","title":"Paladin: Defending LLM-enabled Phishing Emails with a New Trigger-Tag Paradigm","version":1},"reference_index":152,"source":"pdf_text","source_observed_at":"2026-08-04T22:33:33.775424Z"},"links":{"cited_paper":"/paper/2305.02424","citing_paper":"/paper/2509.07287"},"observation_digest":"sha256:4f638368e61cb209bca66e19789330b43102cf1bbf5ea074ac3f5f83cbdd96aa","observation_id":"29bc7750-fb29-40bb-b5e3-201ff74aab10","resolution":{"observed_at":"2026-08-04T22:33:33.775424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02424","last_updated":"2023-05-03T20:31:13Z","snapshot_observed_at":"2026-08-18T06:42:13.431218Z","submitted_at":"2023-05-03T20:31:13Z","title":"Backdoor Learning on Sequence to Sequence Models","version":1},"cited_work":{"arxiv_id":"2305.02424","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.02424","snapshot_observed_at":"2026-07-03T11:28:04.473201Z","title":"arXiv preprint arXiv:2305.02424 , year=","venue":null,"work_id":"8fefb128-a1b4-4219-9f55-4740cd83fa05","year":null},"citing_paper":{"arxiv_id":"2606.11648","last_updated":"2026-06-10T04:26:57Z","snapshot_observed_at":"2026-08-12T15:45:26.927370Z","submitted_at":"2026-06-10T04:26:57Z","title":"Dummy Backdoor as a Defense: Removing Unknown Backdoors via Shared Internal Mechanisms for Generative LLMs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-27T09:33:45.042071Z"},"links":{"cited_paper":"/paper/2305.02424","citing_paper":"/paper/2606.11648"},"observation_digest":"sha256:e247218ad186bd9f1b84250353e65ff078c5a95ff33ca411a20d4c57d78111e2","observation_id":"5624344b-e6b6-4e1d-90b2-aa7b86022004","resolution":{"observed_at":"2026-07-03T11:28:04.474628Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2305.02424/citation-record","integrity":"/paper/2305.02424/integrity","json":"/paper/2305.02424/citation-record.json","paper":"/paper/2305.02424"},"outbound":[],"paper":{"arxiv_id":"2305.02424","last_updated":"2023-05-03T20:31:13Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T06:42:13.431218Z","submitted_at":"2023-05-03T20:31:13Z","title":"Backdoor Learning on Sequence to Sequence Models"},"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 3 inbound Pith citation observations for arXiv:2305.02424."}