{"as_of":"2026-08-10T14:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ff4b8296aecb7903516f32b042a2b77d35f5779d57f73fcb7b1fc698d1b6df6","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:48:17.953046Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:01:13.290234Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T12:01:13.879587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"cited_work":{"arxiv_id":"2507.09969","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.09969","snapshot_observed_at":"2026-08-06T12:01:13.879587Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","venue":"cs.IR","work_id":"0bf6574e-0361-4586-933e-c69c406e88a2","year":2025},"citing_paper":{"arxiv_id":"2507.22224","last_updated":"2025-07-29T20:41:51Z","snapshot_observed_at":"2026-08-06T12:01:12.813253Z","submitted_at":"2025-07-29T20:41:51Z","title":"Generative Recommendation with Semantic IDs: A Practitioner's Handbook","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T12:01:13.290234Z"},"links":{"cited_paper":"/paper/2507.09969","citing_paper":"/paper/2507.22224"},"observation_digest":"sha256:7119a9904188f58117aa758385cc9bd7e2b2259d640b77b187b56a63ed0704b6","observation_id":"eb94b6cc-2d5f-4936-9871-207b496ddd61","resolution":{"observed_at":"2026-08-06T12:01:13.886091Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.09969/citation-record","integrity":"/paper/2507.09969/integrity","json":"/paper/2507.09969/citation-record.json","paper":"/paper/2507.09969"},"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-06T17:48:30.258015Z","title":null,"venue":null,"work_id":"86370172-52f0-45af-ac21-4439fc3ddb7c","year":2018},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.618076Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:8d25678962e971e127d8bb8aa83bdacb334382a65dc187e617867e41a5294414","observation_id":"7c7986d3-01e1-460d-bf79-40684db78932","resolution":{"observed_at":"2026-08-06T17:48:30.320878Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:30.043533Z","title":null,"venue":null,"work_id":"dad39d86-c737-48ba-a799-d5ef151f3226","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.664657Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:e9e1abf54b65625854c0d949fa50bf87b5061eb46949c8823b44b69ee2ac15c1","observation_id":"12daa1e3-45cf-4249-9e8a-90f4d8e02b4b","resolution":{"observed_at":"2026-08-06T17:48:30.159024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:29.735784Z","title":null,"venue":null,"work_id":"a51d936a-a3b6-4c40-a103-93e590c0606c","year":2020},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.733494Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:32516b5124740fe5bbe15440508396ab16d874a1bc350351802103630ce155ab","observation_id":"d884e5f0-91de-4266-adec-26ed200b4825","resolution":{"observed_at":"2026-08-06T17:48:29.907240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:29.383447Z","title":null,"venue":null,"work_id":"07d4037e-b6d0-48bb-a02c-7b6550fc06a6","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.823766Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:ad50b5c1880d6ae1befbe9a43479fba2fbfe3094fbc060f83c05cc13e9965526","observation_id":"75492973-2cca-42c7-9f25-2f1e90690434","resolution":{"observed_at":"2026-08-06T17:48:29.540730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:14.856919Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.856919Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:465e3edda069a37b1886e2b51083215bd0163a6305f13e5b7a384d9b8b781631","observation_id":"834ad608-eb73-4b66-8371-9cd759bd35ac","resolution":{"observed_at":"2026-08-06T17:48:14.856919Z","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-06T17:48:28.651013Z","title":null,"venue":null,"work_id":"083e87cf-7f47-462c-96c8-3a1bec3a14b2","year":2015},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.988373Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:c4f42127abe748a31e771361881fe410d90ec3cc3aca7cf47cd66844d97345c5","observation_id":"717d5913-aad2-4670-a834-efe0b47a00e1","resolution":{"observed_at":"2026-08-06T17:48:28.785987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:28.289149Z","title":null,"venue":null,"work_id":"250b572a-2a80-4c69-b679-091ea272c028","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.038032Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:341d0afd4bf16f0737649ceaddf3770a4e0285eef86476e73a7d869b0948c0e9","observation_id":"a55f9e3b-fba8-43fc-822b-a67b5952069c","resolution":{"observed_at":"2026-08-06T17:48:28.486567Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:27.902057Z","title":null,"venue":null,"work_id":"54316a76-4403-4e7c-8e18-38043e500642","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.085765Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:92a97651557d77ee929a825e6d987b40670e3309dff0d248a064f42c625d013f","observation_id":"c8ca812b-b507-4d24-b9d8-892b144fe713","resolution":{"observed_at":"2026-08-06T17:48:28.106256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:27.658480Z","title":null,"venue":null,"work_id":"b4783f7d-72ac-4ccc-b23f-a4ef69952cb1","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.150583Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:059b03b9d2700ff0054f6a6e69f2f7c918a7b7cd020b51fd798ba31e214cf7ad","observation_id":"5d2b14e9-38c1-4d2d-95d2-61a0af23d8e5","resolution":{"observed_at":"2026-08-06T17:48:27.776696Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:27.401785Z","title":null,"venue":null,"work_id":"c6949f21-3eb9-46fa-b162-8fde4a5dd480","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.220957Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:e2316f7c09f01ce1fae7874c0e62dea6019228f3382a0dc4ac818b15ce9c436d","observation_id":"6547e538-3a4c-4939-9929-a3d8020c5708","resolution":{"observed_at":"2026-08-06T17:48:27.510038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:27.187527Z","title":null,"venue":null,"work_id":"3c89ffcd-41b3-48de-b8b9-66233fed6494","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.270509Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:0c73fa98d8346dbf1de43ee2ac5b350d410b3ac4960ad91ee488a8796da05b92","observation_id":"2ae2ef53-6437-4f67-a309-10c922ec2c85","resolution":{"observed_at":"2026-08-06T17:48:27.253135Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:26.926532Z","title":null,"venue":null,"work_id":"66a1383a-1b7c-4006-b4ee-8fa85f52de1e","year":2020},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.295066Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:7367c28f5902c755f68a3eb4f401985b200778a4bf2ebcfe3307f57ea0e47432","observation_id":"9e9af965-b02b-478f-803c-af9abaad97bb","resolution":{"observed_at":"2026-08-06T17:48:27.044975Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:26.603479Z","title":null,"venue":null,"work_id":"2b421613-bc40-44df-b8b4-c9729fb84957","year":2010},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.318850Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:68e82e09b45d172dc0635eefc70acab872011158f760a2759b5279077944bfc2","observation_id":"d2f41139-e45f-46bb-bd0e-4c598471e5f5","resolution":{"observed_at":"2026-08-06T17:48:26.796120Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:26.471709Z","title":null,"venue":null,"work_id":"afe0d451-4e54-43c4-9f56-e25682d598ab","year":2025},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.379848Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:c15e2519558600fb80cc1969818eb1305a68db337eab7beeda1df628da20c777","observation_id":"6363f616-c884-45cf-86ee-634441d6ddd7","resolution":{"observed_at":"2026-08-06T17:48:26.533821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:26.310046Z","title":null,"venue":null,"work_id":"ae2a3c73-f7de-429d-9d86-2f7f540ddc1d","year":2025},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.436207Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:f2ff345a46147c4c7e21fedc101e0dcadc3e05b7d7d09325de9fa541c075915d","observation_id":"e2887636-8c87-4857-b9bf-a9b9c90f0c3b","resolution":{"observed_at":"2026-08-06T17:48:26.365548Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:26.137827Z","title":null,"venue":null,"work_id":"5a4291e5-0681-4210-8cb8-468e30f3ac39","year":2024},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.494309Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:390cf25ecddc980175a314176185ba7ea08f7f9529de078e0cb5437da39f0f71","observation_id":"ee77ff0c-ef1a-414c-bd87-a124607d9e87","resolution":{"observed_at":"2026-08-06T17:48:26.228934Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:25.885693Z","title":null,"venue":null,"work_id":"fb247abb-7fdb-4507-8f4b-cf289270c96b","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.541879Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:82498a8333ec279a59499774b3f6629d340b14450906a3e9d31f5a10f227584b","observation_id":"edf39765-5c06-4003-932e-1fc658b7b761","resolution":{"observed_at":"2026-08-06T17:48:25.971843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:25.650346Z","title":null,"venue":null,"work_id":"47645a42-a5f0-4e2a-8c2d-2235ac4687dd","year":2009},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.586020Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:7fd7d86a70eaca54d190c34974221bf0c1c2a2e600a61dd1520292bca57399ff","observation_id":"76ddc4ea-ef3d-470e-acbe-5ec83b580da9","resolution":{"observed_at":"2026-08-06T17:48:25.732215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:25.474700Z","title":null,"venue":null,"work_id":"4254a962-7114-47fb-b066-8fdd6ef91a86","year":2021},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.642542Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:f92e76cbe16e9928d5f1d4621313db19476ffd07521116bfa524d9d99d92d83e","observation_id":"1425334e-9c81-491d-8ddb-b124d4128df4","resolution":{"observed_at":"2026-08-06T17:48:25.531492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:25.244372Z","title":null,"venue":null,"work_id":"f130ddfa-7723-411e-a2b4-40f661f71d1b","year":2021},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.709690Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:5dc549965d6669f79edd8dfbf1ed33625195ac69dd4a3da7c2c8c5ebb66099c2","observation_id":"145fe121-bece-44dc-80b3-7208619d25f0","resolution":{"observed_at":"2026-08-06T17:48:25.332567Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:24.994198Z","title":null,"venue":null,"work_id":"4b71017a-f0ad-4e7b-b5a5-b9a02641a577","year":2018},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.751578Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:09b9098930b1f39acbe19b85139aa7f083cdaf605e50da21bf15715ff5829fff","observation_id":"9a1fd8ad-fd5a-4115-984f-671bba13fffa","resolution":{"observed_at":"2026-08-06T17:48:25.112712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:24.734786Z","title":null,"venue":null,"work_id":"ddf4dfcd-fac5-41f6-8b98-1ec0495871fd","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.819509Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:6e32f8f3f1fba10f6d5f1131a400303cfd935af7d987d6c4c32bad1d86adb216","observation_id":"3e45c084-b5eb-4041-a1c5-066ac6c7e86f","resolution":{"observed_at":"2026-08-06T17:48:24.819528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:24.572567Z","title":null,"venue":null,"work_id":"92581c9b-df9d-40e8-bd6f-ea682ee72e1f","year":2008},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.857591Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:b144da1886cdbfdc37f64c9f49d71f535b894f17b25abc204158fdad4db2a7c3","observation_id":"07c1717c-f824-4e8b-9387-79a580320390","resolution":{"observed_at":"2026-08-06T17:48:24.677394Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:23.787287Z","title":null,"venue":null,"work_id":"5fd41a65-544e-4a3e-8936-404b631e67ba","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.916015Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:7fa73817ffffb4f0b5616a1641b1149547fc957a437f7b5067d1f63d709357b6","observation_id":"299a19f8-4b5a-4bf2-affd-6b3f44981567","resolution":{"observed_at":"2026-08-06T17:48:24.122891Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02261","last_updated":"2026-04-16T18:12:54Z","snapshot_observed_at":"2026-08-03T00:32:28.868742Z","submitted_at":"2025-06-02T21:09:29Z","title":"What Makes LLMs Effective Sequential Recommenders? A Study on Preference Intensity and Temporal Context","version":3},"cited_work":{"arxiv_id":"2506.02261","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.02261","snapshot_observed_at":"2026-08-06T17:48:18.088905Z","title":"What Makes LLMs Effective Sequential Recommenders? A Study on Preference Intensity and Temporal Context","venue":"cs.IR","work_id":"d6472916-30d9-48df-8ef0-4ad80b204452","year":2025},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:15.968546Z"},"links":{"cited_paper":"/paper/2506.02261","citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:f8a8955f00e10b5899f853048d65e932196b036daf0981a1ab9a868a528446df","observation_id":"f579e054-bc42-4dac-83cb-cbe8f4744f30","resolution":{"observed_at":"2026-08-06T17:48:18.152188Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:23.422618Z","title":null,"venue":null,"work_id":"e96ff0ba-e0bf-4d3a-8dcc-58ae11c75911","year":2024},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.009323Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:c4873af62d8264eb5e0862a9a3a0bfb89e717be0d0efda47e6698406885c964a","observation_id":"4f1ad461-4d49-4870-b84b-7cec60ac31a2","resolution":{"observed_at":"2026-08-06T17:48:23.567278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:23.250298Z","title":null,"venue":null,"work_id":"b36ecc86-14b6-4a3b-8166-7304b2fc522b","year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.074853Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:d9b2991bf4f5aecab890d2ce0cbc34c828e7e729eb0177e9ff4da3ffcc8252b6","observation_id":"2bff4ecf-470b-46fc-b20f-b2dfb7cfc311","resolution":{"observed_at":"2026-08-06T17:48:23.295096Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:22.852308Z","title":null,"venue":null,"work_id":"9275b078-f33b-41f5-bac8-33013d67ec7a","year":2025},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.155440Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:71baf7a3c8b99c1e443d25bd1a3cfce7dd3d911f002f63b8a4a07351069c6b55","observation_id":"0e77f02a-8750-492f-bf3d-875a437db127","resolution":{"observed_at":"2026-08-06T17:48:22.931643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:22.715989Z","title":null,"venue":null,"work_id":"9eab7197-7805-4770-918e-cdb7075dd122","year":2010},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.216482Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:f10447d06c2cd24e3231200ecc61da1b92423e620a791492a3358ca645ca3300","observation_id":"f89f044f-049b-409e-9441-35b7318a9284","resolution":{"observed_at":"2026-08-06T17:48:22.767380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:16.275519Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.275519Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:6debcdb78be0f089dbe34806718d162c2971fea6418421daf3a94c80884a252c","observation_id":"588776e1-e789-4bb9-9cc3-486dbc9b68ec","resolution":{"observed_at":"2026-08-06T17:48:16.275519Z","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-06T17:48:22.231032Z","title":null,"venue":null,"work_id":"fe7b798d-05b3-4732-a212-dbdc31e0b58a","year":1999},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.434484Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:0819419e718c05a64d91fefee7a4fffc7568bdff8d08acffe6a21150250b28d2","observation_id":"d6eb02e3-5093-414f-8d37-60302c601c1b","resolution":{"observed_at":"2026-08-06T17:48:22.322836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:22.072473Z","title":null,"venue":null,"work_id":"cc64e142-aa78-4660-9cbb-aa94d90deca4","year":2019},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.532529Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:0c4cc545afba53da5c9964941d9cc74922349c2695445ae6c44a6ff46d85f1df","observation_id":"68552a09-0f8c-4a97-9ac2-2e708def563d","resolution":{"observed_at":"2026-08-06T17:48:22.145981Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:21.850603Z","title":null,"venue":null,"work_id":"8034096e-3378-44c9-92d5-b6855b913b80","year":2018},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.568519Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:6fdd21dc09ef820885b658c72fefc3f968149f34d3b17c9b0f04ce48e2be9a15","observation_id":"e04bc81f-9809-49e4-9c31-278743b40290","resolution":{"observed_at":"2026-08-06T17:48:21.979443Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:21.707377Z","title":null,"venue":null,"work_id":"de75ad8e-b025-4c3f-bb4d-4ea9b20a7a86","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.671072Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:3f9074dec3b08c59fc640d51e09f596db609e463be5b295a15344d23c95719ac","observation_id":"66955b8d-098a-4cec-994d-04464d6a5dda","resolution":{"observed_at":"2026-08-06T17:48:21.770360Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:21.541726Z","title":null,"venue":null,"work_id":"cc0029c6-f144-4feb-9f32-3f1f2f436a58","year":2013},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.712868Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:dd1908628ab3871970c12d07f5577fd717e8f6ca9074ddfeaa999dd39474d5a8","observation_id":"5407c92a-ad74-428d-a9dc-b34692d016d5","resolution":{"observed_at":"2026-08-06T17:48:21.591226Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:21.412522Z","title":null,"venue":null,"work_id":"23689af6-ab1b-4690-933f-7386fa0945e4","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.813720Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:42ce6a3b2c05f3709b2ce0780c00e35ae317b119e623f76b921e35df5a03237f","observation_id":"18cb2b9f-93ba-45f6-b6f2-01d5bcb23155","resolution":{"observed_at":"2026-08-06T17:48:21.481621Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:21.165136Z","title":null,"venue":null,"work_id":"949b4dc6-1768-49c9-8d33-38d187d73c7f","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.886785Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:dc340c9d0a89f791141d8cae310bfc7602b1d52245fdbc7a9754ac8ea05450d4","observation_id":"8c507acd-25e0-42fe-a3bb-3753d3a729b8","resolution":{"observed_at":"2026-08-06T17:48:21.286323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:20.935243Z","title":null,"venue":null,"work_id":"c881d573-763d-4616-8587-c3ad1259194c","year":2017},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.001588Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:bc2b610c683f1097313f0498b9ae893a272ca2d36c966e65465c1440ef50fd81","observation_id":"8029da64-5e78-4136-8b46-9bdb5c2fc0e5","resolution":{"observed_at":"2026-08-06T17:48:21.041259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:20.806987Z","title":null,"venue":null,"work_id":"0a9d9ca2-0fca-421a-ac5b-2befe72e725f","year":2021},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.029936Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:0cfef8f5dc97142695480fe637f48d952b5d9880154ce8206a0e061b0c7de3fe","observation_id":"f0ba3176-0faa-45ef-a1d5-8075b3b95969","resolution":{"observed_at":"2026-08-06T17:48:20.878123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:20.560971Z","title":null,"venue":null,"work_id":"4b0ddc9b-8410-473c-aff7-e207d9c3fdfc","year":2019},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.094769Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:df6dd7b5125877d671b7e0b2f7d8b7c986dc851106f352fc8b90d448d66c960e","observation_id":"97ea63f9-5796-4c56-8ea9-36ad6c69e206","resolution":{"observed_at":"2026-08-06T17:48:20.667280Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:17.200803Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.200803Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:0e3814973d9b7014c22626a2bb78fe8392c8ea2eaf171717428f560e072c84ad","observation_id":"a1f9b0cc-d66d-4b78-9670-11b87b6bb6a6","resolution":{"observed_at":"2026-08-06T17:48:17.200803Z","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-06T17:48:19.882632Z","title":null,"venue":null,"work_id":"7481537a-f7f4-4c06-a0fe-8afa3ff620db","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.377117Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:c7aa14214892a613ffedc2523c8d99afd0173cc1c11b1c912964b2bb6f19c0e0","observation_id":"021ca854-248a-40f9-ba03-d68df16c771d","resolution":{"observed_at":"2026-08-06T17:48:20.154219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:19.544310Z","title":null,"venue":null,"work_id":"b7d10471-44e9-4a2d-9c9a-ce08352dc2f3","year":2021},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.479553Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:d6eabc1664a873ef8bed89133f5d6e91d3a5fd941d59839d30c69ada5e7303e5","observation_id":"a27856e8-fe78-4d28-826d-243062d6c796","resolution":{"observed_at":"2026-08-06T17:48:19.724006Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:19.243130Z","title":null,"venue":null,"work_id":"a11a7b07-29e4-40b7-ae40-5a2e199e8d91","year":2018},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.543530Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:194ea5904b494a7f8a945804d2a6b9f6df6a3f335539edf2c54a2ef445fe2b68","observation_id":"10fec708-ff02-4afe-83e8-df7d3860a8e2","resolution":{"observed_at":"2026-08-06T17:48:19.392415Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:18.965209Z","title":null,"venue":null,"work_id":"96a95f29-8901-490e-bfae-398e4c1a6460","year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.594210Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:465a5499388ff85e4496b540e3b79ccb1966fc4342577bafb598222684d42d20","observation_id":"e8d117c2-f6ef-4671-93b2-cdfe898216dc","resolution":{"observed_at":"2026-08-06T17:48:19.093714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:18.713317Z","title":null,"venue":null,"work_id":"5caa95f5-bcf0-47d7-8119-2a66ceefff6c","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.694428Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:f337ec0823a4e9391d5849972c89b1b62fa16b44d0972caa887e1a7f9e21495f","observation_id":"db642784-3404-49d7-a194-05a22e6bc1da","resolution":{"observed_at":"2026-08-06T17:48:18.810958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:18.497392Z","title":null,"venue":null,"work_id":"ccee9d99-29f4-461c-805d-a3a75755649b","year":2023},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.738651Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:e3c729b1b897163648eb5064c259ad305253c42dccf7b15a0f3707bf1bd2dd21","observation_id":"b56e7a23-d380-4cb2-b992-581abfe489e7","resolution":{"observed_at":"2026-08-06T17:48:18.594686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:17.912224Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.912224Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:e37988d2baaafd412dd5214b0cea6a75c4ea9b167609964aeaaa4ea6886e4d88","observation_id":"9a38b13e-b56d-4566-afbd-ff1251307d20","resolution":{"observed_at":"2026-08-06T17:48:17.912224Z","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-06T17:48:18.240198Z","title":null,"venue":null,"work_id":"26f95e07-78c7-414e-8334-e043e31f43e1","year":2021},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.953046Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:054fe9e120416ee9648effd4b8e82d0f59c1b369216c1aa25db4b8c3068c278c","observation_id":"12c7badb-e8ea-48e4-9871-4b0db714d635","resolution":{"observed_at":"2026-08-06T17:48:18.326202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:22.432462Z","title":"In The Confer- ence on Uncertainty in Artificial Intelligence","venue":null,"work_id":"1bc94d31-1934-402b-852c-b7a7adf8cccd","year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.374483Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:b02a30f5d47ec356ea47cdacb87ffe706e8a7b8a5b6a6d7637897714cd1879c8","observation_id":"2ee3c1fb-c4ee-4c17-a1b2-491ad3cc0afc","resolution":{"observed_at":"2026-08-06T17:48:22.560787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:28.996335Z","title":"InACM Web Conference","venue":null,"work_id":"5d318c14-7a45-4b6c-aa5f-820159c83d7b","year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:14.943268Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:e1771619fca5f975c623c59a6b993584af8408625adb2bdcb676566697334126","observation_id":"f2d687f8-bd5f-46e3-80f1-a8433ad18d17","resolution":{"observed_at":"2026-08-06T17:48:29.210628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:20.281774Z","title":"In ACM SIGIR Conference","venue":null,"work_id":"a8b8cc55-5033-4f68-808a-2f5c7fe8bcdd","year":null},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:17.323343Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:521c9f9941d61bf22f2562d8bb9bd2f3bc900288dbb0fa62527820050416634c","observation_id":"45c147af-f303-497b-9898-88492a9e2bdd","resolution":{"observed_at":"2026-08-06T17:48:20.332599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:48:22.974742Z","title":null,"venue":null,"work_id":"21f1d04d-52ce-41de-bc88-16a4c0f98876","year":2025},"citing_paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:16.124792Z"},"links":{"citing_paper":"/paper/2507.09969"},"observation_digest":"sha256:10cf5df70ea26df698cffaaf83875870c3223eaffd8022a067827bae8c7afbf1","observation_id":"8a5a2098-1ab0-4f28-98b5-9191a58d46a7","resolution":{"observed_at":"2026-08-06T17:48:23.148435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09969","last_updated":"2025-07-14T06:35:18Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T17:40:24.102178Z","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":53},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2507.09969."}