{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J76UBAYONAS42B2AH5O3QYBPVS","short_pith_number":"pith:J76UBAYO","schema_version":"1.0","canonical_sha256":"4ffd40830e6825cd07403f5db8602facb410f767190f60fd4551ab6c41e70d95","source":{"kind":"arxiv","id":"2412.10789","version":1},"attestation_state":"computed","paper":{"title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Longlong Lin, Meihao Liao, Rong-Hua Li, Yichun Yang","submitted_at":"2024-12-14T10:56:02Z","abstract_excerpt":"Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clustering, and graph neural networks. Existing methods, mainly relying on power iteration or push computation frameworks, often face challenges with slow convergence rates when applied to large-scale graphs. To address this issue, we propose a novel and powerful approach that accelerates power iteration and push methods using Chebyshev polynomials. Specifically, we first present a novel Chebyshev expansion formula for "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.10789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-14T10:56:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9278b063ed76920d06cced74a65009681a2946ea4fe4c1c8282de8eb3ded9538","abstract_canon_sha256":"b9541ff7286f96a0b30fe713477bbac186b4f5bacb44b230a2da99c8674b2d4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:22.675278Z","signature_b64":"ax7Wk+PZC6DMxdk7crjNKNL2I3Q7niShJSYFbjihaywtlplvQz06P98GHpjKIXQWEmrrkVDsu4bUVg2lPWTdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ffd40830e6825cd07403f5db8602facb410f767190f60fd4551ab6c41e70d95","last_reissued_at":"2026-07-05T09:49:22.674867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:22.674867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Longlong Lin, Meihao Liao, Rong-Hua Li, Yichun Yang","submitted_at":"2024-12-14T10:56:02Z","abstract_excerpt":"Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clustering, and graph neural networks. Existing methods, mainly relying on power iteration or push computation frameworks, often face challenges with slow convergence rates when applied to large-scale graphs. To address this issue, we propose a novel and powerful approach that accelerates power iteration and push methods using Chebyshev polynomials. Specifically, we first present a novel Chebyshev expansion formula for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10789","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.10789/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.10789","created_at":"2026-07-05T09:49:22.674927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10789v1","created_at":"2026-07-05T09:49:22.674927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10789","created_at":"2026-07-05T09:49:22.674927+00:00"},{"alias_kind":"pith_short_12","alias_value":"J76UBAYONAS4","created_at":"2026-07-05T09:49:22.674927+00:00"},{"alias_kind":"pith_short_16","alias_value":"J76UBAYONAS42B2A","created_at":"2026-07-05T09:49:22.674927+00:00"},{"alias_kind":"pith_short_8","alias_value":"J76UBAYO","created_at":"2026-07-05T09:49:22.674927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS","json":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS.json","graph_json":"https://pith.science/api/pith-number/J76UBAYONAS42B2AH5O3QYBPVS/graph.json","events_json":"https://pith.science/api/pith-number/J76UBAYONAS42B2AH5O3QYBPVS/events.json","paper":"https://pith.science/paper/J76UBAYO"},"agent_actions":{"view_html":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS","download_json":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS.json","view_paper":"https://pith.science/paper/J76UBAYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10789&json=true","fetch_graph":"https://pith.science/api/pith-number/J76UBAYONAS42B2AH5O3QYBPVS/graph.json","fetch_events":"https://pith.science/api/pith-number/J76UBAYONAS42B2AH5O3QYBPVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS/action/storage_attestation","attest_author":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS/action/author_attestation","sign_citation":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS/action/citation_signature","submit_replication":"https://pith.science/pith/J76UBAYONAS42B2AH5O3QYBPVS/action/replication_record"}},"created_at":"2026-07-05T09:49:22.674927+00:00","updated_at":"2026-07-05T09:49:22.674927+00:00"}