{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RDFWY6W7NQYD3AZYSVJ3HWFHC2","short_pith_number":"pith:RDFWY6W7","canonical_record":{"source":{"id":"1903.10443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-25T16:24:45Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"3b4865796f010c20dcdb01e3aae25c1739e2774dec3aa78e23479e680537832c","abstract_canon_sha256":"a0a2a880a5c0c2a82ec392c2d616f4e75e1c75eaea81a5bfbff806c596344ef2"},"schema_version":"1.0"},"canonical_sha256":"88cb6c7adf6c303d83389553b3d8a7169535d70c253d961c1a66b725b501e372","source":{"kind":"arxiv","id":"1903.10443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10443","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10443v1","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10443","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"RDFWY6W7NQYD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RDFWY6W7NQYD3AZY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RDFWY6W7","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RDFWY6W7NQYD3AZYSVJ3HWFHC2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-25T16:24:45Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"3b4865796f010c20dcdb01e3aae25c1739e2774dec3aa78e23479e680537832c","abstract_canon_sha256":"a0a2a880a5c0c2a82ec392c2d616f4e75e1c75eaea81a5bfbff806c596344ef2"},"schema_version":"1.0"},"canonical_sha256":"88cb6c7adf6c303d83389553b3d8a7169535d70c253d961c1a66b725b501e372","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:29.383017Z","signature_b64":"DdjF5QK90133uNj8fGW57hwecQK+Eg5o9hVG8q3AIlrGYIEuYtpoo2TNr04F97pFwhD+f9dlTtNlBuiGXJuiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88cb6c7adf6c303d83389553b3d8a7169535d70c253d961c1a66b725b501e372","last_reissued_at":"2026-05-17T23:50:29.382409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:29.382409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10443","source_version":1,"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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDcS/VU1MxVyHwV+e/zl1qkMzgVcusswNK7GdttSOjiZbxta98OTt6euQTgEiwXq3xe5e4RPCdvrTHfq4BhrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:55:52.760874Z"},"content_sha256":"c75636767fa38c97b8969aaf7f9e51a540bc3687e05cf32885bc5879d91d2dd8","schema_version":"1.0","event_id":"sha256:c75636767fa38c97b8969aaf7f9e51a540bc3687e05cf32885bc5879d91d2dd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RDFWY6W7NQYD3AZYSVJ3HWFHC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-Time Robotic Search using Hierarchical Spatial Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.RO","authors_text":"Johan Dahlin, Mattias Villani, Olov Andersson, Patrick Doherty, Per Sid\\'en","submitted_at":"2019-03-25T16:24:45Z","abstract_excerpt":"Aerial robots hold great potential for aiding Search and Rescue (SAR) efforts over large areas. Traditional approaches typically searches an area exhaustively, thereby ignoring that the density of victims varies based on predictable factors, such as the terrain, population density and the type of disaster. We present a probabilistic model to automate SAR planning, with explicit minimization of the expected time to discovery. The proposed model is a hierarchical spatial point process with three interacting spatial fields for i) the point patterns of persons in the area, ii) the probability of d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10443","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"},"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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vm7Cc7o6Dnl6J2P02wfiwD+0FMbVUeMyW31NzEE30bn3CXIXcn3hHPWXlWvwztAWqEztg+MQDMtpVCbcpcYTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:55:52.761308Z"},"content_sha256":"17371fffb8bd361feb207e473b4c44589ce739a230fa8b82f12dbe66dcc74b44","schema_version":"1.0","event_id":"sha256:17371fffb8bd361feb207e473b4c44589ce739a230fa8b82f12dbe66dcc74b44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/bundle.json","state_url":"https://pith.science/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/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-26T20:55:52Z","links":{"resolver":"https://pith.science/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2","bundle":"https://pith.science/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/bundle.json","state":"https://pith.science/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDFWY6W7NQYD3AZYSVJ3HWFHC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RDFWY6W7NQYD3AZYSVJ3HWFHC2","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":"a0a2a880a5c0c2a82ec392c2d616f4e75e1c75eaea81a5bfbff806c596344ef2","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-25T16:24:45Z","title_canon_sha256":"3b4865796f010c20dcdb01e3aae25c1739e2774dec3aa78e23479e680537832c"},"schema_version":"1.0","source":{"id":"1903.10443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10443","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10443v1","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10443","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"RDFWY6W7NQYD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RDFWY6W7NQYD3AZY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RDFWY6W7","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:17371fffb8bd361feb207e473b4c44589ce739a230fa8b82f12dbe66dcc74b44","target":"graph","created_at":"2026-05-17T23:50:29Z","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":"Aerial robots hold great potential for aiding Search and Rescue (SAR) efforts over large areas. Traditional approaches typically searches an area exhaustively, thereby ignoring that the density of victims varies based on predictable factors, such as the terrain, population density and the type of disaster. We present a probabilistic model to automate SAR planning, with explicit minimization of the expected time to discovery. The proposed model is a hierarchical spatial point process with three interacting spatial fields for i) the point patterns of persons in the area, ii) the probability of d","authors_text":"Johan Dahlin, Mattias Villani, Olov Andersson, Patrick Doherty, Per Sid\\'en","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-25T16:24:45Z","title":"Real-Time Robotic Search using Hierarchical Spatial Point Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10443","kind":"arxiv","version":1},"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:c75636767fa38c97b8969aaf7f9e51a540bc3687e05cf32885bc5879d91d2dd8","target":"record","created_at":"2026-05-17T23:50:29Z","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":"a0a2a880a5c0c2a82ec392c2d616f4e75e1c75eaea81a5bfbff806c596344ef2","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-25T16:24:45Z","title_canon_sha256":"3b4865796f010c20dcdb01e3aae25c1739e2774dec3aa78e23479e680537832c"},"schema_version":"1.0","source":{"id":"1903.10443","kind":"arxiv","version":1}},"canonical_sha256":"88cb6c7adf6c303d83389553b3d8a7169535d70c253d961c1a66b725b501e372","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88cb6c7adf6c303d83389553b3d8a7169535d70c253d961c1a66b725b501e372","first_computed_at":"2026-05-17T23:50:29.382409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:29.382409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdjF5QK90133uNj8fGW57hwecQK+Eg5o9hVG8q3AIlrGYIEuYtpoo2TNr04F97pFwhD+f9dlTtNlBuiGXJuiCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:29.383017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c75636767fa38c97b8969aaf7f9e51a540bc3687e05cf32885bc5879d91d2dd8","sha256:17371fffb8bd361feb207e473b4c44589ce739a230fa8b82f12dbe66dcc74b44"],"state_sha256":"ffc0e2533ed8e4e7ebc9e5e63a5dcf210e53f2686b360abe18e8a32b1849d6e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1n2DsjqEdkPrd6iD9F5kua6rItLIqD87MxlrxtTuYqTZ4P676+ykw0+NEdmhao88wvpj7UOjMp8XDZBrMQCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:55:52.764701Z","bundle_sha256":"3b1014ff3754d851f61db03d052ea9230d2b311164485c20a4236f6c37c1aa00"}}