{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/next-free-port","entry":"next_free_port","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":4,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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.20538","paper":"/paper/arxiv-2605-20538","title":"Continual Segmentation under Joint Nonstationarity","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"prinshul/JASCL","path":"baselines_Med_disjoint/Softnet/get_free_port.py","file_url":"https://github.com/prinshul/JASCL/blob/HEAD/baselines_Med_disjoint/Softnet/get_free_port.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5bb42fad3fc38eff","mcp_get_code":{"code_sha256":"5bb42fad3fc38eff"}},{"arxiv_id":"2503.18929","paper":"/paper/trajectory-balance-with-asynchrony-decoupling","title":"Trajectory Balance with Asynchrony: Decoupling Exploration and Learning for Fast, Scalable LLM Post-Training","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbartoldson/TBA","path":"src/dist_utils.py","file_url":"https://github.com/bbartoldson/TBA/blob/HEAD/src/dist_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5503c179cc4b29b0","mcp_get_code":{"code_sha256":"5503c179cc4b29b0"}},{"arxiv_id":"2407.11499","paper":"/paper/bridge-past-and-future-overcoming-information","title":"Bridge Past and Future: Overcoming Information Asymmetry in Incremental Object Detection","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isee-laboratory/bpf","path":"get_free_port.py","file_url":"https://github.com/isee-laboratory/bpf/blob/HEAD/get_free_port.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bb42fad3fc38eff","mcp_get_code":{"code_sha256":"5bb42fad3fc38eff"}},{"arxiv_id":"2210.02326","paper":"/paper/learning-across-domains-and-devices-style","title":"Learning Across Domains and Devices: Style-Driven Source-Free Domain Adaptation in Clustered Federated Learning","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erosinho13/ladd","path":"get_free_port.py","file_url":"https://github.com/erosinho13/ladd/blob/HEAD/get_free_port.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"5bb42fad3fc38eff","mcp_get_code":{"code_sha256":"5bb42fad3fc38eff"}},{"arxiv_id":"Cermelli_Incremental_Learning_in_Semantic_Segmentation_From_Image_Labels_CVPR_2022_paper","paper":null,"title":"arXiv:Cermelli_Incremental_Learning_in_Semantic_Segmentation_From_Image_Labels_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fcdl94/WILSON","path":"get_free_port.py","file_url":"https://github.com/fcdl94/WILSON/blob/HEAD/get_free_port.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bb42fad3fc38eff","mcp_get_code":{"code_sha256":"5bb42fad3fc38eff"}}]}