{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:COGPM7B2NLWIM3SVNT5SZM5GU7","short_pith_number":"pith:COGPM7B2","schema_version":"1.0","canonical_sha256":"138cf67c3a6aec866e556cfb2cb3a6a7dfbbcec158e3016760b86755f9f21ab8","source":{"kind":"arxiv","id":"1911.10373","version":3},"attestation_state":"computed","paper":{"title":"GRASPEL: Graph Spectral Learning at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yongyu Wang, Zhiqiang Zhao, Zhuo Feng","submitted_at":"2019-11-23T14:51:13Z","abstract_excerpt":"Learning meaningful graphs from data plays important roles in many data mining and machine learning tasks, such as data representation and analysis, dimension reduction, data clustering, and visualization, etc. In this work, for the first time, we present a highly-scalable spectral approach (GRASPEL) for learning large graphs from data. By limiting the precision matrix to be a graph Laplacian, our approach aims to estimate ultra-sparse (tree-like) weighted undirected graphs and shows a clear connection with the prior graphical Lasso method. By interleaving the latest high-performance nearly-li"},"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":"1911.10373","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-23T14:51:13Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"0462ac4958b137e136dd8a149175d931d9aae3ab79a508e058e343a5d7b8cbce","abstract_canon_sha256":"5e2608c9485cb8140cbd300900fe588ae3f6f3d4d2ed422edbad9872f4bfddd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:10.019207Z","signature_b64":"Ii8VvTTozjM6ZSVTHltMpVbwWhBDegmfatr/Rgum9PZ16tnnKKIsG3AQBkcnuBTGXEPWJyXt5mkPj5tB0Vo9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"138cf67c3a6aec866e556cfb2cb3a6a7dfbbcec158e3016760b86755f9f21ab8","last_reissued_at":"2026-07-05T01:23:10.018718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:10.018718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRASPEL: Graph Spectral Learning at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yongyu Wang, Zhiqiang Zhao, Zhuo Feng","submitted_at":"2019-11-23T14:51:13Z","abstract_excerpt":"Learning meaningful graphs from data plays important roles in many data mining and machine learning tasks, such as data representation and analysis, dimension reduction, data clustering, and visualization, etc. In this work, for the first time, we present a highly-scalable spectral approach (GRASPEL) for learning large graphs from data. By limiting the precision matrix to be a graph Laplacian, our approach aims to estimate ultra-sparse (tree-like) weighted undirected graphs and shows a clear connection with the prior graphical Lasso method. By interleaving the latest high-performance nearly-li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.10373","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.10373/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":"1911.10373","created_at":"2026-07-05T01:23:10.018790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.10373v3","created_at":"2026-07-05T01:23:10.018790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10373","created_at":"2026-07-05T01:23:10.018790+00:00"},{"alias_kind":"pith_short_12","alias_value":"COGPM7B2NLWI","created_at":"2026-07-05T01:23:10.018790+00:00"},{"alias_kind":"pith_short_16","alias_value":"COGPM7B2NLWIM3SV","created_at":"2026-07-05T01:23:10.018790+00:00"},{"alias_kind":"pith_short_8","alias_value":"COGPM7B2","created_at":"2026-07-05T01:23:10.018790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.19387","citing_title":"Scale-Aware Learning of Chaotic Dynamics on Unstructured Meshes via Binned Spectral Losses","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7","json":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7.json","graph_json":"https://pith.science/api/pith-number/COGPM7B2NLWIM3SVNT5SZM5GU7/graph.json","events_json":"https://pith.science/api/pith-number/COGPM7B2NLWIM3SVNT5SZM5GU7/events.json","paper":"https://pith.science/paper/COGPM7B2"},"agent_actions":{"view_html":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7","download_json":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7.json","view_paper":"https://pith.science/paper/COGPM7B2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.10373&json=true","fetch_graph":"https://pith.science/api/pith-number/COGPM7B2NLWIM3SVNT5SZM5GU7/graph.json","fetch_events":"https://pith.science/api/pith-number/COGPM7B2NLWIM3SVNT5SZM5GU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7/action/storage_attestation","attest_author":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7/action/author_attestation","sign_citation":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7/action/citation_signature","submit_replication":"https://pith.science/pith/COGPM7B2NLWIM3SVNT5SZM5GU7/action/replication_record"}},"created_at":"2026-07-05T01:23:10.018790+00:00","updated_at":"2026-07-05T01:23:10.018790+00:00"}