{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NVDFMZAS4WDT54K572C24US2HN","short_pith_number":"pith:NVDFMZAS","schema_version":"1.0","canonical_sha256":"6d46566412e5873ef15dfe85ae525a3b527560f84addf41b0bde7093495cbf33","source":{"kind":"arxiv","id":"2505.00089","version":1},"attestation_state":"computed","paper":{"title":"Approximation theory for Green's functions via the Lanczos algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Curt von Keyserlingk, Gabriele Pinna, Oliver Lunt","submitted_at":"2025-04-30T18:00:43Z","abstract_excerpt":"It is known that Green's functions can be expressed as continued fractions; the content at the $n$-th level of the fraction is encoded in a coefficient $b_n$, which can be recursively obtained using the Lanczos algorithm. We present a theory concerning errors in approximating Green's functions using continued fractions when only the first $N$ coefficients are known exactly. Our focus lies on the stitching approximation (also known as the recursion method), wherein truncated continued fractions are completed with a sequence of coefficients for which exact solutions are available. We assume a no"},"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":"2505.00089","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T18:00:43Z","cross_cats_sorted":["cond-mat.stat-mech","math-ph","math.MP"],"title_canon_sha256":"b19a1e2ba46b1905c253d443840a9f4a88ee8320ead7e6744f9462b3f75d660c","abstract_canon_sha256":"eda3e84f67d1afd6901607ab1de99f845266bbbdc783477a31c6c0a614b0108b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:10.781776Z","signature_b64":"3UfeghwvDLF3EuwPxchIxtZCWGRJZerunFMVT3zNwgtNPmvk7hocS0baLi3KlW3yXgfiQ1be434Fntei9sahDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d46566412e5873ef15dfe85ae525a3b527560f84addf41b0bde7093495cbf33","last_reissued_at":"2026-06-19T16:11:10.781374Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:10.781374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation theory for Green's functions via the Lanczos algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Curt von Keyserlingk, Gabriele Pinna, Oliver Lunt","submitted_at":"2025-04-30T18:00:43Z","abstract_excerpt":"It is known that Green's functions can be expressed as continued fractions; the content at the $n$-th level of the fraction is encoded in a coefficient $b_n$, which can be recursively obtained using the Lanczos algorithm. We present a theory concerning errors in approximating Green's functions using continued fractions when only the first $N$ coefficients are known exactly. Our focus lies on the stitching approximation (also known as the recursion method), wherein truncated continued fractions are completed with a sequence of coefficients for which exact solutions are available. We assume a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00089","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/2505.00089/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":"2505.00089","created_at":"2026-06-19T16:11:10.781435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.00089v1","created_at":"2026-06-19T16:11:10.781435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00089","created_at":"2026-06-19T16:11:10.781435+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVDFMZAS4WDT","created_at":"2026-06-19T16:11:10.781435+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVDFMZAS4WDT54K5","created_at":"2026-06-19T16:11:10.781435+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVDFMZAS","created_at":"2026-06-19T16:11:10.781435+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/NVDFMZAS4WDT54K572C24US2HN","json":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN.json","graph_json":"https://pith.science/api/pith-number/NVDFMZAS4WDT54K572C24US2HN/graph.json","events_json":"https://pith.science/api/pith-number/NVDFMZAS4WDT54K572C24US2HN/events.json","paper":"https://pith.science/paper/NVDFMZAS"},"agent_actions":{"view_html":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN","download_json":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN.json","view_paper":"https://pith.science/paper/NVDFMZAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.00089&json=true","fetch_graph":"https://pith.science/api/pith-number/NVDFMZAS4WDT54K572C24US2HN/graph.json","fetch_events":"https://pith.science/api/pith-number/NVDFMZAS4WDT54K572C24US2HN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN/action/storage_attestation","attest_author":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN/action/author_attestation","sign_citation":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN/action/citation_signature","submit_replication":"https://pith.science/pith/NVDFMZAS4WDT54K572C24US2HN/action/replication_record"}},"created_at":"2026-06-19T16:11:10.781435+00:00","updated_at":"2026-06-19T16:11:10.781435+00:00"}