{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z3QKJEBGNWMZAGCOBNZD2S3YTW","short_pith_number":"pith:Z3QKJEBG","canonical_record":{"source":{"id":"1402.5681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-23T21:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"87ce199782e99c76c1b48aafb74ddad28617361e2a505b9ddd4db059dbd69526","abstract_canon_sha256":"b97cc080471edd2613bfebe1a50be3913b8db6498f839e17e9f86ed1b7f284e4"},"schema_version":"1.0"},"canonical_sha256":"cee0a490266d9990184e0b723d4b789da3fae08951e85bf6931232c54d95b872","source":{"kind":"arxiv","id":"1402.5681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5681","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5681v2","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5681","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QKJEBGNWMZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QKJEBGNWMZAGCO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QKJEBG","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z3QKJEBGNWMZAGCOBNZD2S3YTW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-23T21:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"87ce199782e99c76c1b48aafb74ddad28617361e2a505b9ddd4db059dbd69526","abstract_canon_sha256":"b97cc080471edd2613bfebe1a50be3913b8db6498f839e17e9f86ed1b7f284e4"},"schema_version":"1.0"},"canonical_sha256":"cee0a490266d9990184e0b723d4b789da3fae08951e85bf6931232c54d95b872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:40.029816Z","signature_b64":"79+GBIjQHFkAOuPbiWMVBKyaQsBs7gtTeuKYC0ChIGpZBwKyCK3xv3BDpvazrtToqg46IPRkNjNse9UVSyTsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee0a490266d9990184e0b723d4b789da3fae08951e85bf6931232c54d95b872","last_reissued_at":"2026-05-17T23:51:40.029137Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:40.029137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5681","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:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84pd0aS0OisEtidEfGqmLtH0yym/488bh5fGgfnaw+vqVkjPY8qyFmK/a1dgnlMfOq0uA1/KfqkBjk8zwWw8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:53:47.277987Z"},"content_sha256":"a34345d74cdc719aae8e4686fd346245f3dc8f54abe332a10509f854fa6f4a51","schema_version":"1.0","event_id":"sha256:a34345d74cdc719aae8e4686fd346245f3dc8f54abe332a10509f854fa6f4a51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z3QKJEBGNWMZAGCOBNZD2S3YTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Irina Kostitsyna, Kevin Buchin, Maarten L\\\"offler, Rodrigo I. Silveira","submitted_at":"2014-02-23T21:35:00Z","abstract_excerpt":"Let $p$ and $q$ be two imprecise points, given as probability density functions on $\\mathbb R^2$, and let $\\cal R$ be a set of $n$ line segments (obstacles) in $\\mathbb R^2$. We study the problem of approximating the probability that $p$ and $q$ can see each other; that is, that the segment connecting $p$ and $q$ does not cross any segment of $\\cal R$. To solve this problem, we approximate each density function by a weighted set of polygons; a novel approach to dealing with probability density functions in computational geometry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5681","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:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y8uscYde5uzojjUTDenigzD2G+0HV6ecSamsexxYHkqtnFb7yfISQHXFPNi8Wg6lGWEoid3sZpXKMVdSN9lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:53:47.278403Z"},"content_sha256":"c82c12223c6ac742b3584222ec497ed5db5defa6361328b3379a5864952edf29","schema_version":"1.0","event_id":"sha256:c82c12223c6ac742b3584222ec497ed5db5defa6361328b3379a5864952edf29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/bundle.json","state_url":"https://pith.science/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/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-28T20:53:47Z","links":{"resolver":"https://pith.science/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW","bundle":"https://pith.science/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/bundle.json","state":"https://pith.science/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3QKJEBGNWMZAGCOBNZD2S3YTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z3QKJEBGNWMZAGCOBNZD2S3YTW","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":"b97cc080471edd2613bfebe1a50be3913b8db6498f839e17e9f86ed1b7f284e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-23T21:35:00Z","title_canon_sha256":"87ce199782e99c76c1b48aafb74ddad28617361e2a505b9ddd4db059dbd69526"},"schema_version":"1.0","source":{"id":"1402.5681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5681","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5681v2","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5681","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QKJEBGNWMZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QKJEBGNWMZAGCO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QKJEBG","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:c82c12223c6ac742b3584222ec497ed5db5defa6361328b3379a5864952edf29","target":"graph","created_at":"2026-05-17T23:51:40Z","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":"Let $p$ and $q$ be two imprecise points, given as probability density functions on $\\mathbb R^2$, and let $\\cal R$ be a set of $n$ line segments (obstacles) in $\\mathbb R^2$. We study the problem of approximating the probability that $p$ and $q$ can see each other; that is, that the segment connecting $p$ and $q$ does not cross any segment of $\\cal R$. To solve this problem, we approximate each density function by a weighted set of polygons; a novel approach to dealing with probability density functions in computational geometry.","authors_text":"Irina Kostitsyna, Kevin Buchin, Maarten L\\\"offler, Rodrigo I. Silveira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-23T21:35:00Z","title":"Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5681","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:a34345d74cdc719aae8e4686fd346245f3dc8f54abe332a10509f854fa6f4a51","target":"record","created_at":"2026-05-17T23:51:40Z","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":"b97cc080471edd2613bfebe1a50be3913b8db6498f839e17e9f86ed1b7f284e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-23T21:35:00Z","title_canon_sha256":"87ce199782e99c76c1b48aafb74ddad28617361e2a505b9ddd4db059dbd69526"},"schema_version":"1.0","source":{"id":"1402.5681","kind":"arxiv","version":2}},"canonical_sha256":"cee0a490266d9990184e0b723d4b789da3fae08951e85bf6931232c54d95b872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cee0a490266d9990184e0b723d4b789da3fae08951e85bf6931232c54d95b872","first_computed_at":"2026-05-17T23:51:40.029137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:40.029137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79+GBIjQHFkAOuPbiWMVBKyaQsBs7gtTeuKYC0ChIGpZBwKyCK3xv3BDpvazrtToqg46IPRkNjNse9UVSyTsCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:40.029816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a34345d74cdc719aae8e4686fd346245f3dc8f54abe332a10509f854fa6f4a51","sha256:c82c12223c6ac742b3584222ec497ed5db5defa6361328b3379a5864952edf29"],"state_sha256":"fac325dde2885a1c8f566eec6ef25bac8b096bc15117d8dc47960dd8b1a7ea33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHTYkC8ELDA6XGsBccwI7x52btV53yBHVF47Z9G8ab1PpAwFwI3O0OTE+bs7ete91sZBF9uFwTfUMk8Glo4OAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:53:47.300846Z","bundle_sha256":"750a3b8ef66af2103a4b556b1d1a3ea84971f099c6a5fed3c8792ea7572da177"}}