{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RVNQIGJIOVLWFYZNNE7U4I4UIV","short_pith_number":"pith:RVNQIGJI","canonical_record":{"source":{"id":"1803.09937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-27T07:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"c7feaa71d28d9c5120496dc0d5de84aae495dbc1061d0d5a8666afb81db1d33b","abstract_canon_sha256":"6902e2264db856cea54c31cc94a80199a3068b5b72fe180d1752ba1b70182311"},"schema_version":"1.0"},"canonical_sha256":"8d5b041928755762e32d693f4e2394455fc9cbc872179746165ca684a4f7282a","source":{"kind":"arxiv","id":"1803.09937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09937","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09937v1","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09937","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"RVNQIGJIOVLW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVNQIGJIOVLWFYZN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVNQIGJI","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RVNQIGJIOVLWFYZNNE7U4I4UIV","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-27T07:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"c7feaa71d28d9c5120496dc0d5de84aae495dbc1061d0d5a8666afb81db1d33b","abstract_canon_sha256":"6902e2264db856cea54c31cc94a80199a3068b5b72fe180d1752ba1b70182311"},"schema_version":"1.0"},"canonical_sha256":"8d5b041928755762e32d693f4e2394455fc9cbc872179746165ca684a4f7282a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:01.014687Z","signature_b64":"8bSMOriAgqrb5CfrEU7Oq0rRcpJFfzKECr5kUivshHBSgS/edrFR6ZcxnPPslJKHxq6Y/fXZHM/1nh3HWnRHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5b041928755762e32d693f4e2394455fc9cbc872179746165ca684a4f7282a","last_reissued_at":"2026-05-18T00:20:01.013983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:01.013983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09937","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOXW+NW0s+i9v8tZ+Ckk+6NRTNduXVFjEshM4YHm+NTNAc1ou8wnY10gbaklDAnqUIVvCOK7/R0Xlfu6AO1PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:25:06.682415Z"},"content_sha256":"03221c25fe069c7b8cbcf6c3d491d8c585af2fe435e26843d617f1a588e056a7","schema_version":"1.0","event_id":"sha256:03221c25fe069c7b8cbcf6c3d491d8c585af2fe435e26843d617f1a588e056a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RVNQIGJIOVLWFYZNNE7U4I4UIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Attention Matching Network for Context-Aware Feature Sequence based Person Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alex C. Kot, Chun-Guang Li, Gang Wang, Honggang Zhang, Jason Kuen, Jianlou Si, Xiangfei Kong","submitted_at":"2018-03-27T07:41:18Z","abstract_excerpt":"Typical person re-identification (ReID) methods usually describe each pedestrian with a single feature vector and match them in a task-specific metric space. However, the methods based on a single feature vector are not sufficient enough to overcome visual ambiguity, which frequently occurs in real scenario. In this paper, we propose a novel end-to-end trainable framework, called Dual ATtention Matching network (DuATM), to learn context-aware feature sequences and perform attentive sequence comparison simultaneously. The core component of our DuATM framework is a dual attention mechanism, in w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09937","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aRlfDf/dba1Hv2VLT0C/jAFiNh//SLwCeKYP1/K2HEPbdLamhy00NFRBSkjB4tgBRn1HKf4zoc1oPg96rFcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:25:06.683133Z"},"content_sha256":"0093f409d501902a2f6f778f47b7c92018a1d0d5a010c26a4ab8ee913af23179","schema_version":"1.0","event_id":"sha256:0093f409d501902a2f6f778f47b7c92018a1d0d5a010c26a4ab8ee913af23179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/bundle.json","state_url":"https://pith.science/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T10:25:06Z","links":{"resolver":"https://pith.science/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV","bundle":"https://pith.science/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/bundle.json","state":"https://pith.science/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVNQIGJIOVLWFYZNNE7U4I4UIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RVNQIGJIOVLWFYZNNE7U4I4UIV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6902e2264db856cea54c31cc94a80199a3068b5b72fe180d1752ba1b70182311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-27T07:41:18Z","title_canon_sha256":"c7feaa71d28d9c5120496dc0d5de84aae495dbc1061d0d5a8666afb81db1d33b"},"schema_version":"1.0","source":{"id":"1803.09937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09937","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09937v1","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09937","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"RVNQIGJIOVLW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVNQIGJIOVLWFYZN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVNQIGJI","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:0093f409d501902a2f6f778f47b7c92018a1d0d5a010c26a4ab8ee913af23179","target":"graph","created_at":"2026-05-18T00:20:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Typical person re-identification (ReID) methods usually describe each pedestrian with a single feature vector and match them in a task-specific metric space. However, the methods based on a single feature vector are not sufficient enough to overcome visual ambiguity, which frequently occurs in real scenario. In this paper, we propose a novel end-to-end trainable framework, called Dual ATtention Matching network (DuATM), to learn context-aware feature sequences and perform attentive sequence comparison simultaneously. The core component of our DuATM framework is a dual attention mechanism, in w","authors_text":"Alex C. Kot, Chun-Guang Li, Gang Wang, Honggang Zhang, Jason Kuen, Jianlou Si, Xiangfei Kong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-27T07:41:18Z","title":"Dual Attention Matching Network for Context-Aware Feature Sequence based Person Re-Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09937","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:03221c25fe069c7b8cbcf6c3d491d8c585af2fe435e26843d617f1a588e056a7","target":"record","created_at":"2026-05-18T00:20:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6902e2264db856cea54c31cc94a80199a3068b5b72fe180d1752ba1b70182311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-27T07:41:18Z","title_canon_sha256":"c7feaa71d28d9c5120496dc0d5de84aae495dbc1061d0d5a8666afb81db1d33b"},"schema_version":"1.0","source":{"id":"1803.09937","kind":"arxiv","version":1}},"canonical_sha256":"8d5b041928755762e32d693f4e2394455fc9cbc872179746165ca684a4f7282a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d5b041928755762e32d693f4e2394455fc9cbc872179746165ca684a4f7282a","first_computed_at":"2026-05-18T00:20:01.013983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:01.013983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8bSMOriAgqrb5CfrEU7Oq0rRcpJFfzKECr5kUivshHBSgS/edrFR6ZcxnPPslJKHxq6Y/fXZHM/1nh3HWnRHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:01.014687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03221c25fe069c7b8cbcf6c3d491d8c585af2fe435e26843d617f1a588e056a7","sha256:0093f409d501902a2f6f778f47b7c92018a1d0d5a010c26a4ab8ee913af23179"],"state_sha256":"c214dfcd4a2c1ab18fa7c66f3d873c0b4d8a9c1d87b5182f5b6f72e3bd62d274"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paWv/+CP5sQmGvHoHIplWFKlEARCc6e/KmctLA+T+WsB6l1GPkPmVueAFwt/rJf9GKpMyA1sdC26xbPsRHn6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:25:06.688048Z","bundle_sha256":"f83796e58378459af78a8e054fbf3d018dd098127dbee8101373054e8df325a6"}}