{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CRWYE2TPG3HIDKXBDCRD5I6C4L","short_pith_number":"pith:CRWYE2TP","schema_version":"1.0","canonical_sha256":"146d826a6f36ce81aae118a23ea3c2e2de5667474583075e6f25dcb106743e45","source":{"kind":"arxiv","id":"1611.07627","version":1},"attestation_state":"computed","paper":{"title":"SyGuS-Comp 2016: Results and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.SE","authors_text":"Armando Solar-Lezama (Massachusetts Institute of Technology), Dana Fisman (Ben-Gurion University), Rajeev Alur (University of Pennsylvania), Redmond), Rishabh Singh (Microsoft Research","submitted_at":"2016-11-23T03:17:40Z","abstract_excerpt":"Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula $\\varphi$ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB.\n  The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platfo"},"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":"1611.07627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-11-23T03:17:40Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"e208786edf1d113f046afb7e4b51184306744d1327563be3794c29d040b36e02","abstract_canon_sha256":"e74c254b7c7d4c61702a81ade8ff1ff494ea722e3962f04eb60cef9c006b5ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:00.239311Z","signature_b64":"BzM7rwyqwhkc7LjkjFr0HCQNwTZqby8WW3434wMB1CC3rCb9C5xDECcDyJ7O4lBR3NITyIIYVqqA09HYpMXwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146d826a6f36ce81aae118a23ea3c2e2de5667474583075e6f25dcb106743e45","last_reissued_at":"2026-05-18T00:57:00.238388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:00.238388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SyGuS-Comp 2016: Results and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.SE","authors_text":"Armando Solar-Lezama (Massachusetts Institute of Technology), Dana Fisman (Ben-Gurion University), Rajeev Alur (University of Pennsylvania), Redmond), Rishabh Singh (Microsoft Research","submitted_at":"2016-11-23T03:17:40Z","abstract_excerpt":"Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula $\\varphi$ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB.\n  The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07627","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":"1611.07627","created_at":"2026-05-18T00:57:00.238527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07627v1","created_at":"2026-05-18T00:57:00.238527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07627","created_at":"2026-05-18T00:57:00.238527+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRWYE2TPG3HI","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRWYE2TPG3HIDKXB","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRWYE2TP","created_at":"2026-05-18T12:30:09.641336+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/CRWYE2TPG3HIDKXBDCRD5I6C4L","json":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L.json","graph_json":"https://pith.science/api/pith-number/CRWYE2TPG3HIDKXBDCRD5I6C4L/graph.json","events_json":"https://pith.science/api/pith-number/CRWYE2TPG3HIDKXBDCRD5I6C4L/events.json","paper":"https://pith.science/paper/CRWYE2TP"},"agent_actions":{"view_html":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L","download_json":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L.json","view_paper":"https://pith.science/paper/CRWYE2TP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07627&json=true","fetch_graph":"https://pith.science/api/pith-number/CRWYE2TPG3HIDKXBDCRD5I6C4L/graph.json","fetch_events":"https://pith.science/api/pith-number/CRWYE2TPG3HIDKXBDCRD5I6C4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L/action/storage_attestation","attest_author":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L/action/author_attestation","sign_citation":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L/action/citation_signature","submit_replication":"https://pith.science/pith/CRWYE2TPG3HIDKXBDCRD5I6C4L/action/replication_record"}},"created_at":"2026-05-18T00:57:00.238527+00:00","updated_at":"2026-05-18T00:57:00.238527+00:00"}