{"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-color","entry":"get_color","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":28,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":15,"n_papers_ran_instrument_only":11,"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":12,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":13,"n_places":29,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":1,"ran_draft_wrong":8,"ran_fixture":1,"ran":9,"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.26822","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-26822","title":"Bridging short-and medium-range weather forecasting with machine learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"NOAA-PSL/nested-eagle","path":"0.25deg-06km/baselines/niceplots.py","file_url":"https://github.com/NOAA-PSL/nested-eagle/blob/HEAD/0.25deg-06km/baselines/niceplots.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a1470c342eb80cf","code_sha256_prefix":"3a1470c342eb80cf","mcp_get_code":{"code_sha256":"3a1470c342eb80cf"}},{"arxiv_id":"2605.15138","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15138","title":"Quantization-Permanent Unlearning via Circuit Attribution","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hannamw/EAP-IG","path":"src/eap/visualization.py","file_url":"https://github.com/hannamw/EAP-IG/blob/HEAD/src/eap/visualization.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":"994fc5fd1dd289d3","code_sha256_prefix":"994fc5fd1dd289d3","mcp_get_code":{"code_sha256":"994fc5fd1dd289d3"}},{"arxiv_id":"2603.04317","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04317","title":"World Properties without World Models: Recovering Spatial and Temporal Structure from Co-occurrence Statistics in Static Word Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"elanbarenholtz/static-embeddings-space-time","path":"glove_multi_probe.py","file_url":"https://github.com/elanbarenholtz/static-embeddings-space-time/blob/HEAD/glove_multi_probe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, elanbarenholtz/static-embeddings-space-time when it was checked","code_sha256":"ec362998eb3021f4","code_sha256_prefix":"ec362998eb3021f4","mcp_get_code":{"code_sha256":"ec362998eb3021f4"}},{"arxiv_id":"2602.02589","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02589","title":"PeerRank: Autonomous LLM Evaluation Through Web-Grounded, Bias-Controlled Peer Review","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"caura-ai/caura-PeerRank","path":"peerrank/figure_utils.py","file_url":"https://github.com/caura-ai/caura-PeerRank/blob/HEAD/peerrank/figure_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76b9fd5321ad4c7c","code_sha256_prefix":"76b9fd5321ad4c7c","mcp_get_code":{"code_sha256":"76b9fd5321ad4c7c"}},{"arxiv_id":"2510.20238","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20238","title":"COS3D: Collaborative Open-Vocabulary 3D Segmentation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Runsong123/COS3D","path":"eval/colors.py","file_url":"https://github.com/Runsong123/COS3D/blob/HEAD/eval/colors.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Runsong123/COS3D (NOASSERTION)","code_sha256":"eeee61bc904ad6c5","code_sha256_prefix":"eeee61bc904ad6c5","mcp_get_code":{"code_sha256":"eeee61bc904ad6c5"}},{"arxiv_id":"2507.17015","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.17015","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"apple/ml-agent-evaluator","path":"src/ageval/analysis/plotting.py","file_url":"https://github.com/apple/ml-agent-evaluator/blob/HEAD/src/ageval/analysis/plotting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, apple/ml-agent-evaluator (NOASSERTION)","code_sha256":"55e27b734515892a","code_sha256_prefix":"55e27b734515892a","mcp_get_code":{"code_sha256":"55e27b734515892a"}},{"arxiv_id":"2506.05447","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.05447","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"mirandrom/zsl","path":"zsl_utils/mpl.py","file_url":"https://github.com/mirandrom/zsl/blob/HEAD/zsl_utils/mpl.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":"73170d6a607b278d","code_sha256_prefix":"73170d6a607b278d","mcp_get_code":{"code_sha256":"73170d6a607b278d"}},{"arxiv_id":"2502.18969","arxiv_id_is_arxiv":true,"paper":"/paper/mis-fitting-a-survey-of-scaling-laws","title":"(Mis)Fitting: A Survey of Scaling Laws","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hadasah/scaling_laws","path":"paper_analysis_and_plots.py","file_url":"https://github.com/hadasah/scaling_laws/blob/HEAD/paper_analysis_and_plots.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hadasah/scaling_laws when it was checked","code_sha256":"8d1a5df6af7bf845","code_sha256_prefix":"8d1a5df6af7bf845","mcp_get_code":{"code_sha256":"8d1a5df6af7bf845"}},{"arxiv_id":"2411.04998","arxiv_id_is_arxiv":true,"paper":"/paper/hourvideo-1-hour-video-language-understanding","title":"HourVideo: 1-Hour Video-Language Understanding","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keshik6/HourVideo","path":"hourvideo/hv_utils.py","file_url":"https://github.com/keshik6/HourVideo/blob/HEAD/hourvideo/hv_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"132f9da86c87ad0d","code_sha256_prefix":"132f9da86c87ad0d","mcp_get_code":{"code_sha256":"132f9da86c87ad0d"}},{"arxiv_id":"2410.24153","arxiv_id_is_arxiv":true,"paper":"/paper/dense-associative-memory-through-the-lens-of","title":"Dense Associative Memory Through the Lens of Random Features","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhoov/distributed_dam","path":"eval_QUANT1b_no_retrieval+bounds.py","file_url":"https://github.com/bhoov/distributed_dam/blob/HEAD/eval_QUANT1b_no_retrieval%2Bbounds.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bhoov/distributed_dam when it was checked","code_sha256":"ba1b59e1fc9e45ef","code_sha256_prefix":"ba1b59e1fc9e45ef","mcp_get_code":{"code_sha256":"ba1b59e1fc9e45ef"}},{"arxiv_id":"2410.24153","arxiv_id_is_arxiv":true,"paper":"/paper/dense-associative-memory-through-the-lens-of","title":"Dense Associative Memory Through the Lens of Random Features","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhoov/distributed_DAM","path":"eval_QUANT1b_no_retrieval+bounds.py","file_url":"https://github.com/bhoov/distributed_DAM/blob/HEAD/eval_QUANT1b_no_retrieval%2Bbounds.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bhoov/distributed_DAM when it was checked","code_sha256":"de01004a8f0a222a","code_sha256_prefix":"de01004a8f0a222a","mcp_get_code":{"code_sha256":"de01004a8f0a222a"}},{"arxiv_id":"2406.19146","arxiv_id_is_arxiv":true,"paper":"/paper/resolving-discrepancies-in-compute-optimal","title":"Resolving Discrepancies in Compute-Optimal Scaling of Language Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"formll/resolving-scaling-law-discrepencies","path":"utils.py","file_url":"https://github.com/formll/resolving-scaling-law-discrepencies/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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 hadasah/scaling_laws, and GitHub detected no licence in that repository when it was checked","code_sha256":"8d1a5df6af7bf845","code_sha256_prefix":"8d1a5df6af7bf845","mcp_get_code":{"code_sha256":"8d1a5df6af7bf845"}},{"arxiv_id":"2406.00622","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-4d-dynamic-scenes-understanding","title":"Compositional 4D Dynamic Scenes Understanding with Physics Priors for Video Question Answering","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingruiWang/SuperCLEVR-Physics","path":"kubric/core/color.py","file_url":"https://github.com/XingruiWang/SuperCLEVR-Physics/blob/HEAD/kubric/core/color.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":"079ddfceef7c9152","code_sha256_prefix":"079ddfceef7c9152","mcp_get_code":{"code_sha256":"079ddfceef7c9152"}},{"arxiv_id":"2404.10102","arxiv_id_is_arxiv":true,"paper":"/paper/chinchilla-scaling-a-replication-attempt","title":"Chinchilla Scaling: A replication attempt","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8d1a5df6af7bf845","code_sha256_prefix":"8d1a5df6af7bf845","mcp_get_code":{"code_sha256":"8d1a5df6af7bf845"}},{"arxiv_id":"2403.19647","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-feature-circuits-discovering-and","title":"Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannamw/eap-ig","path":"src/eap/visualization.py","file_url":"https://github.com/hannamw/eap-ig/blob/HEAD/src/eap/visualization.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":"994fc5fd1dd289d3","code_sha256_prefix":"994fc5fd1dd289d3","mcp_get_code":{"code_sha256":"994fc5fd1dd289d3"}},{"arxiv_id":"2403.16848","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-object-tracking-as-id-prediction","title":"Multiple Object Tracking as ID Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MCG-NJU/MOTIP","path":"demo/colormap.py","file_url":"https://github.com/MCG-NJU/MOTIP/blob/HEAD/demo/colormap.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":"24f206ad2d176f97","code_sha256_prefix":"24f206ad2d176f97","mcp_get_code":{"code_sha256":"24f206ad2d176f97"}},{"arxiv_id":"2403.11186","arxiv_id_is_arxiv":true,"paper":"/paper/nettrack-tracking-highly-dynamic-objects-with","title":"NetTrack: Tracking Highly Dynamic Objects with a Net","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"George-Zhuang/NetTrack","path":"tracker/nettrack.py","file_url":"https://github.com/George-Zhuang/NetTrack/blob/HEAD/tracker/nettrack.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d2550860de1d622","code_sha256_prefix":"0d2550860de1d622","mcp_get_code":{"code_sha256":"0d2550860de1d622"}},{"arxiv_id":"2312.03203","arxiv_id_is_arxiv":true,"paper":"/paper/feature-3dgs-supercharging-3d-gaussian","title":"Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keloee/maskfield","path":"colors.py","file_url":"https://github.com/keloee/maskfield/blob/HEAD/colors.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 Runsong123/COS3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"eeee61bc904ad6c5","code_sha256_prefix":"eeee61bc904ad6c5","mcp_get_code":{"code_sha256":"eeee61bc904ad6c5"}},{"arxiv_id":"2203.09440","arxiv_id_is_arxiv":true,"paper":"/paper/to-scene-a-large-scale-dataset-for","title":"TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GAP-LAB-CUHK-SZ/TO-Scene","path":"sem_seg/vis_tocrowd.py","file_url":"https://github.com/GAP-LAB-CUHK-SZ/TO-Scene/blob/HEAD/sem_seg/vis_tocrowd.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d01e418562a2f61b","code_sha256_prefix":"d01e418562a2f61b","mcp_get_code":{"code_sha256":"d01e418562a2f61b"}},{"arxiv_id":"2203.03570","arxiv_id_is_arxiv":true,"paper":"/paper/kubric-a-scalable-dataset-generator","title":"Kubric: A scalable dataset generator","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/kubric","path":"kubric/core/color.py","file_url":"https://github.com/google-research/kubric/blob/HEAD/kubric/core/color.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":"079ddfceef7c9152","code_sha256_prefix":"079ddfceef7c9152","mcp_get_code":{"code_sha256":"079ddfceef7c9152"}},{"arxiv_id":"2202.06866","arxiv_id_is_arxiv":true,"paper":"/paper/delaunay-component-analysis-for-evaluation-of-1","title":"Delaunay Component Analysis for Evaluation of Data Representations","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petrapoklukar/dca","path":"dca/visualization.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/visualization.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":"30b6fc26960f032b","code_sha256_prefix":"30b6fc26960f032b","mcp_get_code":{"code_sha256":"30b6fc26960f032b"}},{"arxiv_id":"2107.14483","arxiv_id_is_arxiv":true,"paper":"/paper/maniskill-learning-from-demonstrations","title":"ManiSkill: Generalizable Manipulation Skill Benchmark with Large-Scale Demonstrations","date":"2021-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidan-curtis/az-manipulator","path":"pointcloud_utils.py","file_url":"https://github.com/aidan-curtis/az-manipulator/blob/HEAD/pointcloud_utils.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":"92a88c30fa1f12f1","code_sha256_prefix":"92a88c30fa1f12f1","mcp_get_code":{"code_sha256":"92a88c30fa1f12f1"}},{"arxiv_id":"2004.01888","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harsh2912/people-tracking","path":"src/lib/tracking_utils/visualization.py","file_url":"https://github.com/harsh2912/people-tracking/blob/HEAD/src/lib/tracking_utils/visualization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d2550860de1d622","code_sha256_prefix":"0d2550860de1d622","mcp_get_code":{"code_sha256":"0d2550860de1d622"}},{"arxiv_id":"1904.07850","arxiv_id_is_arxiv":true,"paper":"/paper/objects-as-points","title":"Objects as Points","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"see--/keras-centernet","path":"keras_centernet/utils/utils.py","file_url":"https://github.com/see--/keras-centernet/blob/HEAD/keras_centernet/utils/utils.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":"b3fc6fe78497a950","code_sha256_prefix":"b3fc6fe78497a950","mcp_get_code":{"code_sha256":"b3fc6fe78497a950"}},{"arxiv_id":"1901.02985","arxiv_id_is_arxiv":true,"paper":"/paper/auto-deeplab-hierarchical-neural-architecture","title":"Auto-DeepLab: Hierarchical Neural Architecture Search for Semantic Image Segmentation","date":"2019-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangximing666/Auto-DeepLab_MS","path":"postprocess.py","file_url":"https://github.com/zhangximing666/Auto-DeepLab_MS/blob/HEAD/postprocess.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":"07109e3ece74dcc0","code_sha256_prefix":"07109e3ece74dcc0","mcp_get_code":{"code_sha256":"07109e3ece74dcc0"}},{"arxiv_id":"1810.06530","arxiv_id_is_arxiv":true,"paper":"/paper/successor-uncertainties-exploration-and","title":"Successor Uncertainties: Exploration and Uncertainty in Temporal Difference Learning","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavidJanz/successor_uncertainties_tabular","path":"plotting/plot_scaling.py","file_url":"https://github.com/DavidJanz/successor_uncertainties_tabular/blob/HEAD/plotting/plot_scaling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DavidJanz/successor_uncertainties_tabular when it was checked","code_sha256":"c5e92f1d08cd7598","code_sha256_prefix":"c5e92f1d08cd7598","mcp_get_code":{"code_sha256":"c5e92f1d08cd7598"}},{"arxiv_id":"1806.10779","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-learning-to-normalize-via","title":"Differentiable Learning-to-Normalize via Switchable Normalization","date":"2018-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diogorpeixoto/SN_boxy","path":"deps/keras_yolov3/utils/colors.py","file_url":"https://github.com/diogorpeixoto/SN_boxy/blob/HEAD/deps/keras_yolov3/utils/colors.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":"c539797d549ec4a4","code_sha256_prefix":"c539797d549ec4a4","mcp_get_code":{"code_sha256":"c539797d549ec4a4"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexsax/2D-3D-Semantics","path":"assets/utils.py","file_url":"https://github.com/alexsax/2D-3D-Semantics/blob/HEAD/assets/utils.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":"d01e418562a2f61b","code_sha256_prefix":"d01e418562a2f61b","mcp_get_code":{"code_sha256":"d01e418562a2f61b"}},{"arxiv_id":"2023.acl-demo.30","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-demo.30","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Helsinki-NLP/OPUS-MT-map","path":"create-map.py","file_url":"https://github.com/Helsinki-NLP/OPUS-MT-map/blob/HEAD/create-map.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":"c2a446c2f6691180","code_sha256_prefix":"c2a446c2f6691180","mcp_get_code":{"code_sha256":"c2a446c2f6691180"}}],"record_sha256":"44a40d9bf54189b0107ae00a9ace3f2f9f63a93cdc15adaa8ebee09e33e2e2e9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}