{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5MGXJX6YFHCRV3BEDHF3QXYVPZ","short_pith_number":"pith:5MGXJX6Y","schema_version":"1.0","canonical_sha256":"eb0d74dfd829c51aec2419cbb85f157e6c6d628fc3d8f64ca2fcf846fa74e0a0","source":{"kind":"arxiv","id":"1804.06802","version":2},"attestation_state":"computed","paper":{"title":"Entropic Spectral Learning for Large-Scale Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Binxin Ru, Diego Granziol, Michael Osborne, Stefan Zohren, Stephen Roberts, Xiaowen Dong","submitted_at":"2018-04-18T16:23:10Z","abstract_excerpt":"Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. We show that the underlying moment information is lost when using kernel smoothing. We further propose a spectral density approximation based on the method of Maximum Entropy, for which we develop a new algorithm. This method matches moments exactly and is everywhere positive. We"},"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":"1804.06802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-18T16:23:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a249b8b4be3bf85036bdc7732071e57aed85d07c956862f4ad2166757adc7180","abstract_canon_sha256":"b8884da7e060625aed7a12112c5e85deeec89ef3875799333f20637f8f62e3f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:28.197992Z","signature_b64":"4yYfldij+Jq0EwnHFz7m37i7lGsu9yt1oTkmzZgzNYLom71QwtgKck3n0IVVzEXYTpRluNNuZl9fEHMxdsN4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0d74dfd829c51aec2419cbb85f157e6c6d628fc3d8f64ca2fcf846fa74e0a0","last_reissued_at":"2026-05-17T23:50:28.197176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:28.197176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropic Spectral Learning for Large-Scale Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Binxin Ru, Diego Granziol, Michael Osborne, Stefan Zohren, Stephen Roberts, Xiaowen Dong","submitted_at":"2018-04-18T16:23:10Z","abstract_excerpt":"Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. We show that the underlying moment information is lost when using kernel smoothing. We further propose a spectral density approximation based on the method of Maximum Entropy, for which we develop a new algorithm. This method matches moments exactly and is everywhere positive. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06802","kind":"arxiv","version":2},"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":"1804.06802","created_at":"2026-05-17T23:50:28.197291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06802v2","created_at":"2026-05-17T23:50:28.197291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06802","created_at":"2026-05-17T23:50:28.197291+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MGXJX6YFHCR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MGXJX6YFHCRV3BE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MGXJX6Y","created_at":"2026-05-18T12:32:08.215937+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/5MGXJX6YFHCRV3BEDHF3QXYVPZ","json":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ.json","graph_json":"https://pith.science/api/pith-number/5MGXJX6YFHCRV3BEDHF3QXYVPZ/graph.json","events_json":"https://pith.science/api/pith-number/5MGXJX6YFHCRV3BEDHF3QXYVPZ/events.json","paper":"https://pith.science/paper/5MGXJX6Y"},"agent_actions":{"view_html":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ","download_json":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ.json","view_paper":"https://pith.science/paper/5MGXJX6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06802&json=true","fetch_graph":"https://pith.science/api/pith-number/5MGXJX6YFHCRV3BEDHF3QXYVPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5MGXJX6YFHCRV3BEDHF3QXYVPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ/action/storage_attestation","attest_author":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ/action/author_attestation","sign_citation":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ/action/citation_signature","submit_replication":"https://pith.science/pith/5MGXJX6YFHCRV3BEDHF3QXYVPZ/action/replication_record"}},"created_at":"2026-05-17T23:50:28.197291+00:00","updated_at":"2026-05-17T23:50:28.197291+00:00"}