{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WGEDKUSOBIRD5ANZ46M3OAPIL2","short_pith_number":"pith:WGEDKUSO","canonical_record":{"source":{"id":"1805.10478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-26T13:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b37ebdcc136c66ec56a28e793143d6255cc4776469a8e5d36e5ff80596cb842","abstract_canon_sha256":"6cb310e5cc061a5241998773f1ac8c5db096ed5a72b66474233e74e116472138"},"schema_version":"1.0"},"canonical_sha256":"b18835524e0a223e81b9e799b701e85ea180782ade47b23f4dfa7410a01b78e7","source":{"kind":"arxiv","id":"1805.10478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10478","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10478v2","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10478","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"WGEDKUSOBIRD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WGEDKUSOBIRD5ANZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WGEDKUSO","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WGEDKUSOBIRD5ANZ46M3OAPIL2","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-26T13:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b37ebdcc136c66ec56a28e793143d6255cc4776469a8e5d36e5ff80596cb842","abstract_canon_sha256":"6cb310e5cc061a5241998773f1ac8c5db096ed5a72b66474233e74e116472138"},"schema_version":"1.0"},"canonical_sha256":"b18835524e0a223e81b9e799b701e85ea180782ade47b23f4dfa7410a01b78e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:54.178856Z","signature_b64":"iTCiNGNxyKzhGqBw2Evmezva6BJLRR/CBiIdzkWkh8C0VlAYMk71iKPT/sPMjav62TQaMyW2ldF6M8vP+PvICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b18835524e0a223e81b9e799b701e85ea180782ade47b23f4dfa7410a01b78e7","last_reissued_at":"2026-05-18T00:10:54.178117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:54.178117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10478","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:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3boU9ErPcHiH+54+ZGkdQYnRaB9McCM15e8s40ApXd8CPEtq3L99vFv4IBdt5D2nuFctBnBJyodYi8BjqwEJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:37:58.260937Z"},"content_sha256":"7a0317be1b46f879a22a83dbca189b7360e9a6bb3719df6d6e5b500810a25661","schema_version":"1.0","event_id":"sha256:7a0317be1b46f879a22a83dbca189b7360e9a6bb3719df6d6e5b500810a25661"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WGEDKUSOBIRD5ANZ46M3OAPIL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinash Dash, Bikash K. Behera, Deepankar Sarmah, Prasanta K. Panigrahi","submitted_at":"2018-05-26T13:04:43Z","abstract_excerpt":"Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by means of classical computation. However, the order can be drastically reduced by converting the factorization problem to an optimization one and solving it using a quantum computer. Recent works involving both theoretical and experimental approaches use Shor's algorithm, adiabatic quantum computation and quantum annealing principles to factorize integers. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10478","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:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EIeUFdIbSe/oESEmZMk0dkIH4BYs5vwk/O3bAj64Z66t/YQ2Ov5h54sk/ZThn6I1K0XhXlPl6Ou5uKgEfP7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:37:58.261795Z"},"content_sha256":"6b93fb433fe855f7841dcd68ab746a2702dc19997912a9dc1ba88a9786ce8ec8","schema_version":"1.0","event_id":"sha256:6b93fb433fe855f7841dcd68ab746a2702dc19997912a9dc1ba88a9786ce8ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/bundle.json","state_url":"https://pith.science/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/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-08-20T22:37:58Z","links":{"resolver":"https://pith.science/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2","bundle":"https://pith.science/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/bundle.json","state":"https://pith.science/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGEDKUSOBIRD5ANZ46M3OAPIL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WGEDKUSOBIRD5ANZ46M3OAPIL2","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":"6cb310e5cc061a5241998773f1ac8c5db096ed5a72b66474233e74e116472138","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-26T13:04:43Z","title_canon_sha256":"2b37ebdcc136c66ec56a28e793143d6255cc4776469a8e5d36e5ff80596cb842"},"schema_version":"1.0","source":{"id":"1805.10478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10478","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10478v2","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10478","created_at":"2026-05-18T00:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"WGEDKUSOBIRD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WGEDKUSOBIRD5ANZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WGEDKUSO","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:6b93fb433fe855f7841dcd68ab746a2702dc19997912a9dc1ba88a9786ce8ec8","target":"graph","created_at":"2026-05-18T00:10:54Z","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":"Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by means of classical computation. However, the order can be drastically reduced by converting the factorization problem to an optimization one and solving it using a quantum computer. Recent works involving both theoretical and experimental approaches use Shor's algorithm, adiabatic quantum computation and quantum annealing principles to factorize integers. H","authors_text":"Avinash Dash, Bikash K. Behera, Deepankar Sarmah, Prasanta K. Panigrahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-26T13:04:43Z","title":"Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10478","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:7a0317be1b46f879a22a83dbca189b7360e9a6bb3719df6d6e5b500810a25661","target":"record","created_at":"2026-05-18T00:10:54Z","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":"6cb310e5cc061a5241998773f1ac8c5db096ed5a72b66474233e74e116472138","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-26T13:04:43Z","title_canon_sha256":"2b37ebdcc136c66ec56a28e793143d6255cc4776469a8e5d36e5ff80596cb842"},"schema_version":"1.0","source":{"id":"1805.10478","kind":"arxiv","version":2}},"canonical_sha256":"b18835524e0a223e81b9e799b701e85ea180782ade47b23f4dfa7410a01b78e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b18835524e0a223e81b9e799b701e85ea180782ade47b23f4dfa7410a01b78e7","first_computed_at":"2026-05-18T00:10:54.178117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:54.178117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iTCiNGNxyKzhGqBw2Evmezva6BJLRR/CBiIdzkWkh8C0VlAYMk71iKPT/sPMjav62TQaMyW2ldF6M8vP+PvICg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:54.178856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a0317be1b46f879a22a83dbca189b7360e9a6bb3719df6d6e5b500810a25661","sha256:6b93fb433fe855f7841dcd68ab746a2702dc19997912a9dc1ba88a9786ce8ec8"],"state_sha256":"34fd22cf383d65d7f3aec682c6f17cbbb7d75c9a02a0f8e19a77282151e4d489"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dmyhcc3xLGt5QwFO72d6hPJwuYn9Vdt5Xp+rwwfSr0ukEgMbcHL+KUnM6vO9++QUPDf1IduAJz91zwiMD6EBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T22:37:58.268009Z","bundle_sha256":"5ebb741ec3a543df3d6b41f801a7d2d2436d4f24949b17663c700ee1694e049e"}}