{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DT3KMA5MZ7B24YYM72LGCMUZFB","short_pith_number":"pith:DT3KMA5M","canonical_record":{"source":{"id":"1701.08398","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T16:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"b2bf1f1b84ed002948f75e30669c8484391b14db7179f7204e80acd10ccb84ea","abstract_canon_sha256":"634b7162ed3ef2a8d7bd1c7680fa77e100106a52ce75579d1d17e9182838da23"},"schema_version":"1.0"},"canonical_sha256":"1cf6a603accfc3ae630cfe9661329928520113659f6da063e16d5146bf973013","source":{"kind":"arxiv","id":"1701.08398","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08398","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08398v4","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08398","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"pith_short_12","alias_value":"DT3KMA5MZ7B2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DT3KMA5MZ7B24YYM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DT3KMA5M","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DT3KMA5MZ7B24YYM72LGCMUZFB","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08398","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T16:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"b2bf1f1b84ed002948f75e30669c8484391b14db7179f7204e80acd10ccb84ea","abstract_canon_sha256":"634b7162ed3ef2a8d7bd1c7680fa77e100106a52ce75579d1d17e9182838da23"},"schema_version":"1.0"},"canonical_sha256":"1cf6a603accfc3ae630cfe9661329928520113659f6da063e16d5146bf973013","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:01.267816Z","signature_b64":"DMUY26x2rd4c9LOw5diZvHMCw6r11ERbE5IrwpAyzwS7CfQoiZYxB09PeQfg9E+TXlduGVthFDRkKZOcvQixDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf6a603accfc3ae630cfe9661329928520113659f6da063e16d5146bf973013","last_reissued_at":"2026-05-18T00:45:01.267355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:01.267355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08398","source_version":4,"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:45:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNUmgjI4E0QAJYyVt4PxKNQ7GEXBY2UbFiavXb0p878PVlxmEz/9cj1gGTMNeQE2gurXncbwj0K2H4EpnIotBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:54.094746Z"},"content_sha256":"d84982ff67c013aa608e4112f2e3562c1bd1efa541beed9b955843f03f7cf2f6","schema_version":"1.0","event_id":"sha256:d84982ff67c013aa608e4112f2e3562c1bd1efa541beed9b955843f03f7cf2f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DT3KMA5MZ7B24YYM72LGCMUZFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Re-ranking Person Re-identification with k-reciprocal Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Donglin Cao, Liang Zheng, Shaozi Li, Zhun Zhong","submitted_at":"2017-01-29T16:31:51Z","abstract_excerpt":"When considering person re-identification (re-ID) as a retrieval process, re-ranking is a critical step to improve its accuracy. Yet in the re-ID community, limited effort has been devoted to re-ranking, especially those fully automatic, unsupervised solutions. In this paper, we propose a k-reciprocal encoding method to re-rank the re-ID results. Our hypothesis is that if a gallery image is similar to the probe in the k-reciprocal nearest neighbors, it is more likely to be a true match. Specifically, given an image, a k-reciprocal feature is calculated by encoding its k-reciprocal nearest neig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08398","kind":"arxiv","version":4},"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:45:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpxVPp/kt8gnYhnZCbLRXBTnyp7bFst1VNEU6LGDuCrvzeqqYe5rA2kPLpI6JVv5LSr1d5QEY7VSN8WT2r82Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:54.095466Z"},"content_sha256":"82b04edb6bfdc97d26c66315a6ef73d9ef1f3670b19599962d05fb46f045e5fe","schema_version":"1.0","event_id":"sha256:82b04edb6bfdc97d26c66315a6ef73d9ef1f3670b19599962d05fb46f045e5fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/bundle.json","state_url":"https://pith.science/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/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-05-30T07:34:54Z","links":{"resolver":"https://pith.science/pith/DT3KMA5MZ7B24YYM72LGCMUZFB","bundle":"https://pith.science/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/bundle.json","state":"https://pith.science/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DT3KMA5MZ7B24YYM72LGCMUZFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DT3KMA5MZ7B24YYM72LGCMUZFB","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":"634b7162ed3ef2a8d7bd1c7680fa77e100106a52ce75579d1d17e9182838da23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T16:31:51Z","title_canon_sha256":"b2bf1f1b84ed002948f75e30669c8484391b14db7179f7204e80acd10ccb84ea"},"schema_version":"1.0","source":{"id":"1701.08398","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08398","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08398v4","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08398","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"pith_short_12","alias_value":"DT3KMA5MZ7B2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DT3KMA5MZ7B24YYM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DT3KMA5M","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:82b04edb6bfdc97d26c66315a6ef73d9ef1f3670b19599962d05fb46f045e5fe","target":"graph","created_at":"2026-05-18T00:45: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":"When considering person re-identification (re-ID) as a retrieval process, re-ranking is a critical step to improve its accuracy. Yet in the re-ID community, limited effort has been devoted to re-ranking, especially those fully automatic, unsupervised solutions. In this paper, we propose a k-reciprocal encoding method to re-rank the re-ID results. Our hypothesis is that if a gallery image is similar to the probe in the k-reciprocal nearest neighbors, it is more likely to be a true match. Specifically, given an image, a k-reciprocal feature is calculated by encoding its k-reciprocal nearest neig","authors_text":"Donglin Cao, Liang Zheng, Shaozi Li, Zhun Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T16:31:51Z","title":"Re-ranking Person Re-identification with k-reciprocal Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08398","kind":"arxiv","version":4},"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:d84982ff67c013aa608e4112f2e3562c1bd1efa541beed9b955843f03f7cf2f6","target":"record","created_at":"2026-05-18T00:45: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":"634b7162ed3ef2a8d7bd1c7680fa77e100106a52ce75579d1d17e9182838da23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T16:31:51Z","title_canon_sha256":"b2bf1f1b84ed002948f75e30669c8484391b14db7179f7204e80acd10ccb84ea"},"schema_version":"1.0","source":{"id":"1701.08398","kind":"arxiv","version":4}},"canonical_sha256":"1cf6a603accfc3ae630cfe9661329928520113659f6da063e16d5146bf973013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cf6a603accfc3ae630cfe9661329928520113659f6da063e16d5146bf973013","first_computed_at":"2026-05-18T00:45:01.267355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:01.267355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMUY26x2rd4c9LOw5diZvHMCw6r11ERbE5IrwpAyzwS7CfQoiZYxB09PeQfg9E+TXlduGVthFDRkKZOcvQixDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:01.267816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08398","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d84982ff67c013aa608e4112f2e3562c1bd1efa541beed9b955843f03f7cf2f6","sha256:82b04edb6bfdc97d26c66315a6ef73d9ef1f3670b19599962d05fb46f045e5fe"],"state_sha256":"fcec3524cc8a58ef69f34057f412f70de968460324f301bd501cebb1436401d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6av7xtoKIBv7yeCN+FcxH8/+jQdHcmoalPAzub7meBUwQlzu/ScUaSPlp3YRy5qOlJmH973MaBbDwG2hUVmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:34:54.099578Z","bundle_sha256":"7a150c760f3663e3a526f3577e5bb5f06b73e2abe4c050ca0087d5803f01da99"}}