{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YP7WTEQUUTVT3WLO4OL27G4FNV","short_pith_number":"pith:YP7WTEQU","schema_version":"1.0","canonical_sha256":"c3ff699214a4eb3dd96ee397af9b856d7c3fc9a6ec45967f80baa17014227821","source":{"kind":"arxiv","id":"1811.12365","version":1},"attestation_state":"computed","paper":{"title":"(Un)Encrypted Computing and Indistinguishability Obfuscation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jonathan P. Bowen, Peter T. Breuer","submitted_at":"2018-11-29T18:22:13Z","abstract_excerpt":"This paper first describes an `obfuscating' compiler technology developed for encrypted computing, then examines if the trivial case without encryption produces much-sought indistinguishability obfuscation."},"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":"1811.12365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-29T18:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"28ae73458ec3a9bd4aeb38e0efbb79d23ef3e7e59fb8d587b6d0a85f26256dbd","abstract_canon_sha256":"ec0292e3f05040baa16618135cbefdf40af6fd83ae356100b4d52212ce9894d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.705571Z","signature_b64":"YbbgOy8tFvYR579G/4e7IPU9/vWNGt4BtxejPVOpORB0wuPVtQ6UiF5mBBBQogn1kGSiYyneZd/q3dv96+8cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3ff699214a4eb3dd96ee397af9b856d7c3fc9a6ec45967f80baa17014227821","last_reissued_at":"2026-05-17T23:59:33.704907Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.704907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Un)Encrypted Computing and Indistinguishability Obfuscation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jonathan P. Bowen, Peter T. Breuer","submitted_at":"2018-11-29T18:22:13Z","abstract_excerpt":"This paper first describes an `obfuscating' compiler technology developed for encrypted computing, then examines if the trivial case without encryption produces much-sought indistinguishability obfuscation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12365","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.12365","created_at":"2026-05-17T23:59:33.705021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12365v1","created_at":"2026-05-17T23:59:33.705021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12365","created_at":"2026-05-17T23:59:33.705021+00:00"},{"alias_kind":"pith_short_12","alias_value":"YP7WTEQUUTVT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YP7WTEQUUTVT3WLO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YP7WTEQU","created_at":"2026-05-18T12:33:04.347982+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/YP7WTEQUUTVT3WLO4OL27G4FNV","json":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV.json","graph_json":"https://pith.science/api/pith-number/YP7WTEQUUTVT3WLO4OL27G4FNV/graph.json","events_json":"https://pith.science/api/pith-number/YP7WTEQUUTVT3WLO4OL27G4FNV/events.json","paper":"https://pith.science/paper/YP7WTEQU"},"agent_actions":{"view_html":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV","download_json":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV.json","view_paper":"https://pith.science/paper/YP7WTEQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12365&json=true","fetch_graph":"https://pith.science/api/pith-number/YP7WTEQUUTVT3WLO4OL27G4FNV/graph.json","fetch_events":"https://pith.science/api/pith-number/YP7WTEQUUTVT3WLO4OL27G4FNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV/action/storage_attestation","attest_author":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV/action/author_attestation","sign_citation":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV/action/citation_signature","submit_replication":"https://pith.science/pith/YP7WTEQUUTVT3WLO4OL27G4FNV/action/replication_record"}},"created_at":"2026-05-17T23:59:33.705021+00:00","updated_at":"2026-05-17T23:59:33.705021+00:00"}