{"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/promptgenerator","entry":"PromptGenerator","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":5,"n_samples_constructed":5,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":5,"unverified":3},"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":"2607.17653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"iamjingli/LFM","path":"train_target.py","file_url":"https://github.com/iamjingli/LFM/blob/HEAD/train_target.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":"4db77fc0e9bf39b0","code_sha256_prefix":"4db77fc0e9bf39b0","mcp_get_code":{"code_sha256":"4db77fc0e9bf39b0"}},{"arxiv_id":"2606.27655","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27655","title":"Temporal-Emerged Prompting for Segment Anything in Multiframe Infrared Small Target Detection","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"cdh8285/TEP-SAM","path":"models/sam_withToken.py","file_url":"https://github.com/cdh8285/TEP-SAM/blob/HEAD/models/sam_withToken.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":"c6dd8fd76ae71133","code_sha256_prefix":"c6dd8fd76ae71133","mcp_get_code":{"code_sha256":"c6dd8fd76ae71133"}},{"arxiv_id":"2603.29644","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-29644","title":"Disentangled Graph Prompting for Out-Of-Distribution Detection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"BUPT-GAMMA/DGP","path":"DGP_GCL.py","file_url":"https://github.com/BUPT-GAMMA/DGP/blob/HEAD/DGP_GCL.py","status":"ran","verification_level":1,"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, BUPT-GAMMA/DGP when it was checked","code_sha256":"451bfbf7173e4ca9","code_sha256_prefix":"451bfbf7173e4ca9","mcp_get_code":{"code_sha256":"451bfbf7173e4ca9"}},{"arxiv_id":"2603.18891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18891","title":"PromptHub: Enhancing Multi-Prompt Visual In-Context Learning with Locality-Aware Fusion, Concentration and Alignment","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"luotc-why/ICLR26-PromptHub","path":"models/prompt_generator.py","file_url":"https://github.com/luotc-why/ICLR26-PromptHub/blob/HEAD/models/prompt_generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luotc-why/ICLR26-PromptHub when it was checked","code_sha256":"9c857e0f94b1be9d","code_sha256_prefix":"9c857e0f94b1be9d","mcp_get_code":{"code_sha256":"9c857e0f94b1be9d"}},{"arxiv_id":"2405.14804","arxiv_id_is_arxiv":true,"paper":"/paper/can-llms-solve-longer-math-word-problems","title":"Can LLMs Solve longer Math Word Problems Better?","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinxu-ustc/coleg-math","path":"proprietary-llms/prompt_generator.py","file_url":"https://github.com/xinxu-ustc/coleg-math/blob/HEAD/proprietary-llms/prompt_generator.py","status":"ran","verification_level":1,"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, xinxu-ustc/coleg-math when it was checked","code_sha256":"48332bf292c7a698","code_sha256_prefix":"48332bf292c7a698","mcp_get_code":{"code_sha256":"48332bf292c7a698"}},{"arxiv_id":"2303.10883","arxiv_id_is_arxiv":true,"paper":"/paper/explicit-visual-prompting-for-low-level","title":"Explicit Visual Prompting for Low-Level Structure Segmentations","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nifangbaage/explicit-visual-prompt","path":"models/mmseg/models/backbones/mix_transformer_evp.py","file_url":"https://github.com/nifangbaage/explicit-visual-prompt/blob/HEAD/models/mmseg/models/backbones/mix_transformer_evp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1260af12c9528947","code_sha256_prefix":"1260af12c9528947","mcp_get_code":{"code_sha256":"1260af12c9528947"}},{"arxiv_id":"2209.15210","arxiv_id_is_arxiv":true,"paper":"/paper/multi-prompt-alignment-for-multi-source","title":"Multi-Prompt Alignment for Multi-Source Unsupervised Domain Adaptation","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoranchen/multi-prompt-alignment-for-msuda","path":"model.py","file_url":"https://github.com/haoranchen/multi-prompt-alignment-for-msuda/blob/HEAD/model.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, haoranchen/multi-prompt-alignment-for-msuda when it was checked","code_sha256":"f687f604e0d1fd55","code_sha256_prefix":"f687f604e0d1fd55","mcp_get_code":{"code_sha256":"f687f604e0d1fd55"}},{"arxiv_id":"2205.11024","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantized-input-contextualized-soft","title":"Vector-Quantized Input-Contextualized Soft Prompts for Natural Language Understanding","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/vip","path":"src/prompt_gen_module.py","file_url":"https://github.com/declare-lab/vip/blob/HEAD/src/prompt_gen_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94aed0e75bec78c5","code_sha256_prefix":"94aed0e75bec78c5","mcp_get_code":{"code_sha256":"94aed0e75bec78c5"}}],"record_sha256":"1c63a7be1d516585b26bdd1c00e7b1764431d1c9576362846458abc1f6e01db3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}