{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7G6PKNHEMCWJGCO6QAESENUIUP","short_pith_number":"pith:7G6PKNHE","canonical_record":{"source":{"id":"1906.00958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-03T00:11:16Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4d14aafaeeb3925bce3a41c2da811ea66e410fffaea7b4547e9447fa77174eae","abstract_canon_sha256":"d74f953c1562aa16d4791eec3fec226af466c89b4739f5ad6acd69860fa3f9f9"},"schema_version":"1.0"},"canonical_sha256":"f9bcf534e460ac9309de8009223688a3dd1e595b1f235b9f73220e99dd3842f4","source":{"kind":"arxiv","id":"1906.00958","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00958","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00958v2","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00958","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"7G6PKNHEMCWJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7G6PKNHEMCWJGCO6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7G6PKNHE","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7G6PKNHEMCWJGCO6QAESENUIUP","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-03T00:11:16Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4d14aafaeeb3925bce3a41c2da811ea66e410fffaea7b4547e9447fa77174eae","abstract_canon_sha256":"d74f953c1562aa16d4791eec3fec226af466c89b4739f5ad6acd69860fa3f9f9"},"schema_version":"1.0"},"canonical_sha256":"f9bcf534e460ac9309de8009223688a3dd1e595b1f235b9f73220e99dd3842f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.645027Z","signature_b64":"OwVjitIuNcFJnIR1Nj22hfQoEDXI467l6SkyscmBKgwgQGqAYtdSaX/GhpEiJZvUjDYT0y8m/ymw2N7UPNvGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9bcf534e460ac9309de8009223688a3dd1e595b1f235b9f73220e99dd3842f4","last_reissued_at":"2026-05-17T23:44:06.644375Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.644375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00958","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvN/UwvC8Ee0Y14Nb+5KM+eKBt11SlTF9Qfltz+3luKtsewSF59gLeNzxnp5KniQw4QMqBPDPmtBAh2KbUYUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:15:43.019127Z"},"content_sha256":"d4342bf5db6e863d1cb3f4b767d5daf4100b92495a45817436d736ee47e57e40","schema_version":"1.0","event_id":"sha256:d4342bf5db6e863d1cb3f4b767d5daf4100b92495a45817436d736ee47e57e40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7G6PKNHEMCWJGCO6QAESENUIUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A library to compute the density of the distance between a point and a random variable uniformly distributed in some sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CG","authors_text":"Vincent Guigues","submitted_at":"2019-06-03T00:11:16Z","abstract_excerpt":"In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem, has complexity nlog(n) where n is the number of vertices of the polygone. In this paper, we present for case (d) another algorithm with the same complexity, based on a triangulation of the polygone. We also describe an open source library providing this algorithm as well as the algorithms from [3].\n  [3] V. Guigues, Computation of the cumulative distribution f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00958","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FqSZ5CndD73HrwzcbuVhuI6RK7xAPxUIDEPW96pmVEosXuNBvgy7Mlmh6cA8VrNCnzISFfNlVrMNmKnfgUrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:15:43.019510Z"},"content_sha256":"b4d6287c8caa6b234e5fc6b365eaeb8863e7932eb91419673df0a8b5f24a100c","schema_version":"1.0","event_id":"sha256:b4d6287c8caa6b234e5fc6b365eaeb8863e7932eb91419673df0a8b5f24a100c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7G6PKNHEMCWJGCO6QAESENUIUP/bundle.json","state_url":"https://pith.science/pith/7G6PKNHEMCWJGCO6QAESENUIUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7G6PKNHEMCWJGCO6QAESENUIUP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:15:43Z","links":{"resolver":"https://pith.science/pith/7G6PKNHEMCWJGCO6QAESENUIUP","bundle":"https://pith.science/pith/7G6PKNHEMCWJGCO6QAESENUIUP/bundle.json","state":"https://pith.science/pith/7G6PKNHEMCWJGCO6QAESENUIUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7G6PKNHEMCWJGCO6QAESENUIUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7G6PKNHEMCWJGCO6QAESENUIUP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d74f953c1562aa16d4791eec3fec226af466c89b4739f5ad6acd69860fa3f9f9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-03T00:11:16Z","title_canon_sha256":"4d14aafaeeb3925bce3a41c2da811ea66e410fffaea7b4547e9447fa77174eae"},"schema_version":"1.0","source":{"id":"1906.00958","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00958","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00958v2","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00958","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"7G6PKNHEMCWJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7G6PKNHEMCWJGCO6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7G6PKNHE","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:b4d6287c8caa6b234e5fc6b365eaeb8863e7932eb91419673df0a8b5f24a100c","target":"graph","created_at":"2026-05-17T23:44:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem, has complexity nlog(n) where n is the number of vertices of the polygone. In this paper, we present for case (d) another algorithm with the same complexity, based on a triangulation of the polygone. We also describe an open source library providing this algorithm as well as the algorithms from [3].\n  [3] V. Guigues, Computation of the cumulative distribution f","authors_text":"Vincent Guigues","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-03T00:11:16Z","title":"A library to compute the density of the distance between a point and a random variable uniformly distributed in some sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00958","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4342bf5db6e863d1cb3f4b767d5daf4100b92495a45817436d736ee47e57e40","target":"record","created_at":"2026-05-17T23:44:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d74f953c1562aa16d4791eec3fec226af466c89b4739f5ad6acd69860fa3f9f9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-06-03T00:11:16Z","title_canon_sha256":"4d14aafaeeb3925bce3a41c2da811ea66e410fffaea7b4547e9447fa77174eae"},"schema_version":"1.0","source":{"id":"1906.00958","kind":"arxiv","version":2}},"canonical_sha256":"f9bcf534e460ac9309de8009223688a3dd1e595b1f235b9f73220e99dd3842f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9bcf534e460ac9309de8009223688a3dd1e595b1f235b9f73220e99dd3842f4","first_computed_at":"2026-05-17T23:44:06.644375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.644375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OwVjitIuNcFJnIR1Nj22hfQoEDXI467l6SkyscmBKgwgQGqAYtdSaX/GhpEiJZvUjDYT0y8m/ymw2N7UPNvGBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.645027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00958","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4342bf5db6e863d1cb3f4b767d5daf4100b92495a45817436d736ee47e57e40","sha256:b4d6287c8caa6b234e5fc6b365eaeb8863e7932eb91419673df0a8b5f24a100c"],"state_sha256":"e0cc9b36eb96a12f567a7b8c0ad6afbb828ddc5175da8a745ee893de52f4e60a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVIiYTPRQeNq3B9GN+fBDrUid0rFEZEezGwDnefZe9pGu477530rp0HDd+ZIW0sSt5v/MIvSlgejEjZp6dZDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:15:43.021680Z","bundle_sha256":"3c05bdb4f6acaefa551211363454bf1542676b45d3e1f74f11c896f7cd92802f"}}