{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2D3EHMAINY7665PHCLU422SSEG","short_pith_number":"pith:2D3EHMAI","schema_version":"1.0","canonical_sha256":"d0f643b0086e3fef75e712e9cd6a52219e93354508573ed5c4b5118a53934ce5","source":{"kind":"arxiv","id":"1806.01482","version":2},"attestation_state":"computed","paper":{"title":"SoPhie: An Attentive GAN for Predicting Paths Compliant to Social and Physical Constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Sadeghian, Amir Sadeghian, Noriaki Hirose, S. Hamid Rezatofighi, Silvio Savarese, Vineet Kosaraju","submitted_at":"2018-06-05T03:49:46Z","abstract_excerpt":"This paper addresses the problem of path prediction for multiple interacting agents in a scene, which is a crucial step for many autonomous platforms such as self-driving cars and social robots. We present \\textit{SoPhie}; an interpretable framework based on Generative Adversarial Network (GAN), which leverages two sources of information, the path history of all the agents in a scene, and the scene context information, using images of the scene. To predict a future path for an agent, both physical and social information must be leveraged. Previous work has not been successful to jointly model "},"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":"1806.01482","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-06-05T03:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"59e1ad96ced62db602f28aa6553447cdb00a279a6a2df0f1ade32e9097a3eb18","abstract_canon_sha256":"2eed41b439f62b396bca5aa3597ff4800b5436d4cb443c27fe87f5d02f54c50f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.190456Z","signature_b64":"ev+TxB70p88R8Zp24Q9rz4KvkUgh0GTz7Ji8QnFSgE6Zl2bGVqWqlwJ1vhbfSK3kFJ90ED68b3AvFCL6nhTBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f643b0086e3fef75e712e9cd6a52219e93354508573ed5c4b5118a53934ce5","last_reissued_at":"2026-05-18T00:05:19.189842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.189842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SoPhie: An Attentive GAN for Predicting Paths Compliant to Social and Physical Constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Sadeghian, Amir Sadeghian, Noriaki Hirose, S. Hamid Rezatofighi, Silvio Savarese, Vineet Kosaraju","submitted_at":"2018-06-05T03:49:46Z","abstract_excerpt":"This paper addresses the problem of path prediction for multiple interacting agents in a scene, which is a crucial step for many autonomous platforms such as self-driving cars and social robots. We present \\textit{SoPhie}; an interpretable framework based on Generative Adversarial Network (GAN), which leverages two sources of information, the path history of all the agents in a scene, and the scene context information, using images of the scene. To predict a future path for an agent, both physical and social information must be leveraged. Previous work has not been successful to jointly model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01482","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01482","created_at":"2026-05-18T00:05:19.189921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01482v2","created_at":"2026-05-18T00:05:19.189921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01482","created_at":"2026-05-18T00:05:19.189921+00:00"},{"alias_kind":"pith_short_12","alias_value":"2D3EHMAINY76","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2D3EHMAINY7665PH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2D3EHMAI","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.10233","citing_title":"Stochastic trajectory prediction with social graph network","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"1907.10178","citing_title":"Analyzing the Variety Loss in the Context of Probabilistic Trajectory Prediction","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG","json":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG.json","graph_json":"https://pith.science/api/pith-number/2D3EHMAINY7665PHCLU422SSEG/graph.json","events_json":"https://pith.science/api/pith-number/2D3EHMAINY7665PHCLU422SSEG/events.json","paper":"https://pith.science/paper/2D3EHMAI"},"agent_actions":{"view_html":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG","download_json":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG.json","view_paper":"https://pith.science/paper/2D3EHMAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01482&json=true","fetch_graph":"https://pith.science/api/pith-number/2D3EHMAINY7665PHCLU422SSEG/graph.json","fetch_events":"https://pith.science/api/pith-number/2D3EHMAINY7665PHCLU422SSEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG/action/storage_attestation","attest_author":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG/action/author_attestation","sign_citation":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG/action/citation_signature","submit_replication":"https://pith.science/pith/2D3EHMAINY7665PHCLU422SSEG/action/replication_record"}},"created_at":"2026-05-18T00:05:19.189921+00:00","updated_at":"2026-05-18T00:05:19.189921+00:00"}