{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G3TXGJSX3N7YLBSMGNBFGXWWZ7","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":"8ac8e540b6fd0bb2467019320d16fc403a5064e86f91044d2cc12085caf87729","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-12T12:28:23Z","title_canon_sha256":"c7bcc7a2aab4909c5d8f6c92f6a4a720966737dd98717d9185c0617bd691fe18"},"schema_version":"1.0","source":{"id":"2509.10188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.10188","created_at":"2026-07-05T12:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"2509.10188v1","created_at":"2026-07-05T12:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10188","created_at":"2026-07-05T12:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"G3TXGJSX3N7Y","created_at":"2026-07-05T12:11:04Z"},{"alias_kind":"pith_short_16","alias_value":"G3TXGJSX3N7YLBSM","created_at":"2026-07-05T12:11:04Z"},{"alias_kind":"pith_short_8","alias_value":"G3TXGJSX","created_at":"2026-07-05T12:11:04Z"}],"graph_snapshots":[{"event_id":"sha256:c264573c20b27f05b769059e70c04b8c5a97042f3d6b1d13ab73781c0fe694fe","target":"graph","created_at":"2026-07-05T12:11:04Z","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/2509.10188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"\\'Etienne Grandjean, Louis Jachiet","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10188","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:528cf3f473a8508d30ba721a25818ebd73249d58caec15ab2e54816a9439f1a7","target":"record","created_at":"2026-07-05T12:11:04Z","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":"8ac8e540b6fd0bb2467019320d16fc403a5064e86f91044d2cc12085caf87729","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-12T12:28:23Z","title_canon_sha256":"c7bcc7a2aab4909c5d8f6c92f6a4a720966737dd98717d9185c0617bd691fe18"},"schema_version":"1.0","source":{"id":"2509.10188","kind":"arxiv","version":1}},"canonical_sha256":"36e7732657db7f85864c3342535ed6cff818373e42c34cf0d87c72bc769f0c13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36e7732657db7f85864c3342535ed6cff818373e42c34cf0d87c72bc769f0c13","first_computed_at":"2026-07-05T12:11:04.536200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:11:04.536200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f1NlycGkKYYPjdLleRtow+nhdx5eV7tYn7fYsqdb3gdKvhU/1mIvBuVxLYZtBUx/NBaFEr3n5LUnqlncZ6VWBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:11:04.536918Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.10188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:528cf3f473a8508d30ba721a25818ebd73249d58caec15ab2e54816a9439f1a7","sha256:c264573c20b27f05b769059e70c04b8c5a97042f3d6b1d13ab73781c0fe694fe"],"state_sha256":"9f6850737767fc9122b55705cdaf9a0d5dbed0debfce9411325989a974f1e466"}