{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IPJ6QXXMKQI3GLCOB7HYWCRHNM","short_pith_number":"pith:IPJ6QXXM","canonical_record":{"source":{"id":"1805.10928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-28T14:10:17Z","cross_cats_sorted":[],"title_canon_sha256":"79d2ffc55d256b23a3dd92c249b741ab0437199e8d302d26c701f5c2836003a8","abstract_canon_sha256":"cffd4dd20a99f3d801c2f0f4c5d223a0674b73eac631e52027ef7b4dc4d0e214"},"schema_version":"1.0"},"canonical_sha256":"43d3e85eec5411b32c4e0fcf8b0a276b30a25b254e408a3ce7e0d160a4324fb5","source":{"kind":"arxiv","id":"1805.10928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10928","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10928v1","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10928","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"IPJ6QXXMKQI3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IPJ6QXXMKQI3GLCO","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IPJ6QXXM","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IPJ6QXXMKQI3GLCOB7HYWCRHNM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-28T14:10:17Z","cross_cats_sorted":[],"title_canon_sha256":"79d2ffc55d256b23a3dd92c249b741ab0437199e8d302d26c701f5c2836003a8","abstract_canon_sha256":"cffd4dd20a99f3d801c2f0f4c5d223a0674b73eac631e52027ef7b4dc4d0e214"},"schema_version":"1.0"},"canonical_sha256":"43d3e85eec5411b32c4e0fcf8b0a276b30a25b254e408a3ce7e0d160a4324fb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:48.785625Z","signature_b64":"VTCPjESXm02EgjLX9UuixxfVPbMAFYYjhxRnUmESV3E3iLR91Hf4lhjn71l+ph7YIsA0+WcRwWB145fY20bSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d3e85eec5411b32c4e0fcf8b0a276b30a25b254e408a3ce7e0d160a4324fb5","last_reissued_at":"2026-05-18T00:14:48.784953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:48.784953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10928","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-18T00:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtWJb0sDb0w0qXa2//hk78yceX7TGk79DobD36q1UVQz6FTRWOJhkyjkaqKwc0IWtlnV6exftqkVXQlEaHlBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:19:02.418416Z"},"content_sha256":"d50193257745abc428072a8bdee73d677f23b21b2522d9b2fb1ad2dcf51f3435","schema_version":"1.0","event_id":"sha256:d50193257745abc428072a8bdee73d677f23b21b2522d9b2fb1ad2dcf51f3435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IPJ6QXXMKQI3GLCOB7HYWCRHNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bikash K. Behera, Karthik Srinivasan, Prasanta K. Panigrahi, Saipriya Satyajit","submitted_at":"2018-05-28T14:10:17Z","abstract_excerpt":"The famous Travelling Salesman Problem (TSP) is an important category of optimization problems that is mostly encountered in various areas of science and engineering. Studying optimization problems motivates to develop advanced techniques more suited to contemporary practical problems. Among those, especially the NP hard problems provide an apt platform to demonstrate supremacy of quantum over classical technologies in terms of resources and time. TSP is one such NP hard problem in combinatorial optimization which takes exponential time order for solving by brute force method. Here we propose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10928","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-18T00:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M84s7kPqeURf00m1MmoSkKlB2igEXnKDOrj7vflKVMG3uOkrQwWM/RMXZ70Z0rMdmc++4pkP9wCyFU7+A6fiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:19:02.418768Z"},"content_sha256":"a034f7990565f0fc900e191a3dfbe0a0a026a37ee083a931645384952c135ac1","schema_version":"1.0","event_id":"sha256:a034f7990565f0fc900e191a3dfbe0a0a026a37ee083a931645384952c135ac1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/bundle.json","state_url":"https://pith.science/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/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-09T11:19:02Z","links":{"resolver":"https://pith.science/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM","bundle":"https://pith.science/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/bundle.json","state":"https://pith.science/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPJ6QXXMKQI3GLCOB7HYWCRHNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IPJ6QXXMKQI3GLCOB7HYWCRHNM","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":"cffd4dd20a99f3d801c2f0f4c5d223a0674b73eac631e52027ef7b4dc4d0e214","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-28T14:10:17Z","title_canon_sha256":"79d2ffc55d256b23a3dd92c249b741ab0437199e8d302d26c701f5c2836003a8"},"schema_version":"1.0","source":{"id":"1805.10928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10928","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10928v1","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10928","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"IPJ6QXXMKQI3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IPJ6QXXMKQI3GLCO","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IPJ6QXXM","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a034f7990565f0fc900e191a3dfbe0a0a026a37ee083a931645384952c135ac1","target":"graph","created_at":"2026-05-18T00:14:48Z","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 famous Travelling Salesman Problem (TSP) is an important category of optimization problems that is mostly encountered in various areas of science and engineering. Studying optimization problems motivates to develop advanced techniques more suited to contemporary practical problems. Among those, especially the NP hard problems provide an apt platform to demonstrate supremacy of quantum over classical technologies in terms of resources and time. TSP is one such NP hard problem in combinatorial optimization which takes exponential time order for solving by brute force method. Here we propose ","authors_text":"Bikash K. Behera, Karthik Srinivasan, Prasanta K. Panigrahi, Saipriya Satyajit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-28T14:10:17Z","title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10928","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:d50193257745abc428072a8bdee73d677f23b21b2522d9b2fb1ad2dcf51f3435","target":"record","created_at":"2026-05-18T00:14:48Z","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":"cffd4dd20a99f3d801c2f0f4c5d223a0674b73eac631e52027ef7b4dc4d0e214","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-28T14:10:17Z","title_canon_sha256":"79d2ffc55d256b23a3dd92c249b741ab0437199e8d302d26c701f5c2836003a8"},"schema_version":"1.0","source":{"id":"1805.10928","kind":"arxiv","version":1}},"canonical_sha256":"43d3e85eec5411b32c4e0fcf8b0a276b30a25b254e408a3ce7e0d160a4324fb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d3e85eec5411b32c4e0fcf8b0a276b30a25b254e408a3ce7e0d160a4324fb5","first_computed_at":"2026-05-18T00:14:48.784953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:48.784953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VTCPjESXm02EgjLX9UuixxfVPbMAFYYjhxRnUmESV3E3iLR91Hf4lhjn71l+ph7YIsA0+WcRwWB145fY20bSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:48.785625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d50193257745abc428072a8bdee73d677f23b21b2522d9b2fb1ad2dcf51f3435","sha256:a034f7990565f0fc900e191a3dfbe0a0a026a37ee083a931645384952c135ac1"],"state_sha256":"2de9a520fb045ca85320d18e0686fbd4a7a957560b9d9986d11c5dc89ea6534b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds18amjvr2VURFvCN+cxt+AtBFSfg/fBSgGZpHjUC+Nwgzj5aZIo+WDSqkIXxGQC2HuyYXn3rOkSCUIeFphQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:19:02.420684Z","bundle_sha256":"09bfe978102c8e43bd4d89bd7b752c5ad10c2b8861016d285940d985a0e2aaa0"}}