{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/build-text-encoder","entry":"build_text_encoder","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2401.01578","arxiv_id_is_arxiv":true,"paper":"/paper/context-guided-spatio-temporal-video","title":"Context-Guided Spatio-Temporal Video Grounding","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HengLan/CGSTVG","path":"models/pipeline.py","file_url":"https://github.com/HengLan/CGSTVG/blob/HEAD/models/pipeline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HengLan/CGSTVG when it was checked","code_sha256":"f804bc70b1f80bc9","code_sha256_prefix":"f804bc70b1f80bc9","mcp_get_code":{"code_sha256":"f804bc70b1f80bc9"}},{"arxiv_id":"2312.01998","arxiv_id_is_arxiv":true,"paper":"/paper/language-only-efficient-training-of-zero-shot","title":"Language-only Efficient Training of Zero-shot Composed Image Retrieval","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navervision/lincir","path":"models.py","file_url":"https://github.com/navervision/lincir/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, navervision/lincir (NOASSERTION)","code_sha256":"2ceb37f80156acbe","code_sha256_prefix":"2ceb37f80156acbe","mcp_get_code":{"code_sha256":"2ceb37f80156acbe"}},{"arxiv_id":"2308.04197","arxiv_id_is_arxiv":true,"paper":"/paper/d3g-exploring-gaussian-prior-for-temporal","title":"D3G: Exploring Gaussian Prior for Temporal Sentence Grounding with Glance Annotation","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"solicucu/D3G","path":"d3g/modeling/d3g/d3g.py","file_url":"https://github.com/solicucu/D3G/blob/HEAD/d3g/modeling/d3g/d3g.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, solicucu/D3G when it was checked","code_sha256":"82e67c084373d3b9","code_sha256_prefix":"82e67c084373d3b9","mcp_get_code":{"code_sha256":"82e67c084373d3b9"}},{"arxiv_id":"2209.13306","arxiv_id_is_arxiv":true,"paper":"/paper/embracing-consistency-a-one-stage-approach","title":"Embracing Consistency: A One-Stage Approach for Spatio-Temporal Video Grounding","date":"2022-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jy0205/stcat","path":"models/pipeline.py","file_url":"https://github.com/jy0205/stcat/blob/HEAD/models/pipeline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10aac717b87ceafd","code_sha256_prefix":"10aac717b87ceafd","mcp_get_code":{"code_sha256":"10aac717b87ceafd"}},{"arxiv_id":"aaai_20163","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20163","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MCG-NJU/MMN","path":"mmn/modeling/mmn/text_encoder.py","file_url":"https://github.com/MCG-NJU/MMN/blob/HEAD/mmn/modeling/mmn/text_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8afbb83c0adfe917","code_sha256_prefix":"8afbb83c0adfe917","mcp_get_code":{"code_sha256":"8afbb83c0adfe917"}},{"arxiv_id":"Byun_An_Efficient_Post-hoc_Framework_for_Reducing_Task_Discrepancy_of_Text_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Byun_An_Efficient_Post-hoc_Framework_for_Reducing_Task_Discrepancy_of_Text_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jaeseokbyun/RTD","path":"models.py","file_url":"https://github.com/jaeseokbyun/RTD/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2fcadbc7274aff1","code_sha256_prefix":"b2fcadbc7274aff1","mcp_get_code":{"code_sha256":"b2fcadbc7274aff1"}}],"record_sha256":"400943a14f6dc29d07b058180a2c7b374ced533f7f3ef991c58ce367086c91ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}