{"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/get-distance","entry":"get_distance","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":25,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":18,"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":22,"n_samples_ran":21,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":25,"n_places_pointer_only":10,"n_places_pointer_only_link_open":3,"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":3,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":3,"ran":11,"unverified":1},"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":"2608.06264","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-06264","title":"OTLesMix: Wasserstein Barycenter and Optimal Transport Map for Synthetic Lesion Generation with Diverse Shapes and Locations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"robintrmbtt/otlesmix","path":"otlesmix/lesion_generator/carvemix.py","file_url":"https://github.com/robintrmbtt/otlesmix/blob/HEAD/otlesmix/lesion_generator/carvemix.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, robintrmbtt/otlesmix when it was checked","code_sha256":"3505ee29ec4722c5","code_sha256_prefix":"3505ee29ec4722c5","mcp_get_code":{"code_sha256":"3505ee29ec4722c5"}},{"arxiv_id":"2606.19150","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19150","title":"Complementary Attention Head Pruning for Efficient Transformers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"yanivlivert/cahp","path":"cahp/graph/distance.py","file_url":"https://github.com/yanivlivert/cahp/blob/HEAD/cahp/graph/distance.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, yanivlivert/cahp when it was checked","code_sha256":"f666deff835a22b2","code_sha256_prefix":"f666deff835a22b2","mcp_get_code":{"code_sha256":"f666deff835a22b2"}},{"arxiv_id":"2605.06557","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-06557","title":"Coordination Matters: Evaluation of Cooperative Multi-Agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mariacardei/coordination_aware_MARL","path":"src/stat_env/stat_model.py","file_url":"https://github.com/mariacardei/coordination_aware_MARL/blob/HEAD/src/stat_env/stat_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":"560f29de1e064604","code_sha256_prefix":"560f29de1e064604","mcp_get_code":{"code_sha256":"560f29de1e064604"}},{"arxiv_id":"2602.03555","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03555","title":"Cut to the Mix: Simple Data Augmentation Outperforms Elaborate Ones in Limited Organ Segmentation Datasets","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Rebooorn/mosDAtoolkit","path":"cli_carvemix.py","file_url":"https://github.com/Rebooorn/mosDAtoolkit/blob/HEAD/cli_carvemix.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"373014fa9c9c5f9c","code_sha256_prefix":"373014fa9c9c5f9c","mcp_get_code":{"code_sha256":"373014fa9c9c5f9c"}},{"arxiv_id":"2507.05503","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.05503","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"huang3170/MolForm","path":"models/molopt_score_model.py","file_url":"https://github.com/huang3170/MolForm/blob/HEAD/models/molopt_score_model.py","status":"ran","verification_level":1,"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, huang3170/MolForm (NOASSERTION)","code_sha256":"5befa7d29d90c70b","code_sha256_prefix":"5befa7d29d90c70b","mcp_get_code":{"code_sha256":"5befa7d29d90c70b"}},{"arxiv_id":"2410.12456","arxiv_id_is_arxiv":true,"paper":"/paper/training-neural-samplers-with-reverse","title":"Training Neural Samplers with Reverse Diffusive KL Divergence","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiajunhe98/DiKL","path":"DiKL/evaluation/metric.py","file_url":"https://github.com/jiajunhe98/DiKL/blob/HEAD/DiKL/evaluation/metric.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c7ab62a76e76d23","code_sha256_prefix":"6c7ab62a76e76d23","mcp_get_code":{"code_sha256":"6c7ab62a76e76d23"}},{"arxiv_id":"2406.16821","arxiv_id_is_arxiv":true,"paper":"/paper/general-binding-affinity-guidance-for","title":"General Binding Affinity Guidance for Diffusion Models in Structure-Based Drug Design","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ask-berkeley/badger-sbdd","path":"models/classifier_multi.py","file_url":"https://github.com/ask-berkeley/badger-sbdd/blob/HEAD/models/classifier_multi.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 huang3170/MolForm, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"5befa7d29d90c70b","code_sha256_prefix":"5befa7d29d90c70b","mcp_get_code":{"code_sha256":"5befa7d29d90c70b"}},{"arxiv_id":"2403.12510","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-consistency-trajectory-models-for","title":"Generalized Consistency Trajectory Models for Image Manipulation","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1202kbs/gctm","path":"distances.py","file_url":"https://github.com/1202kbs/gctm/blob/HEAD/distances.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ffee88e5ef7fa6b","code_sha256_prefix":"0ffee88e5ef7fa6b","mcp_get_code":{"code_sha256":"0ffee88e5ef7fa6b"}},{"arxiv_id":"2311.18672","arxiv_id_is_arxiv":true,"paper":"/paper/a-comparison-between-invariant-and","title":"A Comparison Between Invariant and Equivariant Classical and Quantum Graph Neural Networks","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royforestano/2023_gsoc_ml4sci_qmlhep_gnn","path":"utils/preprocess.py","file_url":"https://github.com/royforestano/2023_gsoc_ml4sci_qmlhep_gnn/blob/HEAD/utils/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, royforestano/2023_gsoc_ml4sci_qmlhep_gnn when it was checked","code_sha256":"fc25c206a19e5726","code_sha256_prefix":"fc25c206a19e5726","mcp_get_code":{"code_sha256":"fc25c206a19e5726"}},{"arxiv_id":"2311.17034","arxiv_id_is_arxiv":true,"paper":"/paper/telling-left-from-right-identifying-geometry","title":"Telling Left from Right: Identifying Geometry-Aware Semantic Correspondence","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Junyi42/geoaware-sc","path":"utils/utils_correspondence.py","file_url":"https://github.com/Junyi42/geoaware-sc/blob/HEAD/utils/utils_correspondence.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, Junyi42/geoaware-sc when it was checked","code_sha256":"2c70990700a1be88","code_sha256_prefix":"2c70990700a1be88","mcp_get_code":{"code_sha256":"2c70990700a1be88"}},{"arxiv_id":"2309.17342","arxiv_id_is_arxiv":true,"paper":"/paper/towards-free-data-selection-with-general-1","title":"Towards Free Data Selection with General-Purpose Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yichen928/FreeSel","path":"data_selection/utils.py","file_url":"https://github.com/yichen928/FreeSel/blob/HEAD/data_selection/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, yichen928/FreeSel when it was checked","code_sha256":"21b9c84bee8f89fe","code_sha256_prefix":"21b9c84bee8f89fe","mcp_get_code":{"code_sha256":"21b9c84bee8f89fe"}},{"arxiv_id":"2308.09517","arxiv_id_is_arxiv":true,"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/community-aware-graph-transformer","path":"util.py","file_url":"https://github.com/nslab-cuk/community-aware-graph-transformer/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f33dcc24274d2ad3","code_sha256_prefix":"f33dcc24274d2ad3","mcp_get_code":{"code_sha256":"f33dcc24274d2ad3"}},{"arxiv_id":"2303.14382","arxiv_id_is_arxiv":true,"paper":"/paper/active-finetuning-exploiting-annotation","title":"Active Finetuning: Exploiting Annotation Budget in the Pretraining-Finetuning Paradigm","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yichen928/ActiveFT","path":"data_selection/sample_tools/ActiveFT_ImageNet.py","file_url":"https://github.com/yichen928/ActiveFT/blob/HEAD/data_selection/sample_tools/ActiveFT_ImageNet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e12a7dcc6d51fd2d","code_sha256_prefix":"e12a7dcc6d51fd2d","mcp_get_code":{"code_sha256":"e12a7dcc6d51fd2d"}},{"arxiv_id":"2303.08127","arxiv_id_is_arxiv":true,"paper":"/paper/cb2-collaborative-natural-language","title":"CB2: Collaborative Natural Language Interaction Research Platform","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lil-lab/cb2","path":"follower_bots/models/hex_conv.py","file_url":"https://github.com/lil-lab/cb2/blob/HEAD/follower_bots/models/hex_conv.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":"d10445c0642a87eb","code_sha256_prefix":"d10445c0642a87eb","mcp_get_code":{"code_sha256":"d10445c0642a87eb"}},{"arxiv_id":"2211.07807","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-inference-of-the-lensing","title":"Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwoncpark/node-to-joy","path":"n2j/trainval_data/utils/coord_utils.py","file_url":"https://github.com/jiwoncpark/node-to-joy/blob/HEAD/n2j/trainval_data/utils/coord_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45d40eb704570c03","code_sha256_prefix":"45d40eb704570c03","mcp_get_code":{"code_sha256":"45d40eb704570c03"}},{"arxiv_id":"2211.01635","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-grammatical-error-correction","title":"Revisiting Grammatical Error Correction Evaluation and Beyond","date":"2022-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pygongnlp/PT-M2","path":"metrics.py","file_url":"https://github.com/pygongnlp/PT-M2/blob/HEAD/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, pygongnlp/PT-M2 when it was checked","code_sha256":"10b705f17bd01668","code_sha256_prefix":"10b705f17bd01668","mcp_get_code":{"code_sha256":"10b705f17bd01668"}},{"arxiv_id":"2203.02923","arxiv_id_is_arxiv":true,"paper":"/paper/geodiff-a-geometric-diffusion-model-for-1","title":"GeoDiff: a Geometric Diffusion Model for Molecular Conformation Generation","date":"2022-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/geodiff","path":"models/geometry.py","file_url":"https://github.com/minkaixu/geodiff/blob/HEAD/models/geometry.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 huang3170/MolForm, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"5befa7d29d90c70b","code_sha256_prefix":"5befa7d29d90c70b","mcp_get_code":{"code_sha256":"5befa7d29d90c70b"}},{"arxiv_id":"2007.10986","arxiv_id_is_arxiv":true,"paper":"/paper/multi-person-3d-pose-estimation-in-crowded","title":"Multi-person 3D Pose Estimation in Crowded Scenes Based on Multi-View Geometry","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeCraneChen/3D-Crowd-Pose-Estimation-Based-on-MVG","path":"matching/pose_optimize/multiview_geo.py","file_url":"https://github.com/HeCraneChen/3D-Crowd-Pose-Estimation-Based-on-MVG/blob/HEAD/matching/pose_optimize/multiview_geo.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":"43064f75359849ed","code_sha256_prefix":"43064f75359849ed","mcp_get_code":{"code_sha256":"43064f75359849ed"}},{"arxiv_id":"2007.09548","arxiv_id_is_arxiv":true,"paper":"/paper/kinematic-3d-object-detection-in-monocular","title":"Kinematic 3D Object Detection in Monocular Video","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nicholasli1995/EgoNet","path":"libs/metric/criterions.py","file_url":"https://github.com/Nicholasli1995/EgoNet/blob/HEAD/libs/metric/criterions.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":"a11733449ce5e5e0","code_sha256_prefix":"a11733449ce5e5e0","mcp_get_code":{"code_sha256":"a11733449ce5e5e0"}},{"arxiv_id":"2007.05721","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/cluster.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/cluster.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":"6f9a3fa8bb5e3800","code_sha256_prefix":"6f9a3fa8bb5e3800","mcp_get_code":{"code_sha256":"6f9a3fa8bb5e3800"}},{"arxiv_id":"1904.06991","arxiv_id_is_arxiv":true,"paper":"/paper/improved-precision-and-recall-metric-for","title":"Improved Precision and Recall Metric for Assessing Generative Models","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manicman1999/precision-recall-keras","path":"precision-recall.py","file_url":"https://github.com/manicman1999/precision-recall-keras/blob/HEAD/precision-recall.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8985988572ef4703","code_sha256_prefix":"8985988572ef4703","mcp_get_code":{"code_sha256":"8985988572ef4703"}},{"arxiv_id":"1812.09755","arxiv_id_is_arxiv":true,"paper":"/paper/learning-when-to-communicate-at-scale-in","title":"Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Tasks","date":"2018-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apsdehal/gym-starcraft","path":"gym_starcraft/utils.py","file_url":"https://github.com/apsdehal/gym-starcraft/blob/HEAD/gym_starcraft/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cae8240fd6f06df","code_sha256_prefix":"4cae8240fd6f06df","mcp_get_code":{"code_sha256":"4cae8240fd6f06df"}},{"arxiv_id":"1706.07567","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-matters-in-deep-embedding-learning","title":"Sampling Matters in Deep Embedding Learning","date":"2017-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suruoxi/DistanceWeightedSampling","path":"model.py","file_url":"https://github.com/suruoxi/DistanceWeightedSampling/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88dc4f262c9b561a","code_sha256_prefix":"88dc4f262c9b561a","mcp_get_code":{"code_sha256":"88dc4f262c9b561a"}},{"arxiv_id":"1505.08082","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-count-with-deep-object-features","title":"Learning to count with deep object features","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fomorians/counting-mnist","path":"counting_mnist/create_dataset.py","file_url":"https://github.com/fomorians/counting-mnist/blob/HEAD/counting_mnist/create_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5193ac946adff737","code_sha256_prefix":"5193ac946adff737","mcp_get_code":{"code_sha256":"5193ac946adff737"}},{"arxiv_id":"aaai_25639","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25639","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tencent-ailab/MDM","path":"models/geometry.py","file_url":"https://github.com/tencent-ailab/MDM/blob/HEAD/models/geometry.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 huang3170/MolForm, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"5befa7d29d90c70b","code_sha256_prefix":"5befa7d29d90c70b","mcp_get_code":{"code_sha256":"5befa7d29d90c70b"}}],"record_sha256":"e5419594db4f19d0d735fc71ac612216e1c8409f32193fae8eb2693323065f63","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}