{"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/train-network","entry":"train_network","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":8,"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":2,"unverified":5},"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":"2603.24016","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24016","title":"COVTrack++: Learning Open-Vocabulary Multi-Object Tracking from Continuous Videos via a Synergistic Paradigm","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"zekunqian/covtrack","path":"run_later.py","file_url":"https://github.com/zekunqian/covtrack/blob/HEAD/run_later.py","status":"ran","verification_level":1,"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":"3ff115cf03a282e3","code_sha256_prefix":"3ff115cf03a282e3","mcp_get_code":{"code_sha256":"3ff115cf03a282e3"}},{"arxiv_id":"2309.00570","arxiv_id_is_arxiv":true,"paper":"/paper/mechanism-of-feature-learning-in","title":"Mechanism of feature learning in convolutional neural networks","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/convrfm","path":"conv_nets/trainer.py","file_url":"https://github.com/aradha/convrfm/blob/HEAD/conv_nets/trainer.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, aradha/convrfm when it was checked","code_sha256":"0cf3b5fb0cd3cf4e","code_sha256_prefix":"0cf3b5fb0cd3cf4e","mcp_get_code":{"code_sha256":"0cf3b5fb0cd3cf4e"}},{"arxiv_id":"2306.16923","arxiv_id_is_arxiv":true,"paper":"/paper/nautilus-boosting-bayesian-importance-nested","title":"NAUTILUS: boosting Bayesian importance nested sampling with deep learning","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johannesulf/nautilus","path":"nautilus/neural.py","file_url":"https://github.com/johannesulf/nautilus/blob/HEAD/nautilus/neural.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":"eaa875ff030cf334","code_sha256_prefix":"eaa875ff030cf334","mcp_get_code":{"code_sha256":"eaa875ff030cf334"}},{"arxiv_id":"2304.02223","arxiv_id_is_arxiv":true,"paper":"/paper/local-intrinsic-dimensional-entropy","title":"Local Intrinsic Dimensional Entropy","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kentridgeai/id-entropy","path":"MNIST_unsup.py","file_url":"https://github.com/kentridgeai/id-entropy/blob/HEAD/MNIST_unsup.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, kentridgeai/id-entropy when it was checked","code_sha256":"04ea0ce7dd440b3b","code_sha256_prefix":"04ea0ce7dd440b3b","mcp_get_code":{"code_sha256":"04ea0ce7dd440b3b"}},{"arxiv_id":"2212.02521","arxiv_id_is_arxiv":true,"paper":"/paper/deep-quantum-neural-networks-equipped-with","title":"Deep quantum neural networks equipped with backpropagation on a superconducting processor","date":null,"month_inferred_from_arxiv_id":"2022-12","title_source":"archive","repo":"luzd19/deep-quantum-neural-networks_equipped-with-backpropagation","path":"Numerical_Simulations/one-qubit_channel/train_network_one_qubit_channel.py","file_url":"https://github.com/luzd19/deep-quantum-neural-networks_equipped-with-backpropagation/blob/HEAD/Numerical_Simulations/one-qubit_channel/train_network_one_qubit_channel.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":"84d5f34a6cacca3c","code_sha256_prefix":"84d5f34a6cacca3c","mcp_get_code":{"code_sha256":"84d5f34a6cacca3c"}},{"arxiv_id":"2212.02521","arxiv_id_is_arxiv":true,"paper":"/paper/deep-quantum-neural-networks-equipped-with","title":"Deep quantum neural networks equipped with backpropagation on a superconducting processor","date":null,"month_inferred_from_arxiv_id":"2022-12","title_source":"archive","repo":"luzd19/deep-quantum-neural-networks_equipped-with-backpropagation","path":"Numerical_Simulations/two-qubit_channel/train_network_two_qubit_channel.py","file_url":"https://github.com/luzd19/deep-quantum-neural-networks_equipped-with-backpropagation/blob/HEAD/Numerical_Simulations/two-qubit_channel/train_network_two_qubit_channel.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":"30700222bd64ffd7","code_sha256_prefix":"30700222bd64ffd7","mcp_get_code":{"code_sha256":"30700222bd64ffd7"}},{"arxiv_id":"1911.08265","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmiracle/muzero-starter","path":"pseudocode.py","file_url":"https://github.com/dmiracle/muzero-starter/blob/HEAD/pseudocode.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, dmiracle/muzero-starter when it was checked","code_sha256":"abc403d4436aa68a","code_sha256_prefix":"abc403d4436aa68a","mcp_get_code":{"code_sha256":"abc403d4436aa68a"}},{"arxiv_id":"1703.00810","arxiv_id_is_arxiv":true,"paper":"/paper/opening-the-black-box-of-deep-neural-networks","title":"Opening the Black Box of Deep Neural Networks via Information","date":"2017-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"makezur/information_bottleneck_pytorch","path":"pytorch_network.py","file_url":"https://github.com/makezur/information_bottleneck_pytorch/blob/HEAD/pytorch_network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, makezur/information_bottleneck_pytorch when it was checked","code_sha256":"f2a85ea2b597b0a1","code_sha256_prefix":"f2a85ea2b597b0a1","mcp_get_code":{"code_sha256":"f2a85ea2b597b0a1"}}],"record_sha256":"d95a0df20a2073c72c667be99ce8a53c94f03f874f0c445236f122e0c34937f1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}