{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4QOP3GYRHVT6X6MWJ63VL2PDMK","short_pith_number":"pith:4QOP3GYR","schema_version":"1.0","canonical_sha256":"e41cfd9b113d67ebf9964fb755e9e3628a6f101b99a0f5308ba2785a87215f70","source":{"kind":"arxiv","id":"1711.02351","version":2},"attestation_state":"computed","paper":{"title":"Robust Truss Topology Optimization via Semidefinite Programming with Complementarity Constraints: A Difference-of-Convex Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yoshihiro Kanno","submitted_at":"2017-11-07T09:27:08Z","abstract_excerpt":"The robust truss topology optimization against the uncertain static external load can be formulated as mixed-integer semidefinite programming. Although a global optimal solution can be computed with a branch-and-bound method, it is very time-consuming. This paper presents an alternative formulation, semidefinite programming with complementarity constraints, and proposes an efficient heuristic. The proposed method is based upon the convex-concave procedure for DC (difference-of-convex) programming. It is shown that the method can often find a practically reasonable truss design within the compu"},"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":"1711.02351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-07T09:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"0742136cb7d128c0ca38200f3eea7570403890128a75aab48c74d6af90f3568f","abstract_canon_sha256":"3b0465f009f25e60ef94237231f2af51a45ada94947b9bbb09714d4f0c4ec395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.926168Z","signature_b64":"njbQlp5QhVWuRFSMkaKZe/5fXFDqsyvimTKAwBl1dZatBQmsdUDP3HMtiOZyyL0fgbFn3KwcLimmhF7JC02+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e41cfd9b113d67ebf9964fb755e9e3628a6f101b99a0f5308ba2785a87215f70","last_reissued_at":"2026-05-17T23:55:38.925696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.925696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Truss Topology Optimization via Semidefinite Programming with Complementarity Constraints: A Difference-of-Convex Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yoshihiro Kanno","submitted_at":"2017-11-07T09:27:08Z","abstract_excerpt":"The robust truss topology optimization against the uncertain static external load can be formulated as mixed-integer semidefinite programming. Although a global optimal solution can be computed with a branch-and-bound method, it is very time-consuming. This paper presents an alternative formulation, semidefinite programming with complementarity constraints, and proposes an efficient heuristic. The proposed method is based upon the convex-concave procedure for DC (difference-of-convex) programming. It is shown that the method can often find a practically reasonable truss design within the compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02351","kind":"arxiv","version":2},"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":"1711.02351","created_at":"2026-05-17T23:55:38.925799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02351v2","created_at":"2026-05-17T23:55:38.925799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02351","created_at":"2026-05-17T23:55:38.925799+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QOP3GYRHVT6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QOP3GYRHVT6X6MW","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QOP3GYR","created_at":"2026-05-18T12:31:00.734936+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/4QOP3GYRHVT6X6MWJ63VL2PDMK","json":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK.json","graph_json":"https://pith.science/api/pith-number/4QOP3GYRHVT6X6MWJ63VL2PDMK/graph.json","events_json":"https://pith.science/api/pith-number/4QOP3GYRHVT6X6MWJ63VL2PDMK/events.json","paper":"https://pith.science/paper/4QOP3GYR"},"agent_actions":{"view_html":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK","download_json":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK.json","view_paper":"https://pith.science/paper/4QOP3GYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02351&json=true","fetch_graph":"https://pith.science/api/pith-number/4QOP3GYRHVT6X6MWJ63VL2PDMK/graph.json","fetch_events":"https://pith.science/api/pith-number/4QOP3GYRHVT6X6MWJ63VL2PDMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK/action/storage_attestation","attest_author":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK/action/author_attestation","sign_citation":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK/action/citation_signature","submit_replication":"https://pith.science/pith/4QOP3GYRHVT6X6MWJ63VL2PDMK/action/replication_record"}},"created_at":"2026-05-17T23:55:38.925799+00:00","updated_at":"2026-05-17T23:55:38.925799+00:00"}