{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GTPMBY3GHVXVRDMOCK6ODOEUL6","short_pith_number":"pith:GTPMBY3G","canonical_record":{"source":{"id":"1611.01523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-04T20:09:24Z","cross_cats_sorted":["cs.ET","math.CO"],"title_canon_sha256":"c69aed1c07bdd47ba069155d4b4fd64efc26ece987885dcbcf7821c1726d2894","abstract_canon_sha256":"518c21bd0254f607d4fbf3a58e4e0d3ea2d2165a3a967a545f2338d35dc18370"},"schema_version":"1.0"},"canonical_sha256":"34dec0e3663d6f588d8e12bce1b8945fb22d0b3a4c512476b0a3d80b8bd416c3","source":{"kind":"arxiv","id":"1611.01523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01523","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01523v1","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01523","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"GTPMBY3GHVXV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GTPMBY3GHVXVRDMO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GTPMBY3G","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GTPMBY3GHVXVRDMOCK6ODOEUL6","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-04T20:09:24Z","cross_cats_sorted":["cs.ET","math.CO"],"title_canon_sha256":"c69aed1c07bdd47ba069155d4b4fd64efc26ece987885dcbcf7821c1726d2894","abstract_canon_sha256":"518c21bd0254f607d4fbf3a58e4e0d3ea2d2165a3a967a545f2338d35dc18370"},"schema_version":"1.0"},"canonical_sha256":"34dec0e3663d6f588d8e12bce1b8945fb22d0b3a4c512476b0a3d80b8bd416c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.108696Z","signature_b64":"KvYOcYv4Zoe0Q9H6wFu7szUlZsoCa479yucyLu7Fq2RjXcYKevFglyFlHJs/RcIyTjN4UGiIE+E9s5Li8+nDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34dec0e3663d6f588d8e12bce1b8945fb22d0b3a4c512476b0a3d80b8bd416c3","last_reissued_at":"2026-05-18T01:00:05.108123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.108123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01523","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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68/bdIaPk8e4fiCH0uHkRlH/UfLdEpSNV2gvFLzvF8zuU0OOEFKqMAg22eIs6VM3DzPadl4CV1bMSEBqHWpyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:55:50.518976Z"},"content_sha256":"a6aec8430a5206d16ecbf11b3c122fc86ed2effddaccfa2ac50f54173695aa47","schema_version":"1.0","event_id":"sha256:a6aec8430a5206d16ecbf11b3c122fc86ed2effddaccfa2ac50f54173695aa47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GTPMBY3GHVXVRDMOCK6ODOEUL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite generating sets for reversible gate sets under general conservation laws","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","math.CO"],"primary_cat":"cs.DM","authors_text":"Jarkko Kari, Tim Boykett, Ville Salo","submitted_at":"2016-11-04T20:09:24Z","abstract_excerpt":"It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of $\\{0,1\\}^n$ can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed enough. Without auxiliary bits, all even permutations can be implemented. We generalize these results to non-binary logic: For any finite set $A$, a finite gate set can generate all even permutation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01523","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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OiVZEMc84NyYF3PgvhRlpUaAGTvKBC9bfidgRmhaxw3bocVDXK5iJ8DwFt5nad4A3gKxo1PU1hkU3nCJK0RdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:55:50.519726Z"},"content_sha256":"d24ef7414b7904f409057d6f0b283535f2db1b2042f21ec9932633e5ef85bb06","schema_version":"1.0","event_id":"sha256:d24ef7414b7904f409057d6f0b283535f2db1b2042f21ec9932633e5ef85bb06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/bundle.json","state_url":"https://pith.science/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/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-09T04:55:50Z","links":{"resolver":"https://pith.science/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6","bundle":"https://pith.science/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/bundle.json","state":"https://pith.science/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTPMBY3GHVXVRDMOCK6ODOEUL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GTPMBY3GHVXVRDMOCK6ODOEUL6","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":"518c21bd0254f607d4fbf3a58e4e0d3ea2d2165a3a967a545f2338d35dc18370","cross_cats_sorted":["cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-04T20:09:24Z","title_canon_sha256":"c69aed1c07bdd47ba069155d4b4fd64efc26ece987885dcbcf7821c1726d2894"},"schema_version":"1.0","source":{"id":"1611.01523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01523","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01523v1","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01523","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"GTPMBY3GHVXV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GTPMBY3GHVXVRDMO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GTPMBY3G","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:d24ef7414b7904f409057d6f0b283535f2db1b2042f21ec9932633e5ef85bb06","target":"graph","created_at":"2026-05-18T01:00:05Z","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":"It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of $\\{0,1\\}^n$ can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed enough. Without auxiliary bits, all even permutations can be implemented. We generalize these results to non-binary logic: For any finite set $A$, a finite gate set can generate all even permutation","authors_text":"Jarkko Kari, Tim Boykett, Ville Salo","cross_cats":["cs.ET","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-04T20:09:24Z","title":"Finite generating sets for reversible gate sets under general conservation laws"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01523","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:a6aec8430a5206d16ecbf11b3c122fc86ed2effddaccfa2ac50f54173695aa47","target":"record","created_at":"2026-05-18T01:00:05Z","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":"518c21bd0254f607d4fbf3a58e4e0d3ea2d2165a3a967a545f2338d35dc18370","cross_cats_sorted":["cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-04T20:09:24Z","title_canon_sha256":"c69aed1c07bdd47ba069155d4b4fd64efc26ece987885dcbcf7821c1726d2894"},"schema_version":"1.0","source":{"id":"1611.01523","kind":"arxiv","version":1}},"canonical_sha256":"34dec0e3663d6f588d8e12bce1b8945fb22d0b3a4c512476b0a3d80b8bd416c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34dec0e3663d6f588d8e12bce1b8945fb22d0b3a4c512476b0a3d80b8bd416c3","first_computed_at":"2026-05-18T01:00:05.108123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.108123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvYOcYv4Zoe0Q9H6wFu7szUlZsoCa479yucyLu7Fq2RjXcYKevFglyFlHJs/RcIyTjN4UGiIE+E9s5Li8+nDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.108696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6aec8430a5206d16ecbf11b3c122fc86ed2effddaccfa2ac50f54173695aa47","sha256:d24ef7414b7904f409057d6f0b283535f2db1b2042f21ec9932633e5ef85bb06"],"state_sha256":"a934a084b3566cf6296a32d23f3d98b1ecc7e185f45f7ca528b871b20e0b5916"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YkJk3TkuKLSiuOt1Ruj6IveGtNbo3479dTsJA65I8cg/AmwmmpIRV558b7K7HUiFiIwg5pAoa48nN2K8E/YBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:55:50.523798Z","bundle_sha256":"3ded15d8c33729b1617abd2a5cadad0e67b8f2f8295ab71a3345f7c282e0cb52"}}