{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5CQIIOU5HAELBTKUW3LXVLAQCP","short_pith_number":"pith:5CQIIOU5","schema_version":"1.0","canonical_sha256":"e8a0843a9d3808b0cd54b6d77aac1013ec2cff77872c4cfa6f4cb07384450914","source":{"kind":"arxiv","id":"2111.13742","version":1},"attestation_state":"computed","paper":{"title":"Variable resolution Poisson-disk sampling for meshing discrete fracture networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Carl W. Gable, Jeffrey D. Hyman, Johannes Krotz, Juan M. Restrepo, Matthew R. Sweeney","submitted_at":"2021-11-26T20:31:10Z","abstract_excerpt":"We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number"},"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":"2111.13742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2021-11-26T20:31:10Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"06576b30890d987f8824eb3b05f1bb2433d65bcc0748722280fdf9bceb537055","abstract_canon_sha256":"07e4337a57022cb89ed4bb57efb75700b20c8a405808da05b0d142f92a0d35e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:35.189481Z","signature_b64":"uwmtcR+Y6hQspg2ItHjUGJr3DtZ+1xcKluIqYREsfKWFN4zScD498OTAYEaud0Yh7YbBHaP1wXHpCbUryz12Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a0843a9d3808b0cd54b6d77aac1013ec2cff77872c4cfa6f4cb07384450914","last_reissued_at":"2026-07-05T03:35:35.189052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:35.189052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variable resolution Poisson-disk sampling for meshing discrete fracture networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Carl W. Gable, Jeffrey D. Hyman, Johannes Krotz, Juan M. Restrepo, Matthew R. Sweeney","submitted_at":"2021-11-26T20:31:10Z","abstract_excerpt":"We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.13742","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.13742/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.13742","created_at":"2026-07-05T03:35:35.189115+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.13742v1","created_at":"2026-07-05T03:35:35.189115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.13742","created_at":"2026-07-05T03:35:35.189115+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CQIIOU5HAEL","created_at":"2026-07-05T03:35:35.189115+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CQIIOU5HAELBTKU","created_at":"2026-07-05T03:35:35.189115+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CQIIOU5","created_at":"2026-07-05T03:35:35.189115+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP","json":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP.json","graph_json":"https://pith.science/api/pith-number/5CQIIOU5HAELBTKUW3LXVLAQCP/graph.json","events_json":"https://pith.science/api/pith-number/5CQIIOU5HAELBTKUW3LXVLAQCP/events.json","paper":"https://pith.science/paper/5CQIIOU5"},"agent_actions":{"view_html":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP","download_json":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP.json","view_paper":"https://pith.science/paper/5CQIIOU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.13742&json=true","fetch_graph":"https://pith.science/api/pith-number/5CQIIOU5HAELBTKUW3LXVLAQCP/graph.json","fetch_events":"https://pith.science/api/pith-number/5CQIIOU5HAELBTKUW3LXVLAQCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP/action/storage_attestation","attest_author":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP/action/author_attestation","sign_citation":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP/action/citation_signature","submit_replication":"https://pith.science/pith/5CQIIOU5HAELBTKUW3LXVLAQCP/action/replication_record"}},"created_at":"2026-07-05T03:35:35.189115+00:00","updated_at":"2026-07-05T03:35:35.189115+00:00"}