{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TKB2PMQP7EPBROCS3FWIM6UHU5","short_pith_number":"pith:TKB2PMQP","schema_version":"1.0","canonical_sha256":"9a83a7b20ff91e18b852d96c867a87a7432c729d166caa8aa66261906b764ec4","source":{"kind":"arxiv","id":"2606.13056","version":1},"attestation_state":"computed","paper":{"title":"Three-term Recurrence Relation with Arbitrary Degree Step for Orthogonal Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Bo Yang","submitted_at":"2026-06-11T08:39:52Z","abstract_excerpt":"An approach to generate three-term recurrence relations with arbitrary degree step is proposed. Specifically, given any class of orthogonal polynomials $\\{Q_{p}(x)\\}_{p=0}^{\\infty}$ defined by Favard's theorem, we employ the adjacent members $Q_{p}(x)$ and $Q_{p-1}(x)$ to compute the one of high degree $Q_{p+s}(x)$ and that of low degree $Q_{p-t}(x)$, where $(s,t)\\in \\mathbb{N^{+}}$. Therefore, it is able to derive a three-term recurrence relation with respect to $Q_{p+s}(x)$, $Q_{p}(x)$ and $Q_{p-t}(x)$ by taking $Q_{p-1}(x)$ as the bridge. Moreover, as the extensions of standard recursive fo"},"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.13056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-06-11T08:39:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8cb64e216535292106472afae8572ed5b385c6eb2dfce4784d53ece80a6a6c26","abstract_canon_sha256":"3696c782964a58fc6f94f76d3e0b1ce16961bbb6258160b6bb4976306f56b2e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:38.664237Z","signature_b64":"aI2HnowEXsfMeX1aG3Ds8UMKvTP9aJ4nxDgR9YcmfvFGx+6jU0zNnDeK4/t4eWUerAhg4jUXM7N/mIlOZ5+VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a83a7b20ff91e18b852d96c867a87a7432c729d166caa8aa66261906b764ec4","last_reissued_at":"2026-06-12T01:09:38.663841Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:38.663841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-term Recurrence Relation with Arbitrary Degree Step for Orthogonal Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Bo Yang","submitted_at":"2026-06-11T08:39:52Z","abstract_excerpt":"An approach to generate three-term recurrence relations with arbitrary degree step is proposed. Specifically, given any class of orthogonal polynomials $\\{Q_{p}(x)\\}_{p=0}^{\\infty}$ defined by Favard's theorem, we employ the adjacent members $Q_{p}(x)$ and $Q_{p-1}(x)$ to compute the one of high degree $Q_{p+s}(x)$ and that of low degree $Q_{p-t}(x)$, where $(s,t)\\in \\mathbb{N^{+}}$. Therefore, it is able to derive a three-term recurrence relation with respect to $Q_{p+s}(x)$, $Q_{p}(x)$ and $Q_{p-t}(x)$ by taking $Q_{p-1}(x)$ as the bridge. Moreover, as the extensions of standard recursive fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13056","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.13056/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.13056","created_at":"2026-06-12T01:09:38.663896+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13056v1","created_at":"2026-06-12T01:09:38.663896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13056","created_at":"2026-06-12T01:09:38.663896+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKB2PMQP7EPB","created_at":"2026-06-12T01:09:38.663896+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKB2PMQP7EPBROCS","created_at":"2026-06-12T01:09:38.663896+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKB2PMQP","created_at":"2026-06-12T01:09:38.663896+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/TKB2PMQP7EPBROCS3FWIM6UHU5","json":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5.json","graph_json":"https://pith.science/api/pith-number/TKB2PMQP7EPBROCS3FWIM6UHU5/graph.json","events_json":"https://pith.science/api/pith-number/TKB2PMQP7EPBROCS3FWIM6UHU5/events.json","paper":"https://pith.science/paper/TKB2PMQP"},"agent_actions":{"view_html":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5","download_json":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5.json","view_paper":"https://pith.science/paper/TKB2PMQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13056&json=true","fetch_graph":"https://pith.science/api/pith-number/TKB2PMQP7EPBROCS3FWIM6UHU5/graph.json","fetch_events":"https://pith.science/api/pith-number/TKB2PMQP7EPBROCS3FWIM6UHU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5/action/storage_attestation","attest_author":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5/action/author_attestation","sign_citation":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5/action/citation_signature","submit_replication":"https://pith.science/pith/TKB2PMQP7EPBROCS3FWIM6UHU5/action/replication_record"}},"created_at":"2026-06-12T01:09:38.663896+00:00","updated_at":"2026-06-12T01:09:38.663896+00:00"}