{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:C7C6LVY7LC36YYIXC2HX4ZASCR","short_pith_number":"pith:C7C6LVY7","schema_version":"1.0","canonical_sha256":"17c5e5d71f58b7ec6117168f7e641214557e2c3cbf55ae754643fef6f1c27dc7","source":{"kind":"arxiv","id":"2110.07811","version":1},"attestation_state":"computed","paper":{"title":"Cascaded Fast and Slow Models for Efficient Semantic Code Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CL","authors_text":"Akhilesh Deepak Gotmare, Junnan Li, Shafiq Joty, Steven C.H. Hoi","submitted_at":"2021-10-15T02:23:35Z","abstract_excerpt":"The goal of natural language semantic code search is to retrieve a semantically relevant code snippet from a fixed set of candidates using a natural language query. Existing approaches are neither effective nor efficient enough towards a practical semantic code search system. In this paper, we propose an efficient and accurate semantic code search framework with cascaded fast and slow models, in which a fast transformer encoder model is learned to optimize a scalable index for fast retrieval followed by learning a slow classification-based re-ranking model to improve the performance of the top"},"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":"2110.07811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2021-10-15T02:23:35Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e131ca90de856b380720f946e97f7e2903a94aa4a9380f51a5e69a17fa0ef990","abstract_canon_sha256":"2a46813bada98c73de087b6748a8c85c046fc609a037bebe4c49c8b9b7dcafe4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:50.062369Z","signature_b64":"d73gCz1rW/nXJdwj8axgJSCfA8Sz4GH+aiUtXym/WZQyZI4lPDezAR267O4a4qFs3RJ+q82eIdPqkUo5DIeoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c5e5d71f58b7ec6117168f7e641214557e2c3cbf55ae754643fef6f1c27dc7","last_reissued_at":"2026-07-05T03:22:50.061979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:50.061979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cascaded Fast and Slow Models for Efficient Semantic Code Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CL","authors_text":"Akhilesh Deepak Gotmare, Junnan Li, Shafiq Joty, Steven C.H. Hoi","submitted_at":"2021-10-15T02:23:35Z","abstract_excerpt":"The goal of natural language semantic code search is to retrieve a semantically relevant code snippet from a fixed set of candidates using a natural language query. Existing approaches are neither effective nor efficient enough towards a practical semantic code search system. In this paper, we propose an efficient and accurate semantic code search framework with cascaded fast and slow models, in which a fast transformer encoder model is learned to optimize a scalable index for fast retrieval followed by learning a slow classification-based re-ranking model to improve the performance of the top"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07811","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/2110.07811/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":"2110.07811","created_at":"2026-07-05T03:22:50.062032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07811v1","created_at":"2026-07-05T03:22:50.062032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07811","created_at":"2026-07-05T03:22:50.062032+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7C6LVY7LC36","created_at":"2026-07-05T03:22:50.062032+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7C6LVY7LC36YYIX","created_at":"2026-07-05T03:22:50.062032+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7C6LVY7","created_at":"2026-07-05T03:22:50.062032+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR","json":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR.json","graph_json":"https://pith.science/api/pith-number/C7C6LVY7LC36YYIXC2HX4ZASCR/graph.json","events_json":"https://pith.science/api/pith-number/C7C6LVY7LC36YYIXC2HX4ZASCR/events.json","paper":"https://pith.science/paper/C7C6LVY7"},"agent_actions":{"view_html":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR","download_json":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR.json","view_paper":"https://pith.science/paper/C7C6LVY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07811&json=true","fetch_graph":"https://pith.science/api/pith-number/C7C6LVY7LC36YYIXC2HX4ZASCR/graph.json","fetch_events":"https://pith.science/api/pith-number/C7C6LVY7LC36YYIXC2HX4ZASCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR/action/storage_attestation","attest_author":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR/action/author_attestation","sign_citation":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR/action/citation_signature","submit_replication":"https://pith.science/pith/C7C6LVY7LC36YYIXC2HX4ZASCR/action/replication_record"}},"created_at":"2026-07-05T03:22:50.062032+00:00","updated_at":"2026-07-05T03:22:50.062032+00:00"}