{"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/compute-class-weights","entry":"compute_class_weights","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":7,"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":4,"ran_fixture":0,"ran":3,"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":"2605.25894","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25894","title":"Predicting Stock Price Direction on Earnings Announcement Days using Multi-modal Deep Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Marc0-Pol0/dl-project","path":"src/training/train_mlp.py","file_url":"https://github.com/Marc0-Pol0/dl-project/blob/HEAD/src/training/train_mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Marc0-Pol0/dl-project when it was checked","code_sha256":"2e33e92f0dd52976","code_sha256_prefix":"2e33e92f0dd52976","mcp_get_code":{"code_sha256":"2e33e92f0dd52976"}},{"arxiv_id":"2605.25894","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25894","title":"Predicting Stock Price Direction on Earnings Announcement Days using Multi-modal Deep Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Marc0-Pol0/dl-project","path":"src/training/train_transformer.py","file_url":"https://github.com/Marc0-Pol0/dl-project/blob/HEAD/src/training/train_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Marc0-Pol0/dl-project when it was checked","code_sha256":"87b7e42caa65d1ca","code_sha256_prefix":"87b7e42caa65d1ca","mcp_get_code":{"code_sha256":"87b7e42caa65d1ca"}},{"arxiv_id":"2602.19788","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19788","title":"Bayesian Meta-Learning with Expert Feedback for Task-Shift Adaptation through Causal Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lottamakinen/causal-meta-learning","path":"method/hierarchical_model.py","file_url":"https://github.com/lottamakinen/causal-meta-learning/blob/HEAD/method/hierarchical_model.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":"a14916935ef030e3","code_sha256_prefix":"a14916935ef030e3","mcp_get_code":{"code_sha256":"a14916935ef030e3"}},{"arxiv_id":"2602.16590","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16590","title":"A Contrastive Learning Framework Empowered by Attention-based Feature Adaptation for Street-View Image Classification","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SpaceTimeLab/CLIP-MHAdapter","path":"utils/loss.py","file_url":"https://github.com/SpaceTimeLab/CLIP-MHAdapter/blob/HEAD/utils/loss.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, SpaceTimeLab/CLIP-MHAdapter when it was checked","code_sha256":"144b9ec9f1d13f45","code_sha256_prefix":"144b9ec9f1d13f45","mcp_get_code":{"code_sha256":"144b9ec9f1d13f45"}},{"arxiv_id":"2312.11250","arxiv_id_is_arxiv":true,"paper":"/paper/challenges-in-multi-centric-generalization","title":"Challenges in Multi-centric Generalization: Phase and Step Recognition in Roux-en-Y Gastric Bypass Surgery","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camma-public/multibypass140","path":"util/utils.py","file_url":"https://github.com/camma-public/multibypass140/blob/HEAD/util/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, camma-public/multibypass140 (NOASSERTION)","code_sha256":"9d55a941a2e82755","code_sha256_prefix":"9d55a941a2e82755","mcp_get_code":{"code_sha256":"9d55a941a2e82755"}},{"arxiv_id":"2309.13635","arxiv_id_is_arxiv":true,"paper":"/paper/panopticndt-efficient-and-robust-panoptic","title":"PanopticNDT: Efficient and Robust Panoptic Mapping","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tui-nicr/nicr-scene-analysis-datasets","path":"src/nicr_scene_analysis_datasets/dataset_base/_class_weighting.py","file_url":"https://github.com/tui-nicr/nicr-scene-analysis-datasets/blob/HEAD/src/nicr_scene_analysis_datasets/dataset_base/_class_weighting.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":"dfe2f4daf2bb2966","code_sha256_prefix":"dfe2f4daf2bb2966","mcp_get_code":{"code_sha256":"dfe2f4daf2bb2966"}},{"arxiv_id":"1803.06815","arxiv_id_is_arxiv":true,"paper":"/paper/espnet-efficient-spatial-pyramid-of-dilated","title":"ESPNet: Efficient Spatial Pyramid of Dilated Convolutions for Semantic Segmentation","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simuler/ESPNet","path":"compute_classweight.py","file_url":"https://github.com/simuler/ESPNet/blob/HEAD/compute_classweight.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":"e4705748c848babe","code_sha256_prefix":"e4705748c848babe","mcp_get_code":{"code_sha256":"e4705748c848babe"}}],"record_sha256":"1d066b8d13e707cc55dd340e652485bf3a437d097a070ca59d01dff5d3963aab","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}