{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3DO6QSVPBTMMKT3AYUQF4OUQRP","short_pith_number":"pith:3DO6QSVP","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"},"canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","source":{"kind":"arxiv","id":"1301.7717","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7717","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7717v3","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7717","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"3DO6QSVPBTMM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DO6QSVPBTMMKT3A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DO6QSVP","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3DO6QSVPBTMMKT3AYUQF4OUQRP","target":"record","payload":{"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"},"canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","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"},"source_kind":"arxiv","source_id":"1301.7717","source_version":3,"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-18T03:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f59ntIEsneigO5VRoWx1VDP3ZoENCBtk9i9RHTktWXNa5bemL0j/5heSCOD+MunsQNwbS1AqBG1Pew+ukmPiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:09:47.388600Z"},"content_sha256":"37c7992a8e302a13ba8898bb5d22ff130a5b0beeebd0184e74d953d2a2a0db7d","schema_version":"1.0","event_id":"sha256:37c7992a8e302a13ba8898bb5d22ff130a5b0beeebd0184e74d953d2a2a0db7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3DO6QSVPBTMMKT3AYUQF4OUQRP","target":"graph","payload":{"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"},"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-18T03:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTb/Q86eSgXht0cDfY8kQusgCw2C/qGEZE92uqi/ii7cIak+IlSMQnywTtDkameahAoDdO59P5XOI/R3jZGKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:09:47.388948Z"},"content_sha256":"1fbaac49086f520dba67f7421aa9ca7eebd5afdc8ea752d41542aabd18f4a95a","schema_version":"1.0","event_id":"sha256:1fbaac49086f520dba67f7421aa9ca7eebd5afdc8ea752d41542aabd18f4a95a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/bundle.json","state_url":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/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-04T21:09:47Z","links":{"resolver":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP","bundle":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/bundle.json","state":"https://pith.science/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DO6QSVPBTMMKT3AYUQF4OUQRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3DO6QSVPBTMMKT3AYUQF4OUQRP","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":"63f64cad7c09a54c85a9e3c180a493c401d429ffbc31b09198a58dfaa89e3f17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-31T19:06:10Z","title_canon_sha256":"d893b2e5a81f2220af1a0c640bcc6fa2d52b2fb170ce7ddf121491d68fdbb29d"},"schema_version":"1.0","source":{"id":"1301.7717","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7717","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7717v3","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7717","created_at":"2026-05-18T03:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"3DO6QSVPBTMM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DO6QSVPBTMMKT3A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DO6QSVP","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:1fbaac49086f520dba67f7421aa9ca7eebd5afdc8ea752d41542aabd18f4a95a","target":"graph","created_at":"2026-05-18T03:18:06Z","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":"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","authors_text":"Gabor Pataki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-31T19:06:10Z","title":"Strong duality in conic linear programming: facial reduction and extended duals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7717","kind":"arxiv","version":3},"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:37c7992a8e302a13ba8898bb5d22ff130a5b0beeebd0184e74d953d2a2a0db7d","target":"record","created_at":"2026-05-18T03:18:06Z","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":"63f64cad7c09a54c85a9e3c180a493c401d429ffbc31b09198a58dfaa89e3f17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-31T19:06:10Z","title_canon_sha256":"d893b2e5a81f2220af1a0c640bcc6fa2d52b2fb170ce7ddf121491d68fdbb29d"},"schema_version":"1.0","source":{"id":"1301.7717","kind":"arxiv","version":3}},"canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8dde84aaf0cd8c54f60c5205e3a908bca72b2f1c0f104eaa7cdbd3c39113538","first_computed_at":"2026-05-18T03:18:06.150308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:06.150308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P307mAuPBP57c6KzYtFxv4sX9A99iXEWa0ZX/WdeOmE7qEi2FSnWBUYi+nicK2VDyDavs10TQ+lXChKIH7zPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:06.151041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7717","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37c7992a8e302a13ba8898bb5d22ff130a5b0beeebd0184e74d953d2a2a0db7d","sha256:1fbaac49086f520dba67f7421aa9ca7eebd5afdc8ea752d41542aabd18f4a95a"],"state_sha256":"67db4228744275e1023d1c151c30f401b8617432d782475a1323a46f269d6a44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FM9OEmpKq6w1/8zVz7sOQaUtcrSAte2b6dfqBCjEn8pHnUNU9tit/iktiXtd9SDMey8VesI+3+LmTb2IrUghAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:09:47.391007Z","bundle_sha256":"bc989bd664023f200af909ee1788b167708a4cd39443fd28dac3a3ea43d71de8"}}