{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XBI7VRI7GC4PYMUN3HTT25TDR5","short_pith_number":"pith:XBI7VRI7","schema_version":"1.0","canonical_sha256":"b851fac51f30b8fc328dd9e73d76638f6364b6e7fb484ac07f25736ad30e6b07","source":{"kind":"arxiv","id":"1802.04428","version":1},"attestation_state":"computed","paper":{"title":"Reconciling Enumerative and Symbolic Search in Syntax-Guided Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Kangjing Huang, Qi Tian, Xiaokang Qiu, Yanjun Wang","submitted_at":"2018-02-13T01:53:50Z","abstract_excerpt":"Syntax-guided synthesis aims to find a program satisfying semantic specification as well as user-provided structural hypothesis. For syntax-guided synthesis there are two main search strategies: concrete search, which systematically or stochastically enumerates all possible solutions, and symbolic search, which interacts with a constraint solver to solve the synthesis problem. In this paper, we propose a concolic synthesis framework which combines the best of the two worlds. Based on a decision tree representation, our framework works by enumerating tree heights from the smallest possible one "},"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":"1802.04428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-13T01:53:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a79f388d2adf409cc2ba44438303e4d61354fe4c9451b3264ce52638809c7c6c","abstract_canon_sha256":"b26065ec1fefd870efdd0a4e2241fb90d5e0665ba62401f4dd5794ed25ab9bad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:44.222861Z","signature_b64":"+fVX4JtZGMG4SrKwJ6fQ2cCfb4mOJb1ur55jgkAiJZCHUISX2u3sGRe9Qst96YuG5n5HbdcDYWHPFSeMipsuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b851fac51f30b8fc328dd9e73d76638f6364b6e7fb484ac07f25736ad30e6b07","last_reissued_at":"2026-05-18T00:23:44.222378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:44.222378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconciling Enumerative and Symbolic Search in Syntax-Guided Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Kangjing Huang, Qi Tian, Xiaokang Qiu, Yanjun Wang","submitted_at":"2018-02-13T01:53:50Z","abstract_excerpt":"Syntax-guided synthesis aims to find a program satisfying semantic specification as well as user-provided structural hypothesis. For syntax-guided synthesis there are two main search strategies: concrete search, which systematically or stochastically enumerates all possible solutions, and symbolic search, which interacts with a constraint solver to solve the synthesis problem. In this paper, we propose a concolic synthesis framework which combines the best of the two worlds. Based on a decision tree representation, our framework works by enumerating tree heights from the smallest possible one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04428","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":"1802.04428","created_at":"2026-05-18T00:23:44.222460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04428v1","created_at":"2026-05-18T00:23:44.222460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04428","created_at":"2026-05-18T00:23:44.222460+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBI7VRI7GC4P","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBI7VRI7GC4PYMUN","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBI7VRI7","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.24263","citing_title":"Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5","json":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5.json","graph_json":"https://pith.science/api/pith-number/XBI7VRI7GC4PYMUN3HTT25TDR5/graph.json","events_json":"https://pith.science/api/pith-number/XBI7VRI7GC4PYMUN3HTT25TDR5/events.json","paper":"https://pith.science/paper/XBI7VRI7"},"agent_actions":{"view_html":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5","download_json":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5.json","view_paper":"https://pith.science/paper/XBI7VRI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04428&json=true","fetch_graph":"https://pith.science/api/pith-number/XBI7VRI7GC4PYMUN3HTT25TDR5/graph.json","fetch_events":"https://pith.science/api/pith-number/XBI7VRI7GC4PYMUN3HTT25TDR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5/action/storage_attestation","attest_author":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5/action/author_attestation","sign_citation":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5/action/citation_signature","submit_replication":"https://pith.science/pith/XBI7VRI7GC4PYMUN3HTT25TDR5/action/replication_record"}},"created_at":"2026-05-18T00:23:44.222460+00:00","updated_at":"2026-05-18T00:23:44.222460+00:00"}