{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SDHGEF2QNL2F3PBTOKF2EVUWGA","short_pith_number":"pith:SDHGEF2Q","canonical_record":{"source":{"id":"2412.15977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T15:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"7f58e0708bf2a215f472dffe3b952d6962050f2243dd55f57b7e0847e8c76ec7","abstract_canon_sha256":"aad5c0e207a63035551f0f1251e9f0bb198bd95b9e3fcc4ee99dc15f46e01403"},"schema_version":"1.0"},"canonical_sha256":"90ce6217506af45dbc33728ba256963026ae6f6ce1d372df6837e9d755e81bdb","source":{"kind":"arxiv","id":"2412.15977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15977","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15977v1","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15977","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"SDHGEF2QNL2F","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_16","alias_value":"SDHGEF2QNL2F3PBT","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_8","alias_value":"SDHGEF2Q","created_at":"2026-07-05T09:52:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SDHGEF2QNL2F3PBTOKF2EVUWGA","target":"record","payload":{"canonical_record":{"source":{"id":"2412.15977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T15:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"7f58e0708bf2a215f472dffe3b952d6962050f2243dd55f57b7e0847e8c76ec7","abstract_canon_sha256":"aad5c0e207a63035551f0f1251e9f0bb198bd95b9e3fcc4ee99dc15f46e01403"},"schema_version":"1.0"},"canonical_sha256":"90ce6217506af45dbc33728ba256963026ae6f6ce1d372df6837e9d755e81bdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:32.921990Z","signature_b64":"y2kF59qayxeELm+c90UUIrSBNiu1u1bxrOYfFGSYrGD9o271bZqtwv02SX6Y2rQOesumqoVMCirsrF9fcyInDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ce6217506af45dbc33728ba256963026ae6f6ce1d372df6837e9d755e81bdb","last_reissued_at":"2026-07-05T09:52:32.921613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:32.921613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.15977","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-07-05T09:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IrTczqP97e8wNR2S9V30RPeNfUuJ1aYZf6P3+NCoEv/+3BgNfLFusUUKNLat40VfnEb8CTDBR0HJwhjsMkDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:52:59.617674Z"},"content_sha256":"ad31a1f0e75091c47931c0baf508dda7796151d0fd7dbb3e0ac7ec6599204989","schema_version":"1.0","event_id":"sha256:ad31a1f0e75091c47931c0baf508dda7796151d0fd7dbb3e0ac7ec6599204989"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SDHGEF2QNL2F3PBTOKF2EVUWGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum dual logarithmic barrier method for linear optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mohammadhossein Mohammadisiahroudi, Pouya Sampourmahani, Tam\\'as Terlaky, Zeguan Wu","submitted_at":"2024-12-20T15:20:24Z","abstract_excerpt":"Quantum computing has the potential to speed up some optimization methods. One can use quantum computers to solve linear systems via Quantum Linear System Algorithms (QLSAs). QLSAs can be used as a subroutine for algorithms that require solving linear systems, such as the dual logarithmic barrier method (DLBM) for solving linear optimization (LO) problems. In this paper, we use a QLSA to solve the linear systems arising in each iteration of the DLBM. To use the QLSA in a hybrid setting, we read out quantum states via a tomography procedure which introduces considerable error and noise. Thus, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15977","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.15977/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSMG5u6tk/eAQvEcS+xR+HjE9Dq4H6gCduCqYTBWN0RERUGMt0Qu715Khts43yqHO4NT5mvC8xVAt4Csims4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:52:59.618567Z"},"content_sha256":"9bce357d44d8d64e848f18ed0b19f9362c1a3250068ded433d8b1ab4e812b8f7","schema_version":"1.0","event_id":"sha256:9bce357d44d8d64e848f18ed0b19f9362c1a3250068ded433d8b1ab4e812b8f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/bundle.json","state_url":"https://pith.science/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/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-08-12T17:52:59Z","links":{"resolver":"https://pith.science/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA","bundle":"https://pith.science/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/bundle.json","state":"https://pith.science/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDHGEF2QNL2F3PBTOKF2EVUWGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SDHGEF2QNL2F3PBTOKF2EVUWGA","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":"aad5c0e207a63035551f0f1251e9f0bb198bd95b9e3fcc4ee99dc15f46e01403","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T15:20:24Z","title_canon_sha256":"7f58e0708bf2a215f472dffe3b952d6962050f2243dd55f57b7e0847e8c76ec7"},"schema_version":"1.0","source":{"id":"2412.15977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15977","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15977v1","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15977","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"SDHGEF2QNL2F","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_16","alias_value":"SDHGEF2QNL2F3PBT","created_at":"2026-07-05T09:52:32Z"},{"alias_kind":"pith_short_8","alias_value":"SDHGEF2Q","created_at":"2026-07-05T09:52:32Z"}],"graph_snapshots":[{"event_id":"sha256:9bce357d44d8d64e848f18ed0b19f9362c1a3250068ded433d8b1ab4e812b8f7","target":"graph","created_at":"2026-07-05T09:52:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.15977/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing has the potential to speed up some optimization methods. One can use quantum computers to solve linear systems via Quantum Linear System Algorithms (QLSAs). QLSAs can be used as a subroutine for algorithms that require solving linear systems, such as the dual logarithmic barrier method (DLBM) for solving linear optimization (LO) problems. In this paper, we use a QLSA to solve the linear systems arising in each iteration of the DLBM. To use the QLSA in a hybrid setting, we read out quantum states via a tomography procedure which introduces considerable error and noise. Thus, t","authors_text":"Mohammadhossein Mohammadisiahroudi, Pouya Sampourmahani, Tam\\'as Terlaky, Zeguan Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T15:20:24Z","title":"A quantum dual logarithmic barrier method for linear optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15977","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:ad31a1f0e75091c47931c0baf508dda7796151d0fd7dbb3e0ac7ec6599204989","target":"record","created_at":"2026-07-05T09:52:32Z","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":"aad5c0e207a63035551f0f1251e9f0bb198bd95b9e3fcc4ee99dc15f46e01403","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T15:20:24Z","title_canon_sha256":"7f58e0708bf2a215f472dffe3b952d6962050f2243dd55f57b7e0847e8c76ec7"},"schema_version":"1.0","source":{"id":"2412.15977","kind":"arxiv","version":1}},"canonical_sha256":"90ce6217506af45dbc33728ba256963026ae6f6ce1d372df6837e9d755e81bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90ce6217506af45dbc33728ba256963026ae6f6ce1d372df6837e9d755e81bdb","first_computed_at":"2026-07-05T09:52:32.921613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:52:32.921613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2kF59qayxeELm+c90UUIrSBNiu1u1bxrOYfFGSYrGD9o271bZqtwv02SX6Y2rQOesumqoVMCirsrF9fcyInDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:52:32.921990Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.15977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad31a1f0e75091c47931c0baf508dda7796151d0fd7dbb3e0ac7ec6599204989","sha256:9bce357d44d8d64e848f18ed0b19f9362c1a3250068ded433d8b1ab4e812b8f7"],"state_sha256":"e5135d6919eec7f9c984991966bd84b6fa4662cd2ebfcbd7f4fe87783e1b12fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcP4Z1A5p5pqy3izLvxezHuGmB73kZbKkZBvtriPM+BqljZFZYbBNwr5rTWFI0bBPFy0ZCBTVaXpmDpnZzitAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T17:52:59.624746Z","bundle_sha256":"023d2605abff33e891cf57f664b3cc4744c2a4ea87fabc31973ef0e9ece40a73"}}