{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XLPBPLE64SMAENUVDP6AUZGJ2S","short_pith_number":"pith:XLPBPLE6","canonical_record":{"source":{"id":"1505.00642","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-04T14:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"16a134f30047bb9c2e1957cb82ff86e156c9fda6b23bf476ed58aefc9155398a","abstract_canon_sha256":"83425421edc4396b8b772eb6f5ec827df15ee836d2b71cf028b06acff62b85a5"},"schema_version":"1.0"},"canonical_sha256":"bade17ac9ee4980236951bfc0a64c9d4bfcc4979eec20905997227778a28ce27","source":{"kind":"arxiv","id":"1505.00642","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00642","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00642v4","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00642","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"XLPBPLE64SMA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XLPBPLE64SMAENUV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XLPBPLE6","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XLPBPLE64SMAENUVDP6AUZGJ2S","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00642","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-04T14:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"16a134f30047bb9c2e1957cb82ff86e156c9fda6b23bf476ed58aefc9155398a","abstract_canon_sha256":"83425421edc4396b8b772eb6f5ec827df15ee836d2b71cf028b06acff62b85a5"},"schema_version":"1.0"},"canonical_sha256":"bade17ac9ee4980236951bfc0a64c9d4bfcc4979eec20905997227778a28ce27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:40.329018Z","signature_b64":"l7080HDFDiPuySHq2MX1Yy3VE1+Rukdo7GvgaHyGsqIgd026bBtlq/QKJzmrGWKmLrVMlVNb0ZDGYfsq28B5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bade17ac9ee4980236951bfc0a64c9d4bfcc4979eec20905997227778a28ce27","last_reissued_at":"2026-05-18T01:22:40.328570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:40.328570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00642","source_version":4,"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-18T01:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eq7I5dolZ/JegNJnA3dM2StIytEHSSSHGkJO1Vi8f08LK1QZcdKRwhSQcAjkzp60saAC4l/eWWPgcKVUBr8uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:24:31.387544Z"},"content_sha256":"4af62d4d799f9efa991aa9f34e5bea1736da49372fe40b9c82033567a7cb66ac","schema_version":"1.0","event_id":"sha256:4af62d4d799f9efa991aa9f34e5bea1736da49372fe40b9c82033567a7cb66ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XLPBPLE64SMAENUVDP6AUZGJ2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating Factorization with a Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jose Luis Rosales","submitted_at":"2015-05-04T14:08:04Z","abstract_excerpt":"Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum computer would eventually weaken these algorithms. In this paper, one follows Feynman's prescription for a computer to simulate the physics corresponding to the algorithm of factoring a large number $N$ into primes. Using Dirac-Jordan transformation theory one translates factorization into the language of quantum hermitical operators, acting on the vectors of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00642","kind":"arxiv","version":4},"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-18T01:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6txsgNS3b602EDy1rRDL+dj8LYHYrVca2pC/bABrAdQdVnjYH3mz33OCS7CtZEtqiEcdN7uXYVmfIuY2CLP6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:24:31.387879Z"},"content_sha256":"67d5c38bc399c21a18fa939901ad84df2ce904dfdeca7d69f78b718367577705","schema_version":"1.0","event_id":"sha256:67d5c38bc399c21a18fa939901ad84df2ce904dfdeca7d69f78b718367577705"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/bundle.json","state_url":"https://pith.science/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/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-30T21:24:31Z","links":{"resolver":"https://pith.science/pith/XLPBPLE64SMAENUVDP6AUZGJ2S","bundle":"https://pith.science/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/bundle.json","state":"https://pith.science/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLPBPLE64SMAENUVDP6AUZGJ2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XLPBPLE64SMAENUVDP6AUZGJ2S","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":"83425421edc4396b8b772eb6f5ec827df15ee836d2b71cf028b06acff62b85a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-04T14:08:04Z","title_canon_sha256":"16a134f30047bb9c2e1957cb82ff86e156c9fda6b23bf476ed58aefc9155398a"},"schema_version":"1.0","source":{"id":"1505.00642","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00642","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00642v4","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00642","created_at":"2026-05-18T01:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"XLPBPLE64SMA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XLPBPLE64SMAENUV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XLPBPLE6","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:67d5c38bc399c21a18fa939901ad84df2ce904dfdeca7d69f78b718367577705","target":"graph","created_at":"2026-05-18T01:22:40Z","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":"Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum computer would eventually weaken these algorithms. In this paper, one follows Feynman's prescription for a computer to simulate the physics corresponding to the algorithm of factoring a large number $N$ into primes. Using Dirac-Jordan transformation theory one translates factorization into the language of quantum hermitical operators, acting on the vectors of the ","authors_text":"Jose Luis Rosales","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-04T14:08:04Z","title":"Simulating Factorization with a Quantum Computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00642","kind":"arxiv","version":4},"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:4af62d4d799f9efa991aa9f34e5bea1736da49372fe40b9c82033567a7cb66ac","target":"record","created_at":"2026-05-18T01:22:40Z","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":"83425421edc4396b8b772eb6f5ec827df15ee836d2b71cf028b06acff62b85a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-04T14:08:04Z","title_canon_sha256":"16a134f30047bb9c2e1957cb82ff86e156c9fda6b23bf476ed58aefc9155398a"},"schema_version":"1.0","source":{"id":"1505.00642","kind":"arxiv","version":4}},"canonical_sha256":"bade17ac9ee4980236951bfc0a64c9d4bfcc4979eec20905997227778a28ce27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bade17ac9ee4980236951bfc0a64c9d4bfcc4979eec20905997227778a28ce27","first_computed_at":"2026-05-18T01:22:40.328570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:40.328570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l7080HDFDiPuySHq2MX1Yy3VE1+Rukdo7GvgaHyGsqIgd026bBtlq/QKJzmrGWKmLrVMlVNb0ZDGYfsq28B5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:40.329018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00642","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af62d4d799f9efa991aa9f34e5bea1736da49372fe40b9c82033567a7cb66ac","sha256:67d5c38bc399c21a18fa939901ad84df2ce904dfdeca7d69f78b718367577705"],"state_sha256":"9324bb476766aec09326365a27f7eb63b5340fc96efff47ab718fa6fdbbb5b8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZhCbQzBS7QCYHJo8UwErmvnEQ4naPxkrdBo7BRUcHg5KTC4L7+u8R+iCEWVHRTvO4cJUvQBoYBjY/ecyrW1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:24:31.389870Z","bundle_sha256":"57d5e3db0a9d8859c21fe1a214a99939a77e13eb427c0748507fad45d4efbe28"}}