{"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/initialize-scheduler","entry":"initialize_scheduler","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":6,"n_papers_ran_instrument_only":0,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":0,"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":"2407.12489","arxiv_id_is_arxiv":true,"paper":"/paper/dual-level-adaptive-self-labeling-for-novel","title":"Dual-level Adaptive Self-Labeling for Novel Class Discovery in Point Cloud Segmentation","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RikkiXu/NCD_PC","path":"utils/lr.py","file_url":"https://github.com/RikkiXu/NCD_PC/blob/HEAD/utils/lr.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, RikkiXu/NCD_PC when it was checked","code_sha256":"1cfda515a69f8682","code_sha256_prefix":"1cfda515a69f8682","mcp_get_code":{"code_sha256":"1cfda515a69f8682"}},{"arxiv_id":"2405.10305","arxiv_id_is_arxiv":true,"paper":"/paper/4d-panoptic-scene-graph-generation-1","title":"4D Panoptic Scene Graph Generation","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingkang50/psg4d","path":"pc_seg/utils/solver.py","file_url":"https://github.com/jingkang50/psg4d/blob/HEAD/pc_seg/utils/solver.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, jingkang50/psg4d when it was checked","code_sha256":"521ea446997228b2","code_sha256_prefix":"521ea446997228b2","mcp_get_code":{"code_sha256":"521ea446997228b2"}},{"arxiv_id":"2303.12766","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-transformer-for-lidar-based-3d","title":"Spherical Transformer for LiDAR-based 3D Recognition","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/sphereformer","path":"util/lr.py","file_url":"https://github.com/dvlab-research/sphereformer/blob/HEAD/util/lr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from RikkiXu/NCD_PC, and GitHub detected no licence in that repository when it was checked","code_sha256":"1cfda515a69f8682","code_sha256_prefix":"1cfda515a69f8682","mcp_get_code":{"code_sha256":"1cfda515a69f8682"}},{"arxiv_id":"2207.07372","arxiv_id_is_arxiv":true,"paper":"/paper/3d-instances-as-1d-kernels","title":"3D Instances as 1D Kernels","date":"2022-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"W1zheng/DKNet","path":"utils/solver.py","file_url":"https://github.com/W1zheng/DKNet/blob/HEAD/utils/solver.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 jingkang50/psg4d, and GitHub detected no licence in that repository when it was checked","code_sha256":"521ea446997228b2","code_sha256_prefix":"521ea446997228b2","mcp_get_code":{"code_sha256":"521ea446997228b2"}},{"arxiv_id":"2203.14508","arxiv_id_is_arxiv":true,"paper":"/paper/stratified-transformer-for-3d-point-cloud","title":"Stratified Transformer for 3D Point Cloud Segmentation","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/stratified-transformer","path":"util/lr.py","file_url":"https://github.com/dvlab-research/stratified-transformer/blob/HEAD/util/lr.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 RikkiXu/NCD_PC, and GitHub detected no licence in that repository when it was checked","code_sha256":"1cfda515a69f8682","code_sha256_prefix":"1cfda515a69f8682","mcp_get_code":{"code_sha256":"1cfda515a69f8682"}},{"arxiv_id":"1806.01531","arxiv_id_is_arxiv":true,"paper":"/paper/tafe-net-task-aware-feature-embeddings-for","title":"Deep Mixture of Experts via Shallow Embedding","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanKim17920/DeepMoE","path":"traintest.py","file_url":"https://github.com/RyanKim17920/DeepMoE/blob/HEAD/traintest.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":"ab77a722b7b88e9a","code_sha256_prefix":"ab77a722b7b88e9a","mcp_get_code":{"code_sha256":"ab77a722b7b88e9a"}}],"record_sha256":"e6da890a74667869ab8759bbb9314ac9bf6184ae27e195a83472a63524fb88f3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}