{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TUTV2BZYINCB4FEV4BN7VM6SRY","short_pith_number":"pith:TUTV2BZY","schema_version":"1.0","canonical_sha256":"9d275d073843441e1495e05bfab3d28e0bd18107d7f41a3c0e556b033bf533a9","source":{"kind":"arxiv","id":"1503.08192","version":1},"attestation_state":"computed","paper":{"title":"Distributed Estimation of Graph Spectrum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Choon Yik Tang, Mu Yang","submitted_at":"2015-03-27T19:30:26Z","abstract_excerpt":"In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special cases. In the first stage, the algorithm uses a discrete-time linear iteration and the Cayley-Hamilton theorem to convert the problem into one of solving a set of linear equations, where each equation is known to a node. In the second stage, if the nodes happen to know that $W$ is cyclic, the algorithm uses a Lyapunov approach to asymptotically solve the equation"},"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":"1503.08192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-27T19:30:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2f9d58cda8160c6ad8f4b8eb2b80299a64b922ebf4a72303bc0425f2e503d88d","abstract_canon_sha256":"ebb826c209c2c873f6bead7fa537d6636ddce407a49e01dc1575fcc7a738f244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:11.386779Z","signature_b64":"lhWJ1EnIYH+1wnSngTbh86DrZtHm+fO/7JyEuGTWsz5p9FjnVNSlcr8G4XbkatRXECfrneTALTsjmLp4Jn/qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d275d073843441e1495e05bfab3d28e0bd18107d7f41a3c0e556b033bf533a9","last_reissued_at":"2026-05-18T02:20:11.386105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:11.386105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Estimation of Graph Spectrum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Choon Yik Tang, Mu Yang","submitted_at":"2015-03-27T19:30:26Z","abstract_excerpt":"In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special cases. In the first stage, the algorithm uses a discrete-time linear iteration and the Cayley-Hamilton theorem to convert the problem into one of solving a set of linear equations, where each equation is known to a node. In the second stage, if the nodes happen to know that $W$ is cyclic, the algorithm uses a Lyapunov approach to asymptotically solve the equation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08192","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":"1503.08192","created_at":"2026-05-18T02:20:11.386207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08192v1","created_at":"2026-05-18T02:20:11.386207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08192","created_at":"2026-05-18T02:20:11.386207+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUTV2BZYINCB","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUTV2BZYINCB4FEV","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUTV2BZY","created_at":"2026-05-18T12:29:42.218222+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/TUTV2BZYINCB4FEV4BN7VM6SRY","json":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY.json","graph_json":"https://pith.science/api/pith-number/TUTV2BZYINCB4FEV4BN7VM6SRY/graph.json","events_json":"https://pith.science/api/pith-number/TUTV2BZYINCB4FEV4BN7VM6SRY/events.json","paper":"https://pith.science/paper/TUTV2BZY"},"agent_actions":{"view_html":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY","download_json":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY.json","view_paper":"https://pith.science/paper/TUTV2BZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08192&json=true","fetch_graph":"https://pith.science/api/pith-number/TUTV2BZYINCB4FEV4BN7VM6SRY/graph.json","fetch_events":"https://pith.science/api/pith-number/TUTV2BZYINCB4FEV4BN7VM6SRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY/action/storage_attestation","attest_author":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY/action/author_attestation","sign_citation":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY/action/citation_signature","submit_replication":"https://pith.science/pith/TUTV2BZYINCB4FEV4BN7VM6SRY/action/replication_record"}},"created_at":"2026-05-18T02:20:11.386207+00:00","updated_at":"2026-05-18T02:20:11.386207+00:00"}