{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7YMMP5J62CEA6WMZIEM4QFUZ7K","short_pith_number":"pith:7YMMP5J6","schema_version":"1.0","canonical_sha256":"fe18c7f53ed0880f59994119c81699fa895bb594e7e5dc446989e0510effacbd","source":{"kind":"arxiv","id":"1602.01170","version":1},"attestation_state":"computed","paper":{"title":"Results and Analysis of SyGuS-Comp'15","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Armando Solar-Lezama (Massachusetts Institute of Technology), Dana Fisman (University of Pennsylvania), Rajeev Alur (University of Pennsylvania), Rishabh Singh (Microsoft Research)","submitted_at":"2016-02-03T02:49: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":"1602.01170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-03T02:49:40Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"9e7e8c7e42092a840a74d1daf1bff2acb5c0acbdaeeb89b3d3765bdbdcd3d583","abstract_canon_sha256":"196510dd141511f8051246c4369cb8d085b0532a615de99aeb5655dd0719e3a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.955072Z","signature_b64":"RYI1tbWFviALK0MbA7N28YVBDGmHRh2R+NOXhvX6n5NWGjhWA2TDQ3fjU8YEsXt2GmbDrCiqA0UuLXxffJRuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe18c7f53ed0880f59994119c81699fa895bb594e7e5dc446989e0510effacbd","last_reissued_at":"2026-05-18T01:21:20.954565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.954565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Results and Analysis of SyGuS-Comp'15","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Armando Solar-Lezama (Massachusetts Institute of Technology), Dana Fisman (University of Pennsylvania), Rajeev Alur (University of Pennsylvania), Rishabh Singh (Microsoft Research)","submitted_at":"2016-02-03T02:49: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":"1602.01170","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":"1602.01170","created_at":"2026-05-18T01:21:20.954644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01170v1","created_at":"2026-05-18T01:21:20.954644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01170","created_at":"2026-05-18T01:21:20.954644+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YMMP5J62CEA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YMMP5J62CEA6WMZ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YMMP5J6","created_at":"2026-05-18T12:30:04.600751+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/7YMMP5J62CEA6WMZIEM4QFUZ7K","json":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K.json","graph_json":"https://pith.science/api/pith-number/7YMMP5J62CEA6WMZIEM4QFUZ7K/graph.json","events_json":"https://pith.science/api/pith-number/7YMMP5J62CEA6WMZIEM4QFUZ7K/events.json","paper":"https://pith.science/paper/7YMMP5J6"},"agent_actions":{"view_html":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K","download_json":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K.json","view_paper":"https://pith.science/paper/7YMMP5J6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01170&json=true","fetch_graph":"https://pith.science/api/pith-number/7YMMP5J62CEA6WMZIEM4QFUZ7K/graph.json","fetch_events":"https://pith.science/api/pith-number/7YMMP5J62CEA6WMZIEM4QFUZ7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K/action/storage_attestation","attest_author":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K/action/author_attestation","sign_citation":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K/action/citation_signature","submit_replication":"https://pith.science/pith/7YMMP5J62CEA6WMZIEM4QFUZ7K/action/replication_record"}},"created_at":"2026-05-18T01:21:20.954644+00:00","updated_at":"2026-05-18T01:21:20.954644+00:00"}