{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZNLZAKEY7Y2J5DN6QJY22DMI2M","short_pith_number":"pith:ZNLZAKEY","canonical_record":{"source":{"id":"2211.06033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-11T07:09:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e1ccdf9e5746aba4a89eb3a408950df10dde458b05fd5003f3a01a9c4e996a46","abstract_canon_sha256":"86a74b9373b2ffc8fa41fe5e774601408b1e177b650555e6473f5c8ed71fdd90"},"schema_version":"1.0"},"canonical_sha256":"cb57902898fe349e8dbe8271ad0d88d3367b7c627715a07113d40cb170867a36","source":{"kind":"arxiv","id":"2211.06033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06033","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06033v1","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06033","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZNLZAKEY7Y2J","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_16","alias_value":"ZNLZAKEY7Y2J5DN6","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_8","alias_value":"ZNLZAKEY","created_at":"2026-07-05T05:15:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZNLZAKEY7Y2J5DN6QJY22DMI2M","target":"record","payload":{"canonical_record":{"source":{"id":"2211.06033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-11T07:09:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e1ccdf9e5746aba4a89eb3a408950df10dde458b05fd5003f3a01a9c4e996a46","abstract_canon_sha256":"86a74b9373b2ffc8fa41fe5e774601408b1e177b650555e6473f5c8ed71fdd90"},"schema_version":"1.0"},"canonical_sha256":"cb57902898fe349e8dbe8271ad0d88d3367b7c627715a07113d40cb170867a36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:16.420265Z","signature_b64":"sCVucuJaeWxR8u/8Vy1IuRRa6nAaJPK67nts4XJECXov/AB/ROmIdFUobtt4jJoFsYMGXZJCbXCKSjVY6w+ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb57902898fe349e8dbe8271ad0d88d3367b7c627715a07113d40cb170867a36","last_reissued_at":"2026-07-05T05:15:16.419854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:16.419854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.06033","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-05T05:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rH+79y4I1oleuC9HrOQd8nNrUAGO4yMuWVF+ccNfZDuEnb7GarfdIntWw5DO9M0K9raB8rLhsKNL7y6CKFcjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:47:55.002653Z"},"content_sha256":"0afc08f46202123dfc85d2e8d6345df86c5688699907edc61b5f556025801cb1","schema_version":"1.0","event_id":"sha256:0afc08f46202123dfc85d2e8d6345df86c5688699907edc61b5f556025801cb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZNLZAKEY7Y2J5DN6QJY22DMI2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Small Treewidth SDP Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Yuzhou Gu, Zhao Song","submitted_at":"2022-11-11T07:09:31Z","abstract_excerpt":"Semidefinite programming is a fundamental tool in optimization and theoretical computer science. It has been extensively used as a black-box for solving many problems, such as embedding, complexity, learning, and discrepancy.\n  One natural setting of semidefinite programming is the small treewidth setting. The best previous SDP solver under small treewidth setting is due to Zhang-Lavaei '18, which takes $n^{1.5} \\tau^{6.5}$ time. In this work, we show how to solve a semidefinite programming with $n \\times n$ variables, $m$ constraints and $\\tau$ treewidth in $n \\tau^{2\\omega+0.5}$ time, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06033","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/2211.06033/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-05T05:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTj100bPPgYGurPnQRpykLw+MugDvbnIlb0NQ+pESu8C/B0U23fj8ZDW/XGZQqFt5UF4j83Aj3sAgTrgJTLhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:47:55.003194Z"},"content_sha256":"8336118b015f6449c8ed3fcba83fe094a4885ee83d51c01a7af94b8170a70861","schema_version":"1.0","event_id":"sha256:8336118b015f6449c8ed3fcba83fe094a4885ee83d51c01a7af94b8170a70861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/bundle.json","state_url":"https://pith.science/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/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-09T08:47:55Z","links":{"resolver":"https://pith.science/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M","bundle":"https://pith.science/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/bundle.json","state":"https://pith.science/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNLZAKEY7Y2J5DN6QJY22DMI2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZNLZAKEY7Y2J5DN6QJY22DMI2M","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":"86a74b9373b2ffc8fa41fe5e774601408b1e177b650555e6473f5c8ed71fdd90","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-11T07:09:31Z","title_canon_sha256":"e1ccdf9e5746aba4a89eb3a408950df10dde458b05fd5003f3a01a9c4e996a46"},"schema_version":"1.0","source":{"id":"2211.06033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06033","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06033v1","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06033","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZNLZAKEY7Y2J","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_16","alias_value":"ZNLZAKEY7Y2J5DN6","created_at":"2026-07-05T05:15:16Z"},{"alias_kind":"pith_short_8","alias_value":"ZNLZAKEY","created_at":"2026-07-05T05:15:16Z"}],"graph_snapshots":[{"event_id":"sha256:8336118b015f6449c8ed3fcba83fe094a4885ee83d51c01a7af94b8170a70861","target":"graph","created_at":"2026-07-05T05:15:16Z","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.06033/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming is a fundamental tool in optimization and theoretical computer science. It has been extensively used as a black-box for solving many problems, such as embedding, complexity, learning, and discrepancy.\n  One natural setting of semidefinite programming is the small treewidth setting. The best previous SDP solver under small treewidth setting is due to Zhang-Lavaei '18, which takes $n^{1.5} \\tau^{6.5}$ time. In this work, we show how to solve a semidefinite programming with $n \\times n$ variables, $m$ constraints and $\\tau$ treewidth in $n \\tau^{2\\omega+0.5}$ time, where ","authors_text":"Yuzhou Gu, Zhao Song","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06033","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:0afc08f46202123dfc85d2e8d6345df86c5688699907edc61b5f556025801cb1","target":"record","created_at":"2026-07-05T05:15:16Z","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":"86a74b9373b2ffc8fa41fe5e774601408b1e177b650555e6473f5c8ed71fdd90","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-11T07:09:31Z","title_canon_sha256":"e1ccdf9e5746aba4a89eb3a408950df10dde458b05fd5003f3a01a9c4e996a46"},"schema_version":"1.0","source":{"id":"2211.06033","kind":"arxiv","version":1}},"canonical_sha256":"cb57902898fe349e8dbe8271ad0d88d3367b7c627715a07113d40cb170867a36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb57902898fe349e8dbe8271ad0d88d3367b7c627715a07113d40cb170867a36","first_computed_at":"2026-07-05T05:15:16.419854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:15:16.419854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCVucuJaeWxR8u/8Vy1IuRRa6nAaJPK67nts4XJECXov/AB/ROmIdFUobtt4jJoFsYMGXZJCbXCKSjVY6w+ZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:15:16.420265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.06033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0afc08f46202123dfc85d2e8d6345df86c5688699907edc61b5f556025801cb1","sha256:8336118b015f6449c8ed3fcba83fe094a4885ee83d51c01a7af94b8170a70861"],"state_sha256":"fbe061187db3decc7d08a5cb24468de2d8932ad1770552f4a00929a056aaf735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cy6lf5ln2IyrYHZzkXAlGAcRQbYR/8bkOV+yuASVl9cC5IO5uVXqJasypV29QHhIiR5SrPis5zf5KUXhLzUkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:47:55.007495Z","bundle_sha256":"811ee5d6c438729caa75a9658df0ee0a37d2c9c0e70451030043c5c300640a09"}}