{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ERSUXTJR4BYEWPREJYQGIJSZPS","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":"b46e01e9c56aa394e3317a7a7da70d7bfccb99c74ea314fb4d99be64fbc8c8a0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-26T10:20:28Z","title_canon_sha256":"8dd64c83456484c0774293fd2f9de9cc3b87ecb5fe825a37d02818c13fddb97d"},"schema_version":"1.0","source":{"id":"1208.5211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5211","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5211v1","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5211","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"ERSUXTJR4BYE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ERSUXTJR4BYEWPRE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ERSUXTJR","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:c0b8f256f9f07574ee6412f68ab4966800867a5c5f47a5230ad5f5841d2a6a53","target":"graph","created_at":"2026-05-18T03:47:00Z","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"},"paper":{"abstract_excerpt":"We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We also present lower bounds that show our algorithm to have a nearly optimal running time.","authors_text":"Dan Garber, Elad Hazan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-26T10:20:28Z","title":"Almost Optimal Sublinear Time Algorithm for Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5211","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:1ff06d875a0780c534bad2053f061ce2867a599b269fce169b567f94aa4fc74f","target":"record","created_at":"2026-05-18T03:47:00Z","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":"b46e01e9c56aa394e3317a7a7da70d7bfccb99c74ea314fb4d99be64fbc8c8a0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-26T10:20:28Z","title_canon_sha256":"8dd64c83456484c0774293fd2f9de9cc3b87ecb5fe825a37d02818c13fddb97d"},"schema_version":"1.0","source":{"id":"1208.5211","kind":"arxiv","version":1}},"canonical_sha256":"24654bcd31e0704b3e244e206426597c958b2d7fbfc9bacc42a97a6970176ef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24654bcd31e0704b3e244e206426597c958b2d7fbfc9bacc42a97a6970176ef3","first_computed_at":"2026-05-18T03:47:00.143839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:00.143839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qlJ1Yj2fhlu5taG5mT8B0HVbi8cZVdsa4oV93Z5ocgY6psa65V4N+nsuGhMzmeqY2NsJz0ZLSpyYeDavh6QvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:00.144477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ff06d875a0780c534bad2053f061ce2867a599b269fce169b567f94aa4fc74f","sha256:c0b8f256f9f07574ee6412f68ab4966800867a5c5f47a5230ad5f5841d2a6a53"],"state_sha256":"f1db33c660fe42a39b568c4c20ebbb0ec3e88c3f3d5837951ffd7b339c33297c"}