{"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/pooling-2","entry":"Pooling","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":5,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":6,"n_samples_constructed":2,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"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":1,"ran_fixture":0,"ran":5,"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":"2604.12377","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12377","title":"SCRIPT: A Subcharacter Compositional Representation Injection Module for Korean Pre-Trained Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"SungHo3268/SCRIPT","path":"srcs/script.py","file_url":"https://github.com/SungHo3268/SCRIPT/blob/HEAD/srcs/script.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, SungHo3268/SCRIPT, is not in the permissive set Syntology serves inline","code_sha256":"e8b74b16302fda76","code_sha256_prefix":"e8b74b16302fda76","mcp_get_code":{"code_sha256":"e8b74b16302fda76"}},{"arxiv_id":"2404.04050","arxiv_id_is_arxiv":true,"paper":"/paper/no-time-to-train-empowering-non-parametric","title":"No Time to Train: Empowering Non-Parametric Networks for Few-shot 3D Scene Segmentation","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrrskywalker/point-nn","path":"models/point_nn_seg.py","file_url":"https://github.com/zrrskywalker/point-nn/blob/HEAD/models/point_nn_seg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed8271fc0b6bacf2","code_sha256_prefix":"ed8271fc0b6bacf2","mcp_get_code":{"code_sha256":"ed8271fc0b6bacf2"}},{"arxiv_id":"2403.05406","arxiv_id_is_arxiv":true,"paper":"/paper/considering-nonstationary-within-multivariate","title":"Considering Nonstationary within Multivariate Time Series with Variational Hierarchical Transformer for Forecasting","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flare200020/HTV_Trans","path":"HTV-Trans/models.py","file_url":"https://github.com/flare200020/HTV_Trans/blob/HEAD/HTV-Trans/models.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, flare200020/HTV_Trans when it was checked","code_sha256":"61bb2690669d49ba","code_sha256_prefix":"61bb2690669d49ba","mcp_get_code":{"code_sha256":"61bb2690669d49ba"}},{"arxiv_id":"2108.06805","arxiv_id_is_arxiv":true,"paper":"/paper/ssh-a-self-supervised-framework-for-image","title":"SSH: A Self-Supervised Framework for Image Harmonization","date":"2021-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/ssharmonization","path":"unet_tile_se_norm.py","file_url":"https://github.com/vita-group/ssharmonization/blob/HEAD/unet_tile_se_norm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, vita-group/ssharmonization (NOASSERTION)","code_sha256":"4d70444dae8a93f9","code_sha256_prefix":"4d70444dae8a93f9","mcp_get_code":{"code_sha256":"4d70444dae8a93f9"}},{"arxiv_id":"2105.04339","arxiv_id_is_arxiv":true,"paper":"/paper/defsent-sentence-embeddings-using-definition","title":"DefSent: Sentence Embeddings using Definition Sentences","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hppRC/defsent","path":"defsent/model.py","file_url":"https://github.com/hppRC/defsent/blob/HEAD/defsent/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hppRC/defsent when it was checked","code_sha256":"e8aad24ecd0df40a","code_sha256_prefix":"e8aad24ecd0df40a","mcp_get_code":{"code_sha256":"e8aad24ecd0df40a"}},{"arxiv_id":"1612.00593","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-learning-on-point-sets-for-3d","title":"PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinits5/learning3d","path":"models/pointnet.py","file_url":"https://github.com/vinits5/learning3d/blob/HEAD/models/pointnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73fbe9c91fe32ceb","code_sha256_prefix":"73fbe9c91fe32ceb","mcp_get_code":{"code_sha256":"73fbe9c91fe32ceb"}}],"record_sha256":"71548604a217144ad38797268d63658bc5bb5fe91f0c1dbac273f34d9d439b9e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}