{"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/artanh","entry":"artanh","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":3,"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":"2404.15523","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-hyperbolic-metric-learning","title":"Understanding Hyperbolic Metric Learning through Hard Negative Sampling","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunyuny/hypmix","path":"hyptorch/pmath.py","file_url":"https://github.com/yunyuny/hypmix/blob/HEAD/hyptorch/pmath.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"daf212010121f13d","code_sha256_prefix":"daf212010121f13d","mcp_get_code":{"code_sha256":"daf212010121f13d"}},{"arxiv_id":"2211.09224","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-certain-it-s-anomalous","title":"Are we certain it's anomalous?","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/HypAD","path":"math_.py","file_url":"https://github.com/aleflabo/HypAD/blob/HEAD/math_.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":"00f30c4d850a7768","code_sha256_prefix":"00f30c4d850a7768","mcp_get_code":{"code_sha256":"00f30c4d850a7768"}},{"arxiv_id":"2206.12418","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-interaction-knowledge-graph","title":"Geometry Interaction Knowledge Graph Embeddings","date":"2022-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lion-ZS/GIE","path":"GIE-master/code/models.py","file_url":"https://github.com/Lion-ZS/GIE/blob/HEAD/GIE-master/code/models.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, Lion-ZS/GIE when it was checked","code_sha256":"d14145eb0e869cd0","code_sha256_prefix":"d14145eb0e869cd0","mcp_get_code":{"code_sha256":"d14145eb0e869cd0"}},{"arxiv_id":"2206.04285","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-poincare-a-unification-framework-for","title":"A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oom-debugger/ijcai23","path":"multirelational-normalized/utils.py","file_url":"https://github.com/oom-debugger/ijcai23/blob/HEAD/multirelational-normalized/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbf43036d0d1be94","code_sha256_prefix":"bbf43036d0d1be94","mcp_get_code":{"code_sha256":"bbf43036d0d1be94"}},{"arxiv_id":"2203.10833","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-vision-transformers-combining","title":"Hyperbolic Vision Transformers: Combining Improvements in Metric Learning","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"htdt/hyp_metric","path":"hyptorch/nn.py","file_url":"https://github.com/htdt/hyp_metric/blob/HEAD/hyptorch/nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"daf212010121f13d","code_sha256_prefix":"daf212010121f13d","mcp_get_code":{"code_sha256":"daf212010121f13d"}},{"arxiv_id":"2108.02390","arxiv_id_is_arxiv":true,"paper":"/paper/fuzzy-logic-based-logical-query-answering-on","title":"Fuzzy Logic Based Logical Query Answering on Knowledge Graphs","date":"2021-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/sessioncqa","path":"deduction_model/hype_util.py","file_url":"https://github.com/hkust-knowcomp/sessioncqa/blob/HEAD/deduction_model/hype_util.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":"d691d8a4eaf5a9d4","code_sha256_prefix":"d691d8a4eaf5a9d4","mcp_get_code":{"code_sha256":"d691d8a4eaf5a9d4"}},{"arxiv_id":"1905.09791","arxiv_id_is_arxiv":true,"paper":"/paper/multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibalazevic/multirelational-poincare","path":"utils.py","file_url":"https://github.com/ibalazevic/multirelational-poincare/blob/HEAD/utils.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":"bbf43036d0d1be94","code_sha256_prefix":"bbf43036d0d1be94","mcp_get_code":{"code_sha256":"bbf43036d0d1be94"}},{"arxiv_id":"1904.02239","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-image-embeddings","title":"Hyperbolic Image Embeddings","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhrulkovV/hyperbolic-image-embeddings","path":"hyptorch/pmath.py","file_url":"https://github.com/KhrulkovV/hyperbolic-image-embeddings/blob/HEAD/hyptorch/pmath.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"daf212010121f13d","code_sha256_prefix":"daf212010121f13d","mcp_get_code":{"code_sha256":"daf212010121f13d"}}],"record_sha256":"51c2f4689a15fa1830dec462b580544fe2ec6e9c897cf6d83730c79a3fc7e763","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}