{"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/compute-normalized-laplacian","entry":"compute_normalized_laplacian","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":4,"n_papers_ran_instrument_only":2,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"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":"2602.06557","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06557","title":"Which Graph Shift Operator? A Spectral Answer to an Empirical Question","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"abbahaddou/MSD-Alignment","path":"spade.py","file_url":"https://github.com/abbahaddou/MSD-Alignment/blob/HEAD/spade.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, abbahaddou/MSD-Alignment when it was checked","code_sha256":"ff3b34f6ed3e7c67","code_sha256_prefix":"ff3b34f6ed3e7c67","mcp_get_code":{"code_sha256":"ff3b34f6ed3e7c67"}},{"arxiv_id":"2406.03152","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-spectral-clustering-with-provable","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"steinarlaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee","path":"src/spectral_clustering.py","file_url":"https://github.com/steinarlaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee/blob/HEAD/src/spectral_clustering.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92414b27c51942e2","code_sha256_prefix":"92414b27c51942e2","mcp_get_code":{"code_sha256":"92414b27c51942e2"}},{"arxiv_id":"2402.17188","arxiv_id_is_arxiv":true,"paper":"/paper/promptmm-multi-modal-knowledge-distillation","title":"PromptMM: Multi-Modal Knowledge Distillation for Recommendation with Prompt-Tuning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/promptmm","path":"LATTICE/codes/Models.py","file_url":"https://github.com/hkuds/promptmm/blob/HEAD/LATTICE/codes/Models.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, hkuds/promptmm when it was checked","code_sha256":"698d3807a0c41ec9","code_sha256_prefix":"698d3807a0c41ec9","mcp_get_code":{"code_sha256":"698d3807a0c41ec9"}},{"arxiv_id":"2311.00423","arxiv_id_is_arxiv":true,"paper":"/paper/llmrec-large-language-models-with-graph","title":"LLMRec: Large Language Models with Graph Augmentation for Recommendation","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/llmrec","path":"LATTICE/codes/Models.py","file_url":"https://github.com/hkuds/llmrec/blob/HEAD/LATTICE/codes/Models.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"698d3807a0c41ec9","code_sha256_prefix":"698d3807a0c41ec9","mcp_get_code":{"code_sha256":"698d3807a0c41ec9"}},{"arxiv_id":"2104.09036","arxiv_id_is_arxiv":true,"paper":"/paper/mining-latent-structures-for-multimedia","title":"Mining Latent Structures for Multimedia Recommendation","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/LATTICE","path":"codes/Models.py","file_url":"https://github.com/CRIPAC-DIG/LATTICE/blob/HEAD/codes/Models.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"698d3807a0c41ec9","code_sha256_prefix":"698d3807a0c41ec9","mcp_get_code":{"code_sha256":"698d3807a0c41ec9"}},{"arxiv_id":"2006.13009","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/IDGL","path":"src/core/layers/graphlearn.py","file_url":"https://github.com/hugochan/IDGL/blob/HEAD/src/core/layers/graphlearn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"698d3807a0c41ec9","code_sha256_prefix":"698d3807a0c41ec9","mcp_get_code":{"code_sha256":"698d3807a0c41ec9"}}],"record_sha256":"bba03c1d71475d8f9bd00f7c41ce1bb0e8b61ff67f61a5e630979476095d0391","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}