{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JBTOREAV6D6AI4CU43W72DEB45","short_pith_number":"pith:JBTOREAV","schema_version":"1.0","canonical_sha256":"4866e89015f0fc047054e6edfd0c81e766a8808e3652523ad928dc3378aa58c0","source":{"kind":"arxiv","id":"1406.0005","version":4},"attestation_state":"computed","paper":{"title":"Exact computation of the CDF of the Euclidean distance between a point and a random variable uniformly distributed in disks, balls, or polyhedrons and application to PSHA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Vincent Guigues","submitted_at":"2014-05-30T20:00:06Z","abstract_excerpt":"We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this set: a union of disjoint disks, a union of disjoint balls, a union of disjoint line segments, and the boundary of a polyhedron. In the first three cases, we provide closed-form expressions of the cumulative distribution function and the density. In the last case, we propose an algorithm with complexity O(n ln n), n being the number of edges of the polyhedron"},"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":"1406.0005","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-30T20:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"8145ab6d84a05eb2a3d95be55a9f748c8cab310aef613797dc0cca669cec8fb0","abstract_canon_sha256":"6e9ef3fba7a642cdb2c17d3e436f4e3827aa3ab2363396b95d387bcec84bb4b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.320098Z","signature_b64":"8U8MZAMlMm1gH+qYslcYsq+v9gEn3UZyl9SfeGOu0srShhdx+6eoD5TJUJXCBaY3HnOMhCbMAeTQEbb524nAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4866e89015f0fc047054e6edfd0c81e766a8808e3652523ad928dc3378aa58c0","last_reissued_at":"2026-05-17T23:44:23.319687Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.319687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact computation of the CDF of the Euclidean distance between a point and a random variable uniformly distributed in disks, balls, or polyhedrons and application to PSHA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Vincent Guigues","submitted_at":"2014-05-30T20:00:06Z","abstract_excerpt":"We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this set: a union of disjoint disks, a union of disjoint balls, a union of disjoint line segments, and the boundary of a polyhedron. In the first three cases, we provide closed-form expressions of the cumulative distribution function and the density. In the last case, we propose an algorithm with complexity O(n ln n), n being the number of edges of the polyhedron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0005","kind":"arxiv","version":4},"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":"1406.0005","created_at":"2026-05-17T23:44:23.319745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0005v4","created_at":"2026-05-17T23:44:23.319745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0005","created_at":"2026-05-17T23:44:23.319745+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBTOREAV6D6A","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBTOREAV6D6AI4CU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBTOREAV","created_at":"2026-05-18T12:28:33.132498+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/JBTOREAV6D6AI4CU43W72DEB45","json":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45.json","graph_json":"https://pith.science/api/pith-number/JBTOREAV6D6AI4CU43W72DEB45/graph.json","events_json":"https://pith.science/api/pith-number/JBTOREAV6D6AI4CU43W72DEB45/events.json","paper":"https://pith.science/paper/JBTOREAV"},"agent_actions":{"view_html":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45","download_json":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45.json","view_paper":"https://pith.science/paper/JBTOREAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0005&json=true","fetch_graph":"https://pith.science/api/pith-number/JBTOREAV6D6AI4CU43W72DEB45/graph.json","fetch_events":"https://pith.science/api/pith-number/JBTOREAV6D6AI4CU43W72DEB45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45/action/storage_attestation","attest_author":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45/action/author_attestation","sign_citation":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45/action/citation_signature","submit_replication":"https://pith.science/pith/JBTOREAV6D6AI4CU43W72DEB45/action/replication_record"}},"created_at":"2026-05-17T23:44:23.319745+00:00","updated_at":"2026-05-17T23:44:23.319745+00:00"}