{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GGJ2JC5VAQ6BJH4TS6ICEX5BK7","short_pith_number":"pith:GGJ2JC5V","schema_version":"1.0","canonical_sha256":"3193a48bb5043c149f939790225fa157c57d8b3ad31a252721d07e077330c725","source":{"kind":"arxiv","id":"1107.2004","version":1},"attestation_state":"computed","paper":{"title":"Quickest Paths in Simulations of Pedestrians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"physics.soc-ph","authors_text":"Andree Grosse, Andrej Pohlmann, Lukas Kautzsch, Peter Vortisch, Stefan Hengst, Tobias Kretz","submitted_at":"2011-07-11T12:02:26Z","abstract_excerpt":"This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g"},"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":"1107.2004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-11T12:02:26Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"28dbf62a77f533aeb04c0c6648da8d30278f4fb46445a8849e23fb8a1222b56e","abstract_canon_sha256":"27db1b04a9b8ce3aecf16e251886d0197e5261b3289c4e061aed964a73b3442b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.326066Z","signature_b64":"j3czlM8Jpn3dLy5t8YkYZf5+k661VOonLNUwN6CXowlD6Mpd8AfDIrYRbX9KZ1BlyNQMug1yemBxj+KWFAGsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3193a48bb5043c149f939790225fa157c57d8b3ad31a252721d07e077330c725","last_reissued_at":"2026-05-18T02:47:51.325430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.325430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quickest Paths in Simulations of Pedestrians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"physics.soc-ph","authors_text":"Andree Grosse, Andrej Pohlmann, Lukas Kautzsch, Peter Vortisch, Stefan Hengst, Tobias Kretz","submitted_at":"2011-07-11T12:02:26Z","abstract_excerpt":"This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2004","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2004","created_at":"2026-05-18T02:47:51.325537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2004v1","created_at":"2026-05-18T02:47:51.325537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2004","created_at":"2026-05-18T02:47:51.325537+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGJ2JC5VAQ6B","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGJ2JC5VAQ6BJH4T","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGJ2JC5V","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7","json":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7.json","graph_json":"https://pith.science/api/pith-number/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/graph.json","events_json":"https://pith.science/api/pith-number/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/events.json","paper":"https://pith.science/paper/GGJ2JC5V"},"agent_actions":{"view_html":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7","download_json":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7.json","view_paper":"https://pith.science/paper/GGJ2JC5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2004&json=true","fetch_graph":"https://pith.science/api/pith-number/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/graph.json","fetch_events":"https://pith.science/api/pith-number/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/action/storage_attestation","attest_author":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/action/author_attestation","sign_citation":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/action/citation_signature","submit_replication":"https://pith.science/pith/GGJ2JC5VAQ6BJH4TS6ICEX5BK7/action/replication_record"}},"created_at":"2026-05-18T02:47:51.325537+00:00","updated_at":"2026-05-18T02:47:51.325537+00:00"}