{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CEWCRHPTPELXYHI3KEAIK4CQJQ","short_pith_number":"pith:CEWCRHPT","canonical_record":{"source":{"id":"2509.02849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T21:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"1afe9219942792cd1cfea481c64816dcc24149ea7b8c26e3bcba382941b59af9","abstract_canon_sha256":"4248c5c92fce061e2ff04819966aebe155ab9b6534b96b2dddaf87c6bb78a7c4"},"schema_version":"1.0"},"canonical_sha256":"112c289df379177c1d1b51008570504c06ee5f019eea697aba7e05bf9acdecc7","source":{"kind":"arxiv","id":"2509.02849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02849","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02849v1","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02849","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"CEWCRHPTPELX","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"CEWCRHPTPELXYHI3","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"CEWCRHPT","created_at":"2026-07-05T12:03:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CEWCRHPTPELXYHI3KEAIK4CQJQ","target":"record","payload":{"canonical_record":{"source":{"id":"2509.02849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T21:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"1afe9219942792cd1cfea481c64816dcc24149ea7b8c26e3bcba382941b59af9","abstract_canon_sha256":"4248c5c92fce061e2ff04819966aebe155ab9b6534b96b2dddaf87c6bb78a7c4"},"schema_version":"1.0"},"canonical_sha256":"112c289df379177c1d1b51008570504c06ee5f019eea697aba7e05bf9acdecc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:58.462326Z","signature_b64":"2jnFKyyd++Q1N/V2rUbnL3FISl3AVolOz9ger80WzJnTf0o3DfXP89VGcgE91mxksexeHnaP1MGxwogl/RObAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112c289df379177c1d1b51008570504c06ee5f019eea697aba7e05bf9acdecc7","last_reissued_at":"2026-07-05T12:03:58.461790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:58.461790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.02849","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-07-05T12:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZBJZhLj+dtQi04Ur4GQ3GhTOZd4k/R0KTGV+ls4K0gN81H2D85Fwik0xzz+w9K+cgo/JX9sEwwFZp56Al2pAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:06:08.902863Z"},"content_sha256":"ec57e6b850a53cda0c2ef13a1016fe50ec006623e9887299f5932efab461d974","schema_version":"1.0","event_id":"sha256:ec57e6b850a53cda0c2ef13a1016fe50ec006623e9887299f5932efab461d974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CEWCRHPTPELXYHI3KEAIK4CQJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giovanni Fantuzzi, Marek Tyburec, Marouan Handa, Michal Ko\\v{c}vara, Victor Magron","submitted_at":"2025-09-02T21:32:40Z","abstract_excerpt":"The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal decomposition in the context of Linear Matrix Inequalities (LMIs) if the matrix in question satisfied suitable assumptions. The primary objective of this paper is to extend the AD method to address Polynomial Optimization Problems (POPs) involving large-scale Polynomial Matrix Inequalities (PMIs), with the solution framework relying on moment-sum of square (mSOS) hierarchies. As a first step, we revisit the LMI case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02849","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/2509.02849/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"},"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-07-05T12:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3d0OJSanGcoU4QocolZbq/49HErqEkuyjjInZeo/0mdxMQJEBJtVLSt3B1mbi5foY+pRrWV2gu0JEf6mDDFrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:06:08.903369Z"},"content_sha256":"3d8a58cd911d7e85986bbd56f3541665289aece00e6a0a0ff595e29fce993a35","schema_version":"1.0","event_id":"sha256:3d8a58cd911d7e85986bbd56f3541665289aece00e6a0a0ff595e29fce993a35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/bundle.json","state_url":"https://pith.science/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/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-08-13T11:06:08Z","links":{"resolver":"https://pith.science/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ","bundle":"https://pith.science/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/bundle.json","state":"https://pith.science/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEWCRHPTPELXYHI3KEAIK4CQJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CEWCRHPTPELXYHI3KEAIK4CQJQ","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":"4248c5c92fce061e2ff04819966aebe155ab9b6534b96b2dddaf87c6bb78a7c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T21:32:40Z","title_canon_sha256":"1afe9219942792cd1cfea481c64816dcc24149ea7b8c26e3bcba382941b59af9"},"schema_version":"1.0","source":{"id":"2509.02849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02849","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02849v1","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02849","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"CEWCRHPTPELX","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"CEWCRHPTPELXYHI3","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"CEWCRHPT","created_at":"2026-07-05T12:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:3d8a58cd911d7e85986bbd56f3541665289aece00e6a0a0ff595e29fce993a35","target":"graph","created_at":"2026-07-05T12:03:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.02849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal decomposition in the context of Linear Matrix Inequalities (LMIs) if the matrix in question satisfied suitable assumptions. The primary objective of this paper is to extend the AD method to address Polynomial Optimization Problems (POPs) involving large-scale Polynomial Matrix Inequalities (PMIs), with the solution framework relying on moment-sum of square (mSOS) hierarchies. As a first step, we revisit the LMI case","authors_text":"Giovanni Fantuzzi, Marek Tyburec, Marouan Handa, Michal Ko\\v{c}vara, Victor Magron","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T21:32:40Z","title":"Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02849","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:ec57e6b850a53cda0c2ef13a1016fe50ec006623e9887299f5932efab461d974","target":"record","created_at":"2026-07-05T12:03:58Z","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":"4248c5c92fce061e2ff04819966aebe155ab9b6534b96b2dddaf87c6bb78a7c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T21:32:40Z","title_canon_sha256":"1afe9219942792cd1cfea481c64816dcc24149ea7b8c26e3bcba382941b59af9"},"schema_version":"1.0","source":{"id":"2509.02849","kind":"arxiv","version":1}},"canonical_sha256":"112c289df379177c1d1b51008570504c06ee5f019eea697aba7e05bf9acdecc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"112c289df379177c1d1b51008570504c06ee5f019eea697aba7e05bf9acdecc7","first_computed_at":"2026-07-05T12:03:58.461790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:58.461790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jnFKyyd++Q1N/V2rUbnL3FISl3AVolOz9ger80WzJnTf0o3DfXP89VGcgE91mxksexeHnaP1MGxwogl/RObAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:58.462326Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.02849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec57e6b850a53cda0c2ef13a1016fe50ec006623e9887299f5932efab461d974","sha256:3d8a58cd911d7e85986bbd56f3541665289aece00e6a0a0ff595e29fce993a35"],"state_sha256":"46d71d74658472f6473aebc789c1420199337bd0d7f3428da27360233e8b3ae4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spGR06r0Qu7KvkRaPGxzdV5OmIHiKgRonLNi8FVvcYi6jtmpSphdmkgFY1CWT2IM6Ndc7tCagn96SyNlp5ksAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:06:08.911120Z","bundle_sha256":"d672f33c1a1abfb43b223b28951d69e59eded158a7937c773c6f414470072863"}}