{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4HDHNTATQPUMH2GHTVJAJCEELI","short_pith_number":"pith:4HDHNTAT","canonical_record":{"source":{"id":"1402.4157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-17T21:46:26Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"7e99c1a43225028d20f57aeaf7f1687c2897237e309cee18247d486a9202f19c","abstract_canon_sha256":"8e99f5d925980912c28098b638ff4b9e78d4431bc15566ab10c3fc0ad1ad042b"},"schema_version":"1.0"},"canonical_sha256":"e1c676cc1383e8c3e8c79d520488845a3e374e0860e2d3ba04e43ed9af88232e","source":{"kind":"arxiv","id":"1402.4157","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4157","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4157v2","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4157","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"4HDHNTATQPUM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HDHNTATQPUMH2GH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HDHNTAT","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4HDHNTATQPUMH2GHTVJAJCEELI","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-17T21:46:26Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"7e99c1a43225028d20f57aeaf7f1687c2897237e309cee18247d486a9202f19c","abstract_canon_sha256":"8e99f5d925980912c28098b638ff4b9e78d4431bc15566ab10c3fc0ad1ad042b"},"schema_version":"1.0"},"canonical_sha256":"e1c676cc1383e8c3e8c79d520488845a3e374e0860e2d3ba04e43ed9af88232e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:06.071540Z","signature_b64":"6gg5J7spAo5wZDhIHCRkdZZTMVvOHuHetPK7+g7EMdHev1y9OEhFMr7aslTidtn+nImoAGWB6w07LXzT5bBHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c676cc1383e8c3e8c79d520488845a3e374e0860e2d3ba04e43ed9af88232e","last_reissued_at":"2026-05-18T02:52:06.071098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:06.071098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4157","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-18T02:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"joJdEF+fqxSfKpixaeb2gnx/MDTQ7jMl6nmuVhH+g6ScbxUeYpTGsnu/v3/2lT7+PYbp0PkCnIFOJil66iBODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:38:09.567286Z"},"content_sha256":"74c36273e39e0483fc5103c2c4bf99622c3581fc173feb72114d7c02dc31521e","schema_version":"1.0","event_id":"sha256:74c36273e39e0483fc5103c2c4bf99622c3581fc173feb72114d7c02dc31521e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4HDHNTATQPUMH2GHTVJAJCEELI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conservative collision prediction and avoidance for stochastic trajectories in continuous time and space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Jan-Peter Calliess, Michael Osborne, Stephen Roberts","submitted_at":"2014-02-17T21:46:26Z","abstract_excerpt":"Existing work in multi-agent collision prediction and avoidance typically assumes discrete-time trajectories with Gaussian uncertainty or that are completely deterministic. We propose an approach that allows detection of collisions even between continuous, stochastic trajectories with the only restriction that means and variances can be computed. To this end, we employ probabilistic bounds to derive criterion functions whose negative sign provably is indicative of probable collisions. For criterion functions that are Lipschitz, an algorithm is provided to rapidly find negative values or prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4157","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-18T02:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrCH1iTfnpzbv5ELABVZ19PmGtUzLKgp3zUMsTf7LZF1U0y5Y9e+Cx+254EG5HEZZ8gM9QGv0P6mEroEC/OMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:38:09.567655Z"},"content_sha256":"209358b00335efd8144c9ad1fcefbfa582365f7f7a5e28dd6cf4171bd43d6975","schema_version":"1.0","event_id":"sha256:209358b00335efd8144c9ad1fcefbfa582365f7f7a5e28dd6cf4171bd43d6975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HDHNTATQPUMH2GHTVJAJCEELI/bundle.json","state_url":"https://pith.science/pith/4HDHNTATQPUMH2GHTVJAJCEELI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HDHNTATQPUMH2GHTVJAJCEELI/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-06-08T12:38:09Z","links":{"resolver":"https://pith.science/pith/4HDHNTATQPUMH2GHTVJAJCEELI","bundle":"https://pith.science/pith/4HDHNTATQPUMH2GHTVJAJCEELI/bundle.json","state":"https://pith.science/pith/4HDHNTATQPUMH2GHTVJAJCEELI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HDHNTATQPUMH2GHTVJAJCEELI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4HDHNTATQPUMH2GHTVJAJCEELI","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":"8e99f5d925980912c28098b638ff4b9e78d4431bc15566ab10c3fc0ad1ad042b","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-17T21:46:26Z","title_canon_sha256":"7e99c1a43225028d20f57aeaf7f1687c2897237e309cee18247d486a9202f19c"},"schema_version":"1.0","source":{"id":"1402.4157","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4157","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4157v2","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4157","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"4HDHNTATQPUM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HDHNTATQPUMH2GH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HDHNTAT","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:209358b00335efd8144c9ad1fcefbfa582365f7f7a5e28dd6cf4171bd43d6975","target":"graph","created_at":"2026-05-18T02:52: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":"Existing work in multi-agent collision prediction and avoidance typically assumes discrete-time trajectories with Gaussian uncertainty or that are completely deterministic. We propose an approach that allows detection of collisions even between continuous, stochastic trajectories with the only restriction that means and variances can be computed. To this end, we employ probabilistic bounds to derive criterion functions whose negative sign provably is indicative of probable collisions. For criterion functions that are Lipschitz, an algorithm is provided to rapidly find negative values or prove ","authors_text":"Jan-Peter Calliess, Michael Osborne, Stephen Roberts","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-17T21:46:26Z","title":"Conservative collision prediction and avoidance for stochastic trajectories in continuous time and space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4157","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:74c36273e39e0483fc5103c2c4bf99622c3581fc173feb72114d7c02dc31521e","target":"record","created_at":"2026-05-18T02:52: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":"8e99f5d925980912c28098b638ff4b9e78d4431bc15566ab10c3fc0ad1ad042b","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-17T21:46:26Z","title_canon_sha256":"7e99c1a43225028d20f57aeaf7f1687c2897237e309cee18247d486a9202f19c"},"schema_version":"1.0","source":{"id":"1402.4157","kind":"arxiv","version":2}},"canonical_sha256":"e1c676cc1383e8c3e8c79d520488845a3e374e0860e2d3ba04e43ed9af88232e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1c676cc1383e8c3e8c79d520488845a3e374e0860e2d3ba04e43ed9af88232e","first_computed_at":"2026-05-18T02:52:06.071098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:06.071098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gg5J7spAo5wZDhIHCRkdZZTMVvOHuHetPK7+g7EMdHev1y9OEhFMr7aslTidtn+nImoAGWB6w07LXzT5bBHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:06.071540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4157","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74c36273e39e0483fc5103c2c4bf99622c3581fc173feb72114d7c02dc31521e","sha256:209358b00335efd8144c9ad1fcefbfa582365f7f7a5e28dd6cf4171bd43d6975"],"state_sha256":"27b551a3d350d406881d6ce5f3560e0d667e8a32ade379dd7078c323b8a7a684"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRiSrKY3Mo0JegY49ctRE6lvOY2qScPHX/XL1edcSm/qby3awPLiQkmksKgGgiCyOL00g+FionYuyzboJuIqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:38:09.569552Z","bundle_sha256":"01f09cebbf0db185917f309bae492b6713c0aa921f99ae4df35e61f929e08907"}}