{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ETZVJBJ4GFIV7JZLZEXZRECQPN","short_pith_number":"pith:ETZVJBJ4","canonical_record":{"source":{"id":"1608.02300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-08T02:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"2e2bfb3802ad1971c064147ec6b15b50e86190639117602624aaf4c8d3bf3446","abstract_canon_sha256":"ce0b80bea863c50ebae77cdbaedc6962a6cc3602accf98d07a5e3b5e224ba35d"},"schema_version":"1.0"},"canonical_sha256":"24f354853c31515fa72bc92f9890507b49e4a25d854540532caefe4350fd6358","source":{"kind":"arxiv","id":"1608.02300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02300","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02300v1","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02300","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"ETZVJBJ4GFIV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETZVJBJ4GFIV7JZL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETZVJBJ4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ETZVJBJ4GFIV7JZLZEXZRECQPN","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-08T02:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"2e2bfb3802ad1971c064147ec6b15b50e86190639117602624aaf4c8d3bf3446","abstract_canon_sha256":"ce0b80bea863c50ebae77cdbaedc6962a6cc3602accf98d07a5e3b5e224ba35d"},"schema_version":"1.0"},"canonical_sha256":"24f354853c31515fa72bc92f9890507b49e4a25d854540532caefe4350fd6358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:40.537558Z","signature_b64":"YKa3dA+40VpVbF+k0fiiYdiHL3B1urDHLOCmNOM1jhw9HFpwpxr74tvttDmFwxTVsrjCt1GQeoYE5Po3p9xcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f354853c31515fa72bc92f9890507b49e4a25d854540532caefe4350fd6358","last_reissued_at":"2026-05-18T01:09:40.537139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:40.537139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02300","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-05-18T01:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umqlQ6Thte7QHP8BSB57o8k2oiCIhkL9KvSSm4HpZqMwaFcGzJ7ua8ZkWqvtM4FO2eXfSZpgZvxM1Cavlv44AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:30.093132Z"},"content_sha256":"f899143a8f2472cb2a9adf64d40c0a673a3ad1b268e994e081eeee947e87a93c","schema_version":"1.0","event_id":"sha256:f899143a8f2472cb2a9adf64d40c0a673a3ad1b268e994e081eeee947e87a93c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ETZVJBJ4GFIV7JZLZEXZRECQPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple preprocessing algorithm for semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor Pataki, Preston Faulk, Quoc Tran-Dinh","submitted_at":"2016-08-08T02:34:45Z","abstract_excerpt":"We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It often detects infeasibility. Our algorithm does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be implemented with a few lines of code in machine precision. We present computational results on a set of problems arising mostly from polynomial optimization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02300","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":""},"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-05-18T01:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sK7SvudeFvE08j88zP1hs4KelIksO3x/I4y+6mhM0BsgicXxUgzvT/utk4hm7QYQlQLU8T0hIpzxjnqrcUpACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:30.093542Z"},"content_sha256":"3a9398a884ddd9ef2094b8da3c1cd55de986349237a2c897a8273a724ecb9b07","schema_version":"1.0","event_id":"sha256:3a9398a884ddd9ef2094b8da3c1cd55de986349237a2c897a8273a724ecb9b07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/bundle.json","state_url":"https://pith.science/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/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-06-05T04:51:30Z","links":{"resolver":"https://pith.science/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN","bundle":"https://pith.science/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/bundle.json","state":"https://pith.science/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETZVJBJ4GFIV7JZLZEXZRECQPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ETZVJBJ4GFIV7JZLZEXZRECQPN","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":"ce0b80bea863c50ebae77cdbaedc6962a6cc3602accf98d07a5e3b5e224ba35d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-08T02:34:45Z","title_canon_sha256":"2e2bfb3802ad1971c064147ec6b15b50e86190639117602624aaf4c8d3bf3446"},"schema_version":"1.0","source":{"id":"1608.02300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02300","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02300v1","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02300","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"ETZVJBJ4GFIV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETZVJBJ4GFIV7JZL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETZVJBJ4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:3a9398a884ddd9ef2094b8da3c1cd55de986349237a2c897a8273a724ecb9b07","target":"graph","created_at":"2026-05-18T01:09:40Z","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 propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It often detects infeasibility. Our algorithm does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be implemented with a few lines of code in machine precision. We present computational results on a set of problems arising mostly from polynomial optimization.","authors_text":"Gabor Pataki, Preston Faulk, Quoc Tran-Dinh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-08T02:34:45Z","title":"A simple preprocessing algorithm for semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02300","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:f899143a8f2472cb2a9adf64d40c0a673a3ad1b268e994e081eeee947e87a93c","target":"record","created_at":"2026-05-18T01:09:40Z","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":"ce0b80bea863c50ebae77cdbaedc6962a6cc3602accf98d07a5e3b5e224ba35d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-08T02:34:45Z","title_canon_sha256":"2e2bfb3802ad1971c064147ec6b15b50e86190639117602624aaf4c8d3bf3446"},"schema_version":"1.0","source":{"id":"1608.02300","kind":"arxiv","version":1}},"canonical_sha256":"24f354853c31515fa72bc92f9890507b49e4a25d854540532caefe4350fd6358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f354853c31515fa72bc92f9890507b49e4a25d854540532caefe4350fd6358","first_computed_at":"2026-05-18T01:09:40.537139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:40.537139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKa3dA+40VpVbF+k0fiiYdiHL3B1urDHLOCmNOM1jhw9HFpwpxr74tvttDmFwxTVsrjCt1GQeoYE5Po3p9xcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:40.537558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f899143a8f2472cb2a9adf64d40c0a673a3ad1b268e994e081eeee947e87a93c","sha256:3a9398a884ddd9ef2094b8da3c1cd55de986349237a2c897a8273a724ecb9b07"],"state_sha256":"fc00f08649ad4f9dfcb860bd08d539e9da004a2545216688848933f0e76f89bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yw35ZBc1tE6+n0hnxmPQAUaEexppyDsqO5eWIvTsjWs0VXnypr1vNlJHbjyZbIb7t9nEGXWuau5dwLZ1D1jxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:51:30.096513Z","bundle_sha256":"5e9402a13ca7fcb3da217720f206de62cfbb89cd9b70818b1882076d6958e38b"}}