{"as_of":"2026-08-10T14:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbd5df2dd61a61fea57492c7aa8f783b236cffe58a770191fcb7adb938b30344","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:03:15.711978Z","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-05T14:49:41.563760Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12212","snapshot_observed_at":"2026-08-07T15:03:15.711978Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-09T03:01:38.812813Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.711978Z"},"links":{"cited_paper":"/paper/2209.12212","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:e9005369d62b2b7df8d0a96f42169fd9f1f5af9840b8c60bf15e7c461173a067","observation_id":"f3ed0a3c-120a-43e7-ad6e-2e92459b2539","resolution":{"observed_at":"2026-08-07T15:03:15.711978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12212","snapshot_observed_at":"2026-08-05T19:01:48.380271Z","title":"Efficient long sequential user data modeling for click-through rate prediction","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.13568","last_updated":"2025-08-19T06:59:10Z","snapshot_observed_at":"2026-08-10T01:22:04.793786Z","submitted_at":"2025-08-19T06:59:10Z","title":"Understanding Distribution Structure on Calibrated Recommendation Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T19:01:48.380271Z"},"links":{"cited_paper":"/paper/2209.12212","citing_paper":"/paper/2508.13568"},"observation_digest":"sha256:e70ed6ad03f10f015427292314b1a6543a0f101fe7a1a36767a35d80cb6492a5","observation_id":"ed69e09f-998b-476d-bea1-a241de21a7e1","resolution":{"observed_at":"2026-08-05T19:01:48.380271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12212","snapshot_observed_at":"2026-08-05T16:20:16.122238Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18700","last_updated":"2025-08-26T06:06:21Z","snapshot_observed_at":"2026-08-10T03:44:51.632542Z","submitted_at":"2025-08-26T06:06:21Z","title":"Taming the One-Epoch Phenomenon in Online Recommendation System by Two-stage Contrastive ID Pre-training","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:20:16.122238Z"},"links":{"cited_paper":"/paper/2209.12212","citing_paper":"/paper/2508.18700"},"observation_digest":"sha256:f387bc820aa6abea898080899b7ebbb30292c6c58431aec3c1d7cbad0a1c316e","observation_id":"05f8915c-2f25-4a41-ae8b-413a08493009","resolution":{"observed_at":"2026-08-05T16:20:16.122238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":"2209.12212","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.12212","snapshot_observed_at":"2026-08-05T14:49:41.563760Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","venue":"cs.IR","work_id":"a4f630a6-a44e-4531-9915-3158d9db07cc","year":2022},"citing_paper":{"arxiv_id":"2508.20865","last_updated":"2025-08-28T14:58:47Z","snapshot_observed_at":"2026-08-08T03:21:17.167417Z","submitted_at":"2025-08-28T14:58:47Z","title":"Deep Multiple Quantization Network on Long Behavior Sequence for Click-Through Rate Prediction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:41.420189Z"},"links":{"cited_paper":"/paper/2209.12212","citing_paper":"/paper/2508.20865"},"observation_digest":"sha256:a0f90c422dfb7c6efd995f3b1c8f48fd18e8b35e82257565ad5e34d3d3615d06","observation_id":"0206c329-75ce-46d9-8084-012a51205880","resolution":{"observed_at":"2026-08-05T14:49:41.567585Z","resolver_source":"local_arxiv","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/2209.12212/citation-record","integrity":"/paper/2209.12212/integrity","json":"/paper/2209.12212/citation-record.json","paper":"/paper/2209.12212"},"outbound":[],"paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction"},"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 4 inbound Pith citation observations for arXiv:2209.12212."}