{"as_of":"2026-08-14T20:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ebabcd542ed4803980205c9f61a856ef96a9be7811a2577bd362bca9252350b5","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:45:14.784364Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.10789/citation-record","integrity":"/paper/2412.10789/integrity","json":"/paper/2412.10789/citation-record.json","paper":"/paper/2412.10789"},"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-11T15:45:15.757832Z","title":"Local graph partitioning using pagerank vectors","venue":null,"work_id":"60afac43-12ec-4bf9-ba2f-7962969cd8f8","year":2006},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.484937Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:774928fe6651ebb5a6357f383361393c3d4a209c9218d46d053d14a20c652d54","observation_id":"0809fa37-310c-4389-82ec-7347dd6b43bb","resolution":{"observed_at":"2026-08-11T15:45:15.763633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.740256Z","title":"A local updating algorithm for personal- ized pagerank via chebyshev polynomials","venue":null,"work_id":"4821c126-92c2-4aa0-9d87-73ee69a10749","year":2022},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.490701Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:e1571ef0ed7a68282dbfde4daa19f509b626261e0fd5a38ab600dcf6927569bc","observation_id":"30d74a57-402d-4b55-b5a6-ed9309e13b4f","resolution":{"observed_at":"2026-08-11T15:45:15.746010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.724296Z","title":"Scaling graph neural networks with approximate pagerank","venue":null,"work_id":"ecaa8fe7-47c6-4aca-be3e-4a975e586dc4","year":2020},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.500083Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:723809ec279647d3ae4c0aaa8bf76000a125b8b2584a3fc7093415de2b42ca66","observation_id":"0c0a2dfa-eae4-4976-9819-213072b50e7c","resolution":{"observed_at":"2026-08-11T15:45:15.729396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.705103Z","title":"Is pagerank all you need for scalable graph neural networks","venue":null,"work_id":"011496bc-1918-49ef-8443-b306a86e2de3","year":2019},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.505798Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:352c3efd13eb2eac4cdbd118f0a227942139f1d6b265b506eff9a1519c885a40","observation_id":"4317eb66-257e-4f8a-a114-bd41ceba9983","resolution":{"observed_at":"2026-08-11T15:45:15.709811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.688904Z","title":"Sublinear time spectral density estimation","venue":null,"work_id":"b6df4f2b-b082-432b-9818-da18c2b1f8e3","year":2022},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.513781Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:e2697ebdf8e2872ce8e3e255bf80355d75dc2ed35b6fc7f668ba3300e68bc03a","observation_id":"114ad193-6f58-48c2-a7e8-9178037e917d","resolution":{"observed_at":"2026-08-11T15:45:15.694364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.671389Z","title":"Accel- erating personalized pagerank vector computation","venue":null,"work_id":"98ce6e70-876c-4573-b1da-aa6a697127f1","year":2023},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.519549Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:4f7518a68206ef33e57136d1c884b613a281b002e8e5034fefb157fee3c4e549","observation_id":"78db7ddf-2bd4-458d-85c5-3bd2635e0203","resolution":{"observed_at":"2026-08-11T15:45:15.677172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.653729Z","title":"The heat kernel as the pagerank of a graph","venue":null,"work_id":"48ae54c6-945b-4dff-89c9-19827eeb0623","year":2007},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.525645Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:56d039bedd0a59083dbd336dbb9e0e444e822dbb7c28f9e72878ef09b2e5d631","observation_id":"7d3cdc29-30c3-4fca-9fa9-a04388e81ca3","resolution":{"observed_at":"2026-08-11T15:45:15.659307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.636886Z","title":"Concentration inequalities and martingale inequali- ties: a survey","venue":null,"work_id":"864796e0-2132-4136-bbb7-74fc302947bc","year":2006},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.530835Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:7d884625ab4ffd3ad86e16d066dc40473a4f7ca5966dd465b4cfe19536227c92","observation_id":"8efe4139-9ea8-45d2-a2de-a7307b169c95","resolution":{"observed_at":"2026-08-11T15:45:15.642054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.619548Z","title":"Computing heat kernel pagerank and a local clustering algorithm","venue":null,"work_id":"53e1e42f-da22-4ca9-8577-be85c7b9b7b4","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.537453Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:76f622abb39a6a6807ddae1eab23dc2479bef86e7a7c817409640be18f1cb3d4","observation_id":"a595ceb9-218f-4d80-bdf6-594151c29b74","resolution":{"observed_at":"2026-08-11T15:45:15.625097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.602936Z","title":"A note on the summation of chebyshev series.Mathematics of Computation, 9(51), 1955","venue":null,"work_id":"7e10619a-a7a6-4379-8e9c-c5f18194737a","year":1955},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.543187Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:35ea1fbb808b289d889bd51ac7678be7001d54dae45ac02f1ecdfae3d1762c25","observation_id":"010dfd4c-b47f-482d-b7fe-fc4a7f076183","resolution":{"observed_at":"2026-08-11T15:45:15.608298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.585795Z","title":"Efficient processing of network proximity queries via chebyshev acceleration","venue":null,"work_id":"1230caca-d236-4ceb-a8bc-1772f28508de","year":2016},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.549337Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:738a2405027bef58f151b45f25ed59087add0b997bdc8eceaa1c18ee69888f5f","observation_id":"e3f45205-815c-49af-917a-a5e071b2a2c4","resolution":{"observed_at":"2026-08-11T15:45:15.591522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.568222Z","title":"Indexed fast network proximity querying","venue":null,"work_id":"e0e07a2f-7c16-401b-8d0b-2d76abf412bf","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.554732Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:b0ec0a841e7b00fb3e87f9d1260e0912b50c67ccec3cd59f07cf49316083b604","observation_id":"96b1eb02-7685-458f-8db5-2d73de106257","resolution":{"observed_at":"2026-08-11T15:45:15.574142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.549136Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":"64475981-3875-4ca8-a747-a54e37627753","year":2016},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.560079Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:d2a69ef48dfcf569668014d5bcee89e4495f1fb83bca4bd7f7fa53e4ec5d1e1a","observation_id":"22f26a12-e365-428b-b4fa-1f24968cb942","resolution":{"observed_at":"2026-08-11T15:45:15.555120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.532199Z","title":"Pagerank for ranking authors in co-citation networks","venue":null,"work_id":"20c66f5e-b727-4dc5-ac07-e9a34257c169","year":2009},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.565687Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:495197b599fce880a9a787140c3b059449a7bea53cfcad992d033c47aa678140","observation_id":"9a309125-7047-4abf-907f-7ec4f09e4859","resolution":{"observed_at":"2026-08-11T15:45:15.537647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-11T15:45:14.570935Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.570935Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:d1d4121da101ddd992551346b6dab985f7b199df5d16a265233bf22ad2eec52d","observation_id":"7be7de5a-074c-4e36-97fa-c89d388f6545","resolution":{"observed_at":"2026-08-11T15:45:14.570935Z","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-11T15:45:15.514608Z","title":"Diffusion improves graph learning","venue":null,"work_id":"c4beb916-d2a3-4301-9680-b3049814933b","year":2019},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.576580Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:df10772f30fab1c7b28ce7fd9156b6bc2eb5ea13c8ee3f51b900af8d6df72690","observation_id":"4b728766-b18f-4694-ba05-7b9437999a23","resolution":{"observed_at":"2026-08-11T15:45:15.519927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.498155Z","title":"Golub and Charles F","venue":null,"work_id":"559814ad-9346-4ffe-b7b4-55425d7f6e31","year":1996},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.581438Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:6d1970463367544acd84d913b866a57beb7fe3e3ee198f3b39014e094ec45932","observation_id":"bccce5d7-3530-4a88-95e5-7231d4dd4e88","resolution":{"observed_at":"2026-08-11T15:45:15.503108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.482293Z","title":"Subset node representation learning over large dynamic graphs","venue":null,"work_id":"b91fef6a-ceab-4a4c-91ba-fbc3d5641a12","year":2021},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.586082Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:3def7055246db14e230ea17078f4cc512814ea5aa204624d10c6d6443198e2c1","observation_id":"55654e41-5fee-4f3a-8967-a579e88f8588","resolution":{"observed_at":"2026-08-11T15:45:15.487130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.463447Z","title":"Convolutional neural networks on graphs with chebyshev approximation, revisited","venue":null,"work_id":"cbd64c8c-5516-4e76-b8e3-3545338ead46","year":2022},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.590914Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:53dd1d81388908187155d2d139015459abc8e25face65ee9db1e4cb0d5e3a7bc","observation_id":"3ac4543c-15d7-4f8d-a757-60e47bbf32df","resolution":{"observed_at":"2026-08-11T15:45:15.470307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.444281Z","title":"CCSS: towards conductance-based community search with size constraints","venue":null,"work_id":"3503875d-0820-45af-8ea1-967fa05385dd","year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.595673Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:2091b2ae1eb36a9685cafa25c9f349090e8482519827aa2dd12820f04cbe4f6f","observation_id":"ea6165d0-333e-4a96-95ea-dc41f262dcf0","resolution":{"observed_at":"2026-08-11T15:45:15.450294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.426954Z","title":"Heat kernel based community detection","venue":null,"work_id":"6456722f-23a5-40b4-a7bb-6cdabb1be7e3","year":2014},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.600863Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:412bdcba504f59bc5d1aa8c095ee032550f28dec1c21bb3a985797a8aec720d4","observation_id":"091fd6eb-8084-4c75-bb57-0e8c57dad469","resolution":{"observed_at":"2026-08-11T15:45:15.432293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.408450Z","title":"Efficient personalized pagerank computation: The power of variance-reduced monte carlo approaches","venue":null,"work_id":"74f4dbdf-96c9-444a-b45b-12791d2acc77","year":2023},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.606243Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:7f5be6426c839e6479a171e7d0406b2ae9d51976525d90aa497c861ce702d650","observation_id":"481660c2-d3cf-4442-a776-78498a60ce51","resolution":{"observed_at":"2026-08-11T15:45:15.414510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.388672Z","title":"Efficient person- alized pagerank computation: A spanning forests sampling based approach","venue":null,"work_id":"c479b1de-ebf4-4a6d-a06a-f5dd65be630a","year":2022},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.612964Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:26711482649ef3d7586d61d9589a1d71da71e55e07655510c20bcc3273f1960e","observation_id":"de1c329b-5a96-4c86-b6fb-dd1867162c07","resolution":{"observed_at":"2026-08-11T15:45:15.394021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.368429Z","title":"Index- free approach with theoretical guarantee for efficient random walk with restart query","venue":null,"work_id":"f3923df5-2c70-44a5-9bed-014d41171ee0","year":2020},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.618113Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:8d1fd0eab8b714ab63562ab868546b23d56118ec73891c976158c2cede237794","observation_id":"d00ee40e-5ebc-4406-8872-a4f56313f218","resolution":{"observed_at":"2026-08-11T15:45:15.374500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.343646Z","title":"Scalable and effective conductance-based graph clustering","venue":null,"work_id":"b2e09923-d1de-4f42-ac2c-51518eb58699","year":2023},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.631646Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:de0635c9a1f052b492d82cc70b943848c7cb3265de3b956c38b804fb93263be8","observation_id":"ff8252f2-34dc-4797-82a1-27a7b6bcdca7","resolution":{"observed_at":"2026-08-11T15:45:15.350055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.322417Z","title":"QTCS: efficient query-centered temporal community search","venue":null,"work_id":"2b4cb51b-69f0-4394-9a59-21aa6d388efd","year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.640470Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:ea29af9dfabf0e32619df1ea50ebdc46227ac03c6933ba0fbc9e7b9905f742c7","observation_id":"2b55ec10-37d2-487a-8143-e3847d58c1ad","resolution":{"observed_at":"2026-08-11T15:45:15.329805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.298730Z","title":"Personalized pagerank estimation and search: A bidirectional approach","venue":null,"work_id":"3b3ac5df-98b4-46c4-a66b-d61145fbd74b","year":2016},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.646658Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:94180914cb352d3b07e5b4c2a2dbf50cf819b97571016ebb39e62c4c08340984","observation_id":"2d729f80-20b3-4731-a3fd-5f29b735793b","resolution":{"observed_at":"2026-08-11T15:45:15.304914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.4658","last_updated":"2014-04-11T22:49:33Z","snapshot_observed_at":"2026-07-06T03:11:20.467613Z","submitted_at":"2013-04-17T00:49:25Z","title":"Personalized PageRank to a Target Node","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.4658","snapshot_observed_at":"2026-08-11T15:45:14.654132Z","title":"Personalized pagerank to a target node","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.654132Z"},"links":{"cited_paper":"/paper/1304.4658","citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:ce3accea7d8b041f29bdc3e49e0625a88fdb4f87c3a67a88d1d8c2b508d91247","observation_id":"3fbe39f3-7b6c-4216-9456-b49b3c33cf62","resolution":{"observed_at":"2026-08-11T15:45:14.654132Z","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-11T15:45:15.278883Z","title":"Chebyshev polynomials","venue":null,"work_id":"84bd5601-1ee0-4628-89d6-075602470247","year":2002},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.661242Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:bd201866e725f7957f858f55c3d01830eec838c5c57edcd4b913f8365df778ae","observation_id":"482fe218-ef76-4a4f-aafa-44619e99032a","resolution":{"observed_at":"2026-08-11T15:45:15.284591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.259028Z","title":"Stability of the lanczos method for matrix function approximation","venue":null,"work_id":"cd9f7fc6-ed3b-4a33-ae98-36b6d87af367","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.668086Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:738b1f53689e9880e2dfaa77e7f1cb8794167d435c90c9f3f66e7806a15e6d6d","observation_id":"3f95ab09-9ae7-43fb-ab17-c017ba438099","resolution":{"observed_at":"2026-08-11T15:45:15.265348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.236823Z","title":"Bessel functions., 2010","venue":null,"work_id":"9f09735a-7579-4d17-a03e-47c9bbc17fd8","year":2010},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.675255Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:7bc22d2d8e1e143381d060cdec68c5cbd1f383f86f88d4952a821ab3a4400cea","observation_id":"de4f2be4-c0d4-4777-b5a0-898b975a6673","resolution":{"observed_at":"2026-08-11T15:45:15.244123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.681901Z","title":"The pagerank citation ranking: Bringing order to the web","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.681901Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:e3885eb6189e96e925eaf3bf53fc8629a055f367c1c59f27e7bf38a6ca352607","observation_id":"083d43c7-d805-4f1e-9fa0-8cc283df8798","resolution":{"observed_at":"2026-08-11T15:45:14.681901Z","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-11T15:45:15.202525Z","title":"Faster algorithms via approximation theory","venue":null,"work_id":"28d401a1-53d2-434f-b82b-ed7fc4307646","year":2014},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.688492Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:0c0a53344b0cdc2f9ab7c36ed685062b089f6104999989640fdd0d0a71d52130","observation_id":"ccd07595-e7e7-4c74-a76e-cda9d5a8f4c1","resolution":{"observed_at":"2026-08-11T15:45:15.208131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.183423Z","title":"Chebyshev polyno- mial approximation for distributed signal processing","venue":null,"work_id":"b3a2a32e-9237-48c1-8c42-dc0d25d3b6e9","year":2011},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.693914Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:29008916e70519f17bd171588acf5fbad9d579e823f242815d57fe000e4115e8","observation_id":"cb813ee7-d5f9-474e-baae-9b95a602ff82","resolution":{"observed_at":"2026-08-11T15:45:15.189054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.162588Z","title":"Distributed signal processing via chebyshev polynomial approximation","venue":null,"work_id":"50dc5fcb-4c7e-4e21-9753-38f5936a2bf7","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.700124Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:28c190495225e8e2e8f4812bf8343f483d32d7a9d4e723276395c5aa692a14b0","observation_id":"5b94c4f3-0d96-4ada-a971-273331ad4f24","resolution":{"observed_at":"2026-08-11T15:45:15.169678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.138702Z","title":"Verse: Versatile graph embeddings from similarity measures","venue":null,"work_id":"87b25dd1-f9cd-4c4d-a931-cba0ea958ab0","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.705331Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:4b7ed6ffdd3dc935132dc817e5e285a4750775c65c867e0b18da6286d92c631c","observation_id":"1c6f4fc8-9ed9-4b70-9656-64276b6e3ab5","resolution":{"observed_at":"2026-08-11T15:45:15.146305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.119525Z","title":"Approximate graph propagation","venue":null,"work_id":"36668532-f070-470a-9c4a-ff38e52bd3bb","year":2021},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.712919Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:24348ffb15234880e962767758e99115dbc4b8edadfbd706a31cfaeebe6a2275","observation_id":"1586c3f5-0ef0-4f4c-99bb-da0b0952d428","resolution":{"observed_at":"2026-08-11T15:45:15.125303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.098320Z","title":"Estimating single-node pagerank in o (mindt,√𝑚) time","venue":null,"work_id":"73fe4a71-9d2b-4293-a448-3f9dae977992","year":2023},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.718792Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:3f00cbd5fe7b60c258c4cef52e88681ed0367b9a9d231757bd18e5b36a146682","observation_id":"745b2de2-eb07-4190-893a-901431b56709","resolution":{"observed_at":"2026-08-11T15:45:15.104908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.076459Z","title":"Per- sonalized pagerank to a target node, revisited","venue":null,"work_id":"5fb75e81-b4d9-4695-8f5b-fc449367c110","year":2020},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.726779Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:0c6f351f33c71478c0113d1448e07b75a0a3b08bf559398b117264899f3b8e96","observation_id":"e0d6ffe2-8541-4ff4-85a3-6c9923baedd5","resolution":{"observed_at":"2026-08-11T15:45:15.083049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07937","last_updated":"2022-05-07T14:31:30Z","snapshot_observed_at":"2026-08-13T16:22:46.776291Z","submitted_at":"2022-03-15T14:21:08Z","title":"Edge-based Local Push for Personalized PageRank","version":2},"cited_work":{"arxiv_id":"2203.07937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.07937","snapshot_observed_at":"2026-08-11T15:45:14.847559Z","title":"Edge-based Local Push for Personalized PageRank","venue":"cs.DS","work_id":"3b59a629-82e5-495b-8092-7977a64d4d25","year":2022},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.733008Z"},"links":{"cited_paper":"/paper/2203.07937","citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:adaf8be7825d4d7d9e11df0d7b3040f919e1a3b8f78d51c1e8e986990d54f948","observation_id":"d684efb3-7c0e-4243-b9ad-9748040c7f11","resolution":{"observed_at":"2026-08-11T15:45:14.855558Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.055353Z","title":"Fora: simple and effective approximate single-source personalized pagerank","venue":null,"work_id":"ad6a8eff-22cf-421b-9b63-407cd9215075","year":2017},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.739575Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:da3f03222f2f7c05e0cf4fa68fdf1520236f18898a43919f912b793b09abc7c1","observation_id":"8bc513cd-32f6-49d0-8ebb-68899c1c47aa","resolution":{"observed_at":"2026-08-11T15:45:15.061868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:15.034893Z","title":"Topppr: top-k personalized pagerank queries with precision guarantees on large graphs","venue":null,"work_id":"37c82004-0322-43ec-9868-434052bd6e17","year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.745866Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:cef4f5b34341507a255657839ec29940f88d4a27e31bcfa91f6707f6fc9e5852","observation_id":"4ab7103e-22fc-42ac-afe8-660415a79b57","resolution":{"observed_at":"2026-08-11T15:45:15.041429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01019","last_updated":"2024-01-02T04:07:29Z","snapshot_observed_at":"2026-08-13T04:50:18.396956Z","submitted_at":"2024-01-02T04:07:29Z","title":"Approximating Single-Source Personalized PageRank with Absolute Error Guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01019","snapshot_observed_at":"2026-08-11T15:45:14.751450Z","title":"Approximating single-source person- alized pagerank with absolute error guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.751450Z"},"links":{"cited_paper":"/paper/2401.01019","citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:87d3c6b6a30a15b4a93c4de4a4e335e1b405967d61912b6d80c365a00f6a2b67","observation_id":"cc5029c2-ec69-43b3-8e4d-492f3ab83d41","resolution":{"observed_at":"2026-08-11T15:45:14.751450Z","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-11T15:45:15.013152Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"f84787f6-37c8-49f0-a5d6-94349193e3a3","year":2019},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.757969Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:822335e2a3730d98386e0e3d55b1e4fda80700f9f380415d046f77c09a5ebaa4","observation_id":"97ab776b-8ed6-43e1-8f51-ce72660b1559","resolution":{"observed_at":"2026-08-11T15:45:15.020887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.990473Z","title":"Unifying the global and local approaches: an efficient power iteration with forward push","venue":null,"work_id":"2d232d67-37b4-4883-b587-29ae070fb4ac","year":2021},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.763572Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:3afb20cee31289b180a9c01d5dd23e73b68cd4ad93de2c69bf0338a18dd485b4","observation_id":"95b31041-d991-4dae-847d-01cf0145e079","resolution":{"observed_at":"2026-08-11T15:45:14.996943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.970239Z","title":"Efficient algorithms for personalized pagerank computation: A survey","venue":null,"work_id":"58b7863e-9367-4a4e-9d58-42f42539d563","year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.768865Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:eafda53749f9c1e647e701d36654b655631556c9d5baaf8b6aad736a2999a3a5","observation_id":"0970c32f-1ed1-4862-b483-6571c221238d","resolution":{"observed_at":"2026-08-11T15:45:14.976451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.950731Z","title":"Efficient estimation of heat kernel pagerank for local clustering","venue":null,"work_id":"9efc2bd3-088a-49f5-a909-9f29a14bb1d3","year":2019},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.773801Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:e2a1bbb5efffe20836cb6c44b2e2a81e65256a50a2b49b868ccf6a7a36907421","observation_id":"4fa01d54-12e0-41de-942f-e72f693c49dd","resolution":{"observed_at":"2026-08-11T15:45:14.957366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.930838Z","title":"Chebyshev meets push: Efficient and provable graph propagation computation","venue":null,"work_id":"d5e3d88e-f586-4a92-bf41-b1fcd035ee60","year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.778973Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:6aeb544962800f9bfec442d047a5763f1c755e31d64a0f5e5c0074d7f9c9c717","observation_id":"6db84859-84f9-4c4b-827e-d9c031c740c0","resolution":{"observed_at":"2026-08-11T15:45:14.937172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T15:45:14.911222Z","title":"GSD-GNN: generalizable and scalable algorithms for decoupled graph neural networks","venue":null,"work_id":"49e3baa5-5feb-4248-95b3-19071c351164","year":2024},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.784364Z"},"links":{"citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:8ca8cd4be45e90d0c4d0ffd3e418ca066d454da0bd6c0a31286061ae7d94f450","observation_id":"255f72d0-e8a1-4d1a-88aa-3b02faba334d","resolution":{"observed_at":"2026-08-11T15:45:14.917525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":49},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2412.10789."}