{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3FF3ZXKVHCV4T5LF24YCN4V74Y","short_pith_number":"pith:3FF3ZXKV","schema_version":"1.0","canonical_sha256":"d94bbcdd5538abc9f565d73026f2bfe603645c40ce0abcc312bc02d7211ccb4a","source":{"kind":"arxiv","id":"2106.09173","version":1},"attestation_state":"computed","paper":{"title":"Cross-Language Code Search using Static and Dynamic Analyses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"George Mathew, Kathryn T. Stolee","submitted_at":"2021-06-16T23:27:01Z","abstract_excerpt":"As code search permeates most activities in software development,code-to-code search has emerged to support using code as a query and retrieving similar code in the search results. Applications include duplicate code detection for refactoring, patch identification for program repair, and language translation. Existing code-to-code search tools rely on static similarity approaches such as the comparison of tokens and abstract syntax trees (AST) to approximate dynamic behavior, leading to low precision. Most tools do not support cross-language code-to-code search, and those that do, rely on mach"},"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":"2106.09173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-06-16T23:27:01Z","cross_cats_sorted":[],"title_canon_sha256":"81624f3516fd1c58216eb7535f6ff06fe5dbca5e2b9f84a0dcd4041aae9ef161","abstract_canon_sha256":"635b30422822860c60227256d7125d5682c710bf471899853f31beac2f0a20ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:13.049847Z","signature_b64":"ghfUmfj2/Nvda4J1s1mtuTNfQ6lyB+ju5ZNN0hU3SVpDphF1BdYVThontxvEWZu1YoRKgcVZZdEaWG76Wn/3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d94bbcdd5538abc9f565d73026f2bfe603645c40ce0abcc312bc02d7211ccb4a","last_reissued_at":"2026-07-05T02:50:13.049464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:13.049464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Language Code Search using Static and Dynamic Analyses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"George Mathew, Kathryn T. Stolee","submitted_at":"2021-06-16T23:27:01Z","abstract_excerpt":"As code search permeates most activities in software development,code-to-code search has emerged to support using code as a query and retrieving similar code in the search results. Applications include duplicate code detection for refactoring, patch identification for program repair, and language translation. Existing code-to-code search tools rely on static similarity approaches such as the comparison of tokens and abstract syntax trees (AST) to approximate dynamic behavior, leading to low precision. Most tools do not support cross-language code-to-code search, and those that do, rely on mach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09173","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/2106.09173/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":"2106.09173","created_at":"2026-07-05T02:50:13.049514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09173v1","created_at":"2026-07-05T02:50:13.049514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09173","created_at":"2026-07-05T02:50:13.049514+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FF3ZXKVHCV4","created_at":"2026-07-05T02:50:13.049514+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FF3ZXKVHCV4T5LF","created_at":"2026-07-05T02:50:13.049514+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FF3ZXKV","created_at":"2026-07-05T02:50:13.049514+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.09714","citing_title":"How Small Transformation Expose the Weakness of Semantic Similarity Measures","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y","json":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y.json","graph_json":"https://pith.science/api/pith-number/3FF3ZXKVHCV4T5LF24YCN4V74Y/graph.json","events_json":"https://pith.science/api/pith-number/3FF3ZXKVHCV4T5LF24YCN4V74Y/events.json","paper":"https://pith.science/paper/3FF3ZXKV"},"agent_actions":{"view_html":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y","download_json":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y.json","view_paper":"https://pith.science/paper/3FF3ZXKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09173&json=true","fetch_graph":"https://pith.science/api/pith-number/3FF3ZXKVHCV4T5LF24YCN4V74Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3FF3ZXKVHCV4T5LF24YCN4V74Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y/action/storage_attestation","attest_author":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y/action/author_attestation","sign_citation":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y/action/citation_signature","submit_replication":"https://pith.science/pith/3FF3ZXKVHCV4T5LF24YCN4V74Y/action/replication_record"}},"created_at":"2026-07-05T02:50:13.049514+00:00","updated_at":"2026-07-05T02:50:13.049514+00:00"}