{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y3SQLQVY4PV6NRQQA5GAL57CQM","short_pith_number":"pith:Y3SQLQVY","schema_version":"1.0","canonical_sha256":"c6e505c2b8e3ebe6c610074c05f7e2832794ac4080315444bb1b919caf80f764","source":{"kind":"arxiv","id":"1601.00861","version":1},"attestation_state":"computed","paper":{"title":"Efficient cyclic reduction for QBDs with rank structured blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dario A. Bini, Leonardo Robol, Stefano Massei","submitted_at":"2016-01-05T15:26:04Z","abstract_excerpt":"We provide effective algorithms for solving block tridiagonal block Toeplitz systems with $m\\times m$ quasiseparable blocks, as well as quadratic matrix equations with $m\\times m$ quasiseparable coefficients, based on cyclic reduction and on the technology of rank-structured matrices. The algorithms rely on the exponential decay of the singular values of the off-diagonal submatrices generated by cyclic reduction. We provide a formal proof of this decay in the Markovian framework. The results of the numerical experiments that we report confirm a significant speed up over the general algorithms,"},"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":"1601.00861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-05T15:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"c049558076ceaaa041bd3e34764bddf9760b21dad279058b7060e251b8009b00","abstract_canon_sha256":"325b16acaac3373cde3917f89bf119c5bfe8d454a6f6250d2f56f0c7fba4bbb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:21.439521Z","signature_b64":"+FbtJBza9Wv807mXrIpgfTgBERgW/Qe6k7s5KBgeCkoNRd/EHo5x3cQ3Y0dblZtLw67xXEJrkY9kZA+890nuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e505c2b8e3ebe6c610074c05f7e2832794ac4080315444bb1b919caf80f764","last_reissued_at":"2026-05-18T01:23:21.438838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:21.438838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient cyclic reduction for QBDs with rank structured blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dario A. Bini, Leonardo Robol, Stefano Massei","submitted_at":"2016-01-05T15:26:04Z","abstract_excerpt":"We provide effective algorithms for solving block tridiagonal block Toeplitz systems with $m\\times m$ quasiseparable blocks, as well as quadratic matrix equations with $m\\times m$ quasiseparable coefficients, based on cyclic reduction and on the technology of rank-structured matrices. The algorithms rely on the exponential decay of the singular values of the off-diagonal submatrices generated by cyclic reduction. We provide a formal proof of this decay in the Markovian framework. The results of the numerical experiments that we report confirm a significant speed up over the general algorithms,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00861","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":"1601.00861","created_at":"2026-05-18T01:23:21.438939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00861v1","created_at":"2026-05-18T01:23:21.438939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00861","created_at":"2026-05-18T01:23:21.438939+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3SQLQVY4PV6","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3SQLQVY4PV6NRQQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3SQLQVY","created_at":"2026-05-18T12:30:51.357362+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/Y3SQLQVY4PV6NRQQA5GAL57CQM","json":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM.json","graph_json":"https://pith.science/api/pith-number/Y3SQLQVY4PV6NRQQA5GAL57CQM/graph.json","events_json":"https://pith.science/api/pith-number/Y3SQLQVY4PV6NRQQA5GAL57CQM/events.json","paper":"https://pith.science/paper/Y3SQLQVY"},"agent_actions":{"view_html":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM","download_json":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM.json","view_paper":"https://pith.science/paper/Y3SQLQVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00861&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3SQLQVY4PV6NRQQA5GAL57CQM/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3SQLQVY4PV6NRQQA5GAL57CQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM/action/storage_attestation","attest_author":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM/action/author_attestation","sign_citation":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM/action/citation_signature","submit_replication":"https://pith.science/pith/Y3SQLQVY4PV6NRQQA5GAL57CQM/action/replication_record"}},"created_at":"2026-05-18T01:23:21.438939+00:00","updated_at":"2026-05-18T01:23:21.438939+00:00"}