{"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-edge","entry":"get_edge","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"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":"2411.01158","arxiv_id_is_arxiv":true,"paper":"/paper/pin-tuning-parameter-efficient-in-context","title":"Pin-Tuning: Parameter-Efficient In-Context Tuning for Few-Shot Molecular Property Prediction","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/Pin-Tuning","path":"models/graph_connector.py","file_url":"https://github.com/CRIPAC-DIG/Pin-Tuning/blob/HEAD/models/graph_connector.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, CRIPAC-DIG/Pin-Tuning when it was checked","code_sha256":"1fc1b5a753a43608","code_sha256_prefix":"1fc1b5a753a43608","mcp_get_code":{"code_sha256":"1fc1b5a753a43608"}},{"arxiv_id":"2404.07932","arxiv_id_is_arxiv":true,"paper":"/paper/fusionmamba-efficient-image-fusion-with-state","title":"FusionMamba: Efficient Remote Sensing Image Fusion with State Space Model","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PSRben/FusionMamba","path":"utils/load_train_data.py","file_url":"https://github.com/PSRben/FusionMamba/blob/HEAD/utils/load_train_data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, PSRben/FusionMamba when it was checked","code_sha256":"bdc4273032c58caa","code_sha256_prefix":"bdc4273032c58caa","mcp_get_code":{"code_sha256":"bdc4273032c58caa"}},{"arxiv_id":"2306.16780","arxiv_id_is_arxiv":true,"paper":"/paper/graph-sampling-based-meta-learning-for","title":"Graph Sampling-based Meta-Learning for Molecular Property Prediction","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HICAI-ZJU/GS-Meta","path":"models/graph_connector.py","file_url":"https://github.com/HICAI-ZJU/GS-Meta/blob/HEAD/models/graph_connector.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 CRIPAC-DIG/Pin-Tuning, and GitHub detected no licence in that repository when it was checked","code_sha256":"1fc1b5a753a43608","code_sha256_prefix":"1fc1b5a753a43608","mcp_get_code":{"code_sha256":"1fc1b5a753a43608"}},{"arxiv_id":"2009.11692","arxiv_id_is_arxiv":true,"paper":"/paper/language-generation-with-multi-hop-reasoning","title":"Language Generation with Multi-Hop Reasoning on Commonsense Knowledge Graph","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cdjhz/multigen","path":"preprocess/find_neighbours.py","file_url":"https://github.com/cdjhz/multigen/blob/HEAD/preprocess/find_neighbours.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cdjhz/multigen when it was checked","code_sha256":"fe260ebdade3a584","code_sha256_prefix":"fe260ebdade3a584","mcp_get_code":{"code_sha256":"fe260ebdade3a584"}},{"arxiv_id":"1902.04502","arxiv_id_is_arxiv":true,"paper":"/paper/fast-scnn-fast-semantic-segmentation-network","title":"Fast-SCNN: Fast Semantic Segmentation Network","date":"2019-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minus31/Portrait-segmentation","path":"data_generator.py","file_url":"https://github.com/minus31/Portrait-segmentation/blob/HEAD/data_generator.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":"c35601c93ff05d52","code_sha256_prefix":"c35601c93ff05d52","mcp_get_code":{"code_sha256":"c35601c93ff05d52"}}],"record_sha256":"3d79dbbaa9a6a5698e6e4fe28e41360b35abe6d4b3ae913848bd5d9900d97027","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}