{"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/pairwise-loss","entry":"pairwise_loss","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":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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2510.22897","paper":"/paper/arxiv-2510-22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"structlearning/neural-subm-design-space","path":"GMN/loss.py","file_url":"https://github.com/structlearning/neural-subm-design-space/blob/HEAD/GMN/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a4f527c188a5f7fd","mcp_get_code":{"code_sha256":"a4f527c188a5f7fd"}},{"arxiv_id":"2409.17687","paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/GraphEdX","path":"GMN/loss.py","file_url":"https://github.com/structlearning/GraphEdX/blob/HEAD/GMN/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4f527c188a5f7fd","mcp_get_code":{"code_sha256":"a4f527c188a5f7fd"}},{"arxiv_id":"2403.07636","paper":"/paper/decomposing-disease-descriptions-for-enhanced","title":"Decomposing Disease Descriptions for Enhanced Pathology Detection: A Multi-Aspect Vision-Language Pre-training Framework","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hieuphan33/mavl","path":"Pretrain/models/loss.py","file_url":"https://github.com/hieuphan33/mavl/blob/HEAD/Pretrain/models/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d00e605b1ffaceb","mcp_get_code":{"code_sha256":"0d00e605b1ffaceb"}},{"arxiv_id":"2210.11054","paper":"/paper/incorporating-bias-aware-margins-into","title":"Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filtering","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/BC-Loss","path":"util/learner.py","file_url":"https://github.com/anzhang314/BC-Loss/blob/HEAD/util/learner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b17c738dfa5e4d0b","mcp_get_code":{"code_sha256":"b17c738dfa5e4d0b"}},{"arxiv_id":"1908.00347","paper":"/paper/central-similarity-hashing-via-hadamard","title":"Central Similarity Quantization for Efficient Image and Video Retrieval","date":"2019-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanli2333/Hadamard-Matrix-for-hashing","path":"my_pairwise_loss.py","file_url":"https://github.com/yuanli2333/Hadamard-Matrix-for-hashing/blob/HEAD/my_pairwise_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9ace268fb1698a9","mcp_get_code":{"code_sha256":"f9ace268fb1698a9"}},{"arxiv_id":"1702.00758","paper":"/paper/hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/HashNet","path":"pytorch/src/loss.py","file_url":"https://github.com/thuml/HashNet/blob/HEAD/pytorch/src/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cef1cb746b4c73f","mcp_get_code":{"code_sha256":"1cef1cb746b4c73f"}}]}