{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2BWZFCSTSOMUARAPAKIOQ6REC4","short_pith_number":"pith:2BWZFCST","schema_version":"1.0","canonical_sha256":"d06d928a53939940440f0290e87a24170b23d834fe1485538e23f33862dd4e93","source":{"kind":"arxiv","id":"2506.10269","version":1},"attestation_state":"computed","paper":{"title":"Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kazuhide Nakata, Ken Kobayashi, Ryota Ueda, Takami Sato","submitted_at":"2025-06-12T01:25:21Z","abstract_excerpt":"Semidefinite programming (SDP) relaxation has emerged as a promising approach for neural network verification, offering tighter bounds than other convex relaxation methods for deep neural networks (DNNs) with ReLU activations. However, we identify a critical limitation in the SDP relaxation when applied to deep networks: interior-point vanishing, which leads to the loss of strict feasibility -- a crucial condition for the numerical stability and optimality of SDP. Through rigorous theoretical and empirical analysis, we demonstrate that as the depth of DNNs increases, the strict feasibility is "},"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":"2506.10269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T01:25:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2fbd4a9487f47380a31c6970a4ac55e3e0ea4c4b2687848a1004a7bf5d87ba92","abstract_canon_sha256":"9b6e0405743b1beffbc265165e321229f273c8055bf019d2f89055d43fd4eb89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:20.355919Z","signature_b64":"vVqk1oacsxdvwektvgMr6Vvg491ebC30ElFitWEx7i4QXcop/ZEQhIjn4pJyvG2ZEUfmv22rfWjqsS5XyGm/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06d928a53939940440f0290e87a24170b23d834fe1485538e23f33862dd4e93","last_reissued_at":"2026-07-05T11:20:20.355506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:20.355506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kazuhide Nakata, Ken Kobayashi, Ryota Ueda, Takami Sato","submitted_at":"2025-06-12T01:25:21Z","abstract_excerpt":"Semidefinite programming (SDP) relaxation has emerged as a promising approach for neural network verification, offering tighter bounds than other convex relaxation methods for deep neural networks (DNNs) with ReLU activations. However, we identify a critical limitation in the SDP relaxation when applied to deep networks: interior-point vanishing, which leads to the loss of strict feasibility -- a crucial condition for the numerical stability and optimality of SDP. Through rigorous theoretical and empirical analysis, we demonstrate that as the depth of DNNs increases, the strict feasibility is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10269","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.10269/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.10269","created_at":"2026-07-05T11:20:20.355565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10269v1","created_at":"2026-07-05T11:20:20.355565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10269","created_at":"2026-07-05T11:20:20.355565+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BWZFCSTSOMU","created_at":"2026-07-05T11:20:20.355565+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BWZFCSTSOMUARAP","created_at":"2026-07-05T11:20:20.355565+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BWZFCST","created_at":"2026-07-05T11:20:20.355565+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/2BWZFCSTSOMUARAPAKIOQ6REC4","json":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4.json","graph_json":"https://pith.science/api/pith-number/2BWZFCSTSOMUARAPAKIOQ6REC4/graph.json","events_json":"https://pith.science/api/pith-number/2BWZFCSTSOMUARAPAKIOQ6REC4/events.json","paper":"https://pith.science/paper/2BWZFCST"},"agent_actions":{"view_html":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4","download_json":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4.json","view_paper":"https://pith.science/paper/2BWZFCST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10269&json=true","fetch_graph":"https://pith.science/api/pith-number/2BWZFCSTSOMUARAPAKIOQ6REC4/graph.json","fetch_events":"https://pith.science/api/pith-number/2BWZFCSTSOMUARAPAKIOQ6REC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4/action/storage_attestation","attest_author":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4/action/author_attestation","sign_citation":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4/action/citation_signature","submit_replication":"https://pith.science/pith/2BWZFCSTSOMUARAPAKIOQ6REC4/action/replication_record"}},"created_at":"2026-07-05T11:20:20.355565+00:00","updated_at":"2026-07-05T11:20:20.355565+00:00"}