{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OMO2CQZ7MQ25ENVP5WAAQCRRNN","short_pith_number":"pith:OMO2CQZ7","canonical_record":{"source":{"id":"1505.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-05T07:04:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077882f4d86f686bdc227c1f016f22bf33ccec767b15b1a512dc88b5c27ec8fa","abstract_canon_sha256":"00f474c80aa48ed94d169690e4f046674e2a76a08de23524bba27dd2089ad4a0"},"schema_version":"1.0"},"canonical_sha256":"731da1433f6435d236afed80080a316b517f67222a1b20b6bdb991a2f07a2e23","source":{"kind":"arxiv","id":"1505.00895","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00895","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00895v2","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00895","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"OMO2CQZ7MQ25","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMO2CQZ7MQ25ENVP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMO2CQZ7","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OMO2CQZ7MQ25ENVP5WAAQCRRNN","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-05T07:04:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077882f4d86f686bdc227c1f016f22bf33ccec767b15b1a512dc88b5c27ec8fa","abstract_canon_sha256":"00f474c80aa48ed94d169690e4f046674e2a76a08de23524bba27dd2089ad4a0"},"schema_version":"1.0"},"canonical_sha256":"731da1433f6435d236afed80080a316b517f67222a1b20b6bdb991a2f07a2e23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:10.148555Z","signature_b64":"jIfppM6Mp1lcKAkRyBJgh40HBRc9ltz/qH1mheiTimgpyHjoCBNOMq9w7mOzPsxWdv1/0ErLcrvtYWlAjxzUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731da1433f6435d236afed80080a316b517f67222a1b20b6bdb991a2f07a2e23","last_reissued_at":"2026-05-18T00:44:10.147986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:10.147986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00895","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwHPghhRpnOvpkU0ZOWS2J2agZJKwXQr2z61Wm1X8TwLayCPjnOzrHWPK9dbbrt4/5pcy3Xjc1fp7cobK9gxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:19:28.989108Z"},"content_sha256":"e5d2cb0fd7385091ed3d0cfcd45c0fe9466dfa83ef71a51e9fa02970b73bb4a5","schema_version":"1.0","event_id":"sha256:e5d2cb0fd7385091ed3d0cfcd45c0fe9466dfa83ef71a51e9fa02970b73bb4a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OMO2CQZ7MQ25ENVP5WAAQCRRNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Grover Search: Applications in Recommendation systems and Optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Indranil Chakrabarty, Shahzor Khan, Vanshdeep Singh","submitted_at":"2015-05-05T07:04:21Z","abstract_excerpt":"In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceeding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00895","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhLHjDJLcPcTxqe6qa/p50McnsFUmGIDIwQ3tIpthWzGMyrWIQuN/BTBjaMX7yvEARcvJJ4qZiZfnb6sqSNxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:19:28.989474Z"},"content_sha256":"9a6ba660c2278a03b1b7a787b2981447458984e7d36194417390f3a12ad9f663","schema_version":"1.0","event_id":"sha256:9a6ba660c2278a03b1b7a787b2981447458984e7d36194417390f3a12ad9f663"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/bundle.json","state_url":"https://pith.science/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/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-03T03:19:28Z","links":{"resolver":"https://pith.science/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN","bundle":"https://pith.science/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/bundle.json","state":"https://pith.science/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMO2CQZ7MQ25ENVP5WAAQCRRNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OMO2CQZ7MQ25ENVP5WAAQCRRNN","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":"00f474c80aa48ed94d169690e4f046674e2a76a08de23524bba27dd2089ad4a0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-05T07:04:21Z","title_canon_sha256":"077882f4d86f686bdc227c1f016f22bf33ccec767b15b1a512dc88b5c27ec8fa"},"schema_version":"1.0","source":{"id":"1505.00895","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00895","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00895v2","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00895","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"OMO2CQZ7MQ25","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMO2CQZ7MQ25ENVP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMO2CQZ7","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:9a6ba660c2278a03b1b7a787b2981447458984e7d36194417390f3a12ad9f663","target":"graph","created_at":"2026-05-18T00:44:10Z","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":"In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceeding","authors_text":"Indranil Chakrabarty, Shahzor Khan, Vanshdeep Singh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-05T07:04:21Z","title":"Dynamic Grover Search: Applications in Recommendation systems and Optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00895","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:e5d2cb0fd7385091ed3d0cfcd45c0fe9466dfa83ef71a51e9fa02970b73bb4a5","target":"record","created_at":"2026-05-18T00:44:10Z","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":"00f474c80aa48ed94d169690e4f046674e2a76a08de23524bba27dd2089ad4a0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-05T07:04:21Z","title_canon_sha256":"077882f4d86f686bdc227c1f016f22bf33ccec767b15b1a512dc88b5c27ec8fa"},"schema_version":"1.0","source":{"id":"1505.00895","kind":"arxiv","version":2}},"canonical_sha256":"731da1433f6435d236afed80080a316b517f67222a1b20b6bdb991a2f07a2e23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"731da1433f6435d236afed80080a316b517f67222a1b20b6bdb991a2f07a2e23","first_computed_at":"2026-05-18T00:44:10.147986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:10.147986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIfppM6Mp1lcKAkRyBJgh40HBRc9ltz/qH1mheiTimgpyHjoCBNOMq9w7mOzPsxWdv1/0ErLcrvtYWlAjxzUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:10.148555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00895","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5d2cb0fd7385091ed3d0cfcd45c0fe9466dfa83ef71a51e9fa02970b73bb4a5","sha256:9a6ba660c2278a03b1b7a787b2981447458984e7d36194417390f3a12ad9f663"],"state_sha256":"78743091f375dfda885e73fcb41e8af1a975d158f2b8ffa596504183712c1bfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEqEdMGtrrzR8b4wZfbkg/cy7xJ2jsqo0I+SKsKWo/DRe32UuIzcHPp6d1MdoLvXbH1qlO/JcN9hd0gaW0XNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:19:28.991495Z","bundle_sha256":"d561f0d5f98f3c0c86207879ffc83253b7e53b8bd869a75a3d0209c3b77d6fb0"}}