{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y4V6XW2MGXT23N3RLXWU7IO3DF","short_pith_number":"pith:Y4V6XW2M","schema_version":"1.0","canonical_sha256":"c72bebdb4c35e7adb7715ded4fa1db196e0f0034e37260b3a76a1a9253d5d6d8","source":{"kind":"arxiv","id":"1711.04473","version":2},"attestation_state":"computed","paper":{"title":"Sixteen space-filling curves and traversals for d-dimensional cubes and simplices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Herman Haverkort","submitted_at":"2017-11-13T09:07:41Z","abstract_excerpt":"This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain applications. Some of the traversals are novel, some have been known in principle but had not been described adequately for any number of dimensions, some of the traversals have been known. This article is the first to present them all in a consistent notation system. Furthermore, with this article, tools are provided to enumerate points in a regular grid in the o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.04473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-11-13T09:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"7ece6d71c1ce7edec47523fa4250aa97ad7a7e2387f7fb70f5c72b745c77e6ff","abstract_canon_sha256":"2e9a67b623a2769189e45c88e695328f87b4a47f9145d99b91573f1bc60a6cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.067026Z","signature_b64":"IVJV9oqDLH2vgxj61/azo7uhC4CjkuafCjlJ/tbtRxnuUx0HaKeMyER7e0002zR0HuRKg5azRFMGC1TXxRzvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c72bebdb4c35e7adb7715ded4fa1db196e0f0034e37260b3a76a1a9253d5d6d8","last_reissued_at":"2026-05-18T00:05:41.066565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.066565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sixteen space-filling curves and traversals for d-dimensional cubes and simplices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Herman Haverkort","submitted_at":"2017-11-13T09:07:41Z","abstract_excerpt":"This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain applications. Some of the traversals are novel, some have been known in principle but had not been described adequately for any number of dimensions, some of the traversals have been known. This article is the first to present them all in a consistent notation system. Furthermore, with this article, tools are provided to enumerate points in a regular grid in the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04473","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.04473","created_at":"2026-05-18T00:05:41.066634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04473v2","created_at":"2026-05-18T00:05:41.066634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04473","created_at":"2026-05-18T00:05:41.066634+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4V6XW2MGXT2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4V6XW2MGXT23N3R","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4V6XW2M","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06316","citing_title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF","json":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF.json","graph_json":"https://pith.science/api/pith-number/Y4V6XW2MGXT23N3RLXWU7IO3DF/graph.json","events_json":"https://pith.science/api/pith-number/Y4V6XW2MGXT23N3RLXWU7IO3DF/events.json","paper":"https://pith.science/paper/Y4V6XW2M"},"agent_actions":{"view_html":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF","download_json":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF.json","view_paper":"https://pith.science/paper/Y4V6XW2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04473&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4V6XW2MGXT23N3RLXWU7IO3DF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4V6XW2MGXT23N3RLXWU7IO3DF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF/action/storage_attestation","attest_author":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF/action/author_attestation","sign_citation":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF/action/citation_signature","submit_replication":"https://pith.science/pith/Y4V6XW2MGXT23N3RLXWU7IO3DF/action/replication_record"}},"created_at":"2026-05-18T00:05:41.066634+00:00","updated_at":"2026-05-18T00:05:41.066634+00:00"}