{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BT2M5MCGQG6GKN7CAMJXSS4A2S","short_pith_number":"pith:BT2M5MCG","canonical_record":{"source":{"id":"1804.02387","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T19:04:53Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"68c6051a64792efa4827253bb804ffad59edcc6b9b1ef3e225bf000d6139c5d6","abstract_canon_sha256":"3eb369f511adf25a497069808e935bc3cae7ab118c1f4edcb648808752e1517e"},"schema_version":"1.0"},"canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","source":{"kind":"arxiv","id":"1804.02387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02387","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02387v1","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02387","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"BT2M5MCGQG6G","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BT2M5MCGQG6GKN7C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BT2M5MCG","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BT2M5MCGQG6GKN7CAMJXSS4A2S","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02387","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T19:04:53Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"68c6051a64792efa4827253bb804ffad59edcc6b9b1ef3e225bf000d6139c5d6","abstract_canon_sha256":"3eb369f511adf25a497069808e935bc3cae7ab118c1f4edcb648808752e1517e"},"schema_version":"1.0"},"canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:01.856506Z","signature_b64":"0zy9uzBOLKXlnEfmJ/UR1UaAlVRtjKCk3YdB7INXAnFxb7XVVaQsRskXNcUIB70H+pjKMvTz7JbJ05KzI7ccCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","last_reissued_at":"2026-05-18T00:19:01.855775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:01.855775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02387","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:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VGjGnsneXQa7Xidq2tCBCBJPE4sGe8ZzyXKAmHIPbE0KH81IiJjkAj1uImSJ1oK/257RA0prF9WNmXxsBolIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:30:08.012674Z"},"content_sha256":"22a8aef21d395587b69bc3512853190d66f4aeb2002631dc51908c7a5ed7c23b","schema_version":"1.0","event_id":"sha256:22a8aef21d395587b69bc3512853190d66f4aeb2002631dc51908c7a5ed7c23b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BT2M5MCGQG6GKN7CAMJXSS4A2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Daryus Chandra, Dimitrios Alanis, Hung Viet Nguyen, Lajos Hanzo, Panagiotis Botsinis, Soon Xin Ng, Zunaira Babar","submitted_at":"2018-04-05T19:04:53Z","abstract_excerpt":"Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called Evolutionary Quantum Pareto Optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02387","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:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlIeTNMmoSdhHnbeAeqX6poWb+u9CUSAoWFrOQJS8R8E8X5NcQ26gc9hR0LfhdRdPk/Rvhblj+NBFvq14mF9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:30:08.013428Z"},"content_sha256":"0a8e6ccbd057cb0abb6daeb3e9f287d6786ddb03a886e63ea677900b7a0130af","schema_version":"1.0","event_id":"sha256:0a8e6ccbd057cb0abb6daeb3e9f287d6786ddb03a886e63ea677900b7a0130af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/bundle.json","state_url":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/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-05-24T04:30:08Z","links":{"resolver":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S","bundle":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/bundle.json","state":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BT2M5MCGQG6GKN7CAMJXSS4A2S","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":"3eb369f511adf25a497069808e935bc3cae7ab118c1f4edcb648808752e1517e","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T19:04:53Z","title_canon_sha256":"68c6051a64792efa4827253bb804ffad59edcc6b9b1ef3e225bf000d6139c5d6"},"schema_version":"1.0","source":{"id":"1804.02387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02387","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02387v1","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02387","created_at":"2026-05-18T00:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"BT2M5MCGQG6G","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BT2M5MCGQG6GKN7C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BT2M5MCG","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:0a8e6ccbd057cb0abb6daeb3e9f287d6786ddb03a886e63ea677900b7a0130af","target":"graph","created_at":"2026-05-18T00:19: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":"Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called Evolutionary Quantum Pareto Optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-pol","authors_text":"Daryus Chandra, Dimitrios Alanis, Hung Viet Nguyen, Lajos Hanzo, Panagiotis Botsinis, Soon Xin Ng, Zunaira Babar","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T19:04:53Z","title":"Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02387","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:22a8aef21d395587b69bc3512853190d66f4aeb2002631dc51908c7a5ed7c23b","target":"record","created_at":"2026-05-18T00:19: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":"3eb369f511adf25a497069808e935bc3cae7ab118c1f4edcb648808752e1517e","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T19:04:53Z","title_canon_sha256":"68c6051a64792efa4827253bb804ffad59edcc6b9b1ef3e225bf000d6139c5d6"},"schema_version":"1.0","source":{"id":"1804.02387","kind":"arxiv","version":1}},"canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","first_computed_at":"2026-05-18T00:19:01.855775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:01.855775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0zy9uzBOLKXlnEfmJ/UR1UaAlVRtjKCk3YdB7INXAnFxb7XVVaQsRskXNcUIB70H+pjKMvTz7JbJ05KzI7ccCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:01.856506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a8aef21d395587b69bc3512853190d66f4aeb2002631dc51908c7a5ed7c23b","sha256:0a8e6ccbd057cb0abb6daeb3e9f287d6786ddb03a886e63ea677900b7a0130af"],"state_sha256":"bea6b4b65ccc77f0c9e5ae71f535b36f72fe8c4ae0b6b1a4f48f054eb2751345"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBCPpa1cWHEnALG7gKhxIyWG3f/8NeMXHPuWSAIaNNIcOkOdiCI+7BHoSv67rBo5iyRVszwV8YKAIj6RaBL8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:30:08.017222Z","bundle_sha256":"2ab2f0f7a46103f2bdd5a91f0b90ed0123ed0dbdf1ed251675840c7f666a9bf1"}}