{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J2TCYQMV2MT6UU5LEMMM3NJCFF","short_pith_number":"pith:J2TCYQMV","schema_version":"1.0","canonical_sha256":"4ea62c4195d327ea53ab2318cdb52229493dbf76e3cdd1ef166ba9c24898d639","source":{"kind":"arxiv","id":"2412.18766","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Multi-Graphs Learning for Robust Group Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Lubin Weng, Ruiqi Liu, Xiaohao Xu, Xingyu Liu, Yixuan Zhang, Yongxin Ge","submitted_at":"2024-12-25T03:33:43Z","abstract_excerpt":"Group Re-identification (G-ReID) faces greater complexity than individual Re-identification (ReID) due to challenges like mutual occlusion, dynamic member interactions, and evolving group structures. Prior graph-based approaches have aimed to capture these dynamics by modeling the group as a single topological structure. However, these methods struggle to generalize across diverse group compositions, as they fail to fully represent the multifaceted relationships within the group.\n  In this study, we introduce a Hierarchical Multi-Graphs Learning (HMGL) framework to address these challenges. Ou"},"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":"2412.18766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-25T03:33:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fae15cb7e8eda44f20bd6887719b67675aec37536c2654cfcbd3c3f0b7a1388c","abstract_canon_sha256":"3029dfafa5800f24cb866e405c118183566d57ce345e5360c3ce72c85aab63de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:10.468701Z","signature_b64":"aBYKmd1uxbfYAaf3Xthba8c6gz/E0WW7HhZA2KTGUWffQNS+9JUxBxk13DkHyJEHOHKuRQN8WQJJWZpW4O8nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ea62c4195d327ea53ab2318cdb52229493dbf76e3cdd1ef166ba9c24898d639","last_reissued_at":"2026-07-05T09:54:10.468246Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:10.468246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Multi-Graphs Learning for Robust Group Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Lubin Weng, Ruiqi Liu, Xiaohao Xu, Xingyu Liu, Yixuan Zhang, Yongxin Ge","submitted_at":"2024-12-25T03:33:43Z","abstract_excerpt":"Group Re-identification (G-ReID) faces greater complexity than individual Re-identification (ReID) due to challenges like mutual occlusion, dynamic member interactions, and evolving group structures. Prior graph-based approaches have aimed to capture these dynamics by modeling the group as a single topological structure. However, these methods struggle to generalize across diverse group compositions, as they fail to fully represent the multifaceted relationships within the group.\n  In this study, we introduce a Hierarchical Multi-Graphs Learning (HMGL) framework to address these challenges. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18766","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/2412.18766/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":"2412.18766","created_at":"2026-07-05T09:54:10.468304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18766v1","created_at":"2026-07-05T09:54:10.468304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18766","created_at":"2026-07-05T09:54:10.468304+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2TCYQMV2MT6","created_at":"2026-07-05T09:54:10.468304+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2TCYQMV2MT6UU5L","created_at":"2026-07-05T09:54:10.468304+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2TCYQMV","created_at":"2026-07-05T09:54:10.468304+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF","json":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF.json","graph_json":"https://pith.science/api/pith-number/J2TCYQMV2MT6UU5LEMMM3NJCFF/graph.json","events_json":"https://pith.science/api/pith-number/J2TCYQMV2MT6UU5LEMMM3NJCFF/events.json","paper":"https://pith.science/paper/J2TCYQMV"},"agent_actions":{"view_html":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF","download_json":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF.json","view_paper":"https://pith.science/paper/J2TCYQMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18766&json=true","fetch_graph":"https://pith.science/api/pith-number/J2TCYQMV2MT6UU5LEMMM3NJCFF/graph.json","fetch_events":"https://pith.science/api/pith-number/J2TCYQMV2MT6UU5LEMMM3NJCFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF/action/storage_attestation","attest_author":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF/action/author_attestation","sign_citation":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF/action/citation_signature","submit_replication":"https://pith.science/pith/J2TCYQMV2MT6UU5LEMMM3NJCFF/action/replication_record"}},"created_at":"2026-07-05T09:54:10.468304+00:00","updated_at":"2026-07-05T09:54:10.468304+00:00"}