{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RYU5KZ4GFXVFJKVT2DXDDT6TKJ","short_pith_number":"pith:RYU5KZ4G","schema_version":"1.0","canonical_sha256":"8e29d567862dea54aab3d0ee31cfd35276b8c19a45b20b81a547aa0744038ccb","source":{"kind":"arxiv","id":"1902.04373","version":3},"attestation_state":"computed","paper":{"title":"Polynomial Invariant Generation for Non-deterministic Recursive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee","submitted_at":"2019-02-12T13:17:25Z","abstract_excerpt":"We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize positive polynomials over a semi-algebraic set. To the best of our knowledge, this is the first invariant generation method to provide completeness guarantees for invariants consisting of polynomial inequalities. Moreover, on the theoretical side, the worst-case complexit"},"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":"1902.04373","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-12T13:17:25Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"ef4361b90a4d4430a7ed8dc22b65c3164e235cfb531382583a079523e1c99071","abstract_canon_sha256":"02b1e7e6cd251ff475e98affade23a5f6d0531f091e724a72d9cb838646806d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:45.341122Z","signature_b64":"yac/N3hxSjSRIFT85fFaKNiPIkTRc7NZW8wZXM7tcVBYQ+DVoHaSc0qySJ+oLLjzT3/8jU0ggoCdq6TVdi50Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e29d567862dea54aab3d0ee31cfd35276b8c19a45b20b81a547aa0744038ccb","last_reissued_at":"2026-07-05T00:52:45.340665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:45.340665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Invariant Generation for Non-deterministic Recursive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee","submitted_at":"2019-02-12T13:17:25Z","abstract_excerpt":"We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize positive polynomials over a semi-algebraic set. To the best of our knowledge, this is the first invariant generation method to provide completeness guarantees for invariants consisting of polynomial inequalities. Moreover, on the theoretical side, the worst-case complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04373","kind":"arxiv","version":3},"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/1902.04373/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":"1902.04373","created_at":"2026-07-05T00:52:45.340728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04373v3","created_at":"2026-07-05T00:52:45.340728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04373","created_at":"2026-07-05T00:52:45.340728+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYU5KZ4GFXVF","created_at":"2026-07-05T00:52:45.340728+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYU5KZ4GFXVFJKVT","created_at":"2026-07-05T00:52:45.340728+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYU5KZ4G","created_at":"2026-07-05T00:52:45.340728+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/RYU5KZ4GFXVFJKVT2DXDDT6TKJ","json":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ.json","graph_json":"https://pith.science/api/pith-number/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/graph.json","events_json":"https://pith.science/api/pith-number/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/events.json","paper":"https://pith.science/paper/RYU5KZ4G"},"agent_actions":{"view_html":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ","download_json":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ.json","view_paper":"https://pith.science/paper/RYU5KZ4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04373&json=true","fetch_graph":"https://pith.science/api/pith-number/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/action/storage_attestation","attest_author":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/action/author_attestation","sign_citation":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/action/citation_signature","submit_replication":"https://pith.science/pith/RYU5KZ4GFXVFJKVT2DXDDT6TKJ/action/replication_record"}},"created_at":"2026-07-05T00:52:45.340728+00:00","updated_at":"2026-07-05T00:52:45.340728+00:00"}