{"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/mean-average-precision","entry":"mean_average_precision","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":15,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":15,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":6,"unverified":5},"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.15562","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15562","title":"Hard Rules, Soft Preferences: Bridging Reasoning, Learning, and Optimization for Personalized Packing Checklist Generation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Official529Tech/rlo-checklist","path":"src/combined_model.py","file_url":"https://github.com/Official529Tech/rlo-checklist/blob/HEAD/src/combined_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8427c7155e1659cd","code_sha256_prefix":"8427c7155e1659cd","mcp_get_code":{"code_sha256":"8427c7155e1659cd"}},{"arxiv_id":"2601.04824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04824","title":"SOVABench: A Vehicle Surveillance Action Retrieval Benchmark for Multimodal Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"oriol-rabasseda/sovabench","path":"src/mllm_embeddings_sovabench/evaluation/utils.py","file_url":"https://github.com/oriol-rabasseda/sovabench/blob/HEAD/src/mllm_embeddings_sovabench/evaluation/utils.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, oriol-rabasseda/sovabench when it was checked","code_sha256":"d9ad41829456c560","code_sha256_prefix":"d9ad41829456c560","mcp_get_code":{"code_sha256":"d9ad41829456c560"}},{"arxiv_id":"2409.12728","arxiv_id_is_arxiv":true,"paper":"/paper/praga-prototype-aware-graph-adaptive","title":"PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysis","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xubin-s-lab/praga","path":"metric.py","file_url":"https://github.com/xubin-s-lab/praga/blob/HEAD/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, xubin-s-lab/praga, is not in the permissive set Syntology serves inline","code_sha256":"9557c1988e29c353","code_sha256_prefix":"9557c1988e29c353","mcp_get_code":{"code_sha256":"9557c1988e29c353"}},{"arxiv_id":"2403.16182","arxiv_id_is_arxiv":true,"paper":"/paper/egoexolearn-a-dataset-for-bridging","title":"EgoExoLearn: A Dataset for Bridging Asynchronous Ego- and Exo-centric View of Procedural Activities in Real World","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenGVLab/EgoExoLearn","path":"action_anticipation_planning_benchmark/anticipation_main.py","file_url":"https://github.com/OpenGVLab/EgoExoLearn/blob/HEAD/action_anticipation_planning_benchmark/anticipation_main.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b38a33ad005fe8c","code_sha256_prefix":"2b38a33ad005fe8c","mcp_get_code":{"code_sha256":"2b38a33ad005fe8c"}},{"arxiv_id":"2309.05300","arxiv_id_is_arxiv":true,"paper":"/paper/decur-decoupling-common-unique","title":"Decoupling Common and Unique Representations for Multimodal Self-supervised Learning","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhu-xlab/decur","path":"src/pretrain/models/simclr.py","file_url":"https://github.com/zhu-xlab/decur/blob/HEAD/src/pretrain/models/simclr.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":"67f6f3d0ef61ad86","code_sha256_prefix":"67f6f3d0ef61ad86","mcp_get_code":{"code_sha256":"67f6f3d0ef61ad86"}},{"arxiv_id":"2301.02074","arxiv_id_is_arxiv":true,"paper":"/paper/test-of-time-instilling-video-language-models","title":"Test of Time: Instilling Video-Language Models with a Sense of Time","date":"2023-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bpiyush/TestOfTime","path":"package/evaluators/videoclip_action_retrieval.py","file_url":"https://github.com/bpiyush/TestOfTime/blob/HEAD/package/evaluators/videoclip_action_retrieval.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":"0196aa2f7fc22400","code_sha256_prefix":"0196aa2f7fc22400","mcp_get_code":{"code_sha256":"0196aa2f7fc22400"}},{"arxiv_id":"2106.03134","arxiv_id_is_arxiv":true,"paper":"/paper/semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiongbo010/qgcn","path":"models/base_models.py","file_url":"https://github.com/xiongbo010/qgcn/blob/HEAD/models/base_models.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":"44f4208d3cb09de0","code_sha256_prefix":"44f4208d3cb09de0","mcp_get_code":{"code_sha256":"44f4208d3cb09de0"}},{"arxiv_id":"2010.08269","arxiv_id_is_arxiv":true,"paper":"/paper/effective-distributed-representations-for","title":"Effective Distributed Representations for Academic Expert Search","date":"2020-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mabergerx/SDP500_expert_search","path":"Utility/Evaluation.py","file_url":"https://github.com/mabergerx/SDP500_expert_search/blob/HEAD/Utility/Evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mabergerx/SDP500_expert_search when it was checked","code_sha256":"8f51389732284290","code_sha256_prefix":"8f51389732284290","mcp_get_code":{"code_sha256":"8f51389732284290"}},{"arxiv_id":"1902.00153","arxiv_id_is_arxiv":true,"paper":"/paper/deep-triplet-quantization","title":"Deep Triplet Quantization","date":"2019-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thulab/DeepHash","path":"DeepHash/evaluation/load_and_predict.py","file_url":"https://github.com/thulab/DeepHash/blob/HEAD/DeepHash/evaluation/load_and_predict.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":"5887d2f606711347","code_sha256_prefix":"5887d2f606711347","mcp_get_code":{"code_sha256":"5887d2f606711347"}},{"arxiv_id":"1703.08135","arxiv_id_is_arxiv":true,"paper":"/paper/an-embedded-segmental-k-means-model-for","title":"An embedded segmental K-means model for unsupervised segmentation and clustering of speech","date":"2017-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamperh/bucktsong_eskmeans","path":"downsample/samediff.py","file_url":"https://github.com/kamperh/bucktsong_eskmeans/blob/HEAD/downsample/samediff.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":"e09ac618a9f85288","code_sha256_prefix":"e09ac618a9f85288","mcp_get_code":{"code_sha256":"e09ac618a9f85288"}},{"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":"evaluate.py","file_url":"https://github.com/BarbaAlGhul/recommender-system-thesis/blob/HEAD/evaluate.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":"a3a9be21cfa9c135","code_sha256_prefix":"a3a9be21cfa9c135","mcp_get_code":{"code_sha256":"a3a9be21cfa9c135"}},{"arxiv_id":"ijcai2023_0046","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2023_0046","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sruthigorantla/SamplingExPostGroupFairRankings","path":"src/ALG/metrics.py","file_url":"https://github.com/sruthigorantla/SamplingExPostGroupFairRankings/blob/HEAD/src/ALG/metrics.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":"88579f59a6e28b32","code_sha256_prefix":"88579f59a6e28b32","mcp_get_code":{"code_sha256":"88579f59a6e28b32"}},{"arxiv_id":"aaai_29453","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29453","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shapsider/scintegration","path":"integration_c/src/metrics.py","file_url":"https://github.com/shapsider/scintegration/blob/HEAD/integration_c/src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xubin-s-lab/praga, and AGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"9557c1988e29c353","code_sha256_prefix":"9557c1988e29c353","mcp_get_code":{"code_sha256":"9557c1988e29c353"}},{"arxiv_id":"Wang_CPR-Coach_Recognizing_Composite_Error_Actions_based_on_Single-class_Training_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_CPR-Coach_Recognizing_Composite_Error_Actions_based_on_Single-class_Training_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Shunli-Wang/CPR-Coach","path":"code/core/accuracy.py","file_url":"https://github.com/Shunli-Wang/CPR-Coach/blob/HEAD/code/core/accuracy.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":"143e5b9e017ba532","code_sha256_prefix":"143e5b9e017ba532","mcp_get_code":{"code_sha256":"143e5b9e017ba532"}},{"arxiv_id":"Fang_ProS_Prompting-to-simulate_Generalized_knowledge_for_Universal_Cross-Domain_Retrieval_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Fang_ProS_Prompting-to-simulate_Generalized_knowledge_for_Universal_Cross-Domain_Retrieval_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fangkaipeng/ProS","path":"src/utils/mAP.py","file_url":"https://github.com/fangkaipeng/ProS/blob/HEAD/src/utils/mAP.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":"1eea597e1d1d5ea4","code_sha256_prefix":"1eea597e1d1d5ea4","mcp_get_code":{"code_sha256":"1eea597e1d1d5ea4"}}],"record_sha256":"80e4c7ac6de74c879591823ea28c299db3cb099cbdfbfee11c3e0cf49d1e7b32","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}