{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BT2M5MCGQG6GKN7CAMJXSS4A2S","short_pith_number":"pith:BT2M5MCG","schema_version":"1.0","canonical_sha256":"0cf4ceb04681bc6537e20313794b80d4ac284381373b15ce3dff92a16d6166a2","source":{"kind":"arxiv","id":"1804.02387","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.02387","created_at":"2026-05-18T00:19:01.855904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02387v1","created_at":"2026-05-18T00:19:01.855904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02387","created_at":"2026-05-18T00:19:01.855904+00:00"},{"alias_kind":"pith_short_12","alias_value":"BT2M5MCGQG6G","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BT2M5MCGQG6GKN7C","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BT2M5MCG","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S","json":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S.json","graph_json":"https://pith.science/api/pith-number/BT2M5MCGQG6GKN7CAMJXSS4A2S/graph.json","events_json":"https://pith.science/api/pith-number/BT2M5MCGQG6GKN7CAMJXSS4A2S/events.json","paper":"https://pith.science/paper/BT2M5MCG"},"agent_actions":{"view_html":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S","download_json":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S.json","view_paper":"https://pith.science/paper/BT2M5MCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02387&json=true","fetch_graph":"https://pith.science/api/pith-number/BT2M5MCGQG6GKN7CAMJXSS4A2S/graph.json","fetch_events":"https://pith.science/api/pith-number/BT2M5MCGQG6GKN7CAMJXSS4A2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/action/storage_attestation","attest_author":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/action/author_attestation","sign_citation":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/action/citation_signature","submit_replication":"https://pith.science/pith/BT2M5MCGQG6GKN7CAMJXSS4A2S/action/replication_record"}},"created_at":"2026-05-18T00:19:01.855904+00:00","updated_at":"2026-05-18T00:19:01.855904+00:00"}