{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:POQLDEYFTZMW6A7HDYVWGDGWNO","short_pith_number":"pith:POQLDEYF","schema_version":"1.0","canonical_sha256":"7ba0b193059e596f03e71e2b630cd66bb4b5128ae63f27e7d95687e8dc5f36d8","source":{"kind":"arxiv","id":"1602.01421","version":3},"attestation_state":"computed","paper":{"title":"An SSD-based eigensolver for spectral analysis on billion-node graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Alexander S. Szalay, Carey E. Priebe, Da Zheng, Joshua Vogelstein, Randal Burns","submitted_at":"2016-02-03T19:23:44Z","abstract_excerpt":"Many eigensolvers such as ARPACK and Anasazi have been developed to compute eigenvalues of a large sparse matrix. These eigensolvers are limited by the capacity of RAM. They run in memory of a single machine for smaller eigenvalue problems and require the distributed memory for larger problems.\n  In contrast, we develop an SSD-based eigensolver framework called FlashEigen, which extends Anasazi eigensolvers to SSDs, to compute eigenvalues of a graph with hundreds of millions or even billions of vertices in a single machine. FlashEigen performs sparse matrix multiplication in a semi-external me"},"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":"1602.01421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-03T19:23:44Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"f5f7f652c169bdf9bd787535eddcb6dc8b38c1bf334ebdecab3ebb585483db44","abstract_canon_sha256":"baf7b503d6ec5d0605c5415289cab22eaaa43125031a791430e29f319302541a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.947457Z","signature_b64":"h4uhHmnDio9u+jN0fbDR0Z5RArdpvv+lrqd+TEGgTPU2USZVpSj+Khako1wVoa1DlA19mKkk4q7fvH8WMj59AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ba0b193059e596f03e71e2b630cd66bb4b5128ae63f27e7d95687e8dc5f36d8","last_reissued_at":"2026-05-18T01:19:56.946831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.946831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An SSD-based eigensolver for spectral analysis on billion-node graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Alexander S. Szalay, Carey E. Priebe, Da Zheng, Joshua Vogelstein, Randal Burns","submitted_at":"2016-02-03T19:23:44Z","abstract_excerpt":"Many eigensolvers such as ARPACK and Anasazi have been developed to compute eigenvalues of a large sparse matrix. These eigensolvers are limited by the capacity of RAM. They run in memory of a single machine for smaller eigenvalue problems and require the distributed memory for larger problems.\n  In contrast, we develop an SSD-based eigensolver framework called FlashEigen, which extends Anasazi eigensolvers to SSDs, to compute eigenvalues of a graph with hundreds of millions or even billions of vertices in a single machine. FlashEigen performs sparse matrix multiplication in a semi-external me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01421","kind":"arxiv","version":3},"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":"1602.01421","created_at":"2026-05-18T01:19:56.946905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01421v3","created_at":"2026-05-18T01:19:56.946905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01421","created_at":"2026-05-18T01:19:56.946905+00:00"},{"alias_kind":"pith_short_12","alias_value":"POQLDEYFTZMW","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"POQLDEYFTZMW6A7H","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"POQLDEYF","created_at":"2026-05-18T12:30:39.010887+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/POQLDEYFTZMW6A7HDYVWGDGWNO","json":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO.json","graph_json":"https://pith.science/api/pith-number/POQLDEYFTZMW6A7HDYVWGDGWNO/graph.json","events_json":"https://pith.science/api/pith-number/POQLDEYFTZMW6A7HDYVWGDGWNO/events.json","paper":"https://pith.science/paper/POQLDEYF"},"agent_actions":{"view_html":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO","download_json":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO.json","view_paper":"https://pith.science/paper/POQLDEYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01421&json=true","fetch_graph":"https://pith.science/api/pith-number/POQLDEYFTZMW6A7HDYVWGDGWNO/graph.json","fetch_events":"https://pith.science/api/pith-number/POQLDEYFTZMW6A7HDYVWGDGWNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO/action/storage_attestation","attest_author":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO/action/author_attestation","sign_citation":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO/action/citation_signature","submit_replication":"https://pith.science/pith/POQLDEYFTZMW6A7HDYVWGDGWNO/action/replication_record"}},"created_at":"2026-05-18T01:19:56.946905+00:00","updated_at":"2026-05-18T01:19:56.946905+00:00"}