{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7TUAENB23NGFBG4NKMBV4TIGJN","short_pith_number":"pith:7TUAENB2","schema_version":"1.0","canonical_sha256":"fce802343adb4c509b8d53035e4d064b6aaf7e448750240565e88dc89cc5684e","source":{"kind":"arxiv","id":"2209.03602","version":1},"attestation_state":"computed","paper":{"title":"Template-based Program Synthesis using Stellens\\\"atze","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amir Kafshdar Goharshady, Fatemeh Mohammadi, Harshit J Motwani, S. Hitarth","submitted_at":"2022-09-08T06:58:32Z","abstract_excerpt":"Template-based synthesis, also known as sketching, is a localized approach to program synthesis in which the programmer provides not only a specification, but also a high-level ``sketch'' of the program. The sketch is basically a partial program that models the general intuition of the programmer, while leaving the low-level details as unimplemented ``holes''. The role of the synthesis engine is then to fill in these holes such that the completed program satisfies the desired specification. In this work, we focus on template-based synthesis of polynomial imperative programs with real variables"},"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":"2209.03602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-09-08T06:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"1cf5340300cd2b9b776548ba68bee85d71913905324837b8269524f0c587a3db","abstract_canon_sha256":"5b96912a067e33261cb502ffe97a28fb6d943413c7fd5112ebadd8c1cb2bde7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:47.961667Z","signature_b64":"SWP7cqsnuV65/1WdZbbYuSr1RTlGwPIM4Rx8KtehNTp042eWSxEoCVOY1y0jD5OKmMTTDYqIIi84wbHcFJypAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce802343adb4c509b8d53035e4d064b6aaf7e448750240565e88dc89cc5684e","last_reissued_at":"2026-07-05T07:50:47.961189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:47.961189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Template-based Program Synthesis using Stellens\\\"atze","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amir Kafshdar Goharshady, Fatemeh Mohammadi, Harshit J Motwani, S. Hitarth","submitted_at":"2022-09-08T06:58:32Z","abstract_excerpt":"Template-based synthesis, also known as sketching, is a localized approach to program synthesis in which the programmer provides not only a specification, but also a high-level ``sketch'' of the program. The sketch is basically a partial program that models the general intuition of the programmer, while leaving the low-level details as unimplemented ``holes''. The role of the synthesis engine is then to fill in these holes such that the completed program satisfies the desired specification. In this work, we focus on template-based synthesis of polynomial imperative programs with real variables"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03602","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/2209.03602/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":"2209.03602","created_at":"2026-07-05T07:50:47.961241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03602v1","created_at":"2026-07-05T07:50:47.961241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03602","created_at":"2026-07-05T07:50:47.961241+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TUAENB23NGF","created_at":"2026-07-05T07:50:47.961241+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TUAENB23NGFBG4N","created_at":"2026-07-05T07:50:47.961241+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TUAENB2","created_at":"2026-07-05T07:50:47.961241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24263","citing_title":"Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN","json":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN.json","graph_json":"https://pith.science/api/pith-number/7TUAENB23NGFBG4NKMBV4TIGJN/graph.json","events_json":"https://pith.science/api/pith-number/7TUAENB23NGFBG4NKMBV4TIGJN/events.json","paper":"https://pith.science/paper/7TUAENB2"},"agent_actions":{"view_html":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN","download_json":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN.json","view_paper":"https://pith.science/paper/7TUAENB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03602&json=true","fetch_graph":"https://pith.science/api/pith-number/7TUAENB23NGFBG4NKMBV4TIGJN/graph.json","fetch_events":"https://pith.science/api/pith-number/7TUAENB23NGFBG4NKMBV4TIGJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN/action/storage_attestation","attest_author":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN/action/author_attestation","sign_citation":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN/action/citation_signature","submit_replication":"https://pith.science/pith/7TUAENB23NGFBG4NKMBV4TIGJN/action/replication_record"}},"created_at":"2026-07-05T07:50:47.961241+00:00","updated_at":"2026-07-05T07:50:47.961241+00:00"}