{"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/embed","entry":"embed","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":13,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":12,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":8},"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":"2607.24165","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-24165","title":"Do Current Retrievers Cover All the Evidence? A Controlled Study of Conjunctive Cross-Page Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sunggukcha/n_clue","path":"code/build_semantic_clusters.py","file_url":"https://github.com/sunggukcha/n_clue/blob/HEAD/code/build_semantic_clusters.py","status":"unverified","verification_level":0,"contract_check":null,"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, sunggukcha/n_clue (NOASSERTION)","code_sha256":"62a4027b5ded832d","code_sha256_prefix":"62a4027b5ded832d","mcp_get_code":{"code_sha256":"62a4027b5ded832d"}},{"arxiv_id":"2506.07255","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.07255","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"jacobandreas/psketch","path":"models/net.py","file_url":"https://github.com/jacobandreas/psketch/blob/HEAD/models/net.py","status":"unverified","verification_level":0,"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":"1a0fff8870f04909","code_sha256_prefix":"1a0fff8870f04909","mcp_get_code":{"code_sha256":"1a0fff8870f04909"}},{"arxiv_id":"2211.14456","arxiv_id_is_arxiv":true,"paper":"/paper/tetrasphere-a-neural-descriptor-for-o-3","title":"TetraSphere: A Neural Descriptor for O(3)-Invariant Point Cloud Analysis","date":"2022-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pavlo-melnyk/tetrasphere","path":"tetrasphere/models/spheres.py","file_url":"https://github.com/pavlo-melnyk/tetrasphere/blob/HEAD/tetrasphere/models/spheres.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e4b543f085e11201","code_sha256_prefix":"e4b543f085e11201","mcp_get_code":{"code_sha256":"e4b543f085e11201"}},{"arxiv_id":"2211.03231","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-community-detection","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","date":"2022-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/gnn_community_detection","path":"sparsify.py","file_url":"https://github.com/nhuang37/gnn_community_detection/blob/HEAD/sparsify.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nhuang37/gnn_community_detection when it was checked","code_sha256":"cc7e1aaaec67275c","code_sha256_prefix":"cc7e1aaaec67275c","mcp_get_code":{"code_sha256":"cc7e1aaaec67275c"}},{"arxiv_id":"2204.13094","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-word-segmentation-using-k","title":"Unsupervised Word Segmentation using K Nearest Neighbors","date":null,"month_inferred_from_arxiv_id":"2022-04","title_source":"archive","repo":"mlspeech/gradseg","path":"data_loader.py","file_url":"https://github.com/mlspeech/gradseg/blob/HEAD/data_loader.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":"364cd200bab3e807","code_sha256_prefix":"364cd200bab3e807","mcp_get_code":{"code_sha256":"364cd200bab3e807"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lif31up/attention-is-all-you-need","path":"EmbeddedDataset.py","file_url":"https://github.com/lif31up/attention-is-all-you-need/blob/HEAD/EmbeddedDataset.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":"6351105db75b9e71","code_sha256_prefix":"6351105db75b9e71","mcp_get_code":{"code_sha256":"6351105db75b9e71"}},{"arxiv_id":"1912.00385","arxiv_id_is_arxiv":true,"paper":"/paper/the-group-loss-for-deep-metric-learning","title":"The Group Loss for Deep Metric Learning","date":"2019-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laurinwagner/grouploss_plus","path":"net/embed.py","file_url":"https://github.com/laurinwagner/grouploss_plus/blob/HEAD/net/embed.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":"757fc132892039c3","code_sha256_prefix":"757fc132892039c3","mcp_get_code":{"code_sha256":"757fc132892039c3"}},{"arxiv_id":"1905.10876","arxiv_id_is_arxiv":true,"paper":"/paper/expressibility-and-entangling-capability-of","title":"Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms","date":null,"month_inferred_from_arxiv_id":"2019-05","title_source":"archive","repo":"bagmk/Quantum_Machine_Learning_Express","path":"Pyfiles/quantumcircuit.py","file_url":"https://github.com/bagmk/Quantum_Machine_Learning_Express/blob/HEAD/Pyfiles/quantumcircuit.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":"c2dd4274bdc76329","code_sha256_prefix":"c2dd4274bdc76329","mcp_get_code":{"code_sha256":"c2dd4274bdc76329"}},{"arxiv_id":"1903.11269","arxiv_id_is_arxiv":true,"paper":"/paper/css10-a-collection-of-single-speaker-speech","title":"CSS10: A Collection of Single Speaker Speech Datasets for 10 Languages","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyubyong/css10","path":"dc_tts/modules.py","file_url":"https://github.com/Kyubyong/css10/blob/HEAD/dc_tts/modules.py","status":"unverified","verification_level":0,"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":"47b69c1525e362f1","code_sha256_prefix":"47b69c1525e362f1","mcp_get_code":{"code_sha256":"47b69c1525e362f1"}},{"arxiv_id":"1903.11269","arxiv_id_is_arxiv":true,"paper":"/paper/css10-a-collection-of-single-speaker-speech","title":"CSS10: A Collection of Single Speaker Speech Datasets for 10 Languages","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyubyong/css10","path":"tacotron/modules.py","file_url":"https://github.com/Kyubyong/css10/blob/HEAD/tacotron/modules.py","status":"unverified","verification_level":0,"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":"648eb7c9f95d169e","code_sha256_prefix":"648eb7c9f95d169e","mcp_get_code":{"code_sha256":"648eb7c9f95d169e"}},{"arxiv_id":"1710.08969","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-trainable-text-to-speech-system","title":"Efficiently Trainable Text-to-Speech System Based on Deep Convolutional Networks with Guided Attention","date":"2017-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSTR-Edinburgh/ophelia","path":"modules.py","file_url":"https://github.com/CSTR-Edinburgh/ophelia/blob/HEAD/modules.py","status":"unverified","verification_level":0,"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":"47b69c1525e362f1","code_sha256_prefix":"47b69c1525e362f1","mcp_get_code":{"code_sha256":"47b69c1525e362f1"}},{"arxiv_id":"1703.10135","arxiv_id_is_arxiv":true,"paper":"/paper/tacotron-towards-end-to-end-speech-synthesis","title":"Tacotron: Towards End-to-End Speech Synthesis","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyubyong/tacotron","path":"modules.py","file_url":"https://github.com/Kyubyong/tacotron/blob/HEAD/modules.py","status":"unverified","verification_level":0,"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":"648eb7c9f95d169e","code_sha256_prefix":"648eb7c9f95d169e","mcp_get_code":{"code_sha256":"648eb7c9f95d169e"}},{"arxiv_id":"1610.02415","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-chemical-design-using-a-data-driven","title":"Automatic chemical design using a data-driven continuous representation of molecules","date":"2016-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrentBrick/PAE","path":"models.py","file_url":"https://github.com/TrentBrick/PAE/blob/HEAD/models.py","status":"unverified","verification_level":0,"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, TrentBrick/PAE when it was checked","code_sha256":"b31e3a32763105ee","code_sha256_prefix":"b31e3a32763105ee","mcp_get_code":{"code_sha256":"b31e3a32763105ee"}},{"arxiv_id":"ijcai2022_0597","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2022_0597","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mayank31398/VRAG","path":"src_faiss/dataset.py","file_url":"https://github.com/mayank31398/VRAG/blob/HEAD/src_faiss/dataset.py","status":"unverified","verification_level":0,"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":"8bae0d69389ce597","code_sha256_prefix":"8bae0d69389ce597","mcp_get_code":{"code_sha256":"8bae0d69389ce597"}}],"record_sha256":"67c3c168abd77eda7989e56a07c3b3ea9f97b539844c7533610ffbad846e2a4c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}