{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JCY67IVQIQOSOJ5STSHTMZUZDK","short_pith_number":"pith:JCY67IVQ","canonical_record":{"source":{"id":"1503.06395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"5415b8285a7ab66d0dfd8b429675979fdb804e2e4505f4fc20f064d50d69cb7b","abstract_canon_sha256":"b6ff0d9b9c2954d1c57c40533fb92e6c4d27ffb784792020d452846666ddca94"},"schema_version":"1.0"},"canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","source":{"kind":"arxiv","id":"1503.06395","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06395","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06395v1","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06395","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"JCY67IVQIQOS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCY67IVQIQOSOJ5S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCY67IVQ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JCY67IVQIQOSOJ5STSHTMZUZDK","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"5415b8285a7ab66d0dfd8b429675979fdb804e2e4505f4fc20f064d50d69cb7b","abstract_canon_sha256":"b6ff0d9b9c2954d1c57c40533fb92e6c4d27ffb784792020d452846666ddca94"},"schema_version":"1.0"},"canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:01.163705Z","signature_b64":"SalNF+lnigOuw/u7LTnwM73sZfwbfUfdb7bKy16T36W9CEwZZBdpuKaN5gTDNw3XoYcOcLVOB30tov5iyNMPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","last_reissued_at":"2026-05-18T01:55:01.163029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:01.163029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06395","source_version":1,"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:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwYcfL5y7u17YIxNslDrxtwUenD/Cl9jzYKY7za7Q+2N2mgQ6AJGyCVbyiEzZCNOOeQRvQdPnLjonBZQ9CNlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:09:46.698777Z"},"content_sha256":"d98186b2ff97a7534619c87897174bbc8730c66e978c166d420d4a7435e14a95","schema_version":"1.0","event_id":"sha256:d98186b2ff97a7534619c87897174bbc8730c66e978c166d420d4a7435e14a95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JCY67IVQIQOSOJ5STSHTMZUZDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum search algorithm tailored to clause satisfaction problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2015-03-22T07:03:03Z","abstract_excerpt":"Many important computer science problems can be reduced to clause satisfaction problem. We are given $n$ Boolean variables $x_{k}$ and $m$ clauses $c_{j}$ where each clause is a function of values of some of the variables. We want to find an assignment $i$ of variables for which all $m$ clauses are satisfied. Let $f_{j}(i)$ be a binary function which is $1$ if $j^{\\rm th}$ clause is satisfied by the assignment $i$ else $f_{j}(i) = 0$. Then the solution is $r$ for which $f(i=r) = 1$, where $f(i)$ is the AND function of all $f_{j}(i)$. In quantum computing, Grover`s algorithm can be used to find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06395","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"},"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:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jbm6uGMSHnO2/fBhXsQ8JEnWQ/cf/Ca/6tYmuTDPlH/b3OOEyMlb/tsrNjd0lvHWVARrEFi2x43M3clwmFmkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:09:46.699127Z"},"content_sha256":"9eb2d723f276b5e0d41414a1871f98e01f6398dcd269c1350cd4c8a64c439437","schema_version":"1.0","event_id":"sha256:9eb2d723f276b5e0d41414a1871f98e01f6398dcd269c1350cd4c8a64c439437"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/bundle.json","state_url":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/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-12T00:09:46Z","links":{"resolver":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK","bundle":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/bundle.json","state":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JCY67IVQIQOSOJ5STSHTMZUZDK","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":"b6ff0d9b9c2954d1c57c40533fb92e6c4d27ffb784792020d452846666ddca94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","title_canon_sha256":"5415b8285a7ab66d0dfd8b429675979fdb804e2e4505f4fc20f064d50d69cb7b"},"schema_version":"1.0","source":{"id":"1503.06395","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06395","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06395v1","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06395","created_at":"2026-05-18T01:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"JCY67IVQIQOS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCY67IVQIQOSOJ5S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCY67IVQ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:9eb2d723f276b5e0d41414a1871f98e01f6398dcd269c1350cd4c8a64c439437","target":"graph","created_at":"2026-05-18T01:55:01Z","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":"Many important computer science problems can be reduced to clause satisfaction problem. We are given $n$ Boolean variables $x_{k}$ and $m$ clauses $c_{j}$ where each clause is a function of values of some of the variables. We want to find an assignment $i$ of variables for which all $m$ clauses are satisfied. Let $f_{j}(i)$ be a binary function which is $1$ if $j^{\\rm th}$ clause is satisfied by the assignment $i$ else $f_{j}(i) = 0$. Then the solution is $r$ for which $f(i=r) = 1$, where $f(i)$ is the AND function of all $f_{j}(i)$. In quantum computing, Grover`s algorithm can be used to find","authors_text":"Avatar Tulsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","title":"Quantum search algorithm tailored to clause satisfaction problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06395","kind":"arxiv","version":1},"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:d98186b2ff97a7534619c87897174bbc8730c66e978c166d420d4a7435e14a95","target":"record","created_at":"2026-05-18T01:55:01Z","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":"b6ff0d9b9c2954d1c57c40533fb92e6c4d27ffb784792020d452846666ddca94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","title_canon_sha256":"5415b8285a7ab66d0dfd8b429675979fdb804e2e4505f4fc20f064d50d69cb7b"},"schema_version":"1.0","source":{"id":"1503.06395","kind":"arxiv","version":1}},"canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","first_computed_at":"2026-05-18T01:55:01.163029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:01.163029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SalNF+lnigOuw/u7LTnwM73sZfwbfUfdb7bKy16T36W9CEwZZBdpuKaN5gTDNw3XoYcOcLVOB30tov5iyNMPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:01.163705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06395","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d98186b2ff97a7534619c87897174bbc8730c66e978c166d420d4a7435e14a95","sha256:9eb2d723f276b5e0d41414a1871f98e01f6398dcd269c1350cd4c8a64c439437"],"state_sha256":"3bde6b3087cc5449c0fd56fe8be5241000727e2fd16a9ea1c87f8471d98e627e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLKGiwRjYDH0xCNydk07vC6XiCwm0LP5V8vP/ivMtRpQrX+hr44I0og6lu7x2uCj9dXxsYWPbD4rfOsILordDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:09:46.701212Z","bundle_sha256":"47c35e29d1a81d27b583637e0fd795013a65cf1d6dd75c0d27129ab6c1cc4833"}}