{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KTUZ4EJEPPTQK6FLSJ6URDKJ4S","short_pith_number":"pith:KTUZ4EJE","canonical_record":{"source":{"id":"2007.11671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2020-07-22T20:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"2cf10017ad59a552434013d47fc9d4e9d9ccbb26c84dcfcfe8b7b6e1ead8cbe9","abstract_canon_sha256":"902bf5449159e98ec15ed8410990ffb831580f43a6dfc79c4cafc7b38a98ab93"},"schema_version":"1.0"},"canonical_sha256":"54e99e11247be70578ab927d488d49e49a9e57afd969ab11be788a98a8a22f37","source":{"kind":"arxiv","id":"2007.11671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11671","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11671v2","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11671","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_12","alias_value":"KTUZ4EJEPPTQ","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_16","alias_value":"KTUZ4EJEPPTQK6FL","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_8","alias_value":"KTUZ4EJE","created_at":"2026-07-05T01:57:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KTUZ4EJEPPTQK6FLSJ6URDKJ4S","target":"record","payload":{"canonical_record":{"source":{"id":"2007.11671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2020-07-22T20:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"2cf10017ad59a552434013d47fc9d4e9d9ccbb26c84dcfcfe8b7b6e1ead8cbe9","abstract_canon_sha256":"902bf5449159e98ec15ed8410990ffb831580f43a6dfc79c4cafc7b38a98ab93"},"schema_version":"1.0"},"canonical_sha256":"54e99e11247be70578ab927d488d49e49a9e57afd969ab11be788a98a8a22f37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:18.572482Z","signature_b64":"1C05VxR+r1KsiISp+5turyq9Ydzgga9kogQ8L3vW4wxH4QqFYQ7UxrkHjKJ/Dsdr5uS5UDeRlsOCnwSJA5BbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e99e11247be70578ab927d488d49e49a9e57afd969ab11be788a98a8a22f37","last_reissued_at":"2026-07-05T01:57:18.572036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:18.572036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.11671","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-07-05T01:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZCsGN2mJt3W921y5RMtc8DZm1AYF17/Hm1TFDQhAFuZs/STp+rXsYnqWlYwl/KTirbBhls5Sma/59jqziWhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T09:22:41.918803Z"},"content_sha256":"5a09f3d3d9f1db507596d627ce9bba4629e357af44aaee8c5b91646636a02c04","schema_version":"1.0","event_id":"sha256:5a09f3d3d9f1db507596d627ce9bba4629e357af44aaee8c5b91646636a02c04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KTUZ4EJEPPTQK6FLSJ6URDKJ4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeepClone: Modeling Clones to Generate Code Predictions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Hamid Abdul Basit, Mark Van Den Brand, Muhammad Hammad, \\\"Onder Babur","submitted_at":"2020-07-22T20:57:26Z","abstract_excerpt":"Programmers often reuse code from source code repositories to reduce the development effort. Code clones are candidates for reuse in exploratory or rapid development, as they represent often repeated functionality in software systems. To facilitate code clone reuse, we propose DeepClone, a novel approach utilizing a deep learning algorithm for modeling code clones to predict the next set of tokens (possibly a complete clone method body) based on the code written so far. The predicted tokens require minimal customization to fit the context. DeepClone applies natural language processing techniqu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11671","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.11671/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"},"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-07-05T01:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2EZBxvfMt49/Jn7A07uI/cwzI5Wbn4d749KtS5cymcNdUrmv7Ta1TJE7SJRpTObcuM66uSO+Q/n1LSRF2SUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T09:22:41.919302Z"},"content_sha256":"d7645a0f1a7a001216a4190eb5109eca87dbe0cf3aff4b55c5effb0e1605bd45","schema_version":"1.0","event_id":"sha256:d7645a0f1a7a001216a4190eb5109eca87dbe0cf3aff4b55c5effb0e1605bd45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/bundle.json","state_url":"https://pith.science/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/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-08-22T09:22:41Z","links":{"resolver":"https://pith.science/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S","bundle":"https://pith.science/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/bundle.json","state":"https://pith.science/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTUZ4EJEPPTQK6FLSJ6URDKJ4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KTUZ4EJEPPTQK6FLSJ6URDKJ4S","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":"902bf5449159e98ec15ed8410990ffb831580f43a6dfc79c4cafc7b38a98ab93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2020-07-22T20:57:26Z","title_canon_sha256":"2cf10017ad59a552434013d47fc9d4e9d9ccbb26c84dcfcfe8b7b6e1ead8cbe9"},"schema_version":"1.0","source":{"id":"2007.11671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11671","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11671v2","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11671","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_12","alias_value":"KTUZ4EJEPPTQ","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_16","alias_value":"KTUZ4EJEPPTQK6FL","created_at":"2026-07-05T01:57:18Z"},{"alias_kind":"pith_short_8","alias_value":"KTUZ4EJE","created_at":"2026-07-05T01:57:18Z"}],"graph_snapshots":[{"event_id":"sha256:d7645a0f1a7a001216a4190eb5109eca87dbe0cf3aff4b55c5effb0e1605bd45","target":"graph","created_at":"2026-07-05T01:57:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.11671/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Programmers often reuse code from source code repositories to reduce the development effort. Code clones are candidates for reuse in exploratory or rapid development, as they represent often repeated functionality in software systems. To facilitate code clone reuse, we propose DeepClone, a novel approach utilizing a deep learning algorithm for modeling code clones to predict the next set of tokens (possibly a complete clone method body) based on the code written so far. The predicted tokens require minimal customization to fit the context. DeepClone applies natural language processing techniqu","authors_text":"Hamid Abdul Basit, Mark Van Den Brand, Muhammad Hammad, \\\"Onder Babur","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2020-07-22T20:57:26Z","title":"DeepClone: Modeling Clones to Generate Code Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11671","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:5a09f3d3d9f1db507596d627ce9bba4629e357af44aaee8c5b91646636a02c04","target":"record","created_at":"2026-07-05T01:57:18Z","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":"902bf5449159e98ec15ed8410990ffb831580f43a6dfc79c4cafc7b38a98ab93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2020-07-22T20:57:26Z","title_canon_sha256":"2cf10017ad59a552434013d47fc9d4e9d9ccbb26c84dcfcfe8b7b6e1ead8cbe9"},"schema_version":"1.0","source":{"id":"2007.11671","kind":"arxiv","version":2}},"canonical_sha256":"54e99e11247be70578ab927d488d49e49a9e57afd969ab11be788a98a8a22f37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e99e11247be70578ab927d488d49e49a9e57afd969ab11be788a98a8a22f37","first_computed_at":"2026-07-05T01:57:18.572036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:57:18.572036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1C05VxR+r1KsiISp+5turyq9Ydzgga9kogQ8L3vW4wxH4QqFYQ7UxrkHjKJ/Dsdr5uS5UDeRlsOCnwSJA5BbBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:57:18.572482Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.11671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a09f3d3d9f1db507596d627ce9bba4629e357af44aaee8c5b91646636a02c04","sha256:d7645a0f1a7a001216a4190eb5109eca87dbe0cf3aff4b55c5effb0e1605bd45"],"state_sha256":"45c1ba796cf5bd7e93eab7b2da1b06c989f8a3534ec33ce28af6d66c4b5bceab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voSPbmzeBiJkG5lLgeHQ3DOasaK6ebX1mNo1qtXG3eFDhbtk5b7aBX9MRpTiw+TQEj9Ypg9rfxEVUSPeseG4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T09:22:41.923762Z","bundle_sha256":"2485d5bed4e590d7d92395b02cb704cbd0d92dbc570e5f746ec445a62eec39ea"}}