{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LITLQFC7CRNLH2XVCBAOM23W37","short_pith_number":"pith:LITLQFC7","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"},"canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","source":{"kind":"arxiv","id":"2606.01175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01175","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01175v1","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01175","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"LITLQFC7CRNL","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"LITLQFC7CRNLH2XV","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"LITLQFC7","created_at":"2026-06-02T02:04:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LITLQFC7CRNLH2XVCBAOM23W37","target":"record","payload":{"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"},"canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","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"},"source_kind":"arxiv","source_id":"2606.01175","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oXP1Nhj60voeVFDhL4KpT3nJxhys3KZWV0gHivkifnUahpv+mhOnFSAAT8Tu0YK7fyVD5E5su9Sss/vtbgEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:00:57.326983Z"},"content_sha256":"92c7da1f81e95160f636d704bb9c19d812d19a85ec6a580fcef1fb6174a625df","schema_version":"1.0","event_id":"sha256:92c7da1f81e95160f636d704bb9c19d812d19a85ec6a580fcef1fb6174a625df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LITLQFC7CRNLH2XVCBAOM23W37","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1ed6CtbuivhCg7vapboPYNPhBRpJhrZRia73aSrfu9RWHY++I6ymX8cdYsuJeGT6X4pIbdhUsXrVzW7dxuvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:00:57.327361Z"},"content_sha256":"3785048ad577ae734637e16fb42a45ebfe782a4e5af71bfe35051a2168311efb","schema_version":"1.0","event_id":"sha256:3785048ad577ae734637e16fb42a45ebfe782a4e5af71bfe35051a2168311efb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/bundle.json","state_url":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LITLQFC7CRNLH2XVCBAOM23W37/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T12:00:57Z","links":{"resolver":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37","bundle":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/bundle.json","state":"https://pith.science/pith/LITLQFC7CRNLH2XVCBAOM23W37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LITLQFC7CRNLH2XVCBAOM23W37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LITLQFC7CRNLH2XVCBAOM23W37","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2cb169c93bf666e66e2eba9875d24d2abb6e49db222b06e54b142519d5470745","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T11:29:59Z","title_canon_sha256":"192371f22cdb60adc478c92e73224a5cf79cd8e2ac84cef3552ca852b3f84316"},"schema_version":"1.0","source":{"id":"2606.01175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01175","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01175v1","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01175","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"LITLQFC7CRNL","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"LITLQFC7CRNLH2XV","created_at":"2026-06-02T02:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"LITLQFC7","created_at":"2026-06-02T02:04:25Z"}],"graph_snapshots":[{"event_id":"sha256:3785048ad577ae734637e16fb42a45ebfe782a4e5af71bfe35051a2168311efb","target":"graph","created_at":"2026-06-02T02:04:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Artem Parfenov, Michael Vyalyi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T11:29:59Z","title":"On the Complexity of Recurrence Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01175","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92c7da1f81e95160f636d704bb9c19d812d19a85ec6a580fcef1fb6174a625df","target":"record","created_at":"2026-06-02T02:04:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2cb169c93bf666e66e2eba9875d24d2abb6e49db222b06e54b142519d5470745","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T11:29:59Z","title_canon_sha256":"192371f22cdb60adc478c92e73224a5cf79cd8e2ac84cef3552ca852b3f84316"},"schema_version":"1.0","source":{"id":"2606.01175","kind":"arxiv","version":1}},"canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a26b8145f145ab3eaf51040e66b76dfc265c3c6229f99b96098328b9a83edbf","first_computed_at":"2026-06-02T02:04:25.824563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:25.824563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"if4fXwu2jk5gam3nnvsbTfI0pwx2M9c7QbQnEHWt9blKdW64fRC7emdoHHwI5l2L2V7IPCo2BwWx5AjBGtLdDA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:25.824977Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c7da1f81e95160f636d704bb9c19d812d19a85ec6a580fcef1fb6174a625df","sha256:3785048ad577ae734637e16fb42a45ebfe782a4e5af71bfe35051a2168311efb"],"state_sha256":"8a7418367ec5c9f8a4f9d36dd5f17a05b22d345656f2e206555bb5e93b53020d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1Mc2DgWX4tXN952q7C6FNOlJVu/DcHxPdj8q/KXGl1KbEVJJ/jETl1owIHiJLNfGjrCHM+/CVvxF5VVo9HMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:00:57.329200Z","bundle_sha256":"0c5436abd75d29de433a4001583cb638c9cc5b5e41509dea0df125131b61507d"}}