{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X2NDNFT2DE2ABXNN53S65XBDH6","short_pith_number":"pith:X2NDNFT2","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"},"canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","source":{"kind":"arxiv","id":"1502.03496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03496","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03496v1","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03496","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"X2NDNFT2DE2A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X2NDNFT2DE2ABXNN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X2NDNFT2","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X2NDNFT2DE2ABXNN53S65XBDH6","target":"record","payload":{"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"},"canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","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"},"source_kind":"arxiv","source_id":"1502.03496","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgwboXrqq25qzlQz++fawAVhASaB5JKRZz9RIaIK6R/Sl6K5hp5vheRjxXvRDjz0YSsojIxYNuARXymtmkkqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:39.064374Z"},"content_sha256":"781d12cc1af568ffbc858d8b5835c76585134acd70491148bfcc098292f82913","schema_version":"1.0","event_id":"sha256:781d12cc1af568ffbc858d8b5835c76585134acd70491148bfcc098292f82913"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X2NDNFT2DE2ABXNN53S65XBDH6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QPdL/tHmWITqcsSv/A12Q4SVoIHuwkaRP0LRO7PRpRQClhRjn5Z8YK2MbC4y9hTpmFuo+f2VcPY3oUpjgt/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:39.065058Z"},"content_sha256":"bf3bc555141013ed21c64c456cbcfb7aa9ba9abe202cf3649f0b8f444bfa104d","schema_version":"1.0","event_id":"sha256:bf3bc555141013ed21c64c456cbcfb7aa9ba9abe202cf3649f0b8f444bfa104d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/bundle.json","state_url":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2NDNFT2DE2ABXNN53S65XBDH6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T22:17:39Z","links":{"resolver":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6","bundle":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/bundle.json","state":"https://pith.science/pith/X2NDNFT2DE2ABXNN53S65XBDH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2NDNFT2DE2ABXNN53S65XBDH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X2NDNFT2DE2ABXNN53S65XBDH6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"341ad0a7f7d0ca5091f6e8f5ec633d8d8cd123a5a21f03bd1038b2dfefd46f6b","cross_cats_sorted":["cs.DM","cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-12T00:25:32Z","title_canon_sha256":"1f9d22b2541e3fe4a4352ae558a50565b4165a0efac45fffea27e0888df5db5d"},"schema_version":"1.0","source":{"id":"1502.03496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03496","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03496v1","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03496","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"X2NDNFT2DE2A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X2NDNFT2DE2ABXNN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X2NDNFT2","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:bf3bc555141013ed21c64c456cbcfb7aa9ba9abe202cf3649f0b8f444bfa104d","target":"graph","created_at":"2026-05-18T02:27:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Dehua Cheng, Richard Peng, Shang-Hua Teng, Yan Liu, Yu Cheng","cross_cats":["cs.DM","cs.LG","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-12T00:25:32Z","title":"Spectral Sparsification of Random-Walk Matrix Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03496","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:781d12cc1af568ffbc858d8b5835c76585134acd70491148bfcc098292f82913","target":"record","created_at":"2026-05-18T02:27:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"341ad0a7f7d0ca5091f6e8f5ec633d8d8cd123a5a21f03bd1038b2dfefd46f6b","cross_cats_sorted":["cs.DM","cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-12T00:25:32Z","title_canon_sha256":"1f9d22b2541e3fe4a4352ae558a50565b4165a0efac45fffea27e0888df5db5d"},"schema_version":"1.0","source":{"id":"1502.03496","kind":"arxiv","version":1}},"canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be9a36967a193400ddadeee5eedc233fbccabecc6919069ae47c204279a747bf","first_computed_at":"2026-05-18T02:27:17.763561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:17.763561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4tdP88nfKuuynaJlvpioBrEQGFNehPLmSfnAXrK38kHd0qY3Yg50KsAomOx8W7vfjZQhg1LVvttVQzP4k2PlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:17.764293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:781d12cc1af568ffbc858d8b5835c76585134acd70491148bfcc098292f82913","sha256:bf3bc555141013ed21c64c456cbcfb7aa9ba9abe202cf3649f0b8f444bfa104d"],"state_sha256":"83f81672d9223fe9bfab594e6b0fedc87c9d0559ec468c8a4132bbbd0c4caace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4prelKSt85vrhrL8QeRbiI4AKWnK7sFttEqTfVGamHEQdxiVDZ1ygk5xLOY2DU8ZXVP42BH6XdEzmHTkVCJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:17:39.068644Z","bundle_sha256":"23c16ed046c0e5e89e120eebb1cf69526d1cb347efc6de5f24da97fa93702003"}}