{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WDQIBFQ6QWAGTMLWWPT6LNMENS","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":"af383f1d358bee8d92adc50c1f6d114ed981859ad4763213a78e668a9ef71a2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-23T06:21:28Z","title_canon_sha256":"5f0a3bd29cf39f46ac47a1cc65a80b8892dfe0bf0107e2cad460cbfed1db252a"},"schema_version":"1.0","source":{"id":"1103.4456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4456","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4456v1","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4456","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"WDQIBFQ6QWAG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WDQIBFQ6QWAGTMLW","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WDQIBFQ6","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:524f6f0369f00080f5836eb52b37798fba565e76cff318ccc76938d3fbb87ff3","target":"graph","created_at":"2026-05-18T04:26:02Z","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":"A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for $n=4, 6$ and 8. Thus, for even $n\\geq 10$, instances of this problem remain open. Finding those largest small polygons can be formulated as nonconvex quadratic programming problems which can challenge state-of-the-art global optimization algorithms. We show that a recently developed technique for global polynomial optimization, based on a semidefinite program","authors_text":"CTU/FEE), Didier Henrion (LAAS, Frederic Messine (ENSEEIHT, IRIT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-23T06:21:28Z","title":"Finding largest small polygons with GloptiPoly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4456","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:0ec32d488cdf61f71164cfc81678536831b19ec9db91b79dd33bde427f1aa360","target":"record","created_at":"2026-05-18T04:26:02Z","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":"af383f1d358bee8d92adc50c1f6d114ed981859ad4763213a78e668a9ef71a2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-23T06:21:28Z","title_canon_sha256":"5f0a3bd29cf39f46ac47a1cc65a80b8892dfe0bf0107e2cad460cbfed1db252a"},"schema_version":"1.0","source":{"id":"1103.4456","kind":"arxiv","version":1}},"canonical_sha256":"b0e080961e858069b176b3e7e5b5846cbf4d08c56fa472d7b9b9939d0ee07c92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e080961e858069b176b3e7e5b5846cbf4d08c56fa472d7b9b9939d0ee07c92","first_computed_at":"2026-05-18T04:26:02.011811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:02.011811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOejb6iqoBq69oKT8U5UcIlfm+bBwlMAVYhW2Rto1v5SUJAkCkyqAGQQOVRzTP1Zslakiyk1KFI88QAWa3nbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:02.012260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ec32d488cdf61f71164cfc81678536831b19ec9db91b79dd33bde427f1aa360","sha256:524f6f0369f00080f5836eb52b37798fba565e76cff318ccc76938d3fbb87ff3"],"state_sha256":"259205db986c8260e41499a7272a538ed96e7ac0fc5a3c393a03154090380171"}