{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2KWO2AXX5QRLJHIUY2OTJYUOO7","short_pith_number":"pith:2KWO2AXX","schema_version":"1.0","canonical_sha256":"d2aced02f7ec22b49d14c69d34e28e77f922b537957518cf3bfd81f6af233b95","source":{"kind":"arxiv","id":"1812.08942","version":1},"attestation_state":"computed","paper":{"title":"Nearly-Linear Time Spectral Graph Reduction for Scalable Graph Partitioning and Data Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Yongyu Wang, Zhiqiang Zhao, Zhuo Feng","submitted_at":"2018-12-21T04:38:12Z","abstract_excerpt":"This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original graph. Our framework is built upon the following two key components: a spectrum-preserving node aggregation (reduction) scheme, as well as a spectral graph sparsification framework with iterative edge weight scaling. We show that the resulting spectrally-reduced graphs can robustly preserve the first few nontrivial eigenvalues and eigenvectors of the original gra"},"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":"1812.08942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-21T04:38:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"47cf64dc068a137136f0dce5b76cca0695b316911d699398e07f69d35781b321","abstract_canon_sha256":"ade5d7acc692f48889bc4fef452c351b11f077c62f5f5a4ef62820a1cca98cd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:45.841076Z","signature_b64":"FOHWZe3QKHO0Bv6PEteZSWZ4covdFKdUtTdvxvv3nyuxFfaEp6W1ZMAcjrOCSfedamvMta7XOQ3kQF0xB9HPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2aced02f7ec22b49d14c69d34e28e77f922b537957518cf3bfd81f6af233b95","last_reissued_at":"2026-05-17T23:57:45.840493Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:45.840493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly-Linear Time Spectral Graph Reduction for Scalable Graph Partitioning and Data Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Yongyu Wang, Zhiqiang Zhao, Zhuo Feng","submitted_at":"2018-12-21T04:38:12Z","abstract_excerpt":"This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original graph. Our framework is built upon the following two key components: a spectrum-preserving node aggregation (reduction) scheme, as well as a spectral graph sparsification framework with iterative edge weight scaling. We show that the resulting spectrally-reduced graphs can robustly preserve the first few nontrivial eigenvalues and eigenvectors of the original gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08942","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":"1812.08942","created_at":"2026-05-17T23:57:45.840603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08942v1","created_at":"2026-05-17T23:57:45.840603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08942","created_at":"2026-05-17T23:57:45.840603+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KWO2AXX5QRL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KWO2AXX5QRLJHIU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KWO2AXX","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.14111","citing_title":"Expander Hierarchies for Normalized Cuts on Graphs","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7","json":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7.json","graph_json":"https://pith.science/api/pith-number/2KWO2AXX5QRLJHIUY2OTJYUOO7/graph.json","events_json":"https://pith.science/api/pith-number/2KWO2AXX5QRLJHIUY2OTJYUOO7/events.json","paper":"https://pith.science/paper/2KWO2AXX"},"agent_actions":{"view_html":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7","download_json":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7.json","view_paper":"https://pith.science/paper/2KWO2AXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08942&json=true","fetch_graph":"https://pith.science/api/pith-number/2KWO2AXX5QRLJHIUY2OTJYUOO7/graph.json","fetch_events":"https://pith.science/api/pith-number/2KWO2AXX5QRLJHIUY2OTJYUOO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7/action/storage_attestation","attest_author":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7/action/author_attestation","sign_citation":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7/action/citation_signature","submit_replication":"https://pith.science/pith/2KWO2AXX5QRLJHIUY2OTJYUOO7/action/replication_record"}},"created_at":"2026-05-17T23:57:45.840603+00:00","updated_at":"2026-05-17T23:57:45.840603+00:00"}