{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/kronecker","entry":"kronecker","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"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":5,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"unverified":2},"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":"2103.16178","paper":"/paper/learnable-graph-matching-incorporating-graph","title":"Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"fafc95a7ac88ef36","mcp_get_code":{"code_sha256":"fafc95a7ac88ef36"}},{"arxiv_id":"2009.13075","paper":"/paper/semi-supervised-image-deraining-using","title":"Semi-Supervised Image Deraining using Gaussian Processes","date":"2020-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajeevyasarla/Syn2Real","path":"GP.py","file_url":"https://github.com/rajeevyasarla/Syn2Real/blob/HEAD/GP.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fafc95a7ac88ef36","mcp_get_code":{"code_sha256":"fafc95a7ac88ef36"}},{"arxiv_id":"2009.01269","paper":"/paper/can-single-neurons-solve-mnist-the","title":"Can Single Neurons Solve MNIST? The Computational Power of Biological Dendritic Trees","date":null,"month_inferred_from_arxiv_id":"2020-09","title_source":"archive","repo":"ilennaj/ktree","path":"custompackage/load_architecture.py","file_url":"https://github.com/ilennaj/ktree/blob/HEAD/custompackage/load_architecture.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e6f0de3ea55ece55","mcp_get_code":{"code_sha256":"e6f0de3ea55ece55"}},{"arxiv_id":"2004.04197","paper":"/paper/quantum-approximate-optimization-of-non","title":"Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"CDL-Quantum/Hackathon2020","path":"QBC/quantum_aware_optims.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/QBC/quantum_aware_optims.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bcb2a85323de4b3a","mcp_get_code":{"code_sha256":"bcb2a85323de4b3a"}},{"arxiv_id":"2002.08376","paper":"/paper/a-differentiable-programming-method-for","title":"A differentiable programming method for quantum control","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"frankschae/A-differentiable-programming-method-for-quantum-control","path":"spin_chain/GHZ/spinchain.py","file_url":"https://github.com/frankschae/A-differentiable-programming-method-for-quantum-control/blob/HEAD/spin_chain/GHZ/spinchain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ed591024be2e265","mcp_get_code":{"code_sha256":"5ed591024be2e265"}},{"arxiv_id":"1503.05671","paper":"/paper/optimizing-neural-networks-with-kronecker","title":"Optimizing Neural Networks with Kronecker-factored Approximate Curvature","date":"2015-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tfjgeorge/nngeometry","path":"nngeometry/object/pspace.py","file_url":"https://github.com/tfjgeorge/nngeometry/blob/HEAD/nngeometry/object/pspace.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f96d29b7dd6bd0b","mcp_get_code":{"code_sha256":"8f96d29b7dd6bd0b"}}]}