{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DQUF55T4WTTBBE44Y3X6HEJLSJ","short_pith_number":"pith:DQUF55T4","schema_version":"1.0","canonical_sha256":"1c285ef67cb4e610939cc6efe3912b9267626c6e765ac3b71398d340272e54c7","source":{"kind":"arxiv","id":"1209.4991","version":3},"attestation_state":"computed","paper":{"title":"Mind Switches in Futurama and Stargate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Lihua Huang, Ron Evans","submitted_at":"2012-09-22T12:39:16Z","abstract_excerpt":"Let P be a permutation expressed as a product of nontrivial disjoint cycles. When writing P as a product of distinct transpositions none equal to a factor of P, what is the smallest number of transpositions that can be used? We answer this question and give applications to mind-switching problems that have arisen in connection with the popular sci-fi television series Futurama and Stargate SG-1."},"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":"1209.4991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-09-22T12:39:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aaa7fbdb0f26f7020a4833d9f431e4d92df34644cf73b9be6dc2fc1302c5e30e","abstract_canon_sha256":"f6d89f233518a33c427e8ce5686e60f25556408f48089f72d45c82858f0a08e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:39.230490Z","signature_b64":"ivLfJmGQI/7lG0JVNXd6CxHLB4VkrUu7Nha1o1XnGuSLCO1yCtdgInZ3ITQQJLa10TLOcpBFklK2YUNV2MYBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c285ef67cb4e610939cc6efe3912b9267626c6e765ac3b71398d340272e54c7","last_reissued_at":"2026-05-18T02:32:39.229962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:39.229962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mind Switches in Futurama and Stargate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Lihua Huang, Ron Evans","submitted_at":"2012-09-22T12:39:16Z","abstract_excerpt":"Let P be a permutation expressed as a product of nontrivial disjoint cycles. When writing P as a product of distinct transpositions none equal to a factor of P, what is the smallest number of transpositions that can be used? We answer this question and give applications to mind-switching problems that have arisen in connection with the popular sci-fi television series Futurama and Stargate SG-1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4991","kind":"arxiv","version":3},"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":"1209.4991","created_at":"2026-05-18T02:32:39.230029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4991v3","created_at":"2026-05-18T02:32:39.230029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4991","created_at":"2026-05-18T02:32:39.230029+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQUF55T4WTTB","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQUF55T4WTTBBE44","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQUF55T4","created_at":"2026-05-18T12:27:04.183437+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/DQUF55T4WTTBBE44Y3X6HEJLSJ","json":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ.json","graph_json":"https://pith.science/api/pith-number/DQUF55T4WTTBBE44Y3X6HEJLSJ/graph.json","events_json":"https://pith.science/api/pith-number/DQUF55T4WTTBBE44Y3X6HEJLSJ/events.json","paper":"https://pith.science/paper/DQUF55T4"},"agent_actions":{"view_html":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ","download_json":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ.json","view_paper":"https://pith.science/paper/DQUF55T4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4991&json=true","fetch_graph":"https://pith.science/api/pith-number/DQUF55T4WTTBBE44Y3X6HEJLSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DQUF55T4WTTBBE44Y3X6HEJLSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ/action/storage_attestation","attest_author":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ/action/author_attestation","sign_citation":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ/action/citation_signature","submit_replication":"https://pith.science/pith/DQUF55T4WTTBBE44Y3X6HEJLSJ/action/replication_record"}},"created_at":"2026-05-18T02:32:39.230029+00:00","updated_at":"2026-05-18T02:32:39.230029+00:00"}