{"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":"/census/target-distribution","entry":"target_distribution","source":"Syntology differential census (groundwork/55, run v2_2026-09-22), per sample; not an archive number","census_date":"2026-09-22","battery_sha256":["b986f7e04d794a0d88ad4c5f32cf63ec3590b5deff0192150737bc5f1c0b4677"],"runner_sha256":["5a452d0e7c0da5b80771d1be2afe3572e253568cf5c5d59a0d08ebd663d00808"],"bucket_key":"positional (rank, kind, dtype) of each array argument; the argument name is not part of the key because the harness draws the shared array from (rank, kind) and casts it to the dtype, whatever the name","bucket_fields":["rank","kind","dtype"],"claim":"Implementations sharing this entry name were each run on one shared input fixed by the positional (rank, kind, dtype) of their array arguments (the bucket). A cluster is the set whose recorded output digest (sha256 of the output rounded to 6 decimals) is identical. Identical values to six decimals on the shared input are agreement on those inputs, not a statement about the whole domain and not a substitution claim.","n_implementations_compared":3,"n_papers":5,"n_buckets":1,"n_distinct_outputs":1,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":0,"by_error":{}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":0,"n_papers":0,"recorded_shared_digest_equals_own_fixture_digest":0},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/target-distribution","syntology":{"tool":"get_code","arguments_in":"buckets[].clusters[].members[].code_sha256","returns":"one stored sample by its code_sha256, with its behaviour fingerprint on the shared battery (the battery's shuffled null and lift beside it); not shown on this site","developers":"https://syntology.ai/developers","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."},"buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":3,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"649a7b0a9d42755a","size":3,"n_papers":5,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":3,"torch_reference_conventions_with_this_digest":[],"values":[1.8928253650665283,-1.2367668151855469,0.1443730592727661,-0.2686593532562256,-0.30988621711730957,0.7110800743103027,-0.1341654360294342,0.20119942724704742,0.07564110308885574,-0.23327364027500153,0.04847584664821625,-0.6677372455596924,-0.015265166759490967,1.7415846586227417,-0.039039984345436096,0.08961442112922668,0.031076200306415558,-16.75666618347168,1.4395275115966797,-1.1238048076629639,-0.002348658163100481,11.298996925354004,-1.0654075145721436,7.178626537322998,0.8110891580581665,-0.21709856390953064,1.2513689994812012,-1.2818564176559448,-1.2565150260925293,2.3916702270507812,-1.1746340990066528,0.4759758710861206],"values_recorded":32,"members":[{"code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","path":"sdcn.py","papers":["2002.01633","1906.06532","2407.16863"],"paper_pages":[{"arxiv_id":"2002.01633","page":"/paper/structural-deep-clustering-network"},{"arxiv_id":"1906.06532","page":"/paper/attributed-graph-clustering-a-deep"},{"arxiv_id":"2407.16863","page":"/paper/balanced-multi-relational-graph-clustering"}],"arg_sig_recorded":[["q",2,"float","float32"]],"scalar_args":{},"class_bearing":false,"mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"code_sha256":"3339a02639344442","code_sha256_prefix":"3339a02639344442","path":"MultiST/MultiST/MultiST_model.py","papers":["2601.13331"],"paper_pages":[{"arxiv_id":"2601.13331","page":"/paper/arxiv-2601-13331"}],"arg_sig_recorded":[["batch",2,"float","float32"]],"scalar_args":{},"class_bearing":false,"mcp_get_code":{"code_sha256":"3339a02639344442"}},{"code_sha256":"e160219c9330b06b","code_sha256_prefix":"e160219c9330b06b","path":"src/utils/DEC.py","papers":["1511.06335"],"paper_pages":[{"arxiv_id":"1511.06335","page":"/paper/unsupervised-deep-embedding-for-clustering"}],"arg_sig_recorded":[["batch",2,"float","float32"]],"scalar_args":{},"class_bearing":false,"mcp_get_code":{"code_sha256":"e160219c9330b06b"}}]}]}],"record_sha256":"4be97e458ee8bc5a885cbc918d054c15f9c035368c7a1c851c5837bf101af72c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}