{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LJRSIGKZQRRKWKP4COP2OAPBDC","short_pith_number":"pith:LJRSIGKZ","schema_version":"1.0","canonical_sha256":"5a632419598462ab29fc139fa701e1189666181559b84c2096b6c35f90b400ee","source":{"kind":"arxiv","id":"2212.02573","version":2},"attestation_state":"computed","paper":{"title":"Domain-General Crowd Counting in Unseen Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiankang Deng, Miaojing Shi, Zhipeng Du","submitted_at":"2022-12-05T19:52:28Z","abstract_excerpt":"Domain shift across crowd data severely hinders crowd counting models to generalize to unseen scenarios. Although domain adaptive crowd counting approaches close this gap to a certain extent, they are still dependent on the target domain data to adapt (e.g. finetune) their models to the specific domain. In this paper, we aim to train a model based on a single source domain which can generalize well on any unseen domain. This falls into the realm of domain generalization that remains unexplored in crowd counting. We first introduce a dynamic sub-domain division scheme which divides the source d"},"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":"2212.02573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-05T19:52:28Z","cross_cats_sorted":[],"title_canon_sha256":"686a3d584d702ef370645fe05f585f2f8b132b67e82fb4f9405082fde77f409b","abstract_canon_sha256":"00862a6af47c680ca594b114f058249b009bbf37850010c3dd1eb3e765583204"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:15.503895Z","signature_b64":"8v2yLS5OmfNntaVDQhj98heQ6iJQ6Qwwyoy7n7c8RynWPxqviH3PVOp+D2Z+AmLgkWpTS+3OgU1AT81WzMf1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a632419598462ab29fc139fa701e1189666181559b84c2096b6c35f90b400ee","last_reissued_at":"2026-07-05T05:55:15.503373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:15.503373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain-General Crowd Counting in Unseen Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiankang Deng, Miaojing Shi, Zhipeng Du","submitted_at":"2022-12-05T19:52:28Z","abstract_excerpt":"Domain shift across crowd data severely hinders crowd counting models to generalize to unseen scenarios. Although domain adaptive crowd counting approaches close this gap to a certain extent, they are still dependent on the target domain data to adapt (e.g. finetune) their models to the specific domain. In this paper, we aim to train a model based on a single source domain which can generalize well on any unseen domain. This falls into the realm of domain generalization that remains unexplored in crowd counting. We first introduce a dynamic sub-domain division scheme which divides the source d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02573","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/2212.02573/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":"2212.02573","created_at":"2026-07-05T05:55:15.503433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02573v2","created_at":"2026-07-05T05:55:15.503433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02573","created_at":"2026-07-05T05:55:15.503433+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJRSIGKZQRRK","created_at":"2026-07-05T05:55:15.503433+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJRSIGKZQRRKWKP4","created_at":"2026-07-05T05:55:15.503433+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJRSIGKZ","created_at":"2026-07-05T05:55:15.503433+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":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC","json":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC.json","graph_json":"https://pith.science/api/pith-number/LJRSIGKZQRRKWKP4COP2OAPBDC/graph.json","events_json":"https://pith.science/api/pith-number/LJRSIGKZQRRKWKP4COP2OAPBDC/events.json","paper":"https://pith.science/paper/LJRSIGKZ"},"agent_actions":{"view_html":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC","download_json":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC.json","view_paper":"https://pith.science/paper/LJRSIGKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02573&json=true","fetch_graph":"https://pith.science/api/pith-number/LJRSIGKZQRRKWKP4COP2OAPBDC/graph.json","fetch_events":"https://pith.science/api/pith-number/LJRSIGKZQRRKWKP4COP2OAPBDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC/action/storage_attestation","attest_author":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC/action/author_attestation","sign_citation":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC/action/citation_signature","submit_replication":"https://pith.science/pith/LJRSIGKZQRRKWKP4COP2OAPBDC/action/replication_record"}},"created_at":"2026-07-05T05:55:15.503433+00:00","updated_at":"2026-07-05T05:55:15.503433+00:00"}