{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SRCXWCR5ONEF2H7Q76ZKE56PPX","short_pith_number":"pith:SRCXWCR5","canonical_record":{"source":{"id":"1811.06936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-16T17:39:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8eafb92f238681732a0f6a38a40a270bae28683d06e1aed4977aa8651a3b1c24","abstract_canon_sha256":"4b8699c37a501dad960993a880b76c765549d2a0873ab597907fc783e20715fa"},"schema_version":"1.0"},"canonical_sha256":"94457b0a3d73485d1ff0ffb2a277cf7df827854f2cd3f53858fcc7c95b087f42","source":{"kind":"arxiv","id":"1811.06936","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06936","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06936v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06936","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"SRCXWCR5ONEF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SRCXWCR5ONEF2H7Q","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SRCXWCR5","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SRCXWCR5ONEF2H7Q76ZKE56PPX","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-16T17:39:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8eafb92f238681732a0f6a38a40a270bae28683d06e1aed4977aa8651a3b1c24","abstract_canon_sha256":"4b8699c37a501dad960993a880b76c765549d2a0873ab597907fc783e20715fa"},"schema_version":"1.0"},"canonical_sha256":"94457b0a3d73485d1ff0ffb2a277cf7df827854f2cd3f53858fcc7c95b087f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:31.962762Z","signature_b64":"pPDC4j34miqwyPu6oNLKfx1y9NIk19i3ZcGLi0TWio96zy6f104/ScM9BDwEGTj6L4xiPWOITjeyTKOViVF/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94457b0a3d73485d1ff0ffb2a277cf7df827854f2cd3f53858fcc7c95b087f42","last_reissued_at":"2026-05-17T23:46:31.962162Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:31.962162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06936","source_version":2,"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-17T23:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjUR2LPxxe1sTH6Sev2vhapHsABodpc9IsE3EU3HxJMAw+rzIllC4IrrNPpBvEY6DnJgo57Uz1Qql4O4OiI9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:47.660117Z"},"content_sha256":"5b9d0a14ea251c9cb1c9fc534d255e8dbc9672bc4ae657ba0471cde8474a2ac4","schema_version":"1.0","event_id":"sha256:5b9d0a14ea251c9cb1c9fc534d255e8dbc9672bc4ae657ba0471cde8474a2ac4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SRCXWCR5ONEF2H7Q76ZKE56PPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Indistinguishability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"Adrien Koutsos","submitted_at":"2018-11-16T17:39:14Z","abstract_excerpt":"Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations.\n  We follow Bana and Comon's approach, axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are both computationally sound and expressive enough. This can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06936","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"},"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-17T23:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJ+KoRMKCuSykzZ7o0gajdqg+aismHb+Aed74DOianTc0QjhMgnzSxa9l3OGFH4lOBADCAxFzQrlC1lzObPaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:47.660473Z"},"content_sha256":"ae74f9e1b4d96478b8a4cf05ab3899720282c54a7d9d0220f3ddb6999785957f","schema_version":"1.0","event_id":"sha256:ae74f9e1b4d96478b8a4cf05ab3899720282c54a7d9d0220f3ddb6999785957f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/bundle.json","state_url":"https://pith.science/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/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-29T13:09:47Z","links":{"resolver":"https://pith.science/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX","bundle":"https://pith.science/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/bundle.json","state":"https://pith.science/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRCXWCR5ONEF2H7Q76ZKE56PPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SRCXWCR5ONEF2H7Q76ZKE56PPX","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":"4b8699c37a501dad960993a880b76c765549d2a0873ab597907fc783e20715fa","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-16T17:39:14Z","title_canon_sha256":"8eafb92f238681732a0f6a38a40a270bae28683d06e1aed4977aa8651a3b1c24"},"schema_version":"1.0","source":{"id":"1811.06936","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06936","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06936v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06936","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"SRCXWCR5ONEF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SRCXWCR5ONEF2H7Q","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SRCXWCR5","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:ae74f9e1b4d96478b8a4cf05ab3899720282c54a7d9d0220f3ddb6999785957f","target":"graph","created_at":"2026-05-17T23:46:31Z","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":"Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations.\n  We follow Bana and Comon's approach, axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are both computationally sound and expressive enough. This can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.","authors_text":"Adrien Koutsos","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-16T17:39:14Z","title":"Deciding Indistinguishability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06936","kind":"arxiv","version":2},"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:5b9d0a14ea251c9cb1c9fc534d255e8dbc9672bc4ae657ba0471cde8474a2ac4","target":"record","created_at":"2026-05-17T23:46:31Z","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":"4b8699c37a501dad960993a880b76c765549d2a0873ab597907fc783e20715fa","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-16T17:39:14Z","title_canon_sha256":"8eafb92f238681732a0f6a38a40a270bae28683d06e1aed4977aa8651a3b1c24"},"schema_version":"1.0","source":{"id":"1811.06936","kind":"arxiv","version":2}},"canonical_sha256":"94457b0a3d73485d1ff0ffb2a277cf7df827854f2cd3f53858fcc7c95b087f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94457b0a3d73485d1ff0ffb2a277cf7df827854f2cd3f53858fcc7c95b087f42","first_computed_at":"2026-05-17T23:46:31.962162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:31.962162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPDC4j34miqwyPu6oNLKfx1y9NIk19i3ZcGLi0TWio96zy6f104/ScM9BDwEGTj6L4xiPWOITjeyTKOViVF/BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:31.962762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06936","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b9d0a14ea251c9cb1c9fc534d255e8dbc9672bc4ae657ba0471cde8474a2ac4","sha256:ae74f9e1b4d96478b8a4cf05ab3899720282c54a7d9d0220f3ddb6999785957f"],"state_sha256":"8c5b1ef6b9bffd50c825a831e8c3c5843cb356487454f539b51300aed5e40e88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnMgO9u6ozaRHTC9buizMaR7Dv0+FwBWGla1IEHKPEh1VAYgXqHGbsCVo2HElGjAWKFH/RS48t5x7csOoLnyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:09:47.662335Z","bundle_sha256":"42c3154634a55113ac446ae0ad46e334ca9d9b478ff236df0a163ef953364292"}}