{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NDOSRVAQD7WQ22B6B3SEKQBAA5","short_pith_number":"pith:NDOSRVAQ","canonical_record":{"source":{"id":"1612.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-12-15T16:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"14d5a2f6d5ad1d37c62e41923924da5c174f8ef111596eeaf362fc8109d6354f","abstract_canon_sha256":"f68028b587e0a60a73db986058b912979c6fcc4ac61002de89dfb59af5a45555"},"schema_version":"1.0"},"canonical_sha256":"68dd28d4101fed0d683e0ee4454020076b1caf1a2a4b0db38c0e79791f7eaa81","source":{"kind":"arxiv","id":"1612.05136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05136","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05136v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05136","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"NDOSRVAQD7WQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDOSRVAQD7WQ22B6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDOSRVAQ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NDOSRVAQD7WQ22B6B3SEKQBAA5","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-12-15T16:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"14d5a2f6d5ad1d37c62e41923924da5c174f8ef111596eeaf362fc8109d6354f","abstract_canon_sha256":"f68028b587e0a60a73db986058b912979c6fcc4ac61002de89dfb59af5a45555"},"schema_version":"1.0"},"canonical_sha256":"68dd28d4101fed0d683e0ee4454020076b1caf1a2a4b0db38c0e79791f7eaa81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:53.373445Z","signature_b64":"jy2GAMqJmmCEBqNs//OOqFHzJeYHFF0odhCmVkcCVQKuiQH6A04GEOJu4UNwajcZZDpTVJG3WfllF/ojveeOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68dd28d4101fed0d683e0ee4454020076b1caf1a2a4b0db38c0e79791f7eaa81","last_reissued_at":"2026-05-18T00:54:53.373079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:53.373079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05136","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-18T00:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewKll9R01qVYrXZcJm+g1gZE190yEYXah3mQXhbbQ9OxWy6bv007EwVkFbgdOwZMvsNzQ0QglE+e3J+z3F22DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:59.301313Z"},"content_sha256":"b44838ea27c020f7a5ece35b50ecdc773449a9425c959d835fee1b7c0184735e","schema_version":"1.0","event_id":"sha256:b44838ea27c020f7a5ece35b50ecdc773449a9425c959d835fee1b7c0184735e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NDOSRVAQD7WQ22B6B3SEKQBAA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On permutations with decidable cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Tobias Boege","submitted_at":"2016-12-15T16:52:07Z","abstract_excerpt":"Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\\mathrm{Perm}$, the group of all recursive permutations $\\mathcal{G}$. Multiple equivalent computable representations of decidable equivalence relations are provided. $\\mathcal{G}$-conjugacy in $\\mathrm{Perm}$ is characterised by computable isomorphy of cycle equivalence relations. This result parallels the equivalence of cycle type equality and conjugacy in the full symmetric group of the natural numbers.\n  Conditions are presented for a permutation $f "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05136","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-18T00:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAcCa9fIhJVTkjKFjrPBSXIcQrYyU3PPHc/RT16vCQWNMnvWV3dv7p+JT3pZWzJc6nM97QeIu0YO1SFbgzEaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:59.301767Z"},"content_sha256":"a11e374c185748dd407ca6f0ca585218434bb9911d7ec9519b1fffdb38fa5913","schema_version":"1.0","event_id":"sha256:a11e374c185748dd407ca6f0ca585218434bb9911d7ec9519b1fffdb38fa5913"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/bundle.json","state_url":"https://pith.science/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/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-11T22:08:59Z","links":{"resolver":"https://pith.science/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5","bundle":"https://pith.science/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/bundle.json","state":"https://pith.science/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDOSRVAQD7WQ22B6B3SEKQBAA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NDOSRVAQD7WQ22B6B3SEKQBAA5","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":"f68028b587e0a60a73db986058b912979c6fcc4ac61002de89dfb59af5a45555","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-12-15T16:52:07Z","title_canon_sha256":"14d5a2f6d5ad1d37c62e41923924da5c174f8ef111596eeaf362fc8109d6354f"},"schema_version":"1.0","source":{"id":"1612.05136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05136","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05136v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05136","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"NDOSRVAQD7WQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDOSRVAQD7WQ22B6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDOSRVAQ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:a11e374c185748dd407ca6f0ca585218434bb9911d7ec9519b1fffdb38fa5913","target":"graph","created_at":"2026-05-18T00:54:53Z","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":"Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\\mathrm{Perm}$, the group of all recursive permutations $\\mathcal{G}$. Multiple equivalent computable representations of decidable equivalence relations are provided. $\\mathcal{G}$-conjugacy in $\\mathrm{Perm}$ is characterised by computable isomorphy of cycle equivalence relations. This result parallels the equivalence of cycle type equality and conjugacy in the full symmetric group of the natural numbers.\n  Conditions are presented for a permutation $f ","authors_text":"Tobias Boege","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-12-15T16:52:07Z","title":"On permutations with decidable cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05136","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:b44838ea27c020f7a5ece35b50ecdc773449a9425c959d835fee1b7c0184735e","target":"record","created_at":"2026-05-18T00:54:53Z","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":"f68028b587e0a60a73db986058b912979c6fcc4ac61002de89dfb59af5a45555","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-12-15T16:52:07Z","title_canon_sha256":"14d5a2f6d5ad1d37c62e41923924da5c174f8ef111596eeaf362fc8109d6354f"},"schema_version":"1.0","source":{"id":"1612.05136","kind":"arxiv","version":1}},"canonical_sha256":"68dd28d4101fed0d683e0ee4454020076b1caf1a2a4b0db38c0e79791f7eaa81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68dd28d4101fed0d683e0ee4454020076b1caf1a2a4b0db38c0e79791f7eaa81","first_computed_at":"2026-05-18T00:54:53.373079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:53.373079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jy2GAMqJmmCEBqNs//OOqFHzJeYHFF0odhCmVkcCVQKuiQH6A04GEOJu4UNwajcZZDpTVJG3WfllF/ojveeOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:53.373445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b44838ea27c020f7a5ece35b50ecdc773449a9425c959d835fee1b7c0184735e","sha256:a11e374c185748dd407ca6f0ca585218434bb9911d7ec9519b1fffdb38fa5913"],"state_sha256":"e4d252e315f612350d1ccf17635290237915c64209f0f8b704a5c795097ffa04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LafFL72+RYvouZQYTE3HKN+6Y+/NhhNHc1/LtZgSpVSPVfE/UOHwPHiKYSrcryXIqJJNaRlli5y0NNwOwt3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:59.304707Z","bundle_sha256":"09018044306661a1e9c6ad3b48079a1c4eaff081676e4f59b630d84f1c7d1ad1"}}