{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X2NDNFT2DE2ABXNN53S65XBDH6","short_pith_number":"pith:X2NDNFT2","schema_version":"1.0","canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","source":{"kind":"arxiv","id":"1502.03496","version":1},"attestation_state":"computed","paper":{"title":"Spectral Sparsification of Random-Walk Matrix Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.SI","stat.ML"],"primary_cat":"cs.DS","authors_text":"Dehua Cheng, Richard Peng, Shang-Hua Teng, Yan Liu, Yu Cheng","submitted_at":"2015-02-12T00:25:32Z","abstract_excerpt":"We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial $$L_\\alpha(G)=D-\\sum_{r=1}^d\\alpha_rD(D^{-1}A)^r$$ where $A$ is the adjacency matrix of a weighted, undirected graph, $D$ is the diagonal matrix of weighted degrees, and $\\alpha=(\\alpha_1...\\alpha_d)$ are nonnegative coefficients with $\\sum_{r=1}^d\\alpha_r=1$. Recall that $D^{-1}A$ is the transition matrix of random walks on the graph. The sparsification of $L_\\alpha(G)$ appears to be algorithmically challenging as the matrix power $(D^{-1}A)^r$ is defined by "},"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":"1502.03496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-12T00:25:32Z","cross_cats_sorted":["cs.DM","cs.LG","cs.SI","stat.ML"],"title_canon_sha256":"1f9d22b2541e3fe4a4352ae558a50565b4165a0efac45fffea27e0888df5db5d","abstract_canon_sha256":"341ad0a7f7d0ca5091f6e8f5ec633d8d8cd123a5a21f03bd1038b2dfefd46f6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:17.764293Z","signature_b64":"4tdP88nfKuuynaJlvpioBrEQGFNehPLmSfnAXrK38kHd0qY3Yg50KsAomOx8W7vfjZQhg1LVvttVQzP4k2PlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","last_reissued_at":"2026-05-18T02:27:17.763561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:17.763561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Sparsification of Random-Walk Matrix Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.SI","stat.ML"],"primary_cat":"cs.DS","authors_text":"Dehua Cheng, Richard Peng, Shang-Hua Teng, Yan Liu, Yu Cheng","submitted_at":"2015-02-12T00:25:32Z","abstract_excerpt":"We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial $$L_\\alpha(G)=D-\\sum_{r=1}^d\\alpha_rD(D^{-1}A)^r$$ where $A$ is the adjacency matrix of a weighted, undirected graph, $D$ is the diagonal matrix of weighted degrees, and $\\alpha=(\\alpha_1...\\alpha_d)$ are nonnegative coefficients with $\\sum_{r=1}^d\\alpha_r=1$. Recall that $D^{-1}A$ is the transition matrix of random walks on the graph. The sparsification of $L_\\alpha(G)$ appears to be algorithmically challenging as the matrix power $(D^{-1}A)^r$ is defined by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03496","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":""},"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":"1502.03496","created_at":"2026-05-18T02:27:17.763680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03496v1","created_at":"2026-05-18T02:27:17.763680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03496","created_at":"2026-05-18T02:27:17.763680+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2NDNFT2DE2A","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2NDNFT2DE2ABXNN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2NDNFT2","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11156","citing_title":"NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6","json":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6.json","graph_json":"https://pith.science/api/pith-number/X2NDNFT2DE2ABXNN53S65XBDH6/graph.json","events_json":"https://pith.science/api/pith-number/X2NDNFT2DE2ABXNN53S65XBDH6/events.json","paper":"https://pith.science/paper/X2NDNFT2"},"agent_actions":{"view_html":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6","download_json":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6.json","view_paper":"https://pith.science/paper/X2NDNFT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03496&json=true","fetch_graph":"https://pith.science/api/pith-number/X2NDNFT2DE2ABXNN53S65XBDH6/graph.json","fetch_events":"https://pith.science/api/pith-number/X2NDNFT2DE2ABXNN53S65XBDH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/action/storage_attestation","attest_author":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/action/author_attestation","sign_citation":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/action/citation_signature","submit_replication":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/action/replication_record"}},"created_at":"2026-05-18T02:27:17.763680+00:00","updated_at":"2026-05-18T02:27:17.763680+00:00"}