{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7XA2GLXWDKHUCGVFNJYKMS7EHI","short_pith_number":"pith:7XA2GLXW","schema_version":"1.0","canonical_sha256":"fdc1a32ef61a8f411aa56a70a64be43a08ea9fea2e0c19c11b71e0a56f3cdd90","source":{"kind":"arxiv","id":"2410.05808","version":1},"attestation_state":"computed","paper":{"title":"Vision Transformer based Random Walk for Group Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guoqing Zhang, Tianqi Liu, Wenxuan Fang, Yuhui Zheng","submitted_at":"2024-10-08T08:41:14Z","abstract_excerpt":"Group re-identification (re-ID) aims to match groups with the same people under different cameras, mainly involves the challenges of group members and layout changes well. Most existing methods usually use the k-nearest neighbor algorithm to update node features to consider changes in group membership, but these methods cannot solve the problem of group layout changes. To this end, we propose a novel vision transformer based random walk framework for group re-ID. Specifically, we design a vision transformer based on a monocular depth estimation algorithm to construct a graph through the averag"},"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":"2410.05808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-10-08T08:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"63cd1cc4bf8dc0108fa159fa46529813d8d47d49f9cdcef01571e5807a66f85e","abstract_canon_sha256":"fb53c0f0b7776b2e9907234ae216b7869b0ab6972455e0a4213713873a8a7498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:25.125381Z","signature_b64":"OhxCGNQk2FqpmKvouI7L46JmVxnJuHiH1qHvTwO5JwW65E34yIigbYyr/4JQGaQst9OM4xkJz4IbuluHLjicDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdc1a32ef61a8f411aa56a70a64be43a08ea9fea2e0c19c11b71e0a56f3cdd90","last_reissued_at":"2026-07-05T09:17:25.124936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:25.124936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vision Transformer based Random Walk for Group Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guoqing Zhang, Tianqi Liu, Wenxuan Fang, Yuhui Zheng","submitted_at":"2024-10-08T08:41:14Z","abstract_excerpt":"Group re-identification (re-ID) aims to match groups with the same people under different cameras, mainly involves the challenges of group members and layout changes well. Most existing methods usually use the k-nearest neighbor algorithm to update node features to consider changes in group membership, but these methods cannot solve the problem of group layout changes. To this end, we propose a novel vision transformer based random walk framework for group re-ID. Specifically, we design a vision transformer based on a monocular depth estimation algorithm to construct a graph through the averag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05808","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/2410.05808/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":"2410.05808","created_at":"2026-07-05T09:17:25.124991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.05808v1","created_at":"2026-07-05T09:17:25.124991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05808","created_at":"2026-07-05T09:17:25.124991+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XA2GLXWDKHU","created_at":"2026-07-05T09:17:25.124991+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XA2GLXWDKHUCGVF","created_at":"2026-07-05T09:17:25.124991+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XA2GLXW","created_at":"2026-07-05T09:17:25.124991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06460","citing_title":"Group-CLIP Uncertainty Modeling for Group Re-Identification","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI","json":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI.json","graph_json":"https://pith.science/api/pith-number/7XA2GLXWDKHUCGVFNJYKMS7EHI/graph.json","events_json":"https://pith.science/api/pith-number/7XA2GLXWDKHUCGVFNJYKMS7EHI/events.json","paper":"https://pith.science/paper/7XA2GLXW"},"agent_actions":{"view_html":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI","download_json":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI.json","view_paper":"https://pith.science/paper/7XA2GLXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.05808&json=true","fetch_graph":"https://pith.science/api/pith-number/7XA2GLXWDKHUCGVFNJYKMS7EHI/graph.json","fetch_events":"https://pith.science/api/pith-number/7XA2GLXWDKHUCGVFNJYKMS7EHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI/action/storage_attestation","attest_author":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI/action/author_attestation","sign_citation":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI/action/citation_signature","submit_replication":"https://pith.science/pith/7XA2GLXWDKHUCGVFNJYKMS7EHI/action/replication_record"}},"created_at":"2026-07-05T09:17:25.124991+00:00","updated_at":"2026-07-05T09:17:25.124991+00:00"}