{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBC7BCBMGHQGBN36MPMAU66RG4","short_pith_number":"pith:CBC7BCBM","schema_version":"1.0","canonical_sha256":"1045f0882c31e060b77e63d80a7bd13731bc90dd9443c869f9d978e06c2bb41d","source":{"kind":"arxiv","id":"2606.28188","version":1},"attestation_state":"computed","paper":{"title":"An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joy Qiping Yang, Pan Peng, Yichun Yang, Yuyang Wang","submitted_at":"2026-06-26T15:33:54Z","abstract_excerpt":"We study lower bounds for estimating the spectral density of the normalized adjacency matrix of a graph. Previously, Cohen-Steiner et al. [KDD 2018] proposed an algorithm for $\\varepsilon$-approximate spectral density estimation in the Wasserstein-1 distance, using $2^{O(1/\\varepsilon)}$ random walks initiated from uniformly random nodes in the graph. Later, Jin et al. [COLT 2023] established a nearly matching exponential lower bound for \\emph{weighted} graphs, assuming the algorithm has access to samples from random walks started at random nodes. It was left open whether this lower bound coul"},"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":"2606.28188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-26T15:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"d89b637db2636314187e3e2e761be7dbb67fed63607be5591e5f35f51b805307","abstract_canon_sha256":"0cf5d0b0abd041a0189dd48386d7c62a8960638afac0fd1f15bcb8dd0a8dfd66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:08.738700Z","signature_b64":"YhRLUy32CupU9F/ps0rz52ESWt4ruwM8pn4/9ssMK8DIgBFB9TT0+o4qupRLIU7Evn6nbVHaoS52Rnu0zhtXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1045f0882c31e060b77e63d80a7bd13731bc90dd9443c869f9d978e06c2bb41d","last_reissued_at":"2026-06-29T01:15:08.738283Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:08.738283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joy Qiping Yang, Pan Peng, Yichun Yang, Yuyang Wang","submitted_at":"2026-06-26T15:33:54Z","abstract_excerpt":"We study lower bounds for estimating the spectral density of the normalized adjacency matrix of a graph. Previously, Cohen-Steiner et al. [KDD 2018] proposed an algorithm for $\\varepsilon$-approximate spectral density estimation in the Wasserstein-1 distance, using $2^{O(1/\\varepsilon)}$ random walks initiated from uniformly random nodes in the graph. Later, Jin et al. [COLT 2023] established a nearly matching exponential lower bound for \\emph{weighted} graphs, assuming the algorithm has access to samples from random walks started at random nodes. It was left open whether this lower bound coul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28188/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":"2606.28188","created_at":"2026-06-29T01:15:08.738350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28188v1","created_at":"2026-06-29T01:15:08.738350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28188","created_at":"2026-06-29T01:15:08.738350+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBC7BCBMGHQG","created_at":"2026-06-29T01:15:08.738350+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBC7BCBMGHQGBN36","created_at":"2026-06-29T01:15:08.738350+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBC7BCBM","created_at":"2026-06-29T01:15:08.738350+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/CBC7BCBMGHQGBN36MPMAU66RG4","json":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4.json","graph_json":"https://pith.science/api/pith-number/CBC7BCBMGHQGBN36MPMAU66RG4/graph.json","events_json":"https://pith.science/api/pith-number/CBC7BCBMGHQGBN36MPMAU66RG4/events.json","paper":"https://pith.science/paper/CBC7BCBM"},"agent_actions":{"view_html":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4","download_json":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4.json","view_paper":"https://pith.science/paper/CBC7BCBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28188&json=true","fetch_graph":"https://pith.science/api/pith-number/CBC7BCBMGHQGBN36MPMAU66RG4/graph.json","fetch_events":"https://pith.science/api/pith-number/CBC7BCBMGHQGBN36MPMAU66RG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4/action/storage_attestation","attest_author":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4/action/author_attestation","sign_citation":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4/action/citation_signature","submit_replication":"https://pith.science/pith/CBC7BCBMGHQGBN36MPMAU66RG4/action/replication_record"}},"created_at":"2026-06-29T01:15:08.738350+00:00","updated_at":"2026-06-29T01:15:08.738350+00:00"}