{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XYDAIBHIJNWVQQ5RGLS6OR5FD4","short_pith_number":"pith:XYDAIBHI","canonical_record":{"source":{"id":"1901.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"title_canon_sha256":"8a98a875e274ae367a26abb023bf8b6817a94277822abbeb6b7b56757cf49a2c","abstract_canon_sha256":"4fe59f67649ff0a0e5a999a12b826458dcb7bf92c6fc9850fbf477e45a3262f8"},"schema_version":"1.0"},"canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","source":{"kind":"arxiv","id":"1901.03254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03254","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03254v2","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03254","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"XYDAIBHIJNWV","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_16","alias_value":"XYDAIBHIJNWVQQ5R","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_8","alias_value":"XYDAIBHI","created_at":"2026-07-05T01:25:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XYDAIBHIJNWVQQ5RGLS6OR5FD4","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"title_canon_sha256":"8a98a875e274ae367a26abb023bf8b6817a94277822abbeb6b7b56757cf49a2c","abstract_canon_sha256":"4fe59f67649ff0a0e5a999a12b826458dcb7bf92c6fc9850fbf477e45a3262f8"},"schema_version":"1.0"},"canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:01.240913Z","signature_b64":"b10TO196pe3ldDg8Sp4wkgH66yM5I1Rjt6bal4PEls7G4vh01rpViGgJdRP+HdzZ2H8wYVYY13BK0Prs4wMPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","last_reissued_at":"2026-07-05T01:25:01.240390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:01.240390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03254","source_version":2,"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-05T01:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Elej1L4puzkiY80udEsxS5Q/Kh2jN7SjlAfsXGOAumM58UaBXB52MXr4Q77D0LNsIbs6+GxD8BLWW+xU+B7ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:31:23.001769Z"},"content_sha256":"5650ae9543c3e9a5cb7cfea5fdd840fd03b0f756fe02eded7e23177bcadb4953","schema_version":"1.0","event_id":"sha256:5650ae9543c3e9a5cb7cfea5fdd840fd03b0f756fe02eded7e23177bcadb4953"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XYDAIBHIJNWVQQ5RGLS6OR5FD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia, Tongyang Li","submitted_at":"2019-01-10T16:26:15Z","abstract_excerpt":"Semidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. In this paper, we present a proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension $n$ and rank $r$, our algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix. The algorithm runs in time $O(m\\cdot\\mathrm{poly}(\\log n,r,1/\\varepsilon))$ given access to a sampling-based low-overhead data structure for the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03254","kind":"arxiv","version":2},"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/1901.03254/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-05T01:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUGVCEsleS1BBj/cpd0eVzZy4HRRz0Yn8YKJxYYOYdFgY6ksFaB0Vdcrc4dnqIkY6r/iBYmhuq1DYLOs+FFcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:31:23.002664Z"},"content_sha256":"4c7857a6dbbdd7d5acfbf07a12ed1b6ae4778b127c4adbe235220366a60a4ce4","schema_version":"1.0","event_id":"sha256:4c7857a6dbbdd7d5acfbf07a12ed1b6ae4778b127c4adbe235220366a60a4ce4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/bundle.json","state_url":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/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-04T05:31:23Z","links":{"resolver":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4","bundle":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/bundle.json","state":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XYDAIBHIJNWVQQ5RGLS6OR5FD4","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":"4fe59f67649ff0a0e5a999a12b826458dcb7bf92c6fc9850fbf477e45a3262f8","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","title_canon_sha256":"8a98a875e274ae367a26abb023bf8b6817a94277822abbeb6b7b56757cf49a2c"},"schema_version":"1.0","source":{"id":"1901.03254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03254","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03254v2","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03254","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"XYDAIBHIJNWV","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_16","alias_value":"XYDAIBHIJNWVQQ5R","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_8","alias_value":"XYDAIBHI","created_at":"2026-07-05T01:25:01Z"}],"graph_snapshots":[{"event_id":"sha256:4c7857a6dbbdd7d5acfbf07a12ed1b6ae4778b127c4adbe235220366a60a4ce4","target":"graph","created_at":"2026-07-05T01:25: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.03254/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. In this paper, we present a proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension $n$ and rank $r$, our algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix. The algorithm runs in time $O(m\\cdot\\mathrm{poly}(\\log n,r,1/\\varepsilon))$ given access to a sampling-based low-overhead data structure for the c","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia, Tongyang Li","cross_cats":["cs.LG","math.OC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","title":"Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03254","kind":"arxiv","version":2},"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:5650ae9543c3e9a5cb7cfea5fdd840fd03b0f756fe02eded7e23177bcadb4953","target":"record","created_at":"2026-07-05T01:25: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":"4fe59f67649ff0a0e5a999a12b826458dcb7bf92c6fc9850fbf477e45a3262f8","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","title_canon_sha256":"8a98a875e274ae367a26abb023bf8b6817a94277822abbeb6b7b56757cf49a2c"},"schema_version":"1.0","source":{"id":"1901.03254","kind":"arxiv","version":2}},"canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","first_computed_at":"2026-07-05T01:25:01.240390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:01.240390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b10TO196pe3ldDg8Sp4wkgH66yM5I1Rjt6bal4PEls7G4vh01rpViGgJdRP+HdzZ2H8wYVYY13BK0Prs4wMPAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:01.240913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5650ae9543c3e9a5cb7cfea5fdd840fd03b0f756fe02eded7e23177bcadb4953","sha256:4c7857a6dbbdd7d5acfbf07a12ed1b6ae4778b127c4adbe235220366a60a4ce4"],"state_sha256":"8abfae79a5ee797b3bb5842cf7b142accf82f6ffb3db1bf3b4d84e95efd4bb9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXqHB0FtjrinsPaNMNrOeOs+a18L4DK4Y9Ea1jtIW5u9MGvLS41MzkWyCDHLlMNtFdYDxlloM2HiPeIypPKyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:31:23.009754Z","bundle_sha256":"6f873838e36ebb40c9b80e5368e6c282f415b175f8e67a0fefc7575161548b31"}}