{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2RJCLP7VZX4SXDXLFQTFTKF2DU","short_pith_number":"pith:2RJCLP7V","schema_version":"1.0","canonical_sha256":"d45225bff5cdf92b8eeb2c2659a8ba1d18f5c15be37b14b511ab411cbcdd63e0","source":{"kind":"arxiv","id":"1712.01725","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Spectrum of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, David Cohen-Steiner, Gregory Valiant, Weihao Kong","submitted_at":"2017-12-05T16:02:55Z","abstract_excerpt":"The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph, including the extent to which the graph posses community structures at multiple scales. We study the problem of approximating the spectrum $\\lambda = (\\lambda_1,\\dots,\\lambda_{|V|})$, $0 \\le \\lambda_1,\\le \\dots, \\le \\lambda_{|V|}\\le 2$ of $G$ in the regime where the graph is too large to explicitly calculate the spectrum. We present a sublinear time algorithm"},"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":"1712.01725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-05T16:02:55Z","cross_cats_sorted":[],"title_canon_sha256":"e8e35e408cf85ed8a2c6f03a13af7792f72ce901547b090d576f1fe396bbd590","abstract_canon_sha256":"4ae1ca18f321450ac20e0f78823162d8cbefc859ac9afc21501e21eaed704392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:47.756634Z","signature_b64":"ovrjXNrszZnq5GgyHnd3QgsrYTu0f12UWFaYKHhzvD2JT6H9uZELRL6DB33D7IB8zko7BJ1jQTvWaW3lm/F5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45225bff5cdf92b8eeb2c2659a8ba1d18f5c15be37b14b511ab411cbcdd63e0","last_reissued_at":"2026-05-18T00:28:47.755934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:47.755934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Spectrum of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, David Cohen-Steiner, Gregory Valiant, Weihao Kong","submitted_at":"2017-12-05T16:02:55Z","abstract_excerpt":"The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph, including the extent to which the graph posses community structures at multiple scales. We study the problem of approximating the spectrum $\\lambda = (\\lambda_1,\\dots,\\lambda_{|V|})$, $0 \\le \\lambda_1,\\le \\dots, \\le \\lambda_{|V|}\\le 2$ of $G$ in the regime where the graph is too large to explicitly calculate the spectrum. We present a sublinear time algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01725","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":"1712.01725","created_at":"2026-05-18T00:28:47.756057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01725v1","created_at":"2026-05-18T00:28:47.756057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01725","created_at":"2026-05-18T00:28:47.756057+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RJCLP7VZX4S","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RJCLP7VZX4SXDXL","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RJCLP7V","created_at":"2026-05-18T12:30:55.937587+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/2RJCLP7VZX4SXDXLFQTFTKF2DU","json":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU.json","graph_json":"https://pith.science/api/pith-number/2RJCLP7VZX4SXDXLFQTFTKF2DU/graph.json","events_json":"https://pith.science/api/pith-number/2RJCLP7VZX4SXDXLFQTFTKF2DU/events.json","paper":"https://pith.science/paper/2RJCLP7V"},"agent_actions":{"view_html":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU","download_json":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU.json","view_paper":"https://pith.science/paper/2RJCLP7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01725&json=true","fetch_graph":"https://pith.science/api/pith-number/2RJCLP7VZX4SXDXLFQTFTKF2DU/graph.json","fetch_events":"https://pith.science/api/pith-number/2RJCLP7VZX4SXDXLFQTFTKF2DU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU/action/storage_attestation","attest_author":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU/action/author_attestation","sign_citation":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU/action/citation_signature","submit_replication":"https://pith.science/pith/2RJCLP7VZX4SXDXLFQTFTKF2DU/action/replication_record"}},"created_at":"2026-05-18T00:28:47.756057+00:00","updated_at":"2026-05-18T00:28:47.756057+00:00"}