{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PXHMOFIHTTRYRBZEKNFPNTQJO6","short_pith_number":"pith:PXHMOFIH","schema_version":"1.0","canonical_sha256":"7dcec715079ce3888724534af6ce0977a82cbfc19ae180b4d032b71876d7ee98","source":{"kind":"arxiv","id":"1902.01115","version":1},"attestation_state":"computed","paper":{"title":"Dual Path Multi-Scale Fusion Networks with Attention for Crowd Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chao Lu, Liang Zhu, Tangren Yao, Yao Peng, Yining Lin, Zhijian Zhao","submitted_at":"2019-02-04T10:34:56Z","abstract_excerpt":"The task of crowd counting in varying density scenes is an extremely difficult challenge due to large scale variations. In this paper, we propose a novel dual path multi-scale fusion network architecture with attention mechanism named SFANet that can perform accurate count estimation as well as present high-resolution density maps for highly congested crowd scenes. The proposed SFANet contains two main components: a VGG backbone convolutional neural network (CNN) as the front-end feature map extractor and a dual path multi-scale fusion networks as the back-end to generate density map. These du"},"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":"1902.01115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-04T10:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"80e9abcb1f026db8733e73c103c21e35113c09f259143a7e870bc45b7048178d","abstract_canon_sha256":"6675cc8b3d0840f6e31387f01b8048f830137d3eb4556075a2a7ec66a5dc709e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:49.654367Z","signature_b64":"MnM8Gjd8s3iAmh1dxOvC3vUSb2L4/dlJPdBoQdr87cMaLNgN9cKK3MFT+eIQRPrc3WTIlCB6k9D4nlCgM5VhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dcec715079ce3888724534af6ce0977a82cbfc19ae180b4d032b71876d7ee98","last_reissued_at":"2026-05-17T23:54:49.653700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:49.653700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Path Multi-Scale Fusion Networks with Attention for Crowd Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chao Lu, Liang Zhu, Tangren Yao, Yao Peng, Yining Lin, Zhijian Zhao","submitted_at":"2019-02-04T10:34:56Z","abstract_excerpt":"The task of crowd counting in varying density scenes is an extremely difficult challenge due to large scale variations. In this paper, we propose a novel dual path multi-scale fusion network architecture with attention mechanism named SFANet that can perform accurate count estimation as well as present high-resolution density maps for highly congested crowd scenes. The proposed SFANet contains two main components: a VGG backbone convolutional neural network (CNN) as the front-end feature map extractor and a dual path multi-scale fusion networks as the back-end to generate density map. These du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01115","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":"1902.01115","created_at":"2026-05-17T23:54:49.653788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01115v1","created_at":"2026-05-17T23:54:49.653788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01115","created_at":"2026-05-17T23:54:49.653788+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXHMOFIHTTRY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXHMOFIHTTRYRBZE","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXHMOFIH","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18349","citing_title":"Optimising CSRNet with parameter-free attention mechanisms for crowd counting in public transport","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6","json":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6.json","graph_json":"https://pith.science/api/pith-number/PXHMOFIHTTRYRBZEKNFPNTQJO6/graph.json","events_json":"https://pith.science/api/pith-number/PXHMOFIHTTRYRBZEKNFPNTQJO6/events.json","paper":"https://pith.science/paper/PXHMOFIH"},"agent_actions":{"view_html":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6","download_json":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6.json","view_paper":"https://pith.science/paper/PXHMOFIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01115&json=true","fetch_graph":"https://pith.science/api/pith-number/PXHMOFIHTTRYRBZEKNFPNTQJO6/graph.json","fetch_events":"https://pith.science/api/pith-number/PXHMOFIHTTRYRBZEKNFPNTQJO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6/action/storage_attestation","attest_author":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6/action/author_attestation","sign_citation":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6/action/citation_signature","submit_replication":"https://pith.science/pith/PXHMOFIHTTRYRBZEKNFPNTQJO6/action/replication_record"}},"created_at":"2026-05-17T23:54:49.653788+00:00","updated_at":"2026-05-17T23:54:49.653788+00:00"}