{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3SJJZH2OUZPWHX2J45IH5ZDYWA","short_pith_number":"pith:3SJJZH2O","canonical_record":{"source":{"id":"1212.6458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-12-28T03:23:39Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"69e803443e7032752589072d13fa5edf655662e5ac6aa8c8989b09b07cb49768","abstract_canon_sha256":"596692eb116bbb528d5ae93054eb18110e16c36834004250920dc40384dd43c4"},"schema_version":"1.0"},"canonical_sha256":"dc929c9f4ea65f63df49e7507ee478b00a34c59096603da7b91b0100a82ad048","source":{"kind":"arxiv","id":"1212.6458","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6458","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6458v2","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6458","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"3SJJZH2OUZPW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3SJJZH2OUZPWHX2J","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3SJJZH2O","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3SJJZH2OUZPWHX2J45IH5ZDYWA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-12-28T03:23:39Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"69e803443e7032752589072d13fa5edf655662e5ac6aa8c8989b09b07cb49768","abstract_canon_sha256":"596692eb116bbb528d5ae93054eb18110e16c36834004250920dc40384dd43c4"},"schema_version":"1.0"},"canonical_sha256":"dc929c9f4ea65f63df49e7507ee478b00a34c59096603da7b91b0100a82ad048","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:26.649880Z","signature_b64":"5/+QhhASOggjeaCIcT96frEXF0YG/YtFgGk0ei02l6RqhzBvCVWov7bEoukXBXNa13dPddCc8bUuCkDzzz1cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc929c9f4ea65f63df49e7507ee478b00a34c59096603da7b91b0100a82ad048","last_reissued_at":"2026-05-18T00:33:26.649306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:26.649306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6458","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-18T00:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+AIRok3fa1o+jLDCr5cKett2NByNNlUq/tZlbJi9nWs7BWg0ByfmUsQyaLhQGA7Ov0ElLdFyVVBeVDFrSmGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:20:42.523728Z"},"content_sha256":"bfc0c7935353bf537c33cef170bef2ad743c7b1d098126950f2f8fb7c9d4c6ab","schema_version":"1.0","event_id":"sha256:bfc0c7935353bf537c33cef170bef2ad743c7b1d098126950f2f8fb7c9d4c6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3SJJZH2OUZPWHX2J45IH5ZDYWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial-indistinguishability obfuscation using braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Gorjan Alagic, Stacey Jeffery, Stephen P. Jordan","submitted_at":"2012-12-28T03:23:39Z","abstract_excerpt":"An obfuscator is an algorithm that translates circuits into functionally-equivalent similarly-sized circuits that are hard to understand. Efficient obfuscators would have many applications in cryptography. Until recently, theoretical progress has mainly been limited to no-go results. Recent works have proposed the first efficient obfuscation algorithms for classical logic circuits, based on a notion of indistinguishability against polynomial-time adversaries. In this work, we propose a new notion of obfuscation, which we call partial-indistinguishability. This notion is based on computationall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6458","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-18T00:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZUrL5kBNQ3JxnAbd7YsUmozt0yJg9/yRpxt9yQwvL45LKuUZAHBK7Cfhw2t80MIo3J1yS2cyITqEh4ew/UtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:20:42.524086Z"},"content_sha256":"8712daf4149d2b88280a9aa7e4ae9591b219e7329a2981191c029be1b42cc564","schema_version":"1.0","event_id":"sha256:8712daf4149d2b88280a9aa7e4ae9591b219e7329a2981191c029be1b42cc564"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/bundle.json","state_url":"https://pith.science/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/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-05-27T21:20:42Z","links":{"resolver":"https://pith.science/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA","bundle":"https://pith.science/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/bundle.json","state":"https://pith.science/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SJJZH2OUZPWHX2J45IH5ZDYWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3SJJZH2OUZPWHX2J45IH5ZDYWA","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":"596692eb116bbb528d5ae93054eb18110e16c36834004250920dc40384dd43c4","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-12-28T03:23:39Z","title_canon_sha256":"69e803443e7032752589072d13fa5edf655662e5ac6aa8c8989b09b07cb49768"},"schema_version":"1.0","source":{"id":"1212.6458","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6458","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6458v2","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6458","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"3SJJZH2OUZPW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3SJJZH2OUZPWHX2J","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3SJJZH2O","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:8712daf4149d2b88280a9aa7e4ae9591b219e7329a2981191c029be1b42cc564","target":"graph","created_at":"2026-05-18T00:33:26Z","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":"An obfuscator is an algorithm that translates circuits into functionally-equivalent similarly-sized circuits that are hard to understand. Efficient obfuscators would have many applications in cryptography. Until recently, theoretical progress has mainly been limited to no-go results. Recent works have proposed the first efficient obfuscation algorithms for classical logic circuits, based on a notion of indistinguishability against polynomial-time adversaries. In this work, we propose a new notion of obfuscation, which we call partial-indistinguishability. This notion is based on computationall","authors_text":"Gorjan Alagic, Stacey Jeffery, Stephen P. Jordan","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-12-28T03:23:39Z","title":"Partial-indistinguishability obfuscation using braids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6458","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:bfc0c7935353bf537c33cef170bef2ad743c7b1d098126950f2f8fb7c9d4c6ab","target":"record","created_at":"2026-05-18T00:33:26Z","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":"596692eb116bbb528d5ae93054eb18110e16c36834004250920dc40384dd43c4","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-12-28T03:23:39Z","title_canon_sha256":"69e803443e7032752589072d13fa5edf655662e5ac6aa8c8989b09b07cb49768"},"schema_version":"1.0","source":{"id":"1212.6458","kind":"arxiv","version":2}},"canonical_sha256":"dc929c9f4ea65f63df49e7507ee478b00a34c59096603da7b91b0100a82ad048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc929c9f4ea65f63df49e7507ee478b00a34c59096603da7b91b0100a82ad048","first_computed_at":"2026-05-18T00:33:26.649306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:26.649306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/+QhhASOggjeaCIcT96frEXF0YG/YtFgGk0ei02l6RqhzBvCVWov7bEoukXBXNa13dPddCc8bUuCkDzzz1cAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:26.649880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6458","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfc0c7935353bf537c33cef170bef2ad743c7b1d098126950f2f8fb7c9d4c6ab","sha256:8712daf4149d2b88280a9aa7e4ae9591b219e7329a2981191c029be1b42cc564"],"state_sha256":"9de7fcad62c1a41643fa0466d488d645cb088471bfa2e641e25656c5013b417e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QABX6JOvFe7Xp3VPMuT+8xCL1IQeb6GVLp+TInSQDmqCSl7hpp6JF39FfadiNKPt5Kc5j+Fndpu8mq/8L082Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:20:42.526306Z","bundle_sha256":"772a2a3064b60f4c1e03544620070a8d6ca2699eeca8d70ba26b82b3bbdd5e8b"}}