{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3ZJNHAUNMBGA6QMAO5I4P5SASQ","short_pith_number":"pith:3ZJNHAUN","canonical_record":{"source":{"id":"1808.02781","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T13:54:42Z","cross_cats_sorted":[],"title_canon_sha256":"12a96c2335df824e28fd9af303c51fc47d8a1155263eed3eaf9f1fc822e06d3a","abstract_canon_sha256":"541c5692f6cf1596301069fa79bd225ea4c8ab2fe2cdb360cc3bb0c5b2ae2d54"},"schema_version":"1.0"},"canonical_sha256":"de52d3828d604c0f41807751c7f6409402128afeafc118ef4fc26181cc857cce","source":{"kind":"arxiv","id":"1808.02781","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02781","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02781v3","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02781","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"pith_short_12","alias_value":"3ZJNHAUNMBGA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3ZJNHAUNMBGA6QMA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3ZJNHAUN","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3ZJNHAUNMBGA6QMAO5I4P5SASQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02781","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T13:54:42Z","cross_cats_sorted":[],"title_canon_sha256":"12a96c2335df824e28fd9af303c51fc47d8a1155263eed3eaf9f1fc822e06d3a","abstract_canon_sha256":"541c5692f6cf1596301069fa79bd225ea4c8ab2fe2cdb360cc3bb0c5b2ae2d54"},"schema_version":"1.0"},"canonical_sha256":"de52d3828d604c0f41807751c7f6409402128afeafc118ef4fc26181cc857cce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:27.229546Z","signature_b64":"7X6skwyAVdjWcDvY8yE4dASagDqKVz/SJpvYqeAjAbl95n4SvbXs2yxybHkj+wvYARWp/F1idxaHZAiDjg0ECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de52d3828d604c0f41807751c7f6409402128afeafc118ef4fc26181cc857cce","last_reissued_at":"2026-05-17T23:52:27.228992Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:27.228992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02781","source_version":3,"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-17T23:52:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hs/nbweJw7uiWgnMGzM0lcZOAzIlJsQjBQkQvZ0qbGDizKhktm816a21MzSoWUeJcfMyv5k2Z/lkRINGwx5cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:50:49.283541Z"},"content_sha256":"53426986639c70dbf6bf20bc007e62753b8bb2e446cda10846dab3ba3a27cd93","schema_version":"1.0","event_id":"sha256:53426986639c70dbf6bf20bc007e62753b8bb2e446cda10846dab3ba3a27cd93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3ZJNHAUNMBGA6QMAO5I4P5SASQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Factorisation Algorithm in Adiabatic Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tien D. Kieu","submitted_at":"2018-08-08T13:54:42Z","abstract_excerpt":"The problem of factorising positive integer $N$ into two integer factors $x$ and $y$ is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials $Q_N(x,y)=N^2(N-xy)^2 + x(x-y)^2$ or $R_N(x,y) = N^2(N-xy)^2 + (x-y)^2 + x$, of each of which the optimal solution is unique with $x\\le \\sqrt{N} \\le y$, and $x=1$ if and only if $N$ is prime. An algorithm in the context of Adiabatic Quantum Computation is then proposed for the general factorisation problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02781","kind":"arxiv","version":3},"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-17T23:52:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UmKbOh8xyGQJt3zAiL/4/QkZ+poDdw+jA1KV4DTJkDK40Hj5MmFFoKFUzshF/OvnRHDjCH2L4fVCOYzX4q1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:50:49.283882Z"},"content_sha256":"71084684206a6aaa0ca1ffd30b0cdc28bff88b46c841cc3283f309aa70caa3be","schema_version":"1.0","event_id":"sha256:71084684206a6aaa0ca1ffd30b0cdc28bff88b46c841cc3283f309aa70caa3be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/bundle.json","state_url":"https://pith.science/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/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-07-03T12:50:49Z","links":{"resolver":"https://pith.science/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ","bundle":"https://pith.science/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/bundle.json","state":"https://pith.science/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZJNHAUNMBGA6QMAO5I4P5SASQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3ZJNHAUNMBGA6QMAO5I4P5SASQ","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":"541c5692f6cf1596301069fa79bd225ea4c8ab2fe2cdb360cc3bb0c5b2ae2d54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T13:54:42Z","title_canon_sha256":"12a96c2335df824e28fd9af303c51fc47d8a1155263eed3eaf9f1fc822e06d3a"},"schema_version":"1.0","source":{"id":"1808.02781","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02781","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02781v3","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02781","created_at":"2026-05-17T23:52:27Z"},{"alias_kind":"pith_short_12","alias_value":"3ZJNHAUNMBGA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3ZJNHAUNMBGA6QMA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3ZJNHAUN","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:71084684206a6aaa0ca1ffd30b0cdc28bff88b46c841cc3283f309aa70caa3be","target":"graph","created_at":"2026-05-17T23:52:27Z","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":"The problem of factorising positive integer $N$ into two integer factors $x$ and $y$ is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials $Q_N(x,y)=N^2(N-xy)^2 + x(x-y)^2$ or $R_N(x,y) = N^2(N-xy)^2 + (x-y)^2 + x$, of each of which the optimal solution is unique with $x\\le \\sqrt{N} \\le y$, and $x=1$ if and only if $N$ is prime. An algorithm in the context of Adiabatic Quantum Computation is then proposed for the general factorisation problem.","authors_text":"Tien D. Kieu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T13:54:42Z","title":"A Factorisation Algorithm in Adiabatic Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02781","kind":"arxiv","version":3},"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:53426986639c70dbf6bf20bc007e62753b8bb2e446cda10846dab3ba3a27cd93","target":"record","created_at":"2026-05-17T23:52:27Z","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":"541c5692f6cf1596301069fa79bd225ea4c8ab2fe2cdb360cc3bb0c5b2ae2d54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T13:54:42Z","title_canon_sha256":"12a96c2335df824e28fd9af303c51fc47d8a1155263eed3eaf9f1fc822e06d3a"},"schema_version":"1.0","source":{"id":"1808.02781","kind":"arxiv","version":3}},"canonical_sha256":"de52d3828d604c0f41807751c7f6409402128afeafc118ef4fc26181cc857cce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de52d3828d604c0f41807751c7f6409402128afeafc118ef4fc26181cc857cce","first_computed_at":"2026-05-17T23:52:27.228992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:27.228992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7X6skwyAVdjWcDvY8yE4dASagDqKVz/SJpvYqeAjAbl95n4SvbXs2yxybHkj+wvYARWp/F1idxaHZAiDjg0ECQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:27.229546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02781","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53426986639c70dbf6bf20bc007e62753b8bb2e446cda10846dab3ba3a27cd93","sha256:71084684206a6aaa0ca1ffd30b0cdc28bff88b46c841cc3283f309aa70caa3be"],"state_sha256":"44178a4e618e55950fe7f7e3090c6861d82f8f1418b7df178e5c4934b22371d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3vIZt35pKkpxbTfuqaaz9yjnUZjvDOiPs4M+FQt6Ya6ZluEisIqWVQjn302bwFgD1yGIbeTlVgKp8IU5fyvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:50:49.285809Z","bundle_sha256":"a67facb86056b185c06656a8b8f05549ba845f5d1f9a689327fc1c05dd77fca2"}}