{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7XQFE7RA2RHAAHYZ5FR7XVYUML","short_pith_number":"pith:7XQFE7RA","canonical_record":{"source":{"id":"1509.05168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-17T08:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"f5833dad3d6b6dc1ef07ef55d1c029fa6be4e24384a72205a6aae04378c0065b","abstract_canon_sha256":"71a6f871a6b06f751c344b9c70734d8150f745b45bff5c010e262b3999610aae"},"schema_version":"1.0"},"canonical_sha256":"fde0527e20d44e001f19e963fbd71462fc41dbc0132eb3d6eecf5ac9b229ab34","source":{"kind":"arxiv","id":"1509.05168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05168","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05168v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05168","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"7XQFE7RA2RHA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XQFE7RA2RHAAHYZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XQFE7RA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7XQFE7RA2RHAAHYZ5FR7XVYUML","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-17T08:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"f5833dad3d6b6dc1ef07ef55d1c029fa6be4e24384a72205a6aae04378c0065b","abstract_canon_sha256":"71a6f871a6b06f751c344b9c70734d8150f745b45bff5c010e262b3999610aae"},"schema_version":"1.0"},"canonical_sha256":"fde0527e20d44e001f19e963fbd71462fc41dbc0132eb3d6eecf5ac9b229ab34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:49.713307Z","signature_b64":"6lQ1oKLtbSmvZ4ImgiMXZYkD32tArGk/nFVOLf3rBegSAX3NolImbpHFHv0kvRrndwx7GTMIqn971hUpCSmyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fde0527e20d44e001f19e963fbd71462fc41dbc0132eb3d6eecf5ac9b229ab34","last_reissued_at":"2026-05-18T01:32:49.712592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:49.712592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05168","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:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuNPUUfxRStzzXJduKaMyCS/VETLbHB/mb7uIb61JK0u2jRwq6Rg6x8W/uyzenSM6AhGSVVoPv90D2Le9eauDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:06:25.891527Z"},"content_sha256":"67ba6b7684959bfb9d1ad71a61a4355a057362030b44858cd06fb265a905827c","schema_version":"1.0","event_id":"sha256:67ba6b7684959bfb9d1ad71a61a4355a057362030b44858cd06fb265a905827c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7XQFE7RA2RHAAHYZ5FR7XVYUML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weak Infeasibility in Second Order Cone Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bruno F. Louren\\c{c}o, Masakazu Muramatsu, Takashi Tsuchiya","submitted_at":"2015-09-17T08:59:50Z","abstract_excerpt":"The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem. This is used to show that for a given weakly infeasible problem at most $m$ directions are needed to approach the cone, where $m$ is the number of Lorentz cones. We also tackle a closely related question and show that given a bounded optimization problem satisfying Slater's condition, we may transform it into another problem that has the same optimal value but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05168","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:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HF3nciBlg88tn0BXFLe57dgG8kEuQOzDV9inbbODvP0s5WWFahXF/if6tkj6nPLN+D+eAfiuK7qAQnwR4rTqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:06:25.891871Z"},"content_sha256":"32b553bc8dca22fe0a1c13e7399bbaabb14db1ac5b904b4f593f860f054bd510","schema_version":"1.0","event_id":"sha256:32b553bc8dca22fe0a1c13e7399bbaabb14db1ac5b904b4f593f860f054bd510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/bundle.json","state_url":"https://pith.science/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/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-22T00:06:25Z","links":{"resolver":"https://pith.science/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML","bundle":"https://pith.science/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/bundle.json","state":"https://pith.science/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XQFE7RA2RHAAHYZ5FR7XVYUML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7XQFE7RA2RHAAHYZ5FR7XVYUML","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":"71a6f871a6b06f751c344b9c70734d8150f745b45bff5c010e262b3999610aae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-17T08:59:50Z","title_canon_sha256":"f5833dad3d6b6dc1ef07ef55d1c029fa6be4e24384a72205a6aae04378c0065b"},"schema_version":"1.0","source":{"id":"1509.05168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05168","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05168v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05168","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"7XQFE7RA2RHA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XQFE7RA2RHAAHYZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XQFE7RA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:32b553bc8dca22fe0a1c13e7399bbaabb14db1ac5b904b4f593f860f054bd510","target":"graph","created_at":"2026-05-18T01:32:49Z","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 objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem. This is used to show that for a given weakly infeasible problem at most $m$ directions are needed to approach the cone, where $m$ is the number of Lorentz cones. We also tackle a closely related question and show that given a bounded optimization problem satisfying Slater's condition, we may transform it into another problem that has the same optimal value but ","authors_text":"Bruno F. Louren\\c{c}o, Masakazu Muramatsu, Takashi Tsuchiya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-17T08:59:50Z","title":"Weak Infeasibility in Second Order Cone Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05168","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:67ba6b7684959bfb9d1ad71a61a4355a057362030b44858cd06fb265a905827c","target":"record","created_at":"2026-05-18T01:32:49Z","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":"71a6f871a6b06f751c344b9c70734d8150f745b45bff5c010e262b3999610aae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-17T08:59:50Z","title_canon_sha256":"f5833dad3d6b6dc1ef07ef55d1c029fa6be4e24384a72205a6aae04378c0065b"},"schema_version":"1.0","source":{"id":"1509.05168","kind":"arxiv","version":1}},"canonical_sha256":"fde0527e20d44e001f19e963fbd71462fc41dbc0132eb3d6eecf5ac9b229ab34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fde0527e20d44e001f19e963fbd71462fc41dbc0132eb3d6eecf5ac9b229ab34","first_computed_at":"2026-05-18T01:32:49.712592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:49.712592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6lQ1oKLtbSmvZ4ImgiMXZYkD32tArGk/nFVOLf3rBegSAX3NolImbpHFHv0kvRrndwx7GTMIqn971hUpCSmyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:49.713307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67ba6b7684959bfb9d1ad71a61a4355a057362030b44858cd06fb265a905827c","sha256:32b553bc8dca22fe0a1c13e7399bbaabb14db1ac5b904b4f593f860f054bd510"],"state_sha256":"4c6af6be217d2ecc565a7dd8a0a1716ba0efb8056b7f3f4bc3d5d257cf88bc89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJQuaoPtWm+2jnv7C4jBfi3BVv7gB8zoEa/R1iraq4voGgnPxfeGzFvB5NLMJ7MNfr/umUo36NgB2A2zEMgXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T00:06:25.893780Z","bundle_sha256":"76ad4df5325d5cd83e1d58c98334fca506528576b0681d5604c09d89e2ee8187"}}