{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RU7ZXNAVS7SHEFUB4SZ7C4RW3Q","short_pith_number":"pith:RU7ZXNAV","schema_version":"1.0","canonical_sha256":"8d3f9bb41597e4721681e4b3f17236dc1687061581af766c15c6502ae7004d26","source":{"kind":"arxiv","id":"2503.20915","version":1},"attestation_state":"computed","paper":{"title":"Term-sparse polynomial optimization for the design of frame structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marek Tyburec, Marouan Handa, Michal Ko\\v{c}vara","submitted_at":"2025-03-26T18:43:38Z","abstract_excerpt":"This work investigates an efficient solution to two fundamental problems in topology optimization of frame structures. The first one involves minimizing structural compliance under linear-elastic equilibrium and weight constraint, while the second one minimizes the weight under compliance constraints. These problems are non-convex and generally challenging to solve globally, with the non-convexity concentrated in a polynomial matrix inequality. We solve these problems using the moment-sum-of-squares (mSOS) hierarchy and improve the scalability by enhancing (mSOS) with the Term Sparsity Pattern"},"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":"2503.20915","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-26T18:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"429dcbc747c68c322e08cce6989caa322c78eb73a99da3e4c1eab895cc915af5","abstract_canon_sha256":"778a557b55cd762f133fe48f14a48914fabc0b5b75cec9d25404c020b61e8b56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:50.257797Z","signature_b64":"NlJLDPpgSO9Tq9Jj353hrkRc0GDftgtJK5BKm9b8ndKKIOIY+Bv8EOBtnHgcFQCIvj6BIY5/mcbvdcEJSdvuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d3f9bb41597e4721681e4b3f17236dc1687061581af766c15c6502ae7004d26","last_reissued_at":"2026-07-05T10:39:50.257326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:50.257326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Term-sparse polynomial optimization for the design of frame structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marek Tyburec, Marouan Handa, Michal Ko\\v{c}vara","submitted_at":"2025-03-26T18:43:38Z","abstract_excerpt":"This work investigates an efficient solution to two fundamental problems in topology optimization of frame structures. The first one involves minimizing structural compliance under linear-elastic equilibrium and weight constraint, while the second one minimizes the weight under compliance constraints. These problems are non-convex and generally challenging to solve globally, with the non-convexity concentrated in a polynomial matrix inequality. We solve these problems using the moment-sum-of-squares (mSOS) hierarchy and improve the scalability by enhancing (mSOS) with the Term Sparsity Pattern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.20915","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/2503.20915/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":"2503.20915","created_at":"2026-07-05T10:39:50.257391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.20915v1","created_at":"2026-07-05T10:39:50.257391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20915","created_at":"2026-07-05T10:39:50.257391+00:00"},{"alias_kind":"pith_short_12","alias_value":"RU7ZXNAVS7SH","created_at":"2026-07-05T10:39:50.257391+00:00"},{"alias_kind":"pith_short_16","alias_value":"RU7ZXNAVS7SHEFUB","created_at":"2026-07-05T10:39:50.257391+00:00"},{"alias_kind":"pith_short_8","alias_value":"RU7ZXNAV","created_at":"2026-07-05T10:39:50.257391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15479","citing_title":"Sparse Polynomial Matrix Optimization","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q","json":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q.json","graph_json":"https://pith.science/api/pith-number/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/graph.json","events_json":"https://pith.science/api/pith-number/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/events.json","paper":"https://pith.science/paper/RU7ZXNAV"},"agent_actions":{"view_html":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q","download_json":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q.json","view_paper":"https://pith.science/paper/RU7ZXNAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.20915&json=true","fetch_graph":"https://pith.science/api/pith-number/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/action/storage_attestation","attest_author":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/action/author_attestation","sign_citation":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/action/citation_signature","submit_replication":"https://pith.science/pith/RU7ZXNAVS7SHEFUB4SZ7C4RW3Q/action/replication_record"}},"created_at":"2026-07-05T10:39:50.257391+00:00","updated_at":"2026-07-05T10:39:50.257391+00:00"}