{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2MV2QZ3GRH5EMK3RPCNWLXWUPR","short_pith_number":"pith:2MV2QZ3G","schema_version":"1.0","canonical_sha256":"d32ba8676689fa462b71789b65ded47c5620736b72cf020922f1756428065d04","source":{"kind":"arxiv","id":"2310.11133","version":2},"attestation_state":"computed","paper":{"title":"Synthesizing Invariants for Polynomial Programs by Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Bai Xue, Hao Wu, Lihong Zhi, Naijun Zhan, Qiuye Wang, Zhihong Yang","submitted_at":"2023-10-17T10:31:26Z","abstract_excerpt":"Constraint-solving-based program invariant synthesis takes a parametric invariant template and encodes the (inductive) invariant conditions into constraints. The problem of characterizing the set of all valid parameter assignments is referred to as the strong invariant synthesis problem, while the problem of finding a concrete valid parameter assignment is called the weak invariant synthesis problem. For both problems, the challenge lies in solving or reducing the encoded constraints, which are generally non-convex and lack efficient solvers. Consequently, existing works either rely on heurist"},"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":"2310.11133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2023-10-17T10:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"964ed2fdd2b535c591526b0d03f08e9982b1d622166142da823b951a20d5313c","abstract_canon_sha256":"048c5eb040aa26d6b6b92d4df8a578a5acf34a969d000966c36e06ccfabbe268"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:01.565722Z","signature_b64":"2CXeA7x2yXv5LHJGs5lhQEjphOAFSLvkr7RfWdA5/cmw+7f0luuXr/LWm+zXgNAXxBmP0Fb2jcxBnQZwYQR/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d32ba8676689fa462b71789b65ded47c5620736b72cf020922f1756428065d04","last_reissued_at":"2026-07-05T09:09:01.565265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:01.565265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Invariants for Polynomial Programs by Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Bai Xue, Hao Wu, Lihong Zhi, Naijun Zhan, Qiuye Wang, Zhihong Yang","submitted_at":"2023-10-17T10:31:26Z","abstract_excerpt":"Constraint-solving-based program invariant synthesis takes a parametric invariant template and encodes the (inductive) invariant conditions into constraints. The problem of characterizing the set of all valid parameter assignments is referred to as the strong invariant synthesis problem, while the problem of finding a concrete valid parameter assignment is called the weak invariant synthesis problem. For both problems, the challenge lies in solving or reducing the encoded constraints, which are generally non-convex and lack efficient solvers. Consequently, existing works either rely on heurist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11133","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.11133/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":"2310.11133","created_at":"2026-07-05T09:09:01.565343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11133v2","created_at":"2026-07-05T09:09:01.565343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11133","created_at":"2026-07-05T09:09:01.565343+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MV2QZ3GRH5E","created_at":"2026-07-05T09:09:01.565343+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MV2QZ3GRH5EMK3R","created_at":"2026-07-05T09:09:01.565343+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MV2QZ3G","created_at":"2026-07-05T09:09:01.565343+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/2MV2QZ3GRH5EMK3RPCNWLXWUPR","json":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR.json","graph_json":"https://pith.science/api/pith-number/2MV2QZ3GRH5EMK3RPCNWLXWUPR/graph.json","events_json":"https://pith.science/api/pith-number/2MV2QZ3GRH5EMK3RPCNWLXWUPR/events.json","paper":"https://pith.science/paper/2MV2QZ3G"},"agent_actions":{"view_html":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR","download_json":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR.json","view_paper":"https://pith.science/paper/2MV2QZ3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11133&json=true","fetch_graph":"https://pith.science/api/pith-number/2MV2QZ3GRH5EMK3RPCNWLXWUPR/graph.json","fetch_events":"https://pith.science/api/pith-number/2MV2QZ3GRH5EMK3RPCNWLXWUPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR/action/storage_attestation","attest_author":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR/action/author_attestation","sign_citation":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR/action/citation_signature","submit_replication":"https://pith.science/pith/2MV2QZ3GRH5EMK3RPCNWLXWUPR/action/replication_record"}},"created_at":"2026-07-05T09:09:01.565343+00:00","updated_at":"2026-07-05T09:09:01.565343+00:00"}