{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YYHIL2UKUQ6R3BBQMRKGVZPSBS","short_pith_number":"pith:YYHIL2UK","canonical_record":{"source":{"id":"1410.4956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-18T13:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"1731f24e9a33cbb6d2a173bdf8084e384c2adb356dda994315aea961af436bd4","abstract_canon_sha256":"d861df947b895f8a0c916c4cd9bdeb1f6d12eee28c0541edd9dfd29819254ec2"},"schema_version":"1.0"},"canonical_sha256":"c60e85ea8aa43d1d843064546ae5f20ca97b94a597554008f8ef6a6bb22ee123","source":{"kind":"arxiv","id":"1410.4956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4956","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4956v2","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4956","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"YYHIL2UKUQ6R","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYHIL2UKUQ6R3BBQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYHIL2UK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YYHIL2UKUQ6R3BBQMRKGVZPSBS","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-18T13:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"1731f24e9a33cbb6d2a173bdf8084e384c2adb356dda994315aea961af436bd4","abstract_canon_sha256":"d861df947b895f8a0c916c4cd9bdeb1f6d12eee28c0541edd9dfd29819254ec2"},"schema_version":"1.0"},"canonical_sha256":"c60e85ea8aa43d1d843064546ae5f20ca97b94a597554008f8ef6a6bb22ee123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:39.897610Z","signature_b64":"CoSbv+Xk8xOaL0LhEgYwIxf5Nw/F7LFp3eDn8RxXGRSCSW0TwGtsyGJIdnutlvXiP3j2GkxR2TYSMhH7eUWSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c60e85ea8aa43d1d843064546ae5f20ca97b94a597554008f8ef6a6bb22ee123","last_reissued_at":"2026-05-18T02:39:39.896932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:39.896932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4956","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-18T02:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RBmoeZJpBXwzgHDsp/m8HhAgC0CpGGozT+FfVeIp9XIcF8bidFl/j0BDTMEzLeIghcb6UfwZ4GEM8+bPutvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:17:02.417220Z"},"content_sha256":"4fcd278d2821558606f2a63e05c7ea6addcaf76bbd30786ce471f08448552c76","schema_version":"1.0","event_id":"sha256:4fcd278d2821558606f2a63e05c7ea6addcaf76bbd30786ce471f08448552c76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YYHIL2UKUQ6R3BBQMRKGVZPSBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transforming while/do/for/foreach-Loops into Recursive Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Insa, Josep Silva","submitted_at":"2014-10-18T13:43:53Z","abstract_excerpt":"In software engineering, taking a good election between recursion and iteration is essential because their efficiency and maintenance are different. In fact, developers often need to transform iteration into recursion (e.g., in debugging, to decompose the call graph into iterations); thus, it is quite surprising that there does not exist a public transformation from loops to recursion that handles all kinds of loops. This article describes a transformation able to transform iterative loops into equivalent recursive methods. The transformation is described for the programming language Java, but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4956","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-18T02:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"po8ZkgYMoQjXlHnT7HDE5ZwOerxRFpeTiLgK4nge4Dsfi63tRpgvsKe98gEcLdZ2P6N6y6VUf3c90sSBSa+8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:17:02.417573Z"},"content_sha256":"25caa03ede4ecda46a067371ad058462a909c1a9b8606a1a21852b506ea6a42e","schema_version":"1.0","event_id":"sha256:25caa03ede4ecda46a067371ad058462a909c1a9b8606a1a21852b506ea6a42e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/bundle.json","state_url":"https://pith.science/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/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-28T14:17:02Z","links":{"resolver":"https://pith.science/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS","bundle":"https://pith.science/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/bundle.json","state":"https://pith.science/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYHIL2UKUQ6R3BBQMRKGVZPSBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YYHIL2UKUQ6R3BBQMRKGVZPSBS","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":"d861df947b895f8a0c916c4cd9bdeb1f6d12eee28c0541edd9dfd29819254ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-18T13:43:53Z","title_canon_sha256":"1731f24e9a33cbb6d2a173bdf8084e384c2adb356dda994315aea961af436bd4"},"schema_version":"1.0","source":{"id":"1410.4956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4956","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4956v2","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4956","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"YYHIL2UKUQ6R","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYHIL2UKUQ6R3BBQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYHIL2UK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:25caa03ede4ecda46a067371ad058462a909c1a9b8606a1a21852b506ea6a42e","target":"graph","created_at":"2026-05-18T02:39:39Z","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":"In software engineering, taking a good election between recursion and iteration is essential because their efficiency and maintenance are different. In fact, developers often need to transform iteration into recursion (e.g., in debugging, to decompose the call graph into iterations); thus, it is quite surprising that there does not exist a public transformation from loops to recursion that handles all kinds of loops. This article describes a transformation able to transform iterative loops into equivalent recursive methods. The transformation is described for the programming language Java, but","authors_text":"David Insa, Josep Silva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-18T13:43:53Z","title":"Transforming while/do/for/foreach-Loops into Recursive Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4956","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:4fcd278d2821558606f2a63e05c7ea6addcaf76bbd30786ce471f08448552c76","target":"record","created_at":"2026-05-18T02:39:39Z","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":"d861df947b895f8a0c916c4cd9bdeb1f6d12eee28c0541edd9dfd29819254ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-18T13:43:53Z","title_canon_sha256":"1731f24e9a33cbb6d2a173bdf8084e384c2adb356dda994315aea961af436bd4"},"schema_version":"1.0","source":{"id":"1410.4956","kind":"arxiv","version":2}},"canonical_sha256":"c60e85ea8aa43d1d843064546ae5f20ca97b94a597554008f8ef6a6bb22ee123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c60e85ea8aa43d1d843064546ae5f20ca97b94a597554008f8ef6a6bb22ee123","first_computed_at":"2026-05-18T02:39:39.896932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:39.896932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoSbv+Xk8xOaL0LhEgYwIxf5Nw/F7LFp3eDn8RxXGRSCSW0TwGtsyGJIdnutlvXiP3j2GkxR2TYSMhH7eUWSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:39.897610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcd278d2821558606f2a63e05c7ea6addcaf76bbd30786ce471f08448552c76","sha256:25caa03ede4ecda46a067371ad058462a909c1a9b8606a1a21852b506ea6a42e"],"state_sha256":"4ccde8752c8d3aad3aab5bcd8e0326e5b60b265204a0a609a9a6c0164c82f7d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGNjBQo4SCmBytmkR4MV/9Bvwl15SueaDov+oFd8qEa7HSPZInaelGVnjgsuosd6GsRNm3TtMQZBEFjV3xuTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:17:02.419592Z","bundle_sha256":"8778fe753e84791b5e33f2d42309999f4b6f44957602df76f02e06f52e5f6ca3"}}