{"as_of":"2026-08-21T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4db70c44a099e79ad22ab0dc6f4dd9080370cee0d2a37900cb05e3c9ea2fd2d2","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:43:57.583653Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.01141/citation-record","integrity":"/paper/2412.01141/integrity","json":"/paper/2412.01141/citation-record.json","paper":"/paper/2412.01141"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.09888","last_updated":"2019-01-29T14:18:38Z","snapshot_observed_at":"2026-08-16T22:20:33.788255Z","submitted_at":"2019-01-29T14:18:38Z","title":"Federated Collaborative Filtering for Privacy-Preserving Personalized Recommendation System","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09888","snapshot_observed_at":"2026-08-12T04:43:57.228000Z","title":"Khan, Were Oyomno, Qiang Fu, Kuan Eeik Tan, and Adrian Flanagan","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.228000Z"},"links":{"cited_paper":"/paper/1901.09888","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:95ad7a2071d03636ab5986deca6d1f6783ce9e10febbfc97045f51008f6c6179","observation_id":"42165bfb-6f3f-4f7f-a0d6-2ae8293a4c84","resolution":{"observed_at":"2026-08-12T04:43:57.228000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.935728Z","title":null,"venue":null,"work_id":"d9ce4b31-6bb7-43c0-892f-fec0cbf53b51","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.234117Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:0c51b796d34a739105e6b7bdac31c1551969d47902b9455e418396bb0382846c","observation_id":"151b4dc8-d759-41ef-8059-26c821bc2cc2","resolution":{"observed_at":"2026-08-12T04:43:58.941063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.239588Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.239588Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:bdb2d2a88a75fc61fab841691c3475ef493cd4304383ce64f90b288620a2a5df","observation_id":"25756dfe-748d-4cf3-9604-9911d98fc0db","resolution":{"observed_at":"2026-08-12T04:43:57.239588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.868289Z","title":null,"venue":null,"work_id":"d9c0a1b7-5e8b-46b4-b18c-d1456ffba680","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.250624Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:154c590e3699b7daa457ee2908829e2dd58ecf6d190b4271edb6c1eb0b7cb24e","observation_id":"facd0a7a-271e-4af8-b229-f5e84a82de67","resolution":{"observed_at":"2026-08-12T04:43:58.875824Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.846885Z","title":null,"venue":null,"work_id":"63da1520-527d-4cbb-b20c-3af2afa0b640","year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.256838Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:33602274d54aebb1c850c38c1559580283fde3ca6c60576afae22dc5985738de","observation_id":"fab4daf9-60c8-4613-b90f-ad90da140a3b","resolution":{"observed_at":"2026-08-12T04:43:58.853252Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.827825Z","title":null,"venue":null,"work_id":"e70c0ad2-2645-45e2-bb2e-e18aa916afff","year":2020},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.262220Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:1d793f4fe18b89a4d5d76e287f2d553455dd5ce793d316895f520ce83a814218","observation_id":"d80a0aae-3826-467f-ac33-04d3798d436d","resolution":{"observed_at":"2026-08-12T04:43:58.832786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.807620Z","title":null,"venue":null,"work_id":"560f013b-c85a-4c35-ae74-f36e1b07935c","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.268587Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:d3da034813c8b7458056782431da789e2490ad8d1f1ae7b858c5e7a7207bf6c6","observation_id":"5111af7e-ce51-4a94-b866-f41aeaf7f4ee","resolution":{"observed_at":"2026-08-12T04:43:58.814000Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.778293Z","title":null,"venue":null,"work_id":"1982b194-2963-49df-a75a-627740598b85","year":2016},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.274226Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:54c8f9e1d843ddcfff00f7633c1b6c06f1137b37980a4dd4b4c64d9ec17c9e8e","observation_id":"5acab278-232a-45b2-bf44-ff801b744333","resolution":{"observed_at":"2026-08-12T04:43:58.783999Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.757409Z","title":null,"venue":null,"work_id":"72775074-1434-4ad4-9615-f0dedf7e4a46","year":2017},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.279404Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:a1ffaa17863873d0bcdd4fa6a310039c05517fb64d8765a07b2fce6843235c6a","observation_id":"3d7a1a58-1994-49af-9222-d2035f07a2e9","resolution":{"observed_at":"2026-08-12T04:43:58.764216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.739231Z","title":null,"venue":null,"work_id":"35d15ddc-cf42-47ac-9f96-01ed98b19118","year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.284230Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:13c5bf9ed82ba9e53050b2b558ca23eaa26533d8ff176c732b72328517b27e00","observation_id":"ce0d92bb-db40-4f46-a9cc-f629a5d0516c","resolution":{"observed_at":"2026-08-12T04:43:58.744652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.720666Z","title":null,"venue":null,"work_id":"6fbc47a3-231f-4645-b8a8-36f9b7294704","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.289400Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c3bacf5aed562dce7a6d59c29d47ac673d275bfd3400215a517c9a36d87c9a11","observation_id":"df343884-4b11-4110-8a89-1ed960aebe16","resolution":{"observed_at":"2026-08-12T04:43:58.726851Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.697884Z","title":null,"venue":null,"work_id":"ad8e39df-34ac-4965-a43a-495d7293c87f","year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.294637Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:20dc822fb57486e6d8171989affbbedae33ef9cf9223e2269f48f47bff4e930e","observation_id":"e44ec278-9b32-4ba5-abaf-798c146d5857","resolution":{"observed_at":"2026-08-12T04:43:58.703699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.667805Z","title":null,"venue":null,"work_id":"bae7a98f-4238-416c-8720-7596aa94d414","year":2020},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.299915Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:38c9c9b8591f87fa8553fa04853b65803f3de8ddeb2f5d204e98667de78b65e3","observation_id":"624394b7-e86b-4f11-9930-d89841ce645b","resolution":{"observed_at":"2026-08-12T04:43:58.674601Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.645201Z","title":null,"venue":null,"work_id":"0ebcbe53-8878-4987-8ca6-0fa764f3e651","year":2017},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.305117Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:1ef8f8512d1458202b8810f4a5e319fbbf9d3b1a0d77d6598dddc1eedb08c86c","observation_id":"67d7dce7-81ef-46a3-ad03-9326384a2586","resolution":{"observed_at":"2026-08-12T04:43:58.651236Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.627032Z","title":null,"venue":null,"work_id":"54312dcc-0ad2-4c3b-807a-f45f0dc98714","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.310273Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:9102194ff6f5c09596b5e3e44e269f6579dfbdb968eb9fe6f43b52a79a7db72e","observation_id":"159fe5ec-8afb-409f-a4d8-9f8d7504cfa0","resolution":{"observed_at":"2026-08-12T04:43:58.632826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.607545Z","title":null,"venue":null,"work_id":"fa8580b3-b8d7-4024-a750-b6901708e918","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.316191Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:b7be6ef1b3de33a927aada9a8b501ba97a60643bb6801e7e02e02ba32a6c60a3","observation_id":"6dfcc87d-0c00-41a6-9ab3-2bf8a8f7b66a","resolution":{"observed_at":"2026-08-12T04:43:58.613034Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.586387Z","title":null,"venue":null,"work_id":"04e34eab-3a84-4759-98c9-20085c3a5925","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.321201Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:7c5586c18959341dea15f100d8348d3e16495a6af50f0c382c5d1df05b2c77f7","observation_id":"e7f59794-c5af-47de-8291-08c63b42219d","resolution":{"observed_at":"2026-08-12T04:43:58.592189Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.566097Z","title":null,"venue":null,"work_id":"39037619-ef83-404b-ba10-8b4e747b6006","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.326629Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:8d746f536a26060f48b24b9a1b91e1c59d26d7a4303b6c5f0b16f2c91f1b8ee1","observation_id":"487af5ad-95c5-40d4-9ae5-4108b5ea0aac","resolution":{"observed_at":"2026-08-12T04:43:58.572028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.546348Z","title":null,"venue":null,"work_id":"0ace9c16-8d3c-44c6-bc7f-c87cd367fd2d","year":2013},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.331672Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:0bc9632fd02c24768262bfcc8bd25532e077615d91908c60c70d18a4fc194d63","observation_id":"1433aae0-d088-4fde-b54d-aa6460292a94","resolution":{"observed_at":"2026-08-12T04:43:58.551664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08570","last_updated":"2020-02-20T05:20:02Z","snapshot_observed_at":"2026-08-18T00:26:14.797444Z","submitted_at":"2020-02-20T05:20:02Z","title":"Input Perturbation: A New Paradigm between Central and Local Differential Privacy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08570","snapshot_observed_at":"2026-08-12T04:43:57.336614Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.336614Z"},"links":{"cited_paper":"/paper/2002.08570","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:5944c3631d2a7685f7849b27b5b91ce67ae2c83aa6f163352ad74ecba4eaa1d9","observation_id":"79bf923a-5242-4765-9233-f9dc691f9a0e","resolution":{"observed_at":"2026-08-12T04:43:57.336614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-12T04:43:57.341382Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.341382Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:56430eda2e4d76a32771c5f757fa6daf460fe57eb05b8c2d3bd54f628ff2f6b3","observation_id":"f852a048-4b4d-405b-8df0-f5cea33d0256","resolution":{"observed_at":"2026-08-12T04:43:57.341382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.05492","last_updated":"2017-10-30T20:52:14Z","snapshot_observed_at":"2026-08-13T17:19:46.488095Z","submitted_at":"2016-10-18T09:11:51Z","title":"Federated Learning: Strategies for Improving Communication Efficiency","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.05492","snapshot_observed_at":"2026-08-12T04:43:57.346137Z","title":"Brendan McMahan, Felix X","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.346137Z"},"links":{"cited_paper":"/paper/1610.05492","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:de0cad45ff885eca1f96775ecfeec07336e676e26c55a68cfee405a65f39332a","observation_id":"ed0df371-6091-4311-a276-1051a709dea0","resolution":{"observed_at":"2026-08-12T04:43:57.346137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.523479Z","title":null,"venue":null,"work_id":"adc02802-c9e0-4f25-9be9-f0d011cdc040","year":2008},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.351849Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c419e53bca78334fd05db6b184635b759b5f368ff589684ef243630e6ed138d1","observation_id":"95ee00aa-6a40-4bb0-b16e-72f275bd9aba","resolution":{"observed_at":"2026-08-12T04:43:58.531382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.357135Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.357135Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c4329a52e4b0326009629f9f6749a8ad837357f6531076ffd9957691c2b05056","observation_id":"c552d240-58e4-4731-8e7b-e3592b83f094","resolution":{"observed_at":"2026-08-12T04:43:57.357135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.481586Z","title":"Lagendijk, Zekeriya Erkin, and Mauro Barni","venue":null,"work_id":"62a3795f-5d09-4c09-a73b-9fd1569b1962","year":2013},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.362809Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:0e4f67a3debfa4add60dca1cf8a17ae8845aeb0d3983669595288aad2c61c4e0","observation_id":"5c02b324-b402-4b2e-b092-1f934baa01c6","resolution":{"observed_at":"2026-08-12T04:43:58.491082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.13686","last_updated":"2022-10-25T01:08:20Z","snapshot_observed_at":"2026-08-16T16:21:27.023264Z","submitted_at":"2022-10-25T01:08:20Z","title":"FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.13686","snapshot_observed_at":"2026-08-12T04:43:57.368096Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.368096Z"},"links":{"cited_paper":"/paper/2210.13686","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:995e4d341018dabca67cec94d2b78ba01f723431ce541e21a63d5c56e3c07ffb","observation_id":"cf9a4124-1adc-479c-a60e-3882924f365c","resolution":{"observed_at":"2026-08-12T04:43:57.368096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.376412Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.376412Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:03bdd1373e05ba7fcca7d36e650a3cf8226f597173b024e6e67c6949cfceba29","observation_id":"5e182631-d6ae-4180-9ffc-f4b3159cb6c4","resolution":{"observed_at":"2026-08-12T04:43:57.376412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09109","last_updated":"2024-02-08T04:41:49Z","snapshot_observed_at":"2026-08-16T16:00:54.923528Z","submitted_at":"2023-01-22T12:13:25Z","title":"Federated Recommendation with Additive Personalization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.09109","snapshot_observed_at":"2026-08-12T04:43:57.381548Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.381548Z"},"links":{"cited_paper":"/paper/2301.09109","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:7122d3d4b2870e82735090c5d89a38e8b82c6099dd2224a46947f2c2001e3fbc","observation_id":"7994f3d6-1745-45b9-bb07-687c73006d9c","resolution":{"observed_at":"2026-08-12T04:43:57.381548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.447242Z","title":null,"venue":null,"work_id":"c98e2943-b125-4d97-a46f-5c9e638f51fa","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.387671Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:e076ffc4209f631e591a0d1a3239bcf2582b5823d35b5e8f4778ac300de28840","observation_id":"4b05dfdb-f545-47b3-9b3d-57267fc9084a","resolution":{"observed_at":"2026-08-12T04:43:58.453020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.422897Z","title":null,"venue":null,"work_id":"2de9bb89-fcfc-425d-8c87-7872b47ff17c","year":2020},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.393145Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:55c702f5969f8123e62df674c5eb175e33579ac990529f5fb2ccab88888481cc","observation_id":"7f77f293-e44a-4bc2-b1d5-f47605d8ac8e","resolution":{"observed_at":"2026-08-12T04:43:58.431762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.403277Z","title":null,"venue":null,"work_id":"29068dc3-5c3e-4222-928d-1bd778b280ed","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.398006Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:8084867a86d6f22067548d8f5f3c910f6f0cba6e661ec797a7e5084ac14e8526","observation_id":"1913b4bf-8418-488a-9097-7a78fe5e92eb","resolution":{"observed_at":"2026-08-12T04:43:58.409104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.376507Z","title":null,"venue":null,"work_id":"d4c0dbd8-9329-4ae8-933d-7ea1b61862a0","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.403834Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:3f94b7a6636cc031f513474765f8c8e0d58926eebc911a8616d80a6bac1f94e6","observation_id":"cec36ad9-8b10-4510-becd-df74eabe946e","resolution":{"observed_at":"2026-08-12T04:43:58.382134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.351061Z","title":null,"venue":null,"work_id":"50efb08c-d3fc-48b9-af02-bbc28368b614","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.411152Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:b5dc02896a7421c0abcb37d04f368b21a05d6e36637b70aa5156afa382bc4ff7","observation_id":"c95f8da5-7ea3-4ba4-a388-83f913bf85ac","resolution":{"observed_at":"2026-08-12T04:43:58.357950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.334396Z","title":null,"venue":null,"work_id":"b15dd437-f2ca-40ea-bfa8-b400f2ead172","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.418403Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:f87c2697e92fa9015037a6ab5934ff084a7fc1c615af6e14caf9b60d50a40175","observation_id":"22fe6cbb-21aa-44f5-a140-452459d6d716","resolution":{"observed_at":"2026-08-12T04:43:58.339351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.313626Z","title":null,"venue":null,"work_id":"2d4e2d5a-afb4-4023-a9e8-739f322e8a73","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.424561Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:72d6c1de631d2b8bae49bdbcd328f4895db9e08322a1c8f0ec85a7a31e741142","observation_id":"e39b7cfa-03aa-41c6-8cd2-4591530ee26d","resolution":{"observed_at":"2026-08-12T04:43:58.321795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.287796Z","title":null,"venue":null,"work_id":"8cb97710-8396-466c-b9c3-ef9337f16c94","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.429765Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:25bea368b24a6ea99ccfa03fcda528118122901a163581860c1f67b9b78cac03","observation_id":"f2eadcf5-edf3-4346-b52e-7c6d8db12563","resolution":{"observed_at":"2026-08-12T04:43:58.299127Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.264737Z","title":null,"venue":null,"work_id":"b0aabddb-7ddc-4838-9acf-e40379931696","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.435509Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:3734a7ca004e593dfc8949aafeacea5e39d37bc9730f57bdb6bbd7ffeca4df3a","observation_id":"66930076-7453-40ff-afb5-18ff4c6735b8","resolution":{"observed_at":"2026-08-12T04:43:58.272431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.245988Z","title":null,"venue":null,"work_id":"7a98a63b-65fe-41ab-9fb7-325b34fd13a2","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.442494Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:2368bda8db0c4fa50d2349e65ac3fa6ea485202b900e2467c26cedc27680f5d8","observation_id":"3f87b5b8-dde8-4381-8221-4c356ca25e25","resolution":{"observed_at":"2026-08-12T04:43:58.251228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2618","last_updated":"2012-05-09T18:25:09Z","snapshot_observed_at":"2026-08-15T03:23:25.220336Z","submitted_at":"2012-05-09T18:25:09Z","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2618","snapshot_observed_at":"2026-08-12T04:43:57.448780Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.448780Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:02b8d54ea316b452a97956b783cb6f1df17923ef80cdcc283de950837caf9e20","observation_id":"113f418a-43c8-4b10-9850-7aad3eaf4f3c","resolution":{"observed_at":"2026-08-12T04:43:57.448780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.223487Z","title":null,"venue":null,"work_id":"f348fd0f-e62e-4dcf-816a-9dbab5489d36","year":1979},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.454411Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c957f30f4f5580c76485d55fbac1286542fbbf7f4b937230f57e00da9e61d8e2","observation_id":"3e7098aa-b927-44e4-b078-171dda839429","resolution":{"observed_at":"2026-08-12T04:43:58.231412Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.200875Z","title":null,"venue":null,"work_id":"3a5fa396-a4bf-47cd-937d-0bd04fec50f4","year":2020},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.462601Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:0205c86c725dfb2e65656c04d5b784f3bbb914e689293d6e21637b30f56678bc","observation_id":"958c3e2b-9cac-4990-a8c4-739b1f39eaea","resolution":{"observed_at":"2026-08-12T04:43:58.210088Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.174133Z","title":null,"venue":null,"work_id":"e73b4472-325f-4868-86c5-2b1596c9c12d","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.474272Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:6a70ef78137786977e1c410518868a3316bc784516b4428703d2ba093055d52f","observation_id":"b3b60b3b-4c27-4b92-bf34-5c1b4c37ec1c","resolution":{"observed_at":"2026-08-12T04:43:58.181641Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.153052Z","title":null,"venue":null,"work_id":"bbd71864-69ea-40c4-b4be-cfdc39363032","year":2018},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.481645Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:1fbd347f880dc3279da5a1dc19ba348df12026a8cb706488ff5acf95a4699a30","observation_id":"3b3882bb-4df9-4d6c-a0e8-0128269ad973","resolution":{"observed_at":"2026-08-12T04:43:58.160809Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.134056Z","title":null,"venue":null,"work_id":"69020a7b-8246-4346-8847-1bb320a00842","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.487543Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:4249dfff10e3886236212b915f3798d80cd9c29744d57e3b226d3066a1920d39","observation_id":"0fa2e9f1-a0c8-44ad-b221-536e31f450ad","resolution":{"observed_at":"2026-08-12T04:43:58.140539Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.104396Z","title":null,"venue":null,"work_id":"09dbec3a-87a7-4127-8814-b11dec5c3ea7","year":2015},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.492962Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:3322f0556b6e2b9dd8bfa5fe25c620873623c5ebd77c2788567a6c57b8e66632","observation_id":"80ae836a-8b57-42e1-9d45-9405fb021878","resolution":{"observed_at":"2026-08-12T04:43:58.113381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.080408Z","title":null,"venue":null,"work_id":"6088fd3a-0909-4b49-a3ca-2b2d59ff7c43","year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.499543Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:48d8fa7af2d8b1467348605e24f67de94279086394d983ea7c1c125e651ee63f","observation_id":"d304716e-0a97-43ae-9a25-6fc6a68823a3","resolution":{"observed_at":"2026-08-12T04:43:58.086170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.504548Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.504548Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:6a8c870e8958f830b2303a11a209b55ae053d73b99428f560a06b2360847a21b","observation_id":"71b12c5c-1aba-4141-b7d7-9838caf15f9b","resolution":{"observed_at":"2026-08-12T04:43:57.504548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.046831Z","title":null,"venue":null,"work_id":"9d63b7c7-7d63-4683-8eb9-8132e1665a76","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.509919Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:b460541e6be53cea5162d78d28addb243acead47f1b6b0ecbaf76bb52b9baf74","observation_id":"0223a547-73e5-449a-b316-20ca435cebf8","resolution":{"observed_at":"2026-08-12T04:43:58.052308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.017349Z","title":null,"venue":null,"work_id":"da4faf49-cc30-4509-80b0-9d6884d973c7","year":2022},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.515886Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:75727553fe3e832b29986ff66fffaed5efe9e5a5985ff35d07da49b48b50d80a","observation_id":"cf74f3eb-d0ee-4ca0-8b63-223e80dd4d7c","resolution":{"observed_at":"2026-08-12T04:43:58.035283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.997316Z","title":null,"venue":null,"work_id":"f5536737-f99d-4074-b3f9-f2074e324613","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.520411Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:8898dfb2a8e9a1d8524ff5485a87a7edeb0dd62ae0f3b47e860423dbdecf06e9","observation_id":"7d156623-a632-465d-945a-c969188c4ab3","resolution":{"observed_at":"2026-08-12T04:43:58.003788Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.977879Z","title":null,"venue":null,"work_id":"58c98221-8cd5-4f88-a725-7d1f0a0be4b9","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.524933Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:0d4f63faee915326d7dee261906cdb497c6fee971a7e679d927eee19bf174714","observation_id":"4f9501a8-e21b-4c7a-8ed6-146f4630048e","resolution":{"observed_at":"2026-08-12T04:43:57.984537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.953397Z","title":null,"venue":null,"work_id":"22734f2d-8c26-4dae-a1ae-401ab9276b71","year":2019},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.530106Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:79b4fa1f84a6d4188c227758c1fa1dee57bf203abb1c9cd156f8b3b713760229","observation_id":"d4c42b0b-b369-41ce-ad94-d869e2dc20c6","resolution":{"observed_at":"2026-08-12T04:43:57.962469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.935432Z","title":null,"venue":null,"work_id":"8dc57577-63d7-4677-ac72-79aeefed73ae","year":2017},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.537268Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:6c274cc46f3634fe90ce31cb09683f6e17de2c22764795f96f0c67c252995d72","observation_id":"f52198a0-932a-4f15-bf53-f110e850061a","resolution":{"observed_at":"2026-08-12T04:43:57.940674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.912374Z","title":null,"venue":null,"work_id":"740a9cd1-495e-4072-9533-035e210a4e91","year":2018},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.543129Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:dd921fd58aec8a5910a5f93f8bb97b60f7742bbe464b2b8cba98b8bd8a93f568","observation_id":"a8376e76-735a-4690-a64a-eb97b72c3432","resolution":{"observed_at":"2026-08-12T04:43:57.920275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.08143","last_updated":"2023-05-13T08:23:17Z","snapshot_observed_at":"2026-08-21T18:49:09.079330Z","submitted_at":"2023-01-16T05:26:07Z","title":"Dual Personalization on Federated Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.08143","snapshot_observed_at":"2026-08-12T04:43:57.548969Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.548969Z"},"links":{"cited_paper":"/paper/2301.08143","citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:5f1e6d3940bd0ab378ba988faad833c6cc8df2c08a3b0d6e64d7c73a6a47f4fd","observation_id":"b32e7640-c62c-477b-aaaa-2ec9f214dee9","resolution":{"observed_at":"2026-08-12T04:43:57.548969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.889142Z","title":null,"venue":null,"work_id":"3a4ff3ba-8e64-42bd-b127-10fe635c3328","year":2024},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.554827Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:9721f295f69a9de566982995f93d08c4110bb37f34cccbbfa0a4b78ed4b39872","observation_id":"17e33c9a-b5a7-4661-a348-bcb8c5b760ba","resolution":{"observed_at":"2026-08-12T04:43:57.896033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.871612Z","title":null,"venue":null,"work_id":"07650736-5b2e-4f26-b825-df4986fc5a42","year":2023},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.561394Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:1fa186fb3fb1dc5c678f0810980c09f104475969ddf995e918fa39377a26731c","observation_id":"f102de2c-366e-444c-aef9-578501f739b1","resolution":{"observed_at":"2026-08-12T04:43:57.876218Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.850599Z","title":null,"venue":null,"work_id":"05ce849d-3cc8-4432-9a83-8924a760e8b4","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.568575Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c091e1041b698e26bac61582a599514c406fabeadc51e4b9fd67ca648019d2c1","observation_id":"5783ac74-99b8-42f5-9300-239b94b0aa2d","resolution":{"observed_at":"2026-08-12T04:43:57.857518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.830726Z","title":null,"venue":null,"work_id":"25796a80-562a-4977-957f-4e4765998a21","year":2021},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.577465Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:4fba69a8f309722eb8ef6a7247e739e994720ccc26d9b2c0a1a787d0a71e2f9c","observation_id":"44743b37-35c1-4dd4-96c1-c35ae69a801d","resolution":{"observed_at":"2026-08-12T04:43:57.837202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:57.809389Z","title":null,"venue":null,"work_id":"8c7f47a6-b45c-4af1-9ac5-76700fb4c71d","year":2017},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.583653Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:c3024296b3418e4b2a4ecef6a86345dccb8512449c5e172f5c501eff87bf7d63","observation_id":"40c4512c-a2d0-493d-8c91-0141ba25e837","resolution":{"observed_at":"2026-08-12T04:43:57.817305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:43:58.901006Z","title":"In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","venue":null,"work_id":"0ba65916-e7ad-46af-84c3-3dc2bcf815d8","year":2017},"citing_paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T04:43:57.245162Z"},"links":{"citing_paper":"/paper/2412.01141"},"observation_digest":"sha256:5ccf0f5aa27d2f0855d58be8c22444d39b9a07e77acb4753e20ff283f3d19a97","observation_id":"8e3acc55-472f-40aa-a56c-3f7e6ad94aae","resolution":{"observed_at":"2026-08-12T04:43:58.908808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.01141","last_updated":"2024-12-02T05:31:22Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-20T11:32:48.111393Z","submitted_at":"2024-12-02T05:31:22Z","title":"Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":59,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":61},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2412.01141."}