{"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/poincare-loss","entry":"poincare_loss","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":1,"n_papers_ran_instrument_only":5,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":1,"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":"2606.15104","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15104","title":"Text-Driven Fusion for Infrared and Visible Images: Achieving Image Scene Adaptation on Hyperbolic Space","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Shaoyun2023/TEDFusion","path":"model/TEDFusion_model.py","file_url":"https://github.com/Shaoyun2023/TEDFusion/blob/HEAD/model/TEDFusion_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Shaoyun2023/TEDFusion when it was checked","code_sha256":"8ec88aa7d5e15405","code_sha256_prefix":"8ec88aa7d5e15405","mcp_get_code":{"code_sha256":"8ec88aa7d5e15405"}},{"arxiv_id":"2509.20177","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-20177","title":"Generative Model Inversion Through the Lens of the Manifold Hypothesis","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"tmlr-group/AlignMI","path":"high_resolution/losses/poincare.py","file_url":"https://github.com/tmlr-group/AlignMI/blob/HEAD/high_resolution/losses/poincare.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, tmlr-group/AlignMI when it was checked","code_sha256":"9eeaa864194d2b12","code_sha256_prefix":"9eeaa864194d2b12","mcp_get_code":{"code_sha256":"9eeaa864194d2b12"}},{"arxiv_id":"2411.08460","arxiv_id_is_arxiv":true,"paper":"/paper/trap-mid-trapdoor-based-defense-against-model","title":"Trap-MID: Trapdoor-based Defense against Model Inversion Attacks","date":"2024-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntuaislab/Trap-MID","path":"plgmi/losses.py","file_url":"https://github.com/ntuaislab/Trap-MID/blob/HEAD/plgmi/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 ngoc-nguyen-0/LOKT_neurips2023, and GitHub detected no licence in that repository when it was checked","code_sha256":"b6e4cb9cdcdb7226","code_sha256_prefix":"b6e4cb9cdcdb7226","mcp_get_code":{"code_sha256":"b6e4cb9cdcdb7226"}},{"arxiv_id":"2410.16975","arxiv_id_is_arxiv":true,"paper":"/paper/publishing-neural-networks-in-drug-discovery","title":"Publishing Neural Networks in Drug Discovery Might Compromise Training Data Privacy","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidotse/leakpro","path":"leakpro/attacks/utils/gan_losses.py","file_url":"https://github.com/aidotse/leakpro/blob/HEAD/leakpro/attacks/utils/gan_losses.py","status":"ran","verification_level":1,"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, aidotse/leakpro (NOASSERTION)","code_sha256":"d97c476db8f72120","code_sha256_prefix":"d97c476db8f72120","mcp_get_code":{"code_sha256":"d97c476db8f72120"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngoc-nguyen-0/LOKT_neurips2023","path":"plg_tacgan.py","file_url":"https://github.com/ngoc-nguyen-0/LOKT_neurips2023/blob/HEAD/plg_tacgan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ngoc-nguyen-0/LOKT_neurips2023 when it was checked","code_sha256":"b6e4cb9cdcdb7226","code_sha256_prefix":"b6e4cb9cdcdb7226","mcp_get_code":{"code_sha256":"b6e4cb9cdcdb7226"}},{"arxiv_id":"2201.12179","arxiv_id_is_arxiv":true,"paper":"/paper/plug-play-attacks-towards-robust-and-flexible","title":"Plug & Play Attacks: Towards Robust and Flexible Model Inversion Attacks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LukasStruppek/Plug-and-Play-Attacks","path":"attacks/optimize.py","file_url":"https://github.com/LukasStruppek/Plug-and-Play-Attacks/blob/HEAD/attacks/optimize.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9eeaa864194d2b12","code_sha256_prefix":"9eeaa864194d2b12","mcp_get_code":{"code_sha256":"9eeaa864194d2b12"}}],"record_sha256":"8005a9d6bb2ed91ef1c24983187458ae6d3d2f671b30f643be7f0b4dac82968f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}