{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OIGN34PV2LZIPJX2BPFTHWTOYH","short_pith_number":"pith:OIGN34PV","schema_version":"1.0","canonical_sha256":"720cddf1f5d2f287a6fa0bcb33da6ec1c203c20e02fb34d00247f7b92fc4836e","source":{"kind":"arxiv","id":"1301.1994","version":1},"attestation_state":"computed","paper":{"title":"Simulating Entanglement in Classical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Subhash Kak","submitted_at":"2013-01-07T23:09:42Z","abstract_excerpt":"This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the case where the mapping is of order k, we prove a theorem that gives us the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions."},"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":"1301.1994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-07T23:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"ce435a24d43572b221830cc315964ee40273d55cebec7966e9fdc8d35b2d5cd7","abstract_canon_sha256":"857ea23183ff4311dbcb4faae5e9d61bf2a9e8187d05594fe07ec477dd365e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:48.574979Z","signature_b64":"mSaKnFiuU7wQAEaB+ELnEVLoG4P8R2HzBW7dotMfrEwFWqUdo6d0+JBiS7rRKj245Av2xTSOQGdxSLJXv6G0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720cddf1f5d2f287a6fa0bcb33da6ec1c203c20e02fb34d00247f7b92fc4836e","last_reissued_at":"2026-05-18T03:36:48.574539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:48.574539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating Entanglement in Classical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Subhash Kak","submitted_at":"2013-01-07T23:09:42Z","abstract_excerpt":"This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the case where the mapping is of order k, we prove a theorem that gives us the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1994","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":"1301.1994","created_at":"2026-05-18T03:36:48.574601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1994v1","created_at":"2026-05-18T03:36:48.574601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1994","created_at":"2026-05-18T03:36:48.574601+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIGN34PV2LZI","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIGN34PV2LZIPJX2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIGN34PV","created_at":"2026-05-18T12:27:54.935989+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/OIGN34PV2LZIPJX2BPFTHWTOYH","json":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH.json","graph_json":"https://pith.science/api/pith-number/OIGN34PV2LZIPJX2BPFTHWTOYH/graph.json","events_json":"https://pith.science/api/pith-number/OIGN34PV2LZIPJX2BPFTHWTOYH/events.json","paper":"https://pith.science/paper/OIGN34PV"},"agent_actions":{"view_html":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH","download_json":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH.json","view_paper":"https://pith.science/paper/OIGN34PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1994&json=true","fetch_graph":"https://pith.science/api/pith-number/OIGN34PV2LZIPJX2BPFTHWTOYH/graph.json","fetch_events":"https://pith.science/api/pith-number/OIGN34PV2LZIPJX2BPFTHWTOYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH/action/storage_attestation","attest_author":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH/action/author_attestation","sign_citation":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH/action/citation_signature","submit_replication":"https://pith.science/pith/OIGN34PV2LZIPJX2BPFTHWTOYH/action/replication_record"}},"created_at":"2026-05-18T03:36:48.574601+00:00","updated_at":"2026-05-18T03:36:48.574601+00:00"}