{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:AHWJIC26YVHAOORCSMHEFMLQ2T","short_pith_number":"pith:AHWJIC26","schema_version":"1.0","canonical_sha256":"01ec940b5ec54e073a22930e42b170d4d03624f89af4d03b5114503943df4db0","source":{"kind":"arxiv","id":"cs/0508133","version":4},"attestation_state":"computed","paper":{"title":"Decompositions of graphs of functions and efficient iterations of lookup tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Boaz Tsaban","submitted_at":"2005-08-31T17:56:40Z","abstract_excerpt":"We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f^m(x) is small, independently of m and x. The implementation only increases the storage space by a small_constant_ factor."},"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":"cs/0508133","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2005-08-31T17:56:40Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"ef5b690df6b203cdacc308bfe6653531e28af0754a5ecf4a1c1456b596dee017","abstract_canon_sha256":"7c1f2b069d017dd2566790c63ce600627fca3b2a4d057fe3124b161da5acb182"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:23.238738Z","signature_b64":"u+VagfYYlh63xEbuTGbq41yLEnn//PWo+GBbu5gmDEJNnItkzP83M4kxnuGE0ZIZ1O5f7XDIFExx1b2v3EWtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ec940b5ec54e073a22930e42b170d4d03624f89af4d03b5114503943df4db0","last_reissued_at":"2026-05-18T04:37:23.238284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:23.238284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decompositions of graphs of functions and efficient iterations of lookup tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Boaz Tsaban","submitted_at":"2005-08-31T17:56:40Z","abstract_excerpt":"We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f^m(x) is small, independently of m and x. The implementation only increases the storage space by a small_constant_ factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508133","kind":"arxiv","version":4},"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":"cs/0508133","created_at":"2026-05-18T04:37:23.238352+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508133v4","created_at":"2026-05-18T04:37:23.238352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508133","created_at":"2026-05-18T04:37:23.238352+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHWJIC26YVHA","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHWJIC26YVHAOORC","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHWJIC26","created_at":"2026-05-18T12:25:53.335082+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/AHWJIC26YVHAOORCSMHEFMLQ2T","json":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T.json","graph_json":"https://pith.science/api/pith-number/AHWJIC26YVHAOORCSMHEFMLQ2T/graph.json","events_json":"https://pith.science/api/pith-number/AHWJIC26YVHAOORCSMHEFMLQ2T/events.json","paper":"https://pith.science/paper/AHWJIC26"},"agent_actions":{"view_html":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T","download_json":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T.json","view_paper":"https://pith.science/paper/AHWJIC26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508133&json=true","fetch_graph":"https://pith.science/api/pith-number/AHWJIC26YVHAOORCSMHEFMLQ2T/graph.json","fetch_events":"https://pith.science/api/pith-number/AHWJIC26YVHAOORCSMHEFMLQ2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T/action/storage_attestation","attest_author":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T/action/author_attestation","sign_citation":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T/action/citation_signature","submit_replication":"https://pith.science/pith/AHWJIC26YVHAOORCSMHEFMLQ2T/action/replication_record"}},"created_at":"2026-05-18T04:37:23.238352+00:00","updated_at":"2026-05-18T04:37:23.238352+00:00"}