{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NVODCPUOIMXRIBP5AUHAOL4PDB","short_pith_number":"pith:NVODCPUO","schema_version":"1.0","canonical_sha256":"6d5c313e8e432f1405fd050e072f8f1874c336b4cf947e05e5ffb943dee72df0","source":{"kind":"arxiv","id":"1904.07415","version":2},"attestation_state":"computed","paper":{"title":"Resource-Guided Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Di Wang, Jan Hoffmann, Nadia Polikarpova, Tristan Knoth","submitted_at":"2019-04-16T02:34:47Z","abstract_excerpt":"This article presents resource-guided synthesis, a technique for synthesizing recursive programs that satisfy both a functional specification and a symbolic resource bound. The technique is type-directed and rests upon a novel type system that combines polymorphic refinement types with potential annotations of automatic amortized resource analysis. The type system enables efficient constraint-based type checking and can express precise refinement-based resource bounds. The proof of type soundness shows that synthesized programs are correct by construction. By tightly integrating program explor"},"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":"1904.07415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-16T02:34:47Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"87c6e988176ca1235a1f502b5f9eec6593027c2ffd723332e014bf9a94837c5c","abstract_canon_sha256":"29a067cfe14e692ddc386ee4fa46a95c51a8bd90494bf7f79aa3564ed371856e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:14.390387Z","signature_b64":"sCbm8gpsmY7pRowj9FUVfYrAa3KaNGDzPTMRLBhSFq6nxyQmTq4Z4EMffCMxO8YSnnUYAASUbROXRELP4wMeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d5c313e8e432f1405fd050e072f8f1874c336b4cf947e05e5ffb943dee72df0","last_reissued_at":"2026-05-17T23:48:14.389490Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:14.389490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource-Guided Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Di Wang, Jan Hoffmann, Nadia Polikarpova, Tristan Knoth","submitted_at":"2019-04-16T02:34:47Z","abstract_excerpt":"This article presents resource-guided synthesis, a technique for synthesizing recursive programs that satisfy both a functional specification and a symbolic resource bound. The technique is type-directed and rests upon a novel type system that combines polymorphic refinement types with potential annotations of automatic amortized resource analysis. The type system enables efficient constraint-based type checking and can express precise refinement-based resource bounds. The proof of type soundness shows that synthesized programs are correct by construction. By tightly integrating program explor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07415","kind":"arxiv","version":2},"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":"1904.07415","created_at":"2026-05-17T23:48:14.389629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07415v2","created_at":"2026-05-17T23:48:14.389629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07415","created_at":"2026-05-17T23:48:14.389629+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVODCPUOIMXR","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVODCPUOIMXRIBP5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVODCPUO","created_at":"2026-05-18T12:33:24.271573+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/NVODCPUOIMXRIBP5AUHAOL4PDB","json":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB.json","graph_json":"https://pith.science/api/pith-number/NVODCPUOIMXRIBP5AUHAOL4PDB/graph.json","events_json":"https://pith.science/api/pith-number/NVODCPUOIMXRIBP5AUHAOL4PDB/events.json","paper":"https://pith.science/paper/NVODCPUO"},"agent_actions":{"view_html":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB","download_json":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB.json","view_paper":"https://pith.science/paper/NVODCPUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07415&json=true","fetch_graph":"https://pith.science/api/pith-number/NVODCPUOIMXRIBP5AUHAOL4PDB/graph.json","fetch_events":"https://pith.science/api/pith-number/NVODCPUOIMXRIBP5AUHAOL4PDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB/action/storage_attestation","attest_author":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB/action/author_attestation","sign_citation":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB/action/citation_signature","submit_replication":"https://pith.science/pith/NVODCPUOIMXRIBP5AUHAOL4PDB/action/replication_record"}},"created_at":"2026-05-17T23:48:14.389629+00:00","updated_at":"2026-05-17T23:48:14.389629+00:00"}