{"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":"/dataset/fast-linking-numbers-of-loopy-structures","name":"Fast Linking Numbers of Loopy Structures Dataset","full_name":null,"description_markdown":"Copyright (C) 2021 Ante Qu <antequ@cs.stanford.edu>.\r\n\r\nThis is the dataset for this paper:\r\n\r\nAnte Qu and Doug L. James. 2021. Fast Linking Numbers for Topology Verification\r\nof Loopy Structures. ACM Trans. Graph. 40, 4, Article 106 (August 2021),\r\n19 pages. https://doi.org/10.1145/3450626.3459778 \r\n\r\nIn particular, these files correspond to all the closed-loop examples in\r\nTable 1, with the exception that we do not release the chevron 3x3 stitch\r\npattern because it is not a collection of closed loops. Most files are in the\r\nBinary Curve Collection (BCC) file format. The open-sourced fast linking\r\nnumbers [curve verification tool](https://github.com/antequ/fastlinkingnumbers/) released with the paper uses this file format.\r\n\r\nThe chainmail, rubber band, and woundball examples came originally from Houdini\r\nOBJ files, and we have included their original files as well.\r\n\r\nThe reference certificate for each [name].bcc is in\r\nreference_certificates/[name].txt. As described in the code release, the first\r\nline indicates the number of curves in the model, and every subsequent line is\r\na triplet consisting of two curve indices (0-based) and the linking number\r\nbetween the two curves. For example, \"5,6,-2\" indicates that curves 5 and 6\r\nhave a linking number of -2 between them. Any curve pairs not included in a\r\ntriplet have a linking number of zero. If the certificate file only has the\r\nfirst row, then all its curves are unlinked.\r\n\r\nWe also included a script in scripts/dataset_referencegen.sh to generate these\r\ncertificates. Simply edit the \"VERIFYCURVESPATH=\" line to point to your\r\n\"verifycurves\" executable.\r\n\r\nHere is a list of the table entries and their corresponding BCC filenames:\r\n\r\n1. Alien Sweater (Initial):              alien_sweater_init.bcc\r\n2. Alien Sweater (Final):                alien_sweater_final.bcc\r\n3. Sheep Sweater:                        sheep_sweater.bcc\r\n4. Sweater:                              sweater.bcc\r\n5. Glove:                                glove.bcc\r\n6. Knit Tube (Initial):                  knittubeinit.bcc\r\n7. Knit Tube (Final):                    knittubefinal.bcc\r\n8. Chainmail (Initial):                  chainmail_init.bcc\r\n9. Chainmail (Final):                    chainmail_final.bcc\r\n10. Rubber Bands:                        rubber_bands_final.bcc\r\n11. Double-Helix Ribbon λ=10, 200K Segs: double_helix_ribbon_lambda10_N200K.bcc\r\n12. Double-Helix Ribbon λ=1K, 200K Segs: double_helix_ribbon_lambda1K_N200K.bcc\r\n13. Double-Helix Ribbon λ=10, 20M Segs:  double_helix_ribbon_lambda10_N20M.bcc\r\n14. Double-Helix Ribbon λ=1K, 20M Segs:  double_helix_ribbon_lambda1K_N20M.bcc\r\n15. Thick Square Link, 500K Segs:        thicksquarelink_N500K.bcc\r\n16. Thick Square Link, 4M Segs:          thicksquarelink_N4M.bcc\r\n17. Torus λ=1M, 20M Segs:                torus_lambda1M_N20M.bcc\r\n18. Torus λ=0,  40M Segs:                torus_lambda0_N40M.bcc\r\n19. Woundball ν=1K,  1M Segs:            woundball_nu1K_N1M.bcc\r\n20. Woundball ν=10K, 2M Segs:            woundball_nu10K_N2M.bcc\r\n\r\nNote that some input files are B-Splines, some are uniform Catmull–Rom splines,\r\nand some are polylines. This information is encoded in the BCC files.\r\n\r\nknittubebroken.bcc: For the Knit Tube, knittubeinit.bcc comes from simulation\r\nstep 0 and knittubefinal.bcc comes from simulation step 13000, and both states\r\nare unlinked and topologically valid. We also added knittubebroken.bcc, which\r\ncomes from simulation step 13080, when it has a linkage violation.\r\n\r\nrubber_bands_init.bcc: For the Rubber Bands, we also added\r\nrubber_bands_init.bcc with the initial state of the rubber bands.\r\nInterestingly, this configuration has zero potentially linked loop pairs.\r\n\r\nThe knitted yarn models (1 through 7) are modified from Cem Yuksel's Yarn-level\r\nCloth Models located at http://www.cemyuksel.com/research/yarnmodels/.\r\n\r\nDownload the dataset zip [here](https://drive.google.com/file/d/1tTSrzwP92xYxmVXVc6bx3GGEJ0srukp9/view).","description_withheld":null,"homepage":"https://graphics.stanford.edu/papers/fastlinkingnumbers/","introduced_date":"2021-06-23","introduced_date_note":null,"introduced_by":{"paper":"/paper/fast-linking-numbers-for-topology","title":"Fast Linking Numbers for Topology Verification of Loopy Structures","first_author":null,"url":null},"license":{"name":"CC BY","url":"https://creativecommons.org/licenses/by/4.0/"},"modalities":[{"name":"3D","url":"/datasets/modality/3d"},{"name":"3d meshes","url":"/datasets/modality/3d-meshes"}],"tasks":[],"languages":[],"variants":["Fast Linking Numbers of Loopy Structures Dataset"],"data_loaders":[],"num_papers_in_archive":1,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":0,"of":0,"counts":{"papers_with_a_benchmark_row":0,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":0,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"26528bd623e8b92d6dc0e21b7df72584e1f7d42f0e7008f0efc6248d22175321","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}