{"as_of":"2026-08-14T01:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4c370f095377b457e43d1fd59d0ba2297cd35763fd5dbc20a0a45130f4a5eda","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-13T06:32:02.005865+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-12T20:18:19.992580Z","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-15T17:31:22.265339Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.00006","last_updated":"2022-11-02T16:38:37Z","snapshot_observed_at":"2026-08-13T15:33:25.022314Z","submitted_at":"2022-05-31T10:20:07Z","title":"COIN: Co-Cluster Infomax for Bipartite Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00006","snapshot_observed_at":"2026-08-12T20:18:19.992580Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09852","last_updated":"2025-09-11T18:51:53Z","snapshot_observed_at":"2026-08-13T00:39:46.809670Z","submitted_at":"2024-11-15T00:20:36Z","title":"InterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T20:18:19.992580Z"},"links":{"cited_paper":"/paper/2206.00006","citing_paper":"/paper/2411.09852"},"observation_digest":"sha256:05bf7db4a30f72c440a98e4bd2d455827081d12b9eb139bf6e776fd9e9a8559b","observation_id":"5b3727d3-f602-426d-83f0-1a5ab1434f76","resolution":{"observed_at":"2026-08-12T20:18:19.992580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00006","last_updated":"2022-11-02T16:38:37Z","snapshot_observed_at":"2026-08-13T15:33:25.022314Z","submitted_at":"2022-05-31T10:20:07Z","title":"COIN: Co-Cluster Infomax for Bipartite Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00006","snapshot_observed_at":"2026-08-11T18:13:12.643537Z","title":"InWWW ’21: The Web Conference 2021, Virtual Event / Ljubljana, Slovenia, April 19-23, 2021, pages 2414–2424","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.08174","last_updated":"2025-06-01T19:26:04Z","snapshot_observed_at":"2026-08-13T18:02:19.514310Z","submitted_at":"2024-12-11T08:03:35Z","title":"Can Graph Neural Networks Learn Language with Extremely Weak Text Supervision?","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T18:13:12.643537Z"},"links":{"cited_paper":"/paper/2206.00006","citing_paper":"/paper/2412.08174"},"observation_digest":"sha256:6efb0759b46a97cce935986563894ac363c1f0b476188834c239943cb7905c56","observation_id":"bdf81219-308a-4bfe-80df-512cfe4371f2","resolution":{"observed_at":"2026-08-11T18:13:12.643537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00006","last_updated":"2022-11-02T16:38:37Z","snapshot_observed_at":"2026-08-13T15:33:25.022314Z","submitted_at":"2022-05-31T10:20:07Z","title":"COIN: Co-Cluster Infomax for Bipartite Graphs","version":2},"cited_work":{"arxiv_id":"2206.00006","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.00006","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a4516a40-d6b2-450c-b2e5-d657693a6c9f","year":2022},"citing_paper":{"arxiv_id":"2604.20858","last_updated":"2026-03-01T23:20:48Z","snapshot_observed_at":"2026-08-11T21:18:46.381745Z","submitted_at":"2026-03-01T23:20:48Z","title":"Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-15T17:30:44.919870Z"},"links":{"cited_paper":"/paper/2206.00006","citing_paper":"/paper/2604.20858"},"observation_digest":"sha256:f4d3046e3548a87d8b6f43f04e0a2dae5f6020113608468d008009e2be8e9424","observation_id":"79ea5774-a346-4c98-ab52-4469983c2555","resolution":{"observed_at":"2026-05-15T17:31:22.267899Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.00006/citation-record","integrity":"/paper/2206.00006/integrity","json":"/paper/2206.00006/citation-record.json","paper":"/paper/2206.00006"},"outbound":[],"paper":{"arxiv_id":"2206.00006","last_updated":"2022-11-02T16:38:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T15:33:25.022314Z","submitted_at":"2022-05-31T10:20:07Z","title":"COIN: Co-Cluster Infomax for Bipartite Graphs"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2206.00006."}