{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YIGOFEPLQVMQUO4R3QH4Y7MVVV","short_pith_number":"pith:YIGOFEPL","canonical_record":{"source":{"id":"2311.18080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-29T20:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"fc8454c0ec47eca8e6807b80ff15aa18cb5ce66305cb5eb7d430989b98ee2393","abstract_canon_sha256":"a0b14f39616a13fdff6f8881660e6038eb3b42ae14bdc6fb55d4419fbd8ae9a5"},"schema_version":"1.0"},"canonical_sha256":"c20ce291eb85590a3b91dc0fcc7d95ad7560456533d15c33deba3729c799f2da","source":{"kind":"arxiv","id":"2311.18080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.18080","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"2311.18080v1","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18080","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"YIGOFEPLQVMQ","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_16","alias_value":"YIGOFEPLQVMQUO4R","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_8","alias_value":"YIGOFEPL","created_at":"2026-07-05T07:18:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YIGOFEPLQVMQUO4R3QH4Y7MVVV","target":"record","payload":{"canonical_record":{"source":{"id":"2311.18080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-29T20:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"fc8454c0ec47eca8e6807b80ff15aa18cb5ce66305cb5eb7d430989b98ee2393","abstract_canon_sha256":"a0b14f39616a13fdff6f8881660e6038eb3b42ae14bdc6fb55d4419fbd8ae9a5"},"schema_version":"1.0"},"canonical_sha256":"c20ce291eb85590a3b91dc0fcc7d95ad7560456533d15c33deba3729c799f2da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:36.645520Z","signature_b64":"ci36zP+8yyqYeWe2E1YLAdM9IKYZEKhSTy+pQh+iw+ue6fs7eKAyjCTLWu5iuiyxZmA4ZtT1h7pM7aYh5YyxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c20ce291eb85590a3b91dc0fcc7d95ad7560456533d15c33deba3729c799f2da","last_reissued_at":"2026-07-05T07:18:36.645019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:36.645019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.18080","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-07-05T07:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoAPfvJKGo2wNBhWAMQnNPo/kr6u2akHWQ5ZIMMRBxxGyQJBRxTt1oWVfqstp7vakA/vMCCybyOHtWFGD8wyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:12:59.339613Z"},"content_sha256":"652f4365d039dc4205a1edaa8aa388467100966a0a37398918c29715a958d417","schema_version":"1.0","event_id":"sha256:652f4365d039dc4205a1edaa8aa388467100966a0a37398918c29715a958d417"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YIGOFEPLQVMQUO4R3QH4Y7MVVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variations on Keeler's Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandra Bartas, Ben Vessely, Bruce Leavitt, Danny Lara","submitted_at":"2023-11-29T20:52:09Z","abstract_excerpt":"The 2010 Futurama episode The Prisoner of Benda features a mind swapping machine that swaps the minds of two people at a time with the restriction that the same pair of people cannot use the machine more than once. We show that if a machine swaps $n$ people cyclically with the condition that the same group of people cannot use the machine again, we can find a way to get everyone back. We prove our solution is optimal for when $n =3$. We also introduce an infinite variant of the mind swapping machine."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18080","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/2311.18080/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"},"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-07-05T07:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHi1B7T5xgfX1fixVmq3A5tg2FOTAiRhJoddWjxHuhxXPIPaktvCYj/pYIRuBYMJ0/T2eQsPU8EZ23YJJ3pyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:12:59.339990Z"},"content_sha256":"f150f44d9e9c0ca45ee6a62fd8f3d0d3eaf21fb9309d82c0cfd92d8ba5b96bf1","schema_version":"1.0","event_id":"sha256:f150f44d9e9c0ca45ee6a62fd8f3d0d3eaf21fb9309d82c0cfd92d8ba5b96bf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/bundle.json","state_url":"https://pith.science/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/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-07-08T19:12:59Z","links":{"resolver":"https://pith.science/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV","bundle":"https://pith.science/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/bundle.json","state":"https://pith.science/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIGOFEPLQVMQUO4R3QH4Y7MVVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YIGOFEPLQVMQUO4R3QH4Y7MVVV","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":"a0b14f39616a13fdff6f8881660e6038eb3b42ae14bdc6fb55d4419fbd8ae9a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-29T20:52:09Z","title_canon_sha256":"fc8454c0ec47eca8e6807b80ff15aa18cb5ce66305cb5eb7d430989b98ee2393"},"schema_version":"1.0","source":{"id":"2311.18080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.18080","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"2311.18080v1","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18080","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"YIGOFEPLQVMQ","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_16","alias_value":"YIGOFEPLQVMQUO4R","created_at":"2026-07-05T07:18:36Z"},{"alias_kind":"pith_short_8","alias_value":"YIGOFEPL","created_at":"2026-07-05T07:18:36Z"}],"graph_snapshots":[{"event_id":"sha256:f150f44d9e9c0ca45ee6a62fd8f3d0d3eaf21fb9309d82c0cfd92d8ba5b96bf1","target":"graph","created_at":"2026-07-05T07:18:36Z","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/2311.18080/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The 2010 Futurama episode The Prisoner of Benda features a mind swapping machine that swaps the minds of two people at a time with the restriction that the same pair of people cannot use the machine more than once. We show that if a machine swaps $n$ people cyclically with the condition that the same group of people cannot use the machine again, we can find a way to get everyone back. We prove our solution is optimal for when $n =3$. We also introduce an infinite variant of the mind swapping machine.","authors_text":"Alexandra Bartas, Ben Vessely, Bruce Leavitt, Danny Lara","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-29T20:52:09Z","title":"Variations on Keeler's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18080","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:652f4365d039dc4205a1edaa8aa388467100966a0a37398918c29715a958d417","target":"record","created_at":"2026-07-05T07:18:36Z","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":"a0b14f39616a13fdff6f8881660e6038eb3b42ae14bdc6fb55d4419fbd8ae9a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-29T20:52:09Z","title_canon_sha256":"fc8454c0ec47eca8e6807b80ff15aa18cb5ce66305cb5eb7d430989b98ee2393"},"schema_version":"1.0","source":{"id":"2311.18080","kind":"arxiv","version":1}},"canonical_sha256":"c20ce291eb85590a3b91dc0fcc7d95ad7560456533d15c33deba3729c799f2da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c20ce291eb85590a3b91dc0fcc7d95ad7560456533d15c33deba3729c799f2da","first_computed_at":"2026-07-05T07:18:36.645019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:18:36.645019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ci36zP+8yyqYeWe2E1YLAdM9IKYZEKhSTy+pQh+iw+ue6fs7eKAyjCTLWu5iuiyxZmA4ZtT1h7pM7aYh5YyxBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:18:36.645520Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.18080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:652f4365d039dc4205a1edaa8aa388467100966a0a37398918c29715a958d417","sha256:f150f44d9e9c0ca45ee6a62fd8f3d0d3eaf21fb9309d82c0cfd92d8ba5b96bf1"],"state_sha256":"38b4b3af76f3807066548b1091917f611bb50e5f7e01a3ec355bebb5f6bfd616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbKDIhBA6cFE8wq3z7fdcHd1SOWwOkUF0pWkrUc6vurZDMlMoAdVyBe2u7gEAaw59QyB2f9ieH2nxbslb8NsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:12:59.342109Z","bundle_sha256":"8091b2c61df8cc1a6135e8782ba92ddbb80b1ce7d6a827b2c69a93c84fb2b6a7"}}