{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LOQGNRLHEG4BOAZNQYSSKTC2VE","short_pith_number":"pith:LOQGNRLH","canonical_record":{"source":{"id":"1701.04288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-16T13:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"81e472179c86427451f32b0d283a66d3d5fe6c8c4aaf716b4d77ef260e760f57","abstract_canon_sha256":"3eb3ebd9a1d5e066461a2552a45748e1dbed564701b4c60c317da8588f32499a"},"schema_version":"1.0"},"canonical_sha256":"5ba066c56721b817032d8625254c5aa9064d0a3fd454b142e32a432827d97fa6","source":{"kind":"arxiv","id":"1701.04288","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04288","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04288v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04288","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"LOQGNRLHEG4B","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LOQGNRLHEG4BOAZN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LOQGNRLH","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LOQGNRLHEG4BOAZNQYSSKTC2VE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-16T13:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"81e472179c86427451f32b0d283a66d3d5fe6c8c4aaf716b4d77ef260e760f57","abstract_canon_sha256":"3eb3ebd9a1d5e066461a2552a45748e1dbed564701b4c60c317da8588f32499a"},"schema_version":"1.0"},"canonical_sha256":"5ba066c56721b817032d8625254c5aa9064d0a3fd454b142e32a432827d97fa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.167282Z","signature_b64":"GuIYjf0np0g9SE3RdCRKqEw2998RLWhyLi3yjzND4fMvdLDP0F4NH0XQJ2t/vRfuU60PeETAviYSnA2W6CpOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba066c56721b817032d8625254c5aa9064d0a3fd454b142e32a432827d97fa6","last_reissued_at":"2026-05-18T00:43:45.166720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.166720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04288","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qiRsYJ/V3ER2OzgKxu7nIRr93WUhvC7YvsrurnJs7jb20zdcsOve3Xtq7InW9u/7r9619hQD/ps4RlAZt0fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:27:18.663122Z"},"content_sha256":"38acd4c8169578384276363e9b0ef9844e07087da4413321068cfb072e498d6b","schema_version":"1.0","event_id":"sha256:38acd4c8169578384276363e9b0ef9844e07087da4413321068cfb072e498d6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LOQGNRLHEG4BOAZNQYSSKTC2VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jad Hamza, Mika\\\"el Mayer, Viktor Kuncak","submitted_at":"2017-01-16T13:47:26Z","abstract_excerpt":"Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute to foundations of such techniques and present a complete algorithm for synthesis of a class of recursive functions defined by structural recursion over a given algebraic data type definition. The functions we consider map an algebraic data type to a string; they are useful for, e.g., pretty printing and serialization of programs and data. We f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04288","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXOBPCTWSfY1+JSgc1u0k35Qrb2N3Oqyh6pOIs394FZkcHMUf3gJn/zLQlpeKA+jzhZrRKdboAiG/wwRTcVMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:27:18.663775Z"},"content_sha256":"9f05247fc6284906fe3b891df12fdc7c9b49e3b80781e3ab6fc985ace09b4f8a","schema_version":"1.0","event_id":"sha256:9f05247fc6284906fe3b891df12fdc7c9b49e3b80781e3ab6fc985ace09b4f8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/bundle.json","state_url":"https://pith.science/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:27:18Z","links":{"resolver":"https://pith.science/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE","bundle":"https://pith.science/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/bundle.json","state":"https://pith.science/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOQGNRLHEG4BOAZNQYSSKTC2VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LOQGNRLHEG4BOAZNQYSSKTC2VE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3eb3ebd9a1d5e066461a2552a45748e1dbed564701b4c60c317da8588f32499a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-16T13:47:26Z","title_canon_sha256":"81e472179c86427451f32b0d283a66d3d5fe6c8c4aaf716b4d77ef260e760f57"},"schema_version":"1.0","source":{"id":"1701.04288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04288","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04288v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04288","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"LOQGNRLHEG4B","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LOQGNRLHEG4BOAZN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LOQGNRLH","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:9f05247fc6284906fe3b891df12fdc7c9b49e3b80781e3ab6fc985ace09b4f8a","target":"graph","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute to foundations of such techniques and present a complete algorithm for synthesis of a class of recursive functions defined by structural recursion over a given algebraic data type definition. The functions we consider map an algebraic data type to a string; they are useful for, e.g., pretty printing and serialization of programs and data. We f","authors_text":"Jad Hamza, Mika\\\"el Mayer, Viktor Kuncak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-16T13:47:26Z","title":"Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04288","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:38acd4c8169578384276363e9b0ef9844e07087da4413321068cfb072e498d6b","target":"record","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3eb3ebd9a1d5e066461a2552a45748e1dbed564701b4c60c317da8588f32499a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-16T13:47:26Z","title_canon_sha256":"81e472179c86427451f32b0d283a66d3d5fe6c8c4aaf716b4d77ef260e760f57"},"schema_version":"1.0","source":{"id":"1701.04288","kind":"arxiv","version":2}},"canonical_sha256":"5ba066c56721b817032d8625254c5aa9064d0a3fd454b142e32a432827d97fa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba066c56721b817032d8625254c5aa9064d0a3fd454b142e32a432827d97fa6","first_computed_at":"2026-05-18T00:43:45.166720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:45.166720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GuIYjf0np0g9SE3RdCRKqEw2998RLWhyLi3yjzND4fMvdLDP0F4NH0XQJ2t/vRfuU60PeETAviYSnA2W6CpOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:45.167282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38acd4c8169578384276363e9b0ef9844e07087da4413321068cfb072e498d6b","sha256:9f05247fc6284906fe3b891df12fdc7c9b49e3b80781e3ab6fc985ace09b4f8a"],"state_sha256":"b4604aa50e9f2c357bb62445b9078ed4709391b3a5a248c140c258703488df54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7plkjc6dqTyY4URZgLdHgo9D1Thjt4Bju/SjZDeYhDHn8vFhgRyYg4veQSfiw6Aq/wyPRLWY6ZWOuNXhJOJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:27:18.667305Z","bundle_sha256":"776466eabaae90dd8e5e9d417b9fe0d25b26b110964bb83c4929a0b4a8e9f6b9"}}