{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PSWOYK73UJWHN5C3H5NTAE6BHA","short_pith_number":"pith:PSWOYK73","schema_version":"1.0","canonical_sha256":"7cacec2bfba26c76f45b3f5b3013c138293cfba6e9c68d58df17aae781589350","source":{"kind":"arxiv","id":"1708.07559","version":1},"attestation_state":"computed","paper":{"title":"Efficient barycentric point sampling on meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Jamie Portsmouth","submitted_at":"2017-08-24T21:12:51Z","abstract_excerpt":"We present an easy-to-implement and efficient analytical inversion algorithm for the unbiased random sampling of a set of points on a triangle mesh whose surface density is specified by barycentric interpolation of non-negative per-vertex weights. The correctness of the inversion algorithm is verified via statistical tests, and we show that it is faster on average than rejection sampling."},"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":"1708.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2017-08-24T21:12:51Z","cross_cats_sorted":[],"title_canon_sha256":"85bf7db1b48683633457d06e2d2a27c974f75cc2183c52afaef8e7886e2ff6f1","abstract_canon_sha256":"8efc2b337fabd706fe1964fe15877abeca607ef904006fefd0a66b72ad7a6ca7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:42.687216Z","signature_b64":"0xjA7d7nVMg3+JtWWMfnjkr5gQkCLY2LHk1gM21kk96krcb/ftl5CcUPJ52Gp/YatJFlxSzWWY2ld+AASHmGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cacec2bfba26c76f45b3f5b3013c138293cfba6e9c68d58df17aae781589350","last_reissued_at":"2026-05-18T00:36:42.686766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:42.686766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient barycentric point sampling on meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Jamie Portsmouth","submitted_at":"2017-08-24T21:12:51Z","abstract_excerpt":"We present an easy-to-implement and efficient analytical inversion algorithm for the unbiased random sampling of a set of points on a triangle mesh whose surface density is specified by barycentric interpolation of non-negative per-vertex weights. The correctness of the inversion algorithm is verified via statistical tests, and we show that it is faster on average than rejection sampling."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07559","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":""},"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":"1708.07559","created_at":"2026-05-18T00:36:42.686833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07559v1","created_at":"2026-05-18T00:36:42.686833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07559","created_at":"2026-05-18T00:36:42.686833+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSWOYK73UJWH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSWOYK73UJWHN5C3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSWOYK73","created_at":"2026-05-18T12:31:37.085036+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/PSWOYK73UJWHN5C3H5NTAE6BHA","json":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA.json","graph_json":"https://pith.science/api/pith-number/PSWOYK73UJWHN5C3H5NTAE6BHA/graph.json","events_json":"https://pith.science/api/pith-number/PSWOYK73UJWHN5C3H5NTAE6BHA/events.json","paper":"https://pith.science/paper/PSWOYK73"},"agent_actions":{"view_html":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA","download_json":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA.json","view_paper":"https://pith.science/paper/PSWOYK73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07559&json=true","fetch_graph":"https://pith.science/api/pith-number/PSWOYK73UJWHN5C3H5NTAE6BHA/graph.json","fetch_events":"https://pith.science/api/pith-number/PSWOYK73UJWHN5C3H5NTAE6BHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA/action/storage_attestation","attest_author":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA/action/author_attestation","sign_citation":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA/action/citation_signature","submit_replication":"https://pith.science/pith/PSWOYK73UJWHN5C3H5NTAE6BHA/action/replication_record"}},"created_at":"2026-05-18T00:36:42.686833+00:00","updated_at":"2026-05-18T00:36:42.686833+00:00"}