{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ME4QHVM7LQSKVTSQFSJ4JUWNCY","short_pith_number":"pith:ME4QHVM7","canonical_record":{"source":{"id":"1804.05546","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-16T08:27:24Z","cross_cats_sorted":[],"title_canon_sha256":"4719bab81e07abd0cefc32aeb8c6f8cbad995e4ddfcfca76ce1a826c9d6f09e8","abstract_canon_sha256":"e47611ffd6e880b3325c1f744000d21150e5778ff3053fb08ecdf8acd9073740"},"schema_version":"1.0"},"canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","source":{"kind":"arxiv","id":"1804.05546","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05546","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05546v3","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05546","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"ME4QHVM7LQSK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"ME4QHVM7LQSKVTSQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"ME4QHVM7","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ME4QHVM7LQSKVTSQFSJ4JUWNCY","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05546","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-16T08:27:24Z","cross_cats_sorted":[],"title_canon_sha256":"4719bab81e07abd0cefc32aeb8c6f8cbad995e4ddfcfca76ce1a826c9d6f09e8","abstract_canon_sha256":"e47611ffd6e880b3325c1f744000d21150e5778ff3053fb08ecdf8acd9073740"},"schema_version":"1.0"},"canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:56.060112Z","signature_b64":"UlVuDuBQS4LQCFDGHt4ejreYmwpREB6t0btjnYJCc4mXwzePFCWOPU6MrTGPYgrUvwDb5sTUZCABZ+wkerk1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","last_reissued_at":"2026-05-18T00:06:56.059469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:56.059469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05546","source_version":3,"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-18T00:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLdWA/fAOL/QgWylz+f60zomD6+eKceJtNHVtgt5aqvOKlsbxWTruJglfQHtABntnP7rhLuZBYMDB3VS98+aCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:43:28.370159Z"},"content_sha256":"7eaebb31be35097da727cffc5b31952e85a61995da4e67b870d2ce24e1c07fd1","schema_version":"1.0","event_id":"sha256:7eaebb31be35097da727cffc5b31952e85a61995da4e67b870d2ce24e1c07fd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ME4QHVM7LQSKVTSQFSJ4JUWNCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Particle-based pedestrian path prediction using LSTM-MDL models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Michael Arens, Ronny Hug, Stefan Becker, Wolfgang H\\\"ubner","submitted_at":"2018-04-16T08:27:24Z","abstract_excerpt":"Recurrent neural networks are able to learn complex long-term relationships from sequential data and output a pdf over the state space. Therefore, recurrent models are a natural choice to address path prediction tasks, where a trained model is used to generate future expectations from past observations. When applied to security applications, like predicting the path of pedestrians for risk assessment, a point-wise greedy (ML) evaluation of the output pdf is not feasible, since the environment often allows multiple choices. Therefore, a robust risk assessment has to take all options into accoun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05546","kind":"arxiv","version":3},"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-18T00:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BnzTKb9aReizNWk7An5FGgc2zLxQvbRhkh77j5vn3KvO90HlM4BXF+vileq3Jf5xvWuuYu/jZ3rKzttjmX5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:43:28.370825Z"},"content_sha256":"2b6697caee5d59e989154adfa464226e503ead23b7945821de89e78eeea5171a","schema_version":"1.0","event_id":"sha256:2b6697caee5d59e989154adfa464226e503ead23b7945821de89e78eeea5171a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/bundle.json","state_url":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/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-26T03:43:28Z","links":{"resolver":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY","bundle":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/bundle.json","state":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ME4QHVM7LQSKVTSQFSJ4JUWNCY","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":"e47611ffd6e880b3325c1f744000d21150e5778ff3053fb08ecdf8acd9073740","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-16T08:27:24Z","title_canon_sha256":"4719bab81e07abd0cefc32aeb8c6f8cbad995e4ddfcfca76ce1a826c9d6f09e8"},"schema_version":"1.0","source":{"id":"1804.05546","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05546","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05546v3","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05546","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"ME4QHVM7LQSK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"ME4QHVM7LQSKVTSQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"ME4QHVM7","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b6697caee5d59e989154adfa464226e503ead23b7945821de89e78eeea5171a","target":"graph","created_at":"2026-05-18T00:06:56Z","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":"Recurrent neural networks are able to learn complex long-term relationships from sequential data and output a pdf over the state space. Therefore, recurrent models are a natural choice to address path prediction tasks, where a trained model is used to generate future expectations from past observations. When applied to security applications, like predicting the path of pedestrians for risk assessment, a point-wise greedy (ML) evaluation of the output pdf is not feasible, since the environment often allows multiple choices. Therefore, a robust risk assessment has to take all options into accoun","authors_text":"Michael Arens, Ronny Hug, Stefan Becker, Wolfgang H\\\"ubner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-16T08:27:24Z","title":"Particle-based pedestrian path prediction using LSTM-MDL models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05546","kind":"arxiv","version":3},"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:7eaebb31be35097da727cffc5b31952e85a61995da4e67b870d2ce24e1c07fd1","target":"record","created_at":"2026-05-18T00:06:56Z","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":"e47611ffd6e880b3325c1f744000d21150e5778ff3053fb08ecdf8acd9073740","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-16T08:27:24Z","title_canon_sha256":"4719bab81e07abd0cefc32aeb8c6f8cbad995e4ddfcfca76ce1a826c9d6f09e8"},"schema_version":"1.0","source":{"id":"1804.05546","kind":"arxiv","version":3}},"canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","first_computed_at":"2026-05-18T00:06:56.059469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:56.059469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlVuDuBQS4LQCFDGHt4ejreYmwpREB6t0btjnYJCc4mXwzePFCWOPU6MrTGPYgrUvwDb5sTUZCABZ+wkerk1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:56.060112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05546","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eaebb31be35097da727cffc5b31952e85a61995da4e67b870d2ce24e1c07fd1","sha256:2b6697caee5d59e989154adfa464226e503ead23b7945821de89e78eeea5171a"],"state_sha256":"4adf3be1cee17ccac44aab227e4eccde883976a6decfd60491c2ebc5e550311a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUrqcN0m/IkercT0etHasFrFmRsqkh7Wr4BJGY9gKuxbNoDa53e16MRpfbPeLnX2e12E5IgdXXgCSmm62d5lDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:43:28.374263Z","bundle_sha256":"61107c228a8c732559edf8ea95c7e5e6c059fc1582ae96311d0edd7ee06442a4"}}