{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YGY5RWTTCSVNQTJEPJUF54CQ6M","short_pith_number":"pith:YGY5RWTT","canonical_record":{"source":{"id":"1507.05527","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-20T15:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"3615e143c2e277b815d2077d43ec3bb9a866bba18705eec883baf7980bca9f4d","abstract_canon_sha256":"ecad0277ac60feadb5f72d61474689a8f1fd9c5138c3930c2255f0a1a90a4ac1"},"schema_version":"1.0"},"canonical_sha256":"c1b1d8da7314aad84d247a685ef050f30e7e655b0c867bbf5196c173b911884e","source":{"kind":"arxiv","id":"1507.05527","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05527","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05527v3","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05527","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"YGY5RWTTCSVN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGY5RWTTCSVNQTJE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGY5RWTT","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YGY5RWTTCSVNQTJEPJUF54CQ6M","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05527","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-20T15:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"3615e143c2e277b815d2077d43ec3bb9a866bba18705eec883baf7980bca9f4d","abstract_canon_sha256":"ecad0277ac60feadb5f72d61474689a8f1fd9c5138c3930c2255f0a1a90a4ac1"},"schema_version":"1.0"},"canonical_sha256":"c1b1d8da7314aad84d247a685ef050f30e7e655b0c867bbf5196c173b911884e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.225539Z","signature_b64":"Wa7OW6b9Hd/wF3CWZvh4AhuhsK15c+xLASn7bUCyzJhXTMvPofgqcGZL8apRlvAnjqqdU+9ufyQzMxPvZstnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b1d8da7314aad84d247a685ef050f30e7e655b0c867bbf5196c173b911884e","last_reissued_at":"2026-05-18T00:46:21.225103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.225103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05527","source_version":3,"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Y2LFLE8D2Bo36G5Q9Dg6Ocozjpp/8vI1InTz4vL1W89Aaf/McEuALFUzdeyN0BTY+8oH6x5b9z39hFCvkHYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:52:55.173417Z"},"content_sha256":"a60932d58a2c34636e2928f2e219c46516dba6b0f9d3a51d733e2dc671ee32fc","schema_version":"1.0","event_id":"sha256:a60932d58a2c34636e2928f2e219c46516dba6b0f9d3a51d733e2dc671ee32fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YGY5RWTTCSVNQTJEPJUF54CQ6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesis of Recursive ADT Transformations from Reusable Templates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Armando Solar-Lezama, Benjamin S. Lerner, Jeevana Priya Inala, Nadia Polikarpova, Xiaokang Qiu","submitted_at":"2015-07-20T15:09:58Z","abstract_excerpt":"Recent work has proposed a promising approach to improving scalability of program synthesis by allowing the user to supply a syntactic template that constrains the space of potential programs. Unfortunately, creating templates often requires nontrivial effort from the user, which impedes the usability of the synthesizer. We present a solution to this problem in the context of recursive transformations on algebraic data-types. Our approach relies on polymorphic synthesis constructs: a small but powerful extension to the language of syntactic templates, which makes it possible to define a progra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05527","kind":"arxiv","version":3},"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKGCrig1VzozWn+Ump/keWfhDlLj8uO96squ0ZuEU/FFiw5/ofng4D2LUsC5gQh0uQP/ZJ8KUDgCbX4yKmCqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:52:55.174047Z"},"content_sha256":"723ec0e3488dc2287305acec8b0f71a11e88d78086a80ad59c0426bde09e2cb6","schema_version":"1.0","event_id":"sha256:723ec0e3488dc2287305acec8b0f71a11e88d78086a80ad59c0426bde09e2cb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/bundle.json","state_url":"https://pith.science/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/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-06-11T01:52:55Z","links":{"resolver":"https://pith.science/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M","bundle":"https://pith.science/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/bundle.json","state":"https://pith.science/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGY5RWTTCSVNQTJEPJUF54CQ6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YGY5RWTTCSVNQTJEPJUF54CQ6M","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":"ecad0277ac60feadb5f72d61474689a8f1fd9c5138c3930c2255f0a1a90a4ac1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-20T15:09:58Z","title_canon_sha256":"3615e143c2e277b815d2077d43ec3bb9a866bba18705eec883baf7980bca9f4d"},"schema_version":"1.0","source":{"id":"1507.05527","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05527","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05527v3","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05527","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"YGY5RWTTCSVN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGY5RWTTCSVNQTJE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGY5RWTT","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:723ec0e3488dc2287305acec8b0f71a11e88d78086a80ad59c0426bde09e2cb6","target":"graph","created_at":"2026-05-18T00:46:21Z","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":"Recent work has proposed a promising approach to improving scalability of program synthesis by allowing the user to supply a syntactic template that constrains the space of potential programs. Unfortunately, creating templates often requires nontrivial effort from the user, which impedes the usability of the synthesizer. We present a solution to this problem in the context of recursive transformations on algebraic data-types. Our approach relies on polymorphic synthesis constructs: a small but powerful extension to the language of syntactic templates, which makes it possible to define a progra","authors_text":"Armando Solar-Lezama, Benjamin S. Lerner, Jeevana Priya Inala, Nadia Polikarpova, Xiaokang Qiu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-20T15:09:58Z","title":"Synthesis of Recursive ADT Transformations from Reusable Templates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05527","kind":"arxiv","version":3},"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:a60932d58a2c34636e2928f2e219c46516dba6b0f9d3a51d733e2dc671ee32fc","target":"record","created_at":"2026-05-18T00:46:21Z","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":"ecad0277ac60feadb5f72d61474689a8f1fd9c5138c3930c2255f0a1a90a4ac1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-20T15:09:58Z","title_canon_sha256":"3615e143c2e277b815d2077d43ec3bb9a866bba18705eec883baf7980bca9f4d"},"schema_version":"1.0","source":{"id":"1507.05527","kind":"arxiv","version":3}},"canonical_sha256":"c1b1d8da7314aad84d247a685ef050f30e7e655b0c867bbf5196c173b911884e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1b1d8da7314aad84d247a685ef050f30e7e655b0c867bbf5196c173b911884e","first_computed_at":"2026-05-18T00:46:21.225103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:21.225103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wa7OW6b9Hd/wF3CWZvh4AhuhsK15c+xLASn7bUCyzJhXTMvPofgqcGZL8apRlvAnjqqdU+9ufyQzMxPvZstnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:21.225539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05527","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a60932d58a2c34636e2928f2e219c46516dba6b0f9d3a51d733e2dc671ee32fc","sha256:723ec0e3488dc2287305acec8b0f71a11e88d78086a80ad59c0426bde09e2cb6"],"state_sha256":"58002e921ea7dd2780cccba67dba541d4f28a5f84007274f62a20d0eb0a260ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLBXCtNzVgaZ95pinr4YZTXXrNotZiLbCYE22i3pO9Anv5qQbYY/pxuV9reYn94G9clzNW1zvTpOtd1EvaqrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:52:55.178292Z","bundle_sha256":"c23f140ae26efac8efc6f56f7de1f1d7a002ebab97a857422bd1aae8d85f7152"}}