{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J3WW3JGINFOYR2FEVWK7BYOQ5J","short_pith_number":"pith:J3WW3JGI","schema_version":"1.0","canonical_sha256":"4eed6da4c8695d88e8a4ad95f0e1d0ea4e46f29efb0f130b8c4ce6f68666da7a","source":{"kind":"arxiv","id":"2406.01500","version":1},"attestation_state":"computed","paper":{"title":"Going Bananas! - Unfolding Program Synthesis with Origami","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Emilio Francesquini, Fabr\\'icio Olivetti de Fran\\c{c}a, Matheus Campos Fernandes","submitted_at":"2024-06-03T16:27:07Z","abstract_excerpt":"Automatically creating a computer program using input-output examples can be a challenging task, especially when trying to synthesize computer programs that require loops or recursion. Even though the use of recursion can make the algorithmic description more succinct and declarative, this concept creates additional barriers to program synthesis algorithms such as the creation and the (tentative) evaluation of non-terminating programs. One reason is that the recursive function must define how to traverse (or generate) the data structure and, at the same time, how to process it. In functional p"},"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":"2406.01500","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-03T16:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"7e77d0be0ad5ac998bb1c737a926d98f5002564c1a2026cc688bec838297584d","abstract_canon_sha256":"5944b0f6eb2c9bda2e828085da462bf12a027e82cbe86b16a82b5cee1ab5610a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:40.546054Z","signature_b64":"Ul8nLwO83lmrL+mCxgW956gvxakgU8tNkklJuyMKaY/EmGgIIkRBjOrqiVuB0VYT46fCcdeDiZEc3LkxdDgRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eed6da4c8695d88e8a4ad95f0e1d0ea4e46f29efb0f130b8c4ce6f68666da7a","last_reissued_at":"2026-07-05T08:26:40.545493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:40.545493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Going Bananas! - Unfolding Program Synthesis with Origami","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Emilio Francesquini, Fabr\\'icio Olivetti de Fran\\c{c}a, Matheus Campos Fernandes","submitted_at":"2024-06-03T16:27:07Z","abstract_excerpt":"Automatically creating a computer program using input-output examples can be a challenging task, especially when trying to synthesize computer programs that require loops or recursion. Even though the use of recursion can make the algorithmic description more succinct and declarative, this concept creates additional barriers to program synthesis algorithms such as the creation and the (tentative) evaluation of non-terminating programs. One reason is that the recursive function must define how to traverse (or generate) the data structure and, at the same time, how to process it. In functional p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01500","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.01500/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.01500","created_at":"2026-07-05T08:26:40.545552+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01500v1","created_at":"2026-07-05T08:26:40.545552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01500","created_at":"2026-07-05T08:26:40.545552+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3WW3JGINFOY","created_at":"2026-07-05T08:26:40.545552+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3WW3JGINFOYR2FE","created_at":"2026-07-05T08:26:40.545552+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3WW3JGI","created_at":"2026-07-05T08:26:40.545552+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/J3WW3JGINFOYR2FEVWK7BYOQ5J","json":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J.json","graph_json":"https://pith.science/api/pith-number/J3WW3JGINFOYR2FEVWK7BYOQ5J/graph.json","events_json":"https://pith.science/api/pith-number/J3WW3JGINFOYR2FEVWK7BYOQ5J/events.json","paper":"https://pith.science/paper/J3WW3JGI"},"agent_actions":{"view_html":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J","download_json":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J.json","view_paper":"https://pith.science/paper/J3WW3JGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01500&json=true","fetch_graph":"https://pith.science/api/pith-number/J3WW3JGINFOYR2FEVWK7BYOQ5J/graph.json","fetch_events":"https://pith.science/api/pith-number/J3WW3JGINFOYR2FEVWK7BYOQ5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J/action/storage_attestation","attest_author":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J/action/author_attestation","sign_citation":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J/action/citation_signature","submit_replication":"https://pith.science/pith/J3WW3JGINFOYR2FEVWK7BYOQ5J/action/replication_record"}},"created_at":"2026-07-05T08:26:40.545552+00:00","updated_at":"2026-07-05T08:26:40.545552+00:00"}