{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BSJZJSUD3Y6XT23HZ2M4DAQSKZ","short_pith_number":"pith:BSJZJSUD","canonical_record":{"source":{"id":"1806.10221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-26T21:48:02Z","cross_cats_sorted":[],"title_canon_sha256":"08849715a7672272d5c1511f93e36df7dbe1656014a26d5758968d09bf54ffe8","abstract_canon_sha256":"c97d4789ff8eca136963398d152c8f4d3c1f7db0b21ce4a9744c2ae587b8b1a0"},"schema_version":"1.0"},"canonical_sha256":"0c9394ca83de3d79eb67ce99c182125664c9f0cbc3919fdde8ee8d3c469cc458","source":{"kind":"arxiv","id":"1806.10221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10221","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10221v2","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10221","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"BSJZJSUD3Y6X","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSJZJSUD3Y6XT23H","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSJZJSUD","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BSJZJSUD3Y6XT23HZ2M4DAQSKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-26T21:48:02Z","cross_cats_sorted":[],"title_canon_sha256":"08849715a7672272d5c1511f93e36df7dbe1656014a26d5758968d09bf54ffe8","abstract_canon_sha256":"c97d4789ff8eca136963398d152c8f4d3c1f7db0b21ce4a9744c2ae587b8b1a0"},"schema_version":"1.0"},"canonical_sha256":"0c9394ca83de3d79eb67ce99c182125664c9f0cbc3919fdde8ee8d3c469cc458","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:35.422969Z","signature_b64":"mcTkdLY9ZN24faJpTVNnM2K9TBozCBMti/bx+dky2u5DTTtBZh1U0Za2j0I1inH+ZabHVHBPoa9FsZMvR4SMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9394ca83de3d79eb67ce99c182125664c9f0cbc3919fdde8ee8d3c469cc458","last_reissued_at":"2026-05-18T00:09:35.422523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:35.422523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10221","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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq9/8HL8k0bi+fhKYcu+9T18gbKh8q7PnXTUKLoOuQQKfB5/nvup4yVj+AqsrkcTZdW2kX48Vgp0i1ivPCehCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:03:25.604610Z"},"content_sha256":"0f99eb634ca44e1e70d2e1a229e8490f879dc3d5f8473c6a224750f122bd7b66","schema_version":"1.0","event_id":"sha256:0f99eb634ca44e1e70d2e1a229e8490f879dc3d5f8473c6a224750f122bd7b66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BSJZJSUD3Y6XT23HZ2M4DAQSKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Quantum N-Queens Solver Algorithm and its Simulation and Application to Satellite Communication Using IBM Quantum Experience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinash Dash, Bikash K. Behera, Debaiudh Das, Prasanta K. Panigrahi, Rounak Jha, Sandhya Jayaraman","submitted_at":"2018-06-26T21:48:02Z","abstract_excerpt":"Quantum computers can potentially solve problems that are computationally intractable on a classical computer in polynomial time using quantum-mechanical effects such as superposition and entanglement. The N-Queens Problem is a notable example that falls under the class of NP-complete problems. It involves the arrangement of N chess queens on an N x N chessboard such that no queen attacks any other queen, i.e. no two queens are placed along the same row, column or diagonal. The best time complexity that a classical computer has achieved so far in generating all solutions of the N-Queens Proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10221","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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDpk+PYiA1n+l4rV08aHExHDfqg2gKLS/18XRDd+SeZckGH3lWgReMNHfJpix07qENp4iIfx9u6yuRmmafOACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:03:25.604947Z"},"content_sha256":"888f7c58fb6b7bd5b7cc1cf6874a5d73f57792422133da2f8880bfce8999cbe2","schema_version":"1.0","event_id":"sha256:888f7c58fb6b7bd5b7cc1cf6874a5d73f57792422133da2f8880bfce8999cbe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/bundle.json","state_url":"https://pith.science/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/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-09T01:03:25Z","links":{"resolver":"https://pith.science/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ","bundle":"https://pith.science/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/bundle.json","state":"https://pith.science/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSJZJSUD3Y6XT23HZ2M4DAQSKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BSJZJSUD3Y6XT23HZ2M4DAQSKZ","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":"c97d4789ff8eca136963398d152c8f4d3c1f7db0b21ce4a9744c2ae587b8b1a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-26T21:48:02Z","title_canon_sha256":"08849715a7672272d5c1511f93e36df7dbe1656014a26d5758968d09bf54ffe8"},"schema_version":"1.0","source":{"id":"1806.10221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10221","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10221v2","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10221","created_at":"2026-05-18T00:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"BSJZJSUD3Y6X","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSJZJSUD3Y6XT23H","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSJZJSUD","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:888f7c58fb6b7bd5b7cc1cf6874a5d73f57792422133da2f8880bfce8999cbe2","target":"graph","created_at":"2026-05-18T00:09:35Z","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":"Quantum computers can potentially solve problems that are computationally intractable on a classical computer in polynomial time using quantum-mechanical effects such as superposition and entanglement. The N-Queens Problem is a notable example that falls under the class of NP-complete problems. It involves the arrangement of N chess queens on an N x N chessboard such that no queen attacks any other queen, i.e. no two queens are placed along the same row, column or diagonal. The best time complexity that a classical computer has achieved so far in generating all solutions of the N-Queens Proble","authors_text":"Avinash Dash, Bikash K. Behera, Debaiudh Das, Prasanta K. Panigrahi, Rounak Jha, Sandhya Jayaraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-26T21:48:02Z","title":"A Novel Quantum N-Queens Solver Algorithm and its Simulation and Application to Satellite Communication Using IBM Quantum Experience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10221","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:0f99eb634ca44e1e70d2e1a229e8490f879dc3d5f8473c6a224750f122bd7b66","target":"record","created_at":"2026-05-18T00:09:35Z","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":"c97d4789ff8eca136963398d152c8f4d3c1f7db0b21ce4a9744c2ae587b8b1a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-26T21:48:02Z","title_canon_sha256":"08849715a7672272d5c1511f93e36df7dbe1656014a26d5758968d09bf54ffe8"},"schema_version":"1.0","source":{"id":"1806.10221","kind":"arxiv","version":2}},"canonical_sha256":"0c9394ca83de3d79eb67ce99c182125664c9f0cbc3919fdde8ee8d3c469cc458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c9394ca83de3d79eb67ce99c182125664c9f0cbc3919fdde8ee8d3c469cc458","first_computed_at":"2026-05-18T00:09:35.422523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:35.422523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcTkdLY9ZN24faJpTVNnM2K9TBozCBMti/bx+dky2u5DTTtBZh1U0Za2j0I1inH+ZabHVHBPoa9FsZMvR4SMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:35.422969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f99eb634ca44e1e70d2e1a229e8490f879dc3d5f8473c6a224750f122bd7b66","sha256:888f7c58fb6b7bd5b7cc1cf6874a5d73f57792422133da2f8880bfce8999cbe2"],"state_sha256":"94896b45a8fe42e6df126ae0efbe69b637c9d58196099a48a03a1c6beb591d8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF91SMStDjB2rN/eCaFCiHB4m9kxaYJ4XWBf36VoktNrLXD8F2bBNccCP2HCkQgRtDif/LaTZlRsKQ3u7GW/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T01:03:25.606887Z","bundle_sha256":"b3a93fa0ff72c04069328e500f913a05a70becc1764d9ef88a2afbd27aa43d6a"}}