{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E2YTBDHUSHVHBFZJ6RA7FUUXNZ","short_pith_number":"pith:E2YTBDHU","canonical_record":{"source":{"id":"1108.5930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-30T11:49:16Z","cross_cats_sorted":["math.AG","math.OA"],"title_canon_sha256":"82b36b00fa5a9ace3343e94cad1019b211cc04f8ab16230f536383f4e765750d","abstract_canon_sha256":"19ca4a3b2b9d2b0facfd7e7b0f81918839efc552eabf072705445241a169267a"},"schema_version":"1.0"},"canonical_sha256":"26b1308cf491ea709729f441f2d2976e4b9a6c53ca4e7ad5de6b361cefdcfc45","source":{"kind":"arxiv","id":"1108.5930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5930","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5930v1","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5930","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"E2YTBDHUSHVH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E2YTBDHUSHVHBFZJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E2YTBDHU","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E2YTBDHUSHVHBFZJ6RA7FUUXNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-30T11:49:16Z","cross_cats_sorted":["math.AG","math.OA"],"title_canon_sha256":"82b36b00fa5a9ace3343e94cad1019b211cc04f8ab16230f536383f4e765750d","abstract_canon_sha256":"19ca4a3b2b9d2b0facfd7e7b0f81918839efc552eabf072705445241a169267a"},"schema_version":"1.0"},"canonical_sha256":"26b1308cf491ea709729f441f2d2976e4b9a6c53ca4e7ad5de6b361cefdcfc45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:11.417875Z","signature_b64":"gStT8gfWl+nFQROngh569aRF8c5RfjoZJWcbExDczPTQRX9OwlS4iGvRm79rVy3ViyL5TNfGxszDG5s20QeuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b1308cf491ea709729f441f2d2976e4b9a6c53ca4e7ad5de6b361cefdcfc45","last_reissued_at":"2026-05-18T04:01:11.417282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:11.417282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5930","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-18T04:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UXz6VaiA0u3E33Nv7JiR6aTR+5z+dWAZE2m3hE0Zyq6SMHGSnrHIq16yQIss+h9iwFibcBLSZoUAO+u8vZFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:10:14.972711Z"},"content_sha256":"e57957dc6ec31c6b5a6b453cf84d7307bf011f661be8c547024947e2735317b1","schema_version":"1.0","event_id":"sha256:e57957dc6ec31c6b5a6b453cf84d7307bf011f661be8c547024947e2735317b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E2YTBDHUSHVHBFZJ6RA7FUUXNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infeasibility certificates for linear matrix inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.OA"],"primary_cat":"math.OC","authors_text":"Igor Klep, Markus Schweighofer","submitted_at":"2011-08-30T11:49:16Z","abstract_excerpt":"Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. More precisely, we show that a linear matrix inequality is infeasible if and only if -1 lies in the quadratic module associated to it. We prove exponential degree bounds for the corresponding algebraic cert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5930","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-18T04:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r598ezsououinTCT5PzFFGdoOshcV2E1lXMavFQ7Moz8L02ycnQjr9jNUtuqt3vWD4XGDTjD/vT/JJYmxSYvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:10:14.973464Z"},"content_sha256":"f059e1af56972ebefd4d6f324f570f33f053a86e2769294271e84c0bb15a9747","schema_version":"1.0","event_id":"sha256:f059e1af56972ebefd4d6f324f570f33f053a86e2769294271e84c0bb15a9747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/bundle.json","state_url":"https://pith.science/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/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-11T22:10:14Z","links":{"resolver":"https://pith.science/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ","bundle":"https://pith.science/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/bundle.json","state":"https://pith.science/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2YTBDHUSHVHBFZJ6RA7FUUXNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E2YTBDHUSHVHBFZJ6RA7FUUXNZ","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":"19ca4a3b2b9d2b0facfd7e7b0f81918839efc552eabf072705445241a169267a","cross_cats_sorted":["math.AG","math.OA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-30T11:49:16Z","title_canon_sha256":"82b36b00fa5a9ace3343e94cad1019b211cc04f8ab16230f536383f4e765750d"},"schema_version":"1.0","source":{"id":"1108.5930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5930","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5930v1","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5930","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"E2YTBDHUSHVH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E2YTBDHUSHVHBFZJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E2YTBDHU","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:f059e1af56972ebefd4d6f324f570f33f053a86e2769294271e84c0bb15a9747","target":"graph","created_at":"2026-05-18T04:01:11Z","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":"Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. More precisely, we show that a linear matrix inequality is infeasible if and only if -1 lies in the quadratic module associated to it. We prove exponential degree bounds for the corresponding algebraic cert","authors_text":"Igor Klep, Markus Schweighofer","cross_cats":["math.AG","math.OA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-30T11:49:16Z","title":"Infeasibility certificates for linear matrix inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5930","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:e57957dc6ec31c6b5a6b453cf84d7307bf011f661be8c547024947e2735317b1","target":"record","created_at":"2026-05-18T04:01:11Z","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":"19ca4a3b2b9d2b0facfd7e7b0f81918839efc552eabf072705445241a169267a","cross_cats_sorted":["math.AG","math.OA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-30T11:49:16Z","title_canon_sha256":"82b36b00fa5a9ace3343e94cad1019b211cc04f8ab16230f536383f4e765750d"},"schema_version":"1.0","source":{"id":"1108.5930","kind":"arxiv","version":1}},"canonical_sha256":"26b1308cf491ea709729f441f2d2976e4b9a6c53ca4e7ad5de6b361cefdcfc45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26b1308cf491ea709729f441f2d2976e4b9a6c53ca4e7ad5de6b361cefdcfc45","first_computed_at":"2026-05-18T04:01:11.417282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:11.417282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gStT8gfWl+nFQROngh569aRF8c5RfjoZJWcbExDczPTQRX9OwlS4iGvRm79rVy3ViyL5TNfGxszDG5s20QeuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:11.417875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e57957dc6ec31c6b5a6b453cf84d7307bf011f661be8c547024947e2735317b1","sha256:f059e1af56972ebefd4d6f324f570f33f053a86e2769294271e84c0bb15a9747"],"state_sha256":"09f2f8dfa8075820e0ba6cbac40e589248cb993e9cac1f9b65ffe4e6f7cef024"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvO06R83s5vSFlgrYzKUtar2WgcNmjZy3cWitd8lSMK8zo0umiDrcbF531zV7qObLUAHOMZ3lImvKc8sv0OHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:10:14.977502Z","bundle_sha256":"fffd3b629961a9485a1c6b5af533284c289110eb23a1c018c8cd38c83765ed52"}}