{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CK3YZTDHGM4SD3X777YSAKKTYK","short_pith_number":"pith:CK3YZTDH","schema_version":"1.0","canonical_sha256":"12b78ccc67333921eefffff1202953c29fbd8a7bb8e1780d27604c539f03d9bb","source":{"kind":"arxiv","id":"1711.10641","version":1},"attestation_state":"computed","paper":{"title":"SyGuS Techniques in the Core of an SMT Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"(2) University of Iowa), Andrew Reynolds (1), Cesare Tinelli (2) ((1) University of Iowa","submitted_at":"2017-11-29T01:29:26Z","abstract_excerpt":"We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers. We define several classes of synthesis conjectures and corresponding techniques that can be used when dealing with each class of conjecture."},"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":"1711.10641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"52f037232d8f1fb4318237b5b59415a4a0d99b158b9c6f020c2e91a1409e99c4","abstract_canon_sha256":"2d18b7f8a429a5cd59bef4c7b96bf53c4f0995cddb5c61e6213bca3be55de22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.446822Z","signature_b64":"ZD23HoGwQoY3Rqx2TtBhdCaZltRiM4MY3uS9bHhJLZRkLJHfOtgtJO+O/tBNr0Acd2xuUiolAA+N1reUn+OYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12b78ccc67333921eefffff1202953c29fbd8a7bb8e1780d27604c539f03d9bb","last_reissued_at":"2026-05-18T00:29:17.446068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.446068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SyGuS Techniques in the Core of an SMT Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"(2) University of Iowa), Andrew Reynolds (1), Cesare Tinelli (2) ((1) University of Iowa","submitted_at":"2017-11-29T01:29:26Z","abstract_excerpt":"We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers. We define several classes of synthesis conjectures and corresponding techniques that can be used when dealing with each class of conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10641","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":""},"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":"1711.10641","created_at":"2026-05-18T00:29:17.446172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10641v1","created_at":"2026-05-18T00:29:17.446172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10641","created_at":"2026-05-18T00:29:17.446172+00:00"},{"alias_kind":"pith_short_12","alias_value":"CK3YZTDHGM4S","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CK3YZTDHGM4SD3X7","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CK3YZTDH","created_at":"2026-05-18T12:31:10.602751+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/CK3YZTDHGM4SD3X777YSAKKTYK","json":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK.json","graph_json":"https://pith.science/api/pith-number/CK3YZTDHGM4SD3X777YSAKKTYK/graph.json","events_json":"https://pith.science/api/pith-number/CK3YZTDHGM4SD3X777YSAKKTYK/events.json","paper":"https://pith.science/paper/CK3YZTDH"},"agent_actions":{"view_html":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK","download_json":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK.json","view_paper":"https://pith.science/paper/CK3YZTDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10641&json=true","fetch_graph":"https://pith.science/api/pith-number/CK3YZTDHGM4SD3X777YSAKKTYK/graph.json","fetch_events":"https://pith.science/api/pith-number/CK3YZTDHGM4SD3X777YSAKKTYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK/action/storage_attestation","attest_author":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK/action/author_attestation","sign_citation":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK/action/citation_signature","submit_replication":"https://pith.science/pith/CK3YZTDHGM4SD3X777YSAKKTYK/action/replication_record"}},"created_at":"2026-05-18T00:29:17.446172+00:00","updated_at":"2026-05-18T00:29:17.446172+00:00"}