{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H4IV7ZQBSUEJXYQL3AEIR263EJ","short_pith_number":"pith:H4IV7ZQB","canonical_record":{"source":{"id":"1810.00353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"372d29210a839c31caa4fab0b99da7075dbc54c0470ebe1b8c85eb57f37b74e8","abstract_canon_sha256":"e3e7ae9d54ddfbac7fb2bd053b4fabf28f8159b7d2f9dc2d5620cee683853361"},"schema_version":"1.0"},"canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","source":{"kind":"arxiv","id":"1810.00353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00353","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00353v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00353","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"H4IV7ZQBSUEJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4IV7ZQBSUEJXYQL","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4IV7ZQB","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H4IV7ZQBSUEJXYQL3AEIR263EJ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"372d29210a839c31caa4fab0b99da7075dbc54c0470ebe1b8c85eb57f37b74e8","abstract_canon_sha256":"e3e7ae9d54ddfbac7fb2bd053b4fabf28f8159b7d2f9dc2d5620cee683853361"},"schema_version":"1.0"},"canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:28.092614Z","signature_b64":"QF4cAxJqVrceo8VNDJPHxw3EWwa2EvYi7KJr8OUcizBmbGTpuql1dCQNNqkSv39x0fcilk0eS7kP045heFwKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","last_reissued_at":"2026-05-18T00:04:28.092175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:28.092175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00353","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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7NUA2qBklz/TlMILf6adVAIAh6hWGbmq9q2IQBTAyWri661kA6/ebnZSHPQMGc8niXOvDeShUVFbobGkFWJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:56:54.828287Z"},"content_sha256":"c978bc2cbd78d77483ea37dba3b62e3a90e3d34e33528c8a2e3ee523042133ab","schema_version":"1.0","event_id":"sha256:c978bc2cbd78d77483ea37dba3b62e3a90e3d34e33528c8a2e3ee523042133ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H4IV7ZQBSUEJXYQL3AEIR263EJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masao Fukushima, Takayuki Okuno","submitted_at":"2018-09-30T10:36:10Z","abstract_excerpt":"In this paper, we propose two algorithms for nonlinear semi-infinite semi-definite programs with infinitely many convex inequality constraints, called SISDP for short. A straightforward approach to the SISDP is to use classical methods for semi-infinite programs such as discretization and exchange methods and solve a sequence of (nonlinear) semi-definite programs (SDPs). However, it is often too demanding to find exact solutions of SDPs.\n  Our first approach does not rely on solving SDPs but on approximately following {a path leading to a solution, which is formed on the intersection of the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00353","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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE8Fi8HtRxWkAVM5Y8Pesjfq/b/UzXcS4vxbpTL82txLwSudArx/WDHOp5QqYnd7o3O9M2YiRjcLGRHtFlfkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:56:54.828661Z"},"content_sha256":"ff5184d931b3516483e15efb1011c9b98a79fc6fcb55190e2d7a15ca6d189958","schema_version":"1.0","event_id":"sha256:ff5184d931b3516483e15efb1011c9b98a79fc6fcb55190e2d7a15ca6d189958"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/bundle.json","state_url":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/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-22T14:56:54Z","links":{"resolver":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ","bundle":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/bundle.json","state":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H4IV7ZQBSUEJXYQL3AEIR263EJ","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":"e3e7ae9d54ddfbac7fb2bd053b4fabf28f8159b7d2f9dc2d5620cee683853361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","title_canon_sha256":"372d29210a839c31caa4fab0b99da7075dbc54c0470ebe1b8c85eb57f37b74e8"},"schema_version":"1.0","source":{"id":"1810.00353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00353","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00353v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00353","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"H4IV7ZQBSUEJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4IV7ZQBSUEJXYQL","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4IV7ZQB","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:ff5184d931b3516483e15efb1011c9b98a79fc6fcb55190e2d7a15ca6d189958","target":"graph","created_at":"2026-05-18T00:04:28Z","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":"In this paper, we propose two algorithms for nonlinear semi-infinite semi-definite programs with infinitely many convex inequality constraints, called SISDP for short. A straightforward approach to the SISDP is to use classical methods for semi-infinite programs such as discretization and exchange methods and solve a sequence of (nonlinear) semi-definite programs (SDPs). However, it is often too demanding to find exact solutions of SDPs.\n  Our first approach does not rely on solving SDPs but on approximately following {a path leading to a solution, which is formed on the intersection of the se","authors_text":"Masao Fukushima, Takayuki Okuno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","title":"Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00353","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:c978bc2cbd78d77483ea37dba3b62e3a90e3d34e33528c8a2e3ee523042133ab","target":"record","created_at":"2026-05-18T00:04:28Z","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":"e3e7ae9d54ddfbac7fb2bd053b4fabf28f8159b7d2f9dc2d5620cee683853361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","title_canon_sha256":"372d29210a839c31caa4fab0b99da7075dbc54c0470ebe1b8c85eb57f37b74e8"},"schema_version":"1.0","source":{"id":"1810.00353","kind":"arxiv","version":1}},"canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","first_computed_at":"2026-05-18T00:04:28.092175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:28.092175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QF4cAxJqVrceo8VNDJPHxw3EWwa2EvYi7KJr8OUcizBmbGTpuql1dCQNNqkSv39x0fcilk0eS7kP045heFwKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:28.092614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c978bc2cbd78d77483ea37dba3b62e3a90e3d34e33528c8a2e3ee523042133ab","sha256:ff5184d931b3516483e15efb1011c9b98a79fc6fcb55190e2d7a15ca6d189958"],"state_sha256":"3ed98160a5230dd9825353395dc416b1c2c6eea57faab4002c09a4a739a8706c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkpQcTyx3OgR3UKMtqt8NzmcTEnyOIX5hLSUBnB5tFPOxnwBxFDmTt+m9eNfCQuHvVtwh85VhueghRvaCk+gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:56:54.830588Z","bundle_sha256":"16967ce1c8e6190299736981c74bc692fb50b56de4420ca0c8f7861142a46a00"}}