{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LITLQFC7CRNLH2XVCBAOM23W37","short_pith_number":"pith:LITLQFC7","schema_version":"1.0","canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","source":{"kind":"arxiv","id":"2606.01175","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Recurrence Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Artem Parfenov, Michael Vyalyi","submitted_at":"2026-05-31T11:29:59Z","abstract_excerpt":"In this paper, we study the complexity of the recurrence evaluation problem. We are interested in finitely valued recurrent functions. We present two results in this direction. First, we study the recurrence problem for sequences, assuming that a recurrence relation is defined by a fixed function, while the offsets are part of the input. Depending on the form of presentation (whether the offsets are given in unary or in binary), the problem is PSPACE-complete or EXP-complete.\n  Second, we study recurrences defined by the NAND function. They are related to impartial games. We prove PP-hardness "},"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.01175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T11:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"192371f22cdb60adc478c92e73224a5cf79cd8e2ac84cef3552ca852b3f84316","abstract_canon_sha256":"2cb169c93bf666e66e2eba9875d24d2abb6e49db222b06e54b142519d5470745"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:25.824977Z","signature_b64":"if4fXwu2jk5gam3nnvsbTfI0pwx2M9c7QbQnEHWt9blKdW64fRC7emdoHHwI5l2L2V7IPCo2BwWx5AjBGtLdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","last_reissued_at":"2026-06-02T02:04:25.824563Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:25.824563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Recurrence Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Artem Parfenov, Michael Vyalyi","submitted_at":"2026-05-31T11:29:59Z","abstract_excerpt":"In this paper, we study the complexity of the recurrence evaluation problem. We are interested in finitely valued recurrent functions. We present two results in this direction. First, we study the recurrence problem for sequences, assuming that a recurrence relation is defined by a fixed function, while the offsets are part of the input. Depending on the form of presentation (whether the offsets are given in unary or in binary), the problem is PSPACE-complete or EXP-complete.\n  Second, we study recurrences defined by the NAND function. They are related to impartial games. We prove PP-hardness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01175","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.01175/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.01175","created_at":"2026-06-02T02:04:25.824621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01175v1","created_at":"2026-06-02T02:04:25.824621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01175","created_at":"2026-06-02T02:04:25.824621+00:00"},{"alias_kind":"pith_short_12","alias_value":"LITLQFC7CRNL","created_at":"2026-06-02T02:04:25.824621+00:00"},{"alias_kind":"pith_short_16","alias_value":"LITLQFC7CRNLH2XV","created_at":"2026-06-02T02:04:25.824621+00:00"},{"alias_kind":"pith_short_8","alias_value":"LITLQFC7","created_at":"2026-06-02T02:04:25.824621+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/LITLQFC7CRNLH2XVCBAOM23W37","json":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37.json","graph_json":"https://pith.science/api/pith-number/LITLQFC7CRNLH2XVCBAOM23W37/graph.json","events_json":"https://pith.science/api/pith-number/LITLQFC7CRNLH2XVCBAOM23W37/events.json","paper":"https://pith.science/paper/LITLQFC7"},"agent_actions":{"view_html":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37","download_json":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37.json","view_paper":"https://pith.science/paper/LITLQFC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01175&json=true","fetch_graph":"https://pith.science/api/pith-number/LITLQFC7CRNLH2XVCBAOM23W37/graph.json","fetch_events":"https://pith.science/api/pith-number/LITLQFC7CRNLH2XVCBAOM23W37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/action/storage_attestation","attest_author":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/action/author_attestation","sign_citation":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/action/citation_signature","submit_replication":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/action/replication_record"}},"created_at":"2026-06-02T02:04:25.824621+00:00","updated_at":"2026-06-02T02:04:25.824621+00:00"}