{"as_of":"2026-08-09T20:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f099c059324889219689c8fab0dea30a9904e39dc5bea3456040497cd85ffe4b","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-09T06:31:02.800959+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-07T14:22:59.171744Z","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-10T10:49:55.839584Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.15355","last_updated":"2025-02-21T10:12:34Z","snapshot_observed_at":"2026-08-07T17:59:09.375080Z","submitted_at":"2025-02-21T10:12:34Z","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15355","snapshot_observed_at":"2026-08-07T14:22:59.171744Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19182","last_updated":"2025-05-25T15:05:00Z","snapshot_observed_at":"2026-08-09T00:06:30.689284Z","submitted_at":"2025-05-25T15:05:00Z","title":"DLF: Enhancing Explicit-Implicit Interaction via Dynamic Low-Order-Aware Fusion for CTR Prediction","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:59.171744Z"},"links":{"cited_paper":"/paper/2502.15355","citing_paper":"/paper/2505.19182"},"observation_digest":"sha256:f74287b9f45ed36b672ded148fdc3d1a8d7f3dceed57d191a2b71e9b70fe8210","observation_id":"d01cfff9-7879-476c-8f5b-b65e41fe529e","resolution":{"observed_at":"2026-08-07T14:22:59.171744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15355","last_updated":"2025-02-21T10:12:34Z","snapshot_observed_at":"2026-08-07T17:59:09.375080Z","submitted_at":"2025-02-21T10:12:34Z","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15355","snapshot_observed_at":"2026-08-05T20:25:12.110041Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.10615","last_updated":"2025-08-14T13:12:29Z","snapshot_observed_at":"2026-08-06T19:53:35.593518Z","submitted_at":"2025-08-14T13:12:29Z","title":"FuXi-\\beta: Towards a Lightweight and Fast Large-Scale Generative Recommendation Model","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T20:25:12.110041Z"},"links":{"cited_paper":"/paper/2502.15355","citing_paper":"/paper/2508.10615"},"observation_digest":"sha256:9402b1506671dac92c47027b167426045256274d719babb8758ad663d5d7a37f","observation_id":"1233c1f9-691f-46e2-930f-ff2fd51a16b6","resolution":{"observed_at":"2026-08-05T20:25:12.110041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15355","last_updated":"2025-02-21T10:12:34Z","snapshot_observed_at":"2026-08-07T17:59:09.375080Z","submitted_at":"2025-02-21T10:12:34Z","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","version":1},"cited_work":{"arxiv_id":"2502.15355","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.15355","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A universal framework for compressing embeddings in ctr prediction","venue":null,"work_id":"b2fad36d-6b14-43ae-8894-fe1e05e45214","year":2025},"citing_paper":{"arxiv_id":"2604.14930","last_updated":"2026-04-16T12:18:27Z","snapshot_observed_at":"2026-07-06T23:02:36.062162Z","submitted_at":"2026-04-16T12:18:27Z","title":"IE as Cache: Information Extraction Enhanced Agentic Reasoning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-10T10:49:50.177400Z"},"links":{"cited_paper":"/paper/2502.15355","citing_paper":"/paper/2604.14930"},"observation_digest":"sha256:5feeacff3edd00e06ab080411165363b9307dbea6775b5a020441ce3e35417fa","observation_id":"68b8f978-a66b-4745-8e0d-82cabe8c4ab7","resolution":{"observed_at":"2026-05-10T10:49:55.842276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15355","last_updated":"2025-02-21T10:12:34Z","snapshot_observed_at":"2026-08-07T17:59:09.375080Z","submitted_at":"2025-02-21T10:12:34Z","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","version":1},"cited_work":{"arxiv_id":"2502.15355","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.15355","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A universal framework for compressing embeddings in ctr prediction","venue":null,"work_id":"b2fad36d-6b14-43ae-8894-fe1e05e45214","year":2025},"citing_paper":{"arxiv_id":"2604.15621","last_updated":"2026-04-17T02:00:52Z","snapshot_observed_at":"2026-07-06T23:03:07.228701Z","submitted_at":"2026-04-17T02:00:52Z","title":"Rethinking the Necessity of Adaptive Retrieval-Augmented Generation through the Lens of Adaptive Listwise Ranking","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-10T08:26:02.605596Z"},"links":{"cited_paper":"/paper/2502.15355","citing_paper":"/paper/2604.15621"},"observation_digest":"sha256:77ad5bc659c984bd0e62cdb4d209d53e200dde8d530c442f582d6263a39288cc","observation_id":"bbfc3034-5d5f-456b-abfb-c3177cf3bc7f","resolution":{"observed_at":"2026-05-10T08:27:51.771437Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.15355/citation-record","integrity":"/paper/2502.15355/integrity","json":"/paper/2502.15355/citation-record.json","paper":"/paper/2502.15355"},"outbound":[],"paper":{"arxiv_id":"2502.15355","last_updated":"2025-02-21T10:12:34Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T17:59:09.375080Z","submitted_at":"2025-02-21T10:12:34Z","title":"A Universal Framework for Compressing Embeddings in CTR 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2502.15355."}