{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3DO6QSVPBTMMKT3AYUQF4OUQRP","short_pith_number":"pith:3DO6QSVP","schema_version":"1.0","canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","source":{"kind":"arxiv","id":"1301.7717","version":3},"attestation_state":"computed","paper":{"title":"Strong duality in conic linear programming: facial reduction and extended duals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor Pataki","submitted_at":"2013-01-31T19:06:10Z","abstract_excerpt":"The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \\sup {<c, x> | Ax \\leq_K b} $$ in the absence of any constraint qualification. The facial reduction algorithm solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz showed that these approaches are closely related; in particular, they proved the correctness of Ramana's dual using certificates from a fa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.7717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-31T19:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"d893b2e5a81f2220af1a0c640bcc6fa2d52b2fb170ce7ddf121491d68fdbb29d","abstract_canon_sha256":"63f64cad7c09a54c85a9e3c180a493c401d429ffbc31b09198a58dfaa89e3f17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:06.151041Z","signature_b64":"P307mAuPBP57c6KzYtFxv4sX9A99iXEWa0ZX/WdeOmE7qEi2FSnWBUYi+nicK2VDyDavs10TQ+lXChKIH7zPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","last_reissued_at":"2026-05-18T03:18:06.150308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:06.150308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong duality in conic linear programming: facial reduction and extended duals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor Pataki","submitted_at":"2013-01-31T19:06:10Z","abstract_excerpt":"The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \\sup {<c, x> | Ax \\leq_K b} $$ in the absence of any constraint qualification. The facial reduction algorithm solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz showed that these approaches are closely related; in particular, they proved the correctness of Ramana's dual using certificates from a fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7717","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.7717","created_at":"2026-05-18T03:18:06.150427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7717v3","created_at":"2026-05-18T03:18:06.150427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7717","created_at":"2026-05-18T03:18:06.150427+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DO6QSVPBTMM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DO6QSVPBTMMKT3A","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DO6QSVP","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP","json":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP.json","graph_json":"https://pith.science/api/pith-number/3DO6QSVPBTMMKT3AYUQF4OUQRP/graph.json","events_json":"https://pith.science/api/pith-number/3DO6QSVPBTMMKT3AYUQF4OUQRP/events.json","paper":"https://pith.science/paper/3DO6QSVP"},"agent_actions":{"view_html":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP","download_json":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP.json","view_paper":"https://pith.science/paper/3DO6QSVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7717&json=true","fetch_graph":"https://pith.science/api/pith-number/3DO6QSVPBTMMKT3AYUQF4OUQRP/graph.json","fetch_events":"https://pith.science/api/pith-number/3DO6QSVPBTMMKT3AYUQF4OUQRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/action/storage_attestation","attest_author":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/action/author_attestation","sign_citation":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/action/citation_signature","submit_replication":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/action/replication_record"}},"created_at":"2026-05-18T03:18:06.150427+00:00","updated_at":"2026-05-18T03:18:06.150427+00:00"}