{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TPRX67NQGYQ7BVTDIDDYNYSXJI","short_pith_number":"pith:TPRX67NQ","canonical_record":{"source":{"id":"1310.6009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:47:12Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"4b0ba1ba616ce0fd089a242a7a949f44052e10383d2eca42e97507a9d031ade0","abstract_canon_sha256":"df64937f24a8a4d7969d59d5893a1a37b9c121b1d1ac65c48c67decfa7045701"},"schema_version":"1.0"},"canonical_sha256":"9be37f7db03621f0d66340c786e2574a3f91ec6f2e28e9af6d7fb4506e7305ce","source":{"kind":"arxiv","id":"1310.6009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6009","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6009v1","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6009","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"TPRX67NQGYQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TPRX67NQGYQ7BVTD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TPRX67NQ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TPRX67NQGYQ7BVTDIDDYNYSXJI","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:47:12Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"4b0ba1ba616ce0fd089a242a7a949f44052e10383d2eca42e97507a9d031ade0","abstract_canon_sha256":"df64937f24a8a4d7969d59d5893a1a37b9c121b1d1ac65c48c67decfa7045701"},"schema_version":"1.0"},"canonical_sha256":"9be37f7db03621f0d66340c786e2574a3f91ec6f2e28e9af6d7fb4506e7305ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:23.457775Z","signature_b64":"T3mLen/qs6TnVWXjBGaa+sZh4HWj7HCBrCj7wz+9fT/Rn4U/BvbuRBaUjga+kA2XScNnz5LVquSO8a7bfhKpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be37f7db03621f0d66340c786e2574a3f91ec6f2e28e9af6d7fb4506e7305ce","last_reissued_at":"2026-05-18T03:09:23.457008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:23.457008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6009","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-05-18T03:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14gblt3A/TjqwD+dy5QdnCCin2RRv64nhhrvlgF3DQTIqWvlu8SMpFBVyLugv4Cmpepb/d4NK9nkvquzZrr4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:41:04.913731Z"},"content_sha256":"e34f5ca54b7a706d3b9c20ea278b96b1b65177838f0cf64fbb5c5c2f39b33091","schema_version":"1.0","event_id":"sha256:e34f5ca54b7a706d3b9c20ea278b96b1b65177838f0cf64fbb5c5c2f39b33091"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TPRX67NQGYQ7BVTDIDDYNYSXJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing in matrix groups without memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"cs.CC","authors_text":"Ben Fairbairn, Maximilien Gadouleau, Peter J. Cameron","submitted_at":"2013-10-22T18:47:12Z","abstract_excerpt":"Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we view registers as elements of a finite field and we compute linear permutations without memory. We first determine the maximum complexity of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6009","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":""},"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-05-18T03:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwoj6x9GPMPq8ILD+hXAps6sAVs32wIHCKcJ9FBbFECAHlUVFD7mvvj3cxE7Q/4jlcM7Lqz54+RQhnl4PU4/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:41:04.914078Z"},"content_sha256":"db51176ed7374dd996d8fbe8fd28bde670be29582046c5fa2effead1bcdd5534","schema_version":"1.0","event_id":"sha256:db51176ed7374dd996d8fbe8fd28bde670be29582046c5fa2effead1bcdd5534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/bundle.json","state_url":"https://pith.science/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/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-04T19:41:04Z","links":{"resolver":"https://pith.science/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI","bundle":"https://pith.science/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/bundle.json","state":"https://pith.science/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPRX67NQGYQ7BVTDIDDYNYSXJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TPRX67NQGYQ7BVTDIDDYNYSXJI","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":"df64937f24a8a4d7969d59d5893a1a37b9c121b1d1ac65c48c67decfa7045701","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:47:12Z","title_canon_sha256":"4b0ba1ba616ce0fd089a242a7a949f44052e10383d2eca42e97507a9d031ade0"},"schema_version":"1.0","source":{"id":"1310.6009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6009","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6009v1","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6009","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"TPRX67NQGYQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TPRX67NQGYQ7BVTD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TPRX67NQ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:db51176ed7374dd996d8fbe8fd28bde670be29582046c5fa2effead1bcdd5534","target":"graph","created_at":"2026-05-18T03:09:23Z","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"},"paper":{"abstract_excerpt":"Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we view registers as elements of a finite field and we compute linear permutations without memory. We first determine the maximum complexity of a ","authors_text":"Ben Fairbairn, Maximilien Gadouleau, Peter J. Cameron","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:47:12Z","title":"Computing in matrix groups without memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6009","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:e34f5ca54b7a706d3b9c20ea278b96b1b65177838f0cf64fbb5c5c2f39b33091","target":"record","created_at":"2026-05-18T03:09:23Z","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":"df64937f24a8a4d7969d59d5893a1a37b9c121b1d1ac65c48c67decfa7045701","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:47:12Z","title_canon_sha256":"4b0ba1ba616ce0fd089a242a7a949f44052e10383d2eca42e97507a9d031ade0"},"schema_version":"1.0","source":{"id":"1310.6009","kind":"arxiv","version":1}},"canonical_sha256":"9be37f7db03621f0d66340c786e2574a3f91ec6f2e28e9af6d7fb4506e7305ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9be37f7db03621f0d66340c786e2574a3f91ec6f2e28e9af6d7fb4506e7305ce","first_computed_at":"2026-05-18T03:09:23.457008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:23.457008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3mLen/qs6TnVWXjBGaa+sZh4HWj7HCBrCj7wz+9fT/Rn4U/BvbuRBaUjga+kA2XScNnz5LVquSO8a7bfhKpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:23.457775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e34f5ca54b7a706d3b9c20ea278b96b1b65177838f0cf64fbb5c5c2f39b33091","sha256:db51176ed7374dd996d8fbe8fd28bde670be29582046c5fa2effead1bcdd5534"],"state_sha256":"193f26dc647f4a87623710f98b5dbdd833ae684f713eb30f73066204057c5467"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9XRHSDJ6bqfsstIOlaAamH79R/BZ+3cQ7yMn3cnxzjOC7+qRjh3VyZRlMtM+bbmnpthTyq/QAJ/w4shBsceAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:41:04.916006Z","bundle_sha256":"33a05a5e6d50ae9f3f6e07a8f4de00303badfb4295ea9a900e6a22618f22c0f3"}}