{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ME4QHVM7LQSKVTSQFSJ4JUWNCY","short_pith_number":"pith:ME4QHVM7","schema_version":"1.0","canonical_sha256":"613903d59f5c24aace502c93c4d2cd161a6cc071748495fdd2a56bdd798e2c4a","source":{"kind":"arxiv","id":"1804.05546","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.05546","created_at":"2026-05-18T00:06:56.059573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05546v3","created_at":"2026-05-18T00:06:56.059573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05546","created_at":"2026-05-18T00:06:56.059573+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME4QHVM7LQSK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME4QHVM7LQSKVTSQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME4QHVM7","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03395","citing_title":"Social-BiGAT: Multimodal Trajectory Forecasting using Bicycle-GAN and Graph Attention Networks","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY","json":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY.json","graph_json":"https://pith.science/api/pith-number/ME4QHVM7LQSKVTSQFSJ4JUWNCY/graph.json","events_json":"https://pith.science/api/pith-number/ME4QHVM7LQSKVTSQFSJ4JUWNCY/events.json","paper":"https://pith.science/paper/ME4QHVM7"},"agent_actions":{"view_html":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY","download_json":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY.json","view_paper":"https://pith.science/paper/ME4QHVM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05546&json=true","fetch_graph":"https://pith.science/api/pith-number/ME4QHVM7LQSKVTSQFSJ4JUWNCY/graph.json","fetch_events":"https://pith.science/api/pith-number/ME4QHVM7LQSKVTSQFSJ4JUWNCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/action/storage_attestation","attest_author":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/action/author_attestation","sign_citation":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/action/citation_signature","submit_replication":"https://pith.science/pith/ME4QHVM7LQSKVTSQFSJ4JUWNCY/action/replication_record"}},"created_at":"2026-05-18T00:06:56.059573+00:00","updated_at":"2026-05-18T00:06:56.059573+00:00"}