{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:L6WHMQPN5H5W6ZNBM6KJRNUNLW","short_pith_number":"pith:L6WHMQPN","schema_version":"1.0","canonical_sha256":"5fac7641ede9fb6f65a1679498b68d5d88ca8bb09619ad7c2abdcffe4b45556c","source":{"kind":"arxiv","id":"1204.6086","version":2},"attestation_state":"computed","paper":{"title":"Keeler's theorem and products of distinct transpositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Lihua Huang, Ron Evans, Tuan Nguyen","submitted_at":"2012-04-26T23:51:47Z","abstract_excerpt":"An episode of Futurama features a two-body mind-switching machine which will not work more than once on the same pair of bodies. After the Futurama community engages in a mind-switching spree, the question is asked, \"Can the switching be undone so as to restore all minds to their original bodies?\" Ken Keeler found an algorithm that undoes any mind-scrambling permutation with the aid of two \"outsiders.\" We refine Keeler's result by providing a more efficient algorithm that uses the smallest possible number of switches. We also present best possible algorithms for undoing two natural sequences o"},"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":"1204.6086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-04-26T23:51:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"adad17c7f973be03d98bf24dbc3cc086b0901edfa468efbd5d85f8c666db853a","abstract_canon_sha256":"ee0fada18a93cf7c067d18869d7f565f97c7e394c54b8f282294e170276adbdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:46.729585Z","signature_b64":"OunBGKldXEhjc3CQ6IjZo/8PUD1j2GTc1W2wBJX5y1yidk6OVsOahaHQAvNLWAOfN9G5BcxVftOoPZJxO9+VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fac7641ede9fb6f65a1679498b68d5d88ca8bb09619ad7c2abdcffe4b45556c","last_reissued_at":"2026-05-18T02:58:46.728789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:46.728789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Keeler's theorem and products of distinct transpositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Lihua Huang, Ron Evans, Tuan Nguyen","submitted_at":"2012-04-26T23:51:47Z","abstract_excerpt":"An episode of Futurama features a two-body mind-switching machine which will not work more than once on the same pair of bodies. After the Futurama community engages in a mind-switching spree, the question is asked, \"Can the switching be undone so as to restore all minds to their original bodies?\" Ken Keeler found an algorithm that undoes any mind-scrambling permutation with the aid of two \"outsiders.\" We refine Keeler's result by providing a more efficient algorithm that uses the smallest possible number of switches. We also present best possible algorithms for undoing two natural sequences o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6086","kind":"arxiv","version":2},"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":"1204.6086","created_at":"2026-05-18T02:58:46.728932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6086v2","created_at":"2026-05-18T02:58:46.728932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6086","created_at":"2026-05-18T02:58:46.728932+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6WHMQPN5H5W","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6WHMQPN5H5W6ZNB","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6WHMQPN","created_at":"2026-05-18T12:27:14.488303+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/L6WHMQPN5H5W6ZNBM6KJRNUNLW","json":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW.json","graph_json":"https://pith.science/api/pith-number/L6WHMQPN5H5W6ZNBM6KJRNUNLW/graph.json","events_json":"https://pith.science/api/pith-number/L6WHMQPN5H5W6ZNBM6KJRNUNLW/events.json","paper":"https://pith.science/paper/L6WHMQPN"},"agent_actions":{"view_html":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW","download_json":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW.json","view_paper":"https://pith.science/paper/L6WHMQPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6086&json=true","fetch_graph":"https://pith.science/api/pith-number/L6WHMQPN5H5W6ZNBM6KJRNUNLW/graph.json","fetch_events":"https://pith.science/api/pith-number/L6WHMQPN5H5W6ZNBM6KJRNUNLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW/action/storage_attestation","attest_author":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW/action/author_attestation","sign_citation":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW/action/citation_signature","submit_replication":"https://pith.science/pith/L6WHMQPN5H5W6ZNBM6KJRNUNLW/action/replication_record"}},"created_at":"2026-05-18T02:58:46.728932+00:00","updated_at":"2026-05-18T02:58:46.728932+00:00"}