{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RX3YMS435Z4UKC6NXTIYDWUZJF","short_pith_number":"pith:RX3YMS43","schema_version":"1.0","canonical_sha256":"8df7864b9bee79450bcdbcd181da99495873ab333720b71593fd03a69aa70cc9","source":{"kind":"arxiv","id":"2403.09124","version":2},"attestation_state":"computed","paper":{"title":"Single Domain Generalization for Crowd Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"S.-H. Gary Chan, Zhuoxuan Peng","submitted_at":"2024-03-14T06:16:21Z","abstract_excerpt":"Due to its promising results, density map regression has been widely employed for image-based crowd counting. The approach, however, often suffers from severe performance degradation when tested on data from unseen scenarios, the so-called \"domain shift\" problem. To address the problem, we investigate in this work single domain generalization (SDG) for crowd counting. The existing SDG approaches are mainly for image classification and segmentation, and can hardly be extended to our case due to its regression nature and label ambiguity (i.e., ambiguous pixel-level ground truths). We propose MPC"},"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":"2403.09124","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-03-14T06:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"24b9208a5734ac761b1351dc0d3b7ef3155c35f678545291f047f0f4c9d9eb6a","abstract_canon_sha256":"82e4df7ef0b92335d690d8f0f623a152473da571472b6afe1a94124635649579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:38.413862Z","signature_b64":"6sSCDdOcIrifjVd48N7ibREG6WOIr1sEoHBjSkRYcXGRqaOkQWtHYO3BsgJzgnwHkmNBP9OtzFMLPPpzptXaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df7864b9bee79450bcdbcd181da99495873ab333720b71593fd03a69aa70cc9","last_reissued_at":"2026-07-05T08:04:38.413415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:38.413415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Domain Generalization for Crowd Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"S.-H. Gary Chan, Zhuoxuan Peng","submitted_at":"2024-03-14T06:16:21Z","abstract_excerpt":"Due to its promising results, density map regression has been widely employed for image-based crowd counting. The approach, however, often suffers from severe performance degradation when tested on data from unseen scenarios, the so-called \"domain shift\" problem. To address the problem, we investigate in this work single domain generalization (SDG) for crowd counting. The existing SDG approaches are mainly for image classification and segmentation, and can hardly be extended to our case due to its regression nature and label ambiguity (i.e., ambiguous pixel-level ground truths). We propose MPC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09124","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.09124/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":"2403.09124","created_at":"2026-07-05T08:04:38.413470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09124v2","created_at":"2026-07-05T08:04:38.413470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09124","created_at":"2026-07-05T08:04:38.413470+00:00"},{"alias_kind":"pith_short_12","alias_value":"RX3YMS435Z4U","created_at":"2026-07-05T08:04:38.413470+00:00"},{"alias_kind":"pith_short_16","alias_value":"RX3YMS435Z4UKC6N","created_at":"2026-07-05T08:04:38.413470+00:00"},{"alias_kind":"pith_short_8","alias_value":"RX3YMS43","created_at":"2026-07-05T08:04:38.413470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16778","citing_title":"Single Domain Generalization for Few-Shot Counting via Universal Representation Matching","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF","json":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF.json","graph_json":"https://pith.science/api/pith-number/RX3YMS435Z4UKC6NXTIYDWUZJF/graph.json","events_json":"https://pith.science/api/pith-number/RX3YMS435Z4UKC6NXTIYDWUZJF/events.json","paper":"https://pith.science/paper/RX3YMS43"},"agent_actions":{"view_html":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF","download_json":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF.json","view_paper":"https://pith.science/paper/RX3YMS43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09124&json=true","fetch_graph":"https://pith.science/api/pith-number/RX3YMS435Z4UKC6NXTIYDWUZJF/graph.json","fetch_events":"https://pith.science/api/pith-number/RX3YMS435Z4UKC6NXTIYDWUZJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF/action/storage_attestation","attest_author":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF/action/author_attestation","sign_citation":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF/action/citation_signature","submit_replication":"https://pith.science/pith/RX3YMS435Z4UKC6NXTIYDWUZJF/action/replication_record"}},"created_at":"2026-07-05T08:04:38.413470+00:00","updated_at":"2026-07-05T08:04:38.413470+00:00"}