{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KQJJVVVHGZM4OUT453VFQBEEXR","short_pith_number":"pith:KQJJVVVH","schema_version":"1.0","canonical_sha256":"54129ad6a73659c7527ceeea580484bc6a0add07be1ce2404f5cfd96b403f655","source":{"kind":"arxiv","id":"1311.4989","version":2},"attestation_state":"computed","paper":{"title":"Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Weber, Gunther Reissig","submitted_at":"2013-11-20T09:37:29Z","abstract_excerpt":"Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of the so-called local quadratic support is proved. The results concerning strong convexity are used to derive sufficient conditions for attainable sets of continuous-time nonlinear systems to be strongly convex. An application of these conditions is a novel method to over-approximate attainable sets when strong convexity is present."},"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":"1311.4989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-20T09:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"14e7397763ee347aef7f4b6318f06bbff072289a8f272d5e6bfbcbf3a53eb0f3","abstract_canon_sha256":"cde8813ccb681814672509e3d499ca3ba917ee9a9feea4463896f6bb7bfca989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.865473Z","signature_b64":"CdcdtgwiS0lmqBQIPMcIBZd/pFoa6VsLxxVlpOrDnPMPv6S1gD3AFwXbpq3fOA7UxW+HfI7r9Jfr6flSf0zTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54129ad6a73659c7527ceeea580484bc6a0add07be1ce2404f5cfd96b403f655","last_reissued_at":"2026-05-18T00:53:40.864966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.864966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Weber, Gunther Reissig","submitted_at":"2013-11-20T09:37:29Z","abstract_excerpt":"Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of the so-called local quadratic support is proved. The results concerning strong convexity are used to derive sufficient conditions for attainable sets of continuous-time nonlinear systems to be strongly convex. An application of these conditions is a novel method to over-approximate attainable sets when strong convexity is present."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4989","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":"1311.4989","created_at":"2026-05-18T00:53:40.865039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4989v2","created_at":"2026-05-18T00:53:40.865039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4989","created_at":"2026-05-18T00:53:40.865039+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQJJVVVHGZM4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQJJVVVHGZM4OUT4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQJJVVVH","created_at":"2026-05-18T12:27:51.066281+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/KQJJVVVHGZM4OUT453VFQBEEXR","json":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR.json","graph_json":"https://pith.science/api/pith-number/KQJJVVVHGZM4OUT453VFQBEEXR/graph.json","events_json":"https://pith.science/api/pith-number/KQJJVVVHGZM4OUT453VFQBEEXR/events.json","paper":"https://pith.science/paper/KQJJVVVH"},"agent_actions":{"view_html":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR","download_json":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR.json","view_paper":"https://pith.science/paper/KQJJVVVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4989&json=true","fetch_graph":"https://pith.science/api/pith-number/KQJJVVVHGZM4OUT453VFQBEEXR/graph.json","fetch_events":"https://pith.science/api/pith-number/KQJJVVVHGZM4OUT453VFQBEEXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR/action/storage_attestation","attest_author":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR/action/author_attestation","sign_citation":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR/action/citation_signature","submit_replication":"https://pith.science/pith/KQJJVVVHGZM4OUT453VFQBEEXR/action/replication_record"}},"created_at":"2026-05-18T00:53:40.865039+00:00","updated_at":"2026-05-18T00:53:40.865039+00:00"}