{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ENUEW3EIQMPF4D5HAEWTHKDGCU","short_pith_number":"pith:ENUEW3EI","schema_version":"1.0","canonical_sha256":"23684b6c88831e5e0fa7012d33a8661506ce9f5fe2ec34e1d57f3e5132acc806","source":{"kind":"arxiv","id":"2210.17012","version":1},"attestation_state":"computed","paper":{"title":"GotFlow3D: Recurrent Graph Optimal Transport for Learning 3D Flow Motion in Particle Tracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"physics.flu-dyn","authors_text":"Chao Xu, Jiaming Liang, Shengze Cai","submitted_at":"2022-10-31T02:05:58Z","abstract_excerpt":"Flow visualization technologies such as particle tracking velocimetry (PTV) are broadly used in understanding the all-pervasiveness three-dimensional (3D) turbulent flow from nature and industrial processes. Despite the advances in 3D acquisition techniques, the developed motion estimation algorithms in particle tracking remain great challenges of large particle displacements, dense particle distributions and high computational cost. By introducing a novel deep neural network based on recurrent Graph Optimal Transport, called GotFlow3D, we present an end-to-end solution to learn the 3D fluid f"},"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":"2210.17012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.flu-dyn","submitted_at":"2022-10-31T02:05:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8354b14fbcb6631556e0bb71c4e045622c182ab02911b6fa40cf800bb7f23225","abstract_canon_sha256":"548f2ed0e1230baf80ed26ce49669ea0864ba7d5e499e1162eb16b22ccef1b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:53.872815Z","signature_b64":"H8A1pwUz246+J9iP0ebpsO8k0Q+d7Kgvsww1prHyPxS7DT/FDJx39t6g1oX6eG0pUtzx6Qs/JxkNJvT/AX1qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23684b6c88831e5e0fa7012d33a8661506ce9f5fe2ec34e1d57f3e5132acc806","last_reissued_at":"2026-07-05T05:11:53.872365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:53.872365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GotFlow3D: Recurrent Graph Optimal Transport for Learning 3D Flow Motion in Particle Tracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"physics.flu-dyn","authors_text":"Chao Xu, Jiaming Liang, Shengze Cai","submitted_at":"2022-10-31T02:05:58Z","abstract_excerpt":"Flow visualization technologies such as particle tracking velocimetry (PTV) are broadly used in understanding the all-pervasiveness three-dimensional (3D) turbulent flow from nature and industrial processes. Despite the advances in 3D acquisition techniques, the developed motion estimation algorithms in particle tracking remain great challenges of large particle displacements, dense particle distributions and high computational cost. By introducing a novel deep neural network based on recurrent Graph Optimal Transport, called GotFlow3D, we present an end-to-end solution to learn the 3D fluid f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.17012","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.17012/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.17012","created_at":"2026-07-05T05:11:53.872423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.17012v1","created_at":"2026-07-05T05:11:53.872423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.17012","created_at":"2026-07-05T05:11:53.872423+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENUEW3EIQMPF","created_at":"2026-07-05T05:11:53.872423+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENUEW3EIQMPF4D5H","created_at":"2026-07-05T05:11:53.872423+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENUEW3EI","created_at":"2026-07-05T05:11:53.872423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19870","citing_title":"Secure Multi-LLM Agentic AI and Agentification for Edge General Intelligence by Zero-Trust: A Survey","ref_index":65,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU","json":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU.json","graph_json":"https://pith.science/api/pith-number/ENUEW3EIQMPF4D5HAEWTHKDGCU/graph.json","events_json":"https://pith.science/api/pith-number/ENUEW3EIQMPF4D5HAEWTHKDGCU/events.json","paper":"https://pith.science/paper/ENUEW3EI"},"agent_actions":{"view_html":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU","download_json":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU.json","view_paper":"https://pith.science/paper/ENUEW3EI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.17012&json=true","fetch_graph":"https://pith.science/api/pith-number/ENUEW3EIQMPF4D5HAEWTHKDGCU/graph.json","fetch_events":"https://pith.science/api/pith-number/ENUEW3EIQMPF4D5HAEWTHKDGCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU/action/storage_attestation","attest_author":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU/action/author_attestation","sign_citation":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU/action/citation_signature","submit_replication":"https://pith.science/pith/ENUEW3EIQMPF4D5HAEWTHKDGCU/action/replication_record"}},"created_at":"2026-07-05T05:11:53.872423+00:00","updated_at":"2026-07-05T05:11:53.872423+00:00"}