{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KYD2TGV354IUJDJHMUVI5PENQV","short_pith_number":"pith:KYD2TGV3","schema_version":"1.0","canonical_sha256":"5607a99abbef11448d27652a8ebc8d85490b92928f9d3f4d1855674f91312a85","source":{"kind":"arxiv","id":"1305.0353","version":1},"attestation_state":"computed","paper":{"title":"Spectral computations for birth and death chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Guan-Yu Chen, Laurent Saloff-Coste","submitted_at":"2013-05-02T07:10:24Z","abstract_excerpt":"We consider the spectrum of birth and death chains on a $n$-path. An iterative scheme is proposed to compute any eigenvalue with exponential convergence rate independent of $n$. This allows one to determine the whole spectrum in order $n^2$ elementary operations. Using the same idea, we also provide a lower bound on the spectral gap, which is of the correct order on some classes of examples."},"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":"1305.0353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-05-02T07:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"c6acb00d7989efbb4957f89c38f5e0ec42ead6973ebf7f458052285b90271497","abstract_canon_sha256":"3c8a5d0f48590d0510750d92d36a562c89cdb582aff932fedec09bd758f3147f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.489550Z","signature_b64":"HoXU/0i2HginPbWpBY1/4VC1DL77sgTRAE8ahzhhdU3Fb2ab6I5vOXEo7IATHkHwczu1YEih0inHSZAOoZuJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5607a99abbef11448d27652a8ebc8d85490b92928f9d3f4d1855674f91312a85","last_reissued_at":"2026-05-18T03:26:40.489021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.489021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral computations for birth and death chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Guan-Yu Chen, Laurent Saloff-Coste","submitted_at":"2013-05-02T07:10:24Z","abstract_excerpt":"We consider the spectrum of birth and death chains on a $n$-path. An iterative scheme is proposed to compute any eigenvalue with exponential convergence rate independent of $n$. This allows one to determine the whole spectrum in order $n^2$ elementary operations. Using the same idea, we also provide a lower bound on the spectral gap, which is of the correct order on some classes of examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0353","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":"1305.0353","created_at":"2026-05-18T03:26:40.489123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0353v1","created_at":"2026-05-18T03:26:40.489123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0353","created_at":"2026-05-18T03:26:40.489123+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYD2TGV354IU","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYD2TGV354IUJDJH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYD2TGV3","created_at":"2026-05-18T12:27:51.066281+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/KYD2TGV354IUJDJHMUVI5PENQV","json":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV.json","graph_json":"https://pith.science/api/pith-number/KYD2TGV354IUJDJHMUVI5PENQV/graph.json","events_json":"https://pith.science/api/pith-number/KYD2TGV354IUJDJHMUVI5PENQV/events.json","paper":"https://pith.science/paper/KYD2TGV3"},"agent_actions":{"view_html":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV","download_json":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV.json","view_paper":"https://pith.science/paper/KYD2TGV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0353&json=true","fetch_graph":"https://pith.science/api/pith-number/KYD2TGV354IUJDJHMUVI5PENQV/graph.json","fetch_events":"https://pith.science/api/pith-number/KYD2TGV354IUJDJHMUVI5PENQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV/action/storage_attestation","attest_author":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV/action/author_attestation","sign_citation":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV/action/citation_signature","submit_replication":"https://pith.science/pith/KYD2TGV354IUJDJHMUVI5PENQV/action/replication_record"}},"created_at":"2026-05-18T03:26:40.489123+00:00","updated_at":"2026-05-18T03:26:40.489123+00:00"}