{"as_of":"2026-08-09T10:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:189f6e1f0347f4e85b1cfe42301d95f41fc8da0f77f583c223adcb18e0b83ab9","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-09T06:31:02.800959+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-07T14:03:12.366594Z","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-21T14:14:12.313111Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.05625","last_updated":"2021-12-07T06:16:07Z","snapshot_observed_at":"2026-08-02T13:47:47.712881Z","submitted_at":"2020-11-11T08:33:07Z","title":"CAN: Feature Co-Action for Click-Through Rate Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.05625","snapshot_observed_at":"2026-08-07T14:03:12.366594Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20227","last_updated":"2025-05-26T17:07:31Z","snapshot_observed_at":"2026-08-07T13:54:29.526445Z","submitted_at":"2025-05-26T17:07:31Z","title":"Measure Domain's Gap: A Similar Domain Selection Principle for Multi-Domain Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:03:12.366594Z"},"links":{"cited_paper":"/paper/2011.05625","citing_paper":"/paper/2505.20227"},"observation_digest":"sha256:b8d669538f060c7ac7d4726b9a466e1bf80767d8dcfce586c4a09c8d1e46ca9a","observation_id":"62023007-53ee-435b-9833-7395099612a2","resolution":{"observed_at":"2026-08-07T14:03:12.366594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05625","last_updated":"2021-12-07T06:16:07Z","snapshot_observed_at":"2026-08-02T13:47:47.712881Z","submitted_at":"2020-11-11T08:33:07Z","title":"CAN: Feature Co-Action for Click-Through Rate Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.05625","snapshot_observed_at":"2026-08-07T05:34:41.408734Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07563","last_updated":"2025-06-11T07:55:32Z","snapshot_observed_at":"2026-08-07T05:28:15.323605Z","submitted_at":"2025-06-09T09:03:05Z","title":"MoE-MLoRA for Multi-Domain CTR Prediction: Efficient Adaptation with Expert Specialization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:34:41.408734Z"},"links":{"cited_paper":"/paper/2011.05625","citing_paper":"/paper/2506.07563"},"observation_digest":"sha256:554a82345f2d49762d34b83292d17409a3413b48ac6ad24db89dee01af40daae","observation_id":"61bfba09-3496-4edb-a43f-7f191f95d15e","resolution":{"observed_at":"2026-08-07T05:34:41.408734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05625","last_updated":"2021-12-07T06:16:07Z","snapshot_observed_at":"2026-08-02T13:47:47.712881Z","submitted_at":"2020-11-11T08:33:07Z","title":"CAN: Feature Co-Action for Click-Through Rate Prediction","version":3},"cited_work":{"arxiv_id":"2011.05625","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.05625","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3c0ae7f7-4f18-4d21-b255-397529b38782","year":2020},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-08-05T18:30:23.267372Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2011.05625","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:fad26985019954eee7b8feea9e912b091a114243fb429a4e376d376d262fb379","observation_id":"b8aefc6b-9874-4ff7-89ee-9af58cafd8c9","resolution":{"observed_at":"2026-05-21T14:14:12.315856Z","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/2011.05625/citation-record","integrity":"/paper/2011.05625/integrity","json":"/paper/2011.05625/citation-record.json","paper":"/paper/2011.05625"},"outbound":[],"paper":{"arxiv_id":"2011.05625","last_updated":"2021-12-07T06:16:07Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-02T13:47:47.712881Z","submitted_at":"2020-11-11T08:33:07Z","title":"CAN: Feature Co-Action 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-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 3 inbound Pith citation observations for arXiv:2011.05625."}