{"as_of":"2026-08-17T16:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28865cde600bdbb7e8b0e0595733484045536c7a51ee355341740f8ad1eb7d35","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:33:40.519130Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2505.09590/citation-record","integrity":"/paper/2505.09590/integrity","json":"/paper/2505.09590/citation-record.json","paper":"/paper/2505.09590"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:33:43.315232Z","title":"Recommendation systems: Algorithms, challenges, metrics, and business opportunities.Applied Sciences, 10(21):7748, 2020","venue":null,"work_id":"6d13a381-caea-403a-a81a-ed779a5e18f2","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.826796Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:e3b0d660d23fe8f9d592e3fb754d0eb90fe5d723f2f3fb3834fd2c7d4e3be8dd","observation_id":"791f9507-855a-428f-a046-d1b5fcf8573d","resolution":{"observed_at":"2026-08-15T21:33:43.425044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:43.299248Z","title":"Issues and solutions in deep learning-enabled recommendation systems within the e-commerce field.Applied Sciences, 12(21):11256, 2022","venue":null,"work_id":"becd375e-f3e0-41dc-8203-da49dca689ae","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.832245Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:f23e07c79173b9a849cd5798305be315e10da0334a4808550f62568f6a310b25","observation_id":"561c20bb-848b-4e89-afb9-63d4b2077a1c","resolution":{"observed_at":"2026-08-15T21:33:43.304278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.02631","last_updated":"2024-03-13T20:51:25Z","snapshot_observed_at":"2026-08-16T16:56:28.386620Z","submitted_at":"2022-05-31T01:54:29Z","title":"Contemporary Recommendation Systems on Big Data and Their Applications: A Survey","version":4},"cited_work":{"arxiv_id":"2206.02631","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.02631","snapshot_observed_at":"2026-08-15T21:33:40.736668Z","title":"Contemporary Recommendation Systems on Big Data and Their Applications: A Survey","venue":"cs.IR","work_id":"c12a0e72-a306-40c7-bc55-b8edec8dbe68","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.838702Z"},"links":{"cited_paper":"/paper/2206.02631","citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:a95677f10e3ac356358193b6ee8517cde90398827938f4ceb7582920812e20fc","observation_id":"6fba4391-b419-43e2-8d47-3c63bfa17f70","resolution":{"observed_at":"2026-08-15T21:33:40.741654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:43.276597Z","title":"Neuralcollaborativefiltering","venue":null,"work_id":"65e176e2-3d2a-46f1-ac13-1533d4eee3dc","year":2017},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.881518Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:2f035eab24ce7f641fe823c36b91e6d3b297b0cb2fba3c126ab47587ef93ae12","observation_id":"68bc6739-ea89-4268-8a8d-cc8dfe1df43a","resolution":{"observed_at":"2026-08-15T21:33:43.285241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:43.239411Z","title":"Attentive collaborative filtering: Multimedia recommendationwithitem-andcomponent-levelattention","venue":null,"work_id":"6e6af4b1-7afd-4a3f-b313-67caa37ae59e","year":2017},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.949290Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:170b850441fb753480634e51293672e6e8391f14f6cb8f2b9baf281d2ee96774","observation_id":"001bf6c8-ba66-4903-9765-f8ccd8584ce5","resolution":{"observed_at":"2026-08-15T21:33:43.263119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:37.956223Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:37.956223Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:614b1b1f14832cae5b5b8578347f8b2f795059c25c415ccca1323641b287670c","observation_id":"69de4470-f07b-4201-abc7-b7feb6fa2f22","resolution":{"observed_at":"2026-08-15T21:33:37.956223Z","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-15T21:33:43.093160Z","title":"Disentangled graph collaborative filtering","venue":null,"work_id":"be96f0a0-161b-4eb6-97aa-5381ecb2a95a","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.008374Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:8a71f9be96731bc28ac506f7fb1699bb6aa28c53f5e9db0021ef6c3eed6b948f","observation_id":"fc772e95-ff34-4c10-9af0-9fb6a6b6f6f0","resolution":{"observed_at":"2026-08-15T21:33:43.146109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:38.049486Z","title":"How powerful are k-hop message passing graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.049486Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:9d6a60e99b079d118ab1d1cd968db57891785ba4c6a92e4281177f9d682032b4","observation_id":"0911f375-4a0a-4783-b8a2-9c9fbc8fb2d8","resolution":{"observed_at":"2026-08-15T21:33:38.049486Z","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-15T21:33:43.064641Z","title":"Localaugmentation for graph neural networks","venue":null,"work_id":"bd21b2b7-3b61-4bad-aa85-39e89ee22642","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.054997Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:b996a769890c6b3a55d0f5cf1149415ab59f161241185ef6d3d186f059df5c66","observation_id":"26b3385f-89cf-4f10-b0ed-bf1b5e663da2","resolution":{"observed_at":"2026-08-15T21:33:43.069954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:43.047066Z","title":"Robust mid-pass filtering graph convolutional networks","venue":null,"work_id":"b2551b18-7993-434c-87fa-16e44b99c7c5","year":2023},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.160221Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:64f0eac10f29cfd3609a30b4d012663c6ceebdf13a93d8b35962a8cf0229aca6","observation_id":"4bb77684-6ace-44b3-8632-7fc2cea9aca7","resolution":{"observed_at":"2026-08-15T21:33:43.052875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:43.025409Z","title":"Mixed graph contrastive network for semi-supervised node classification.ACM Transactions on Knowledge Discovery from Data, 2024","venue":null,"work_id":"b2ce53fa-c2b5-4afb-9ebc-c823f941b83d","year":2024},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.191919Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:0513aa0e25ae0a1f1945bc744b3d4173c84b19a94eeece49550293ba70719e03","observation_id":"c089b78c-d87d-40f9-974f-ff3e16b1fc4c","resolution":{"observed_at":"2026-08-15T21:33:43.035089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.777594Z","title":"Graphneuralnetworksfornaturallanguage processing: A survey.Foundations and Trends®in Machine Learning, 16(2):119–328, 2023","venue":null,"work_id":"9c24b89a-e505-493e-a606-b4688276d76e","year":2023},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.198236Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:e67b15eb423edb8a8b95bb04dee1a21a596ebc81b591933598d66e9085fdbce1","observation_id":"8a00d316-6e62-4ec9-b73b-ef19563aa14b","resolution":{"observed_at":"2026-08-15T21:33:42.900174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.760668Z","title":"OnwhichnodesdoesGCNfail?enhancingGCNfromthenodeperspective","venue":null,"work_id":"d902d831-4bcc-465c-be0e-97624c50a498","year":2024},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.230007Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:59b6f6f9fea8fb88b23000acd3e0fba944f1814a3c1a6a9ddd4d65e561c80c73","observation_id":"f7a9c2de-8430-4c77-8605-611f4b0a4833","resolution":{"observed_at":"2026-08-15T21:33:42.766410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.740523Z","title":"Nie-gcn: Neighbor item embedding-aware graph convolutional network for recommendation.IEEE Transactions on Systems, Man, and Cybernetics: Systems, 54(5):2810–2821, 2024","venue":null,"work_id":"d3811c0d-de96-43af-b209-c7df745ce22e","year":2024},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.320442Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:61170cfe52a65977ede16faee192f91c9380f03ec2eaa677e758ed03d24ee5e7","observation_id":"fe031699-f58d-444e-b3b8-cd0bf441ddf2","resolution":{"observed_at":"2026-08-15T21:33:42.746851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.572258Z","title":"Multi-behavior recommendation with graph convolutional networks","venue":null,"work_id":"2d49eb10-7411-4732-a671-719cecfbedd3","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.326450Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:dc43190539aa45ae3de14cbc9b678dfe4b13c3308e009dabca7407def9eaf76a","observation_id":"bd3e5b4d-ba85-42d6-a2ab-bea1e7fc97b9","resolution":{"observed_at":"2026-08-15T21:33:42.683710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.553354Z","title":null,"venue":null,"work_id":"d4bec0de-162d-4a9e-b967-5f6344491dac","year":2006},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.332128Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:ded5963dbab3ae59d69ab31ef0b81092c332619d9b80b344e5e5ec2aa9d08163","observation_id":"8a6119b1-4ee9-4fc7-98d8-7a01518f5c0d","resolution":{"observed_at":"2026-08-15T21:33:42.558959Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.324867Z","title":"Meta-relation assisted knowledge-aware coupled graph neural network for recommendation.Information Processing & Management, 60(3):103353, 2023","venue":null,"work_id":"b0c8c4c0-8691-4073-9ab6-1fc0bff57389","year":2023},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.467805Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:f5dfdcae4e033598e576ccbb18c420967502945c9de7d2656876a5c8318352da","observation_id":"21a2a1c7-4984-4abd-b863-58e9cc658332","resolution":{"observed_at":"2026-08-15T21:33:42.428525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.306890Z","title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere","venue":null,"work_id":"4d71e13c-2660-4397-b910-bfda6f67f540","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.474412Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:e660b2fc65ca302dc9b09c38ac0e082dc940028e5d9d74dc5aeed68f8bd45104","observation_id":"6bd459f9-d548-4d0f-b00d-990405691595","resolution":{"observed_at":"2026-08-15T21:33:42.312640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.286133Z","title":"Lightgcn:Simplifyingandpoweringgraphconvolution networkforrecommendation","venue":null,"work_id":"27c724eb-f118-44be-9080-03587c48cfd5","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.483067Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:2ccd83b8801cce42de4a514379e0b315ffc7a7f6301ec2157e55bb51fb4e667a","observation_id":"68fd45af-d0cf-4264-8d87-7a8887b57f4d","resolution":{"observed_at":"2026-08-15T21:33:42.295085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.100172Z","title":"InProceedings of the Web Conference 2021, pages 593–601, 2021","venue":null,"work_id":"c89fd57a-467f-4b2a-a3e1-45e0dce6ff85","year":2021},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.596766Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:4ec24b01e3fc8d6a566779267d06e86d4c2296614d22ad19fcd97d9fcc641743","observation_id":"b65b8f46-2739-4e09-bb57-3a099bee0832","resolution":{"observed_at":"2026-08-15T21:33:42.181459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:42.081355Z","title":"Hrcf: Enhancing collaborative filtering via hyperbolic geometric regularization","venue":null,"work_id":"722cbaa6-5cdd-4b0a-bec5-17a839eef91a","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.651916Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:48318c3e7b60cabe8606345ebf1fc8c747e42d37ac60b4818eb2a1bba8228a66","observation_id":"df9dea9b-60fd-4db6-bff5-a78e9b19ea91","resolution":{"observed_at":"2026-08-15T21:33:42.087940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.895825Z","title":"Adaptive popularity debiasing aggregator for graph collaborative filtering.(2023).A APPENDICES A, 1, 2023","venue":null,"work_id":"32078a5b-9fd6-42db-8ae2-6a681dc97722","year":2023},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.657520Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:aa4e905e41068d26e7186274b923ed381a0fd3b5a5cb86d3851a622f0519318e","observation_id":"c3cdf761-9302-4019-b691-1ccfd1695bb2","resolution":{"observed_at":"2026-08-15T21:33:41.995622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:38.664059Z","title":"Model-agnostic counterfactual reasoning for eliminating popularity bias in recommender system","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.664059Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:4b70b593f99243b60cbaee95283bd80cbd75ff0261c953f1be19ecf87c751c57","observation_id":"6391e6ad-e697-490f-b73d-6cc004df960e","resolution":{"observed_at":"2026-08-15T21:33:38.664059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.12326","last_updated":"2022-04-27T15:36:26Z","snapshot_observed_at":"2026-08-16T17:04:29.385498Z","submitted_at":"2022-04-26T14:09:29Z","title":"Investigating Accuracy-Novelty Performance for Graph-based Collaborative Filtering","version":2},"cited_work":{"arxiv_id":"2204.12326","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.12326","snapshot_observed_at":"2026-08-15T21:33:40.595393Z","title":"Investigating Accuracy-Novelty Performance for Graph-based Collaborative Filtering","venue":"cs.IR","work_id":"20ca36aa-267d-466a-8280-7733fad310d4","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.741831Z"},"links":{"cited_paper":"/paper/2204.12326","citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:64ceaab1a78f4d13ab6e2004d36405a8a19a30d7d405d9360c18903abc386643","observation_id":"426c356b-688d-482d-ae5d-0761a5345b2f","resolution":{"observed_at":"2026-08-15T21:33:40.688588Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.866566Z","title":"Self-guided learning to denoise for robust recommendation","venue":null,"work_id":"7cbec271-6d74-4db5-b365-cb1b3d728a7f","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.791973Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:e7dce9ab5441ec68ce7d310ea0a3709a3ec5cb4920ddf3dd90da986f044fce27","observation_id":"de46b26e-6994-4c50-95b6-134fcba200d3","resolution":{"observed_at":"2026-08-15T21:33:41.872179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.741545Z","title":"Learning robust recommenders through cross-model agreement","venue":null,"work_id":"547da934-a196-486d-a067-d184364d0ac9","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.797661Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:4302ed4504682edda554ede6438c8c5be4ef2a780f768ca13a60fcb624b3c093","observation_id":"f95de8fb-2931-4778-8b56-758b7069ffab","resolution":{"observed_at":"2026-08-15T21:33:41.855357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.559715Z","title":"Springer, 2002","venue":null,"work_id":"2439320a-5535-4048-a5e6-814af9a94dea","year":2002},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.802973Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:9f50a2c5fd2169ff055d07db8f80903cd89c09bdc2043460d70c9f1896b6ac8f","observation_id":"61d5f9dd-d4c6-4fdf-9e12-ff2b51b3935f","resolution":{"observed_at":"2026-08-15T21:33:41.621589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.536048Z","title":"Graphmae: Self-supervised masked graph autoencoders","venue":null,"work_id":"44adffe9-5b25-4f98-a247-1f8b1e14ae48","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.944145Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:2540bb88f0738167b487d21209118b8c0093acf86cdcd66a0e3c72f52b5af462","observation_id":"5321b858-5bff-486d-8e7c-b496c34dd695","resolution":{"observed_at":"2026-08-15T21:33:41.542093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.354693Z","title":"Bayesian personalized ranking from implicit feedback","venue":null,"work_id":"10d67995-2192-4de1-8de3-724d6eca0800","year":2014},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.952216Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:3136c00001b5c1afbbbd5ddd272a3f87daf794626e37f35f5b1646c145de8ce0","observation_id":"f579bd49-01b4-4a77-9597-cec8039adee6","resolution":{"observed_at":"2026-08-15T21:33:41.448601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.334669Z","title":"Field-aware factorization machines for ctr prediction","venue":null,"work_id":"95df3833-8839-4ae4-bc39-f4b566847767","year":2016},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:38.958409Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:5393f46534918807144bf026f514c25d2d9d61fe2dd531f18fcef5b818b4ce30","observation_id":"4aebeda3-c004-42f4-a041-0b178c6b3647","resolution":{"observed_at":"2026-08-15T21:33:41.340099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.313553Z","title":"A neural collaborative filtering model with interaction-based neighborhood","venue":null,"work_id":"8725b506-f808-4284-9754-2c1f8751b3c3","year":2017},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:39.076367Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:ec4b339cad42d893d9e35303db77487784dc30ed87f11a1419a19b4fe7ef11fb","observation_id":"01bacfc3-c9ac-4446-ba04-5d4a0d5756ec","resolution":{"observed_at":"2026-08-15T21:33:41.320590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.148986Z","title":"Neural graph collaborative filtering","venue":null,"work_id":"2548d312-48ed-48aa-8bdb-2a3c88ab7590","year":2019},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:39.310758Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:a27e21f5c4ec317524cc95a090fcfc8f91e8058dad250247a380119dc3feb65e","observation_id":"51745ba5-dc01-453f-8fb0-9780acaf7588","resolution":{"observed_at":"2026-08-15T21:33:41.276381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.083266Z","title":"Disentangledgraphcollaborativefiltering","venue":null,"work_id":"0a5c6caa-b8bb-4a71-beba-d12c4aba8a8b","year":2020},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:39.612043Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:264567b2f01528841e67e207d436136f72a7f1554ba936dae1bae9383db0edf1","observation_id":"c24a7cdf-db19-4ddd-863c-bcdea57e0a33","resolution":{"observed_at":"2026-08-15T21:33:41.089175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.064737Z","title":"Less is more: Reweighting important spectral graph features for recommendation","venue":null,"work_id":"05a5c231-80d9-4e96-9290-0d602029faf4","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:40.076087Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:8fd35732dea4459854059b24e12eb67aeede07ce9d4f52cc492b86a21eb84682","observation_id":"bc9ed154-0462-4523-b7e8-09f9a1f5c4fc","resolution":{"observed_at":"2026-08-15T21:33:41.070088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:41.045417Z","title":"Self-supervised graph learning for recommendation","venue":null,"work_id":"554cd76a-aaf6-4903-84c2-0448173467f2","year":2021},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:40.415715Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:6e823f0a6c5048a8e84506b7c36cd621bec01f25e5e393aaa242596dbc3bc565","observation_id":"fe3065fe-8fe4-4ffc-ac1c-f8394dd64258","resolution":{"observed_at":"2026-08-15T21:33:41.052935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:40.983547Z","title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","venue":null,"work_id":"b752c3a4-85f5-4098-af46-7de59e42d4f1","year":2022},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:40.454849Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:ddc9a2df1b5a1c7bc3bceaa1dc4f1a7ca2e1915e7f89b24c8be998299fd60839","observation_id":"fc3ad8b7-edad-45a6-a276-5c3aea27f918","resolution":{"observed_at":"2026-08-15T21:33:41.032322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:40.794299Z","title":"Understandingthedifficultyoftrainingdeepfeedforwardneuralnetworks","venue":null,"work_id":"879622e6-2e1b-43e2-a279-2e9db15f81b8","year":2010},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:40.461496Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:c5d5a9b121193f8d675a9830f59aa39374fae9673c9d23fd5397e9ba5c906783","observation_id":"9c208430-0d47-4b4d-955a-81a26d259f7f","resolution":{"observed_at":"2026-08-15T21:33:40.866167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:33:40.753112Z","title":null,"venue":null,"work_id":"b9c7b009-0639-4cbd-96ee-b782d162396a","year":2015},"citing_paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:33:40.519130Z"},"links":{"citing_paper":"/paper/2505.09590"},"observation_digest":"sha256:cdafb0d30a59b420d5feb70a775242e469a18486336d3fc46f06c60e85b6cd64","observation_id":"b6750988-a866-4679-a190-960b7a06144a","resolution":{"observed_at":"2026-08-15T21:33:40.757900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09590","last_updated":"2025-05-14T17:39:34Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-15T21:25:35.968060Z","submitted_at":"2025-05-14T17:39:34Z","title":"Distance-aware Self-adaptive Graph Convolution for Fine-grained Hierarchical Recommendation"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":31},"total_outbound_references":38},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2505.09590."}