{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AQXDKUK2KUXQDUGQFXWIQBOJW3","short_pith_number":"pith:AQXDKUK2","schema_version":"1.0","canonical_sha256":"042e35515a552f01d0d02dec8805c9b6fdf0e8cb194e14599320245367e7dfcc","source":{"kind":"arxiv","id":"1310.6008","version":1},"attestation_state":"computed","paper":{"title":"Computing in permutation 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:45:19Z","abstract_excerpt":"Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation"},"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":"1310.6008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-22T18:45:19Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"7827ed44c9900dde67f2a6a216b5d4710fb490c549767b14ea3b4a6f0c6ddc6b","abstract_canon_sha256":"83cba4f0acbafe190b604b3078a20db391073f23c2f44a75d95c616e912f24f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:23.480823Z","signature_b64":"iWMRyobCuJH6SoUeknXiiyIqiRbfpEwQ8NxiRx0F5hh+9sh43GaOHDTzpdLoUnGI1DLpxOw6k56Z/3bfC5eAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"042e35515a552f01d0d02dec8805c9b6fdf0e8cb194e14599320245367e7dfcc","last_reissued_at":"2026-05-18T03:09:23.480171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:23.480171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing in permutation 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:45:19Z","abstract_excerpt":"Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6008","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6008","created_at":"2026-05-18T03:09:23.480260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6008v1","created_at":"2026-05-18T03:09:23.480260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6008","created_at":"2026-05-18T03:09:23.480260+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQXDKUK2KUXQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQXDKUK2KUXQDUGQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQXDKUK2","created_at":"2026-05-18T12:27:38.830355+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/AQXDKUK2KUXQDUGQFXWIQBOJW3","json":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3.json","graph_json":"https://pith.science/api/pith-number/AQXDKUK2KUXQDUGQFXWIQBOJW3/graph.json","events_json":"https://pith.science/api/pith-number/AQXDKUK2KUXQDUGQFXWIQBOJW3/events.json","paper":"https://pith.science/paper/AQXDKUK2"},"agent_actions":{"view_html":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3","download_json":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3.json","view_paper":"https://pith.science/paper/AQXDKUK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6008&json=true","fetch_graph":"https://pith.science/api/pith-number/AQXDKUK2KUXQDUGQFXWIQBOJW3/graph.json","fetch_events":"https://pith.science/api/pith-number/AQXDKUK2KUXQDUGQFXWIQBOJW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3/action/storage_attestation","attest_author":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3/action/author_attestation","sign_citation":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3/action/citation_signature","submit_replication":"https://pith.science/pith/AQXDKUK2KUXQDUGQFXWIQBOJW3/action/replication_record"}},"created_at":"2026-05-18T03:09:23.480260+00:00","updated_at":"2026-05-18T03:09:23.480260+00:00"}