{"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/dcg-score","entry":"dcg_score","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":2,"unverified":0},"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":"2505.12260","arxiv_id_is_arxiv":true,"paper":"/paper/lightretriever-a-llm-based-hybrid-retrieval","title":"LightRetriever: A LLM-based Hybrid Retrieval Architecture with 1000x Faster Query Inference","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caskcsg/lightretriever","path":"src/lightretriever/finetune/metrics.py","file_url":"https://github.com/caskcsg/lightretriever/blob/HEAD/src/lightretriever/finetune/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2308.12028","arxiv_id_is_arxiv":true,"paper":"/paper/lkpnr-llm-and-kg-for-personalized-news","title":"LKPNR: LLM and KG for Personalized News Recommendation Framework","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuan-zw/lkpnr","path":"NNR/evaluate.py","file_url":"https://github.com/xuan-zw/lkpnr/blob/HEAD/NNR/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuan-zw/lkpnr when it was checked","code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2302.11050","arxiv_id_is_arxiv":true,"paper":"/paper/edgeformers-graph-empowered-transformers-for","title":"Edgeformers: Graph-Empowered Transformers for Representation Learning on Textual-Edge Networks","date":"2023-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petergriffinjin/edgeformers","path":"Edgeformer-E/src/utils.py","file_url":"https://github.com/petergriffinjin/edgeformers/blob/HEAD/Edgeformer-E/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2205.10282","arxiv_id_is_arxiv":true,"paper":"/paper/heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petergriffinjin/heterformer","path":"downstream/classification.py","file_url":"https://github.com/petergriffinjin/heterformer/blob/HEAD/downstream/classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2109.05446","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-fedrec-efficient-federated-learning","title":"Efficient-FedRec: Efficient Federated Learning Framework for Privacy-Preserving News Recommendation","date":"2021-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjw1029/efficient-fedrec","path":"src/metrics.py","file_url":"https://github.com/yjw1029/efficient-fedrec/blob/HEAD/src/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2105.02605","arxiv_id_is_arxiv":true,"paper":"/paper/graphformers-gnn-nested-language-models-for","title":"GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graph","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/GraphFormers","path":"src/utils.py","file_url":"https://github.com/microsoft/GraphFormers/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e79e8e0904d5d8","code_sha256_prefix":"43e79e8e0904d5d8","mcp_get_code":{"code_sha256":"43e79e8e0904d5d8"}},{"arxiv_id":"2008.05231","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-visual-textual-alignment-for","title":"Fine-grained Visual Textual Alignment for Cross-Modal Retrieval using Transformer Encoders","date":"2020-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mesnico/TERAN","path":"evaluate_utils/dcg.py","file_url":"https://github.com/mesnico/TERAN/blob/HEAD/evaluate_utils/dcg.py","status":"ran","verification_level":1,"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":"f6b4594fd6677dbe","code_sha256_prefix":"f6b4594fd6677dbe","mcp_get_code":{"code_sha256":"f6b4594fd6677dbe"}},{"arxiv_id":"2004.09144","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-reasoning-network-for-image-text","title":"Transformer Reasoning Network for Image-Text Matching and Retrieval","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mesnico/TERN","path":"evaluate_utils/dcg.py","file_url":"https://github.com/mesnico/TERN/blob/HEAD/evaluate_utils/dcg.py","status":"ran","verification_level":1,"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":"f6b4594fd6677dbe","code_sha256_prefix":"f6b4594fd6677dbe","mcp_get_code":{"code_sha256":"f6b4594fd6677dbe"}},{"arxiv_id":"1703.07737","arxiv_id_is_arxiv":true,"paper":"/paper/in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BarbaAlGhul/recommender-system-thesis","path":"metrics.py","file_url":"https://github.com/BarbaAlGhul/recommender-system-thesis/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"87856274c73e4919","code_sha256_prefix":"87856274c73e4919","mcp_get_code":{"code_sha256":"87856274c73e4919"}}],"record_sha256":"9a6c9513144d0d215b5e1e43046b7bb18eb8d91dd4ca489221ec6a7ed560f4e4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}