{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M4S2QJYBCBLFQHXH2Z24DKZ4FB","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":"1677a29e48c5214cbb658e224fe09edb297f7bbf8de6cca84367db0c79a79b9c","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-23T11:35:47Z","title_canon_sha256":"3d3a7d8843d27b3331d212b1034f3e47033116e414430c46e07b196674b4c607"},"schema_version":"1.0","source":{"id":"2211.12880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12880","created_at":"2026-07-05T05:18:55Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12880v1","created_at":"2026-07-05T05:18:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12880","created_at":"2026-07-05T05:18:55Z"},{"alias_kind":"pith_short_12","alias_value":"M4S2QJYBCBLF","created_at":"2026-07-05T05:18:55Z"},{"alias_kind":"pith_short_16","alias_value":"M4S2QJYBCBLFQHXH","created_at":"2026-07-05T05:18:55Z"},{"alias_kind":"pith_short_8","alias_value":"M4S2QJYB","created_at":"2026-07-05T05:18:55Z"}],"graph_snapshots":[{"event_id":"sha256:4e0d5e4afff1c07b827f32c016647f95c32f39d872b73e07c8b15e78aacca09c","target":"graph","created_at":"2026-07-05T05:18:55Z","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/2211.12880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In maximum-likelihood quantum state tomography, both the sample size and dimension grow exponentially with the number of qubits. It is therefore desirable to develop a stochastic first-order method, just like stochastic gradient descent for modern machine learning, to compute the maximum-likelihood estimate. To this end, we propose an algorithm called stochastic mirror descent with the Burg entropy. Its expected optimization error vanishes at a $O ( \\sqrt{ ( 1 / t ) d \\log t } )$ rate, where $d$ and $t$ denote the dimension and number of iterations, respectively. Its per-iteration time complex","authors_text":"Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-23T11:35:47Z","title":"Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12880","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:8295cb43542d5861d6dc45c45cef1b3c5909e9085d9825f832d673c960e65d05","target":"record","created_at":"2026-07-05T05:18:55Z","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":"1677a29e48c5214cbb658e224fe09edb297f7bbf8de6cca84367db0c79a79b9c","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-23T11:35:47Z","title_canon_sha256":"3d3a7d8843d27b3331d212b1034f3e47033116e414430c46e07b196674b4c607"},"schema_version":"1.0","source":{"id":"2211.12880","kind":"arxiv","version":1}},"canonical_sha256":"6725a827011056581ee7d675c1ab3c284d09fbffb5dd0cf1dc74e0951ec890be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6725a827011056581ee7d675c1ab3c284d09fbffb5dd0cf1dc74e0951ec890be","first_computed_at":"2026-07-05T05:18:55.970263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:55.970263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YutLxrmKinJOgGd4S6esX0CaHWFs9gWFhZ3IJpvVdQvi2O8Frcr39AtO5fOALgietOy98kEznJttZgjtuEdmDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:55.970660Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.12880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8295cb43542d5861d6dc45c45cef1b3c5909e9085d9825f832d673c960e65d05","sha256:4e0d5e4afff1c07b827f32c016647f95c32f39d872b73e07c8b15e78aacca09c"],"state_sha256":"8c9d55e526e1ff7d858491ccb45736537feecab34585ae2d714dc5616e5b50a6"}