{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G3TXGJSX3N7YLBSMGNBFGXWWZ7","short_pith_number":"pith:G3TXGJSX","schema_version":"1.0","canonical_sha256":"36e7732657db7f85864c3342535ed6cff818373e42c34cf0d87c72bc769f0c13","source":{"kind":"arxiv","id":"2509.10188","version":1},"attestation_state":"computed","paper":{"title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Etienne Grandjean, Louis Jachiet","submitted_at":"2025-09-12T12:28:23Z","abstract_excerpt":"In this paper, we study the class $\\mathtt{cstPP}$ of operations $\\mathtt{op}: \\mathbb{N}^k\\to\\mathbb{N}$, of any fixed arity $k\\ge 1$, satisfying the following property: for each fixed integer $d\\ge 1$, there exists an algorithm for a RAM machine which, for any input integer $N\\ge 2$, - pre-computes some tables in $O(N)$ time, - then reads $k$ operands $x_1,\\ldots,x_k<N^d$ and computes $\\mathtt{op}(x_1,\\dots,x_k)$ in constant time.\n  We show that the $\\mathtt{cstPP}$ class is robust and extensive and satisfies several closure properties. It is invariant depending on whether the set of primiti"},"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":"2509.10188","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-12T12:28:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c7bcc7a2aab4909c5d8f6c92f6a4a720966737dd98717d9185c0617bd691fe18","abstract_canon_sha256":"8ac8e540b6fd0bb2467019320d16fc403a5064e86f91044d2cc12085caf87729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:04.536918Z","signature_b64":"f1NlycGkKYYPjdLleRtow+nhdx5eV7tYn7fYsqdb3gdKvhU/1mIvBuVxLYZtBUx/NBaFEr3n5LUnqlncZ6VWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36e7732657db7f85864c3342535ed6cff818373e42c34cf0d87c72bc769f0c13","last_reissued_at":"2026-07-05T12:11:04.536200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:04.536200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Etienne Grandjean, Louis Jachiet","submitted_at":"2025-09-12T12:28:23Z","abstract_excerpt":"In this paper, we study the class $\\mathtt{cstPP}$ of operations $\\mathtt{op}: \\mathbb{N}^k\\to\\mathbb{N}$, of any fixed arity $k\\ge 1$, satisfying the following property: for each fixed integer $d\\ge 1$, there exists an algorithm for a RAM machine which, for any input integer $N\\ge 2$, - pre-computes some tables in $O(N)$ time, - then reads $k$ operands $x_1,\\ldots,x_k<N^d$ and computes $\\mathtt{op}(x_1,\\dots,x_k)$ in constant time.\n  We show that the $\\mathtt{cstPP}$ class is robust and extensive and satisfies several closure properties. It is invariant depending on whether the set of primiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10188","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/2509.10188/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":"2509.10188","created_at":"2026-07-05T12:11:04.536292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10188v1","created_at":"2026-07-05T12:11:04.536292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10188","created_at":"2026-07-05T12:11:04.536292+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3TXGJSX3N7Y","created_at":"2026-07-05T12:11:04.536292+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3TXGJSX3N7YLBSM","created_at":"2026-07-05T12:11:04.536292+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3TXGJSX","created_at":"2026-07-05T12:11:04.536292+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/G3TXGJSX3N7YLBSMGNBFGXWWZ7","json":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7.json","graph_json":"https://pith.science/api/pith-number/G3TXGJSX3N7YLBSMGNBFGXWWZ7/graph.json","events_json":"https://pith.science/api/pith-number/G3TXGJSX3N7YLBSMGNBFGXWWZ7/events.json","paper":"https://pith.science/paper/G3TXGJSX"},"agent_actions":{"view_html":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7","download_json":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7.json","view_paper":"https://pith.science/paper/G3TXGJSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10188&json=true","fetch_graph":"https://pith.science/api/pith-number/G3TXGJSX3N7YLBSMGNBFGXWWZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/G3TXGJSX3N7YLBSMGNBFGXWWZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7/action/storage_attestation","attest_author":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7/action/author_attestation","sign_citation":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7/action/citation_signature","submit_replication":"https://pith.science/pith/G3TXGJSX3N7YLBSMGNBFGXWWZ7/action/replication_record"}},"created_at":"2026-07-05T12:11:04.536292+00:00","updated_at":"2026-07-05T12:11:04.536292+00:00"}