{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QXMUI3X4B73J5RE7KBEAMBBKW5","short_pith_number":"pith:QXMUI3X4","canonical_record":{"source":{"id":"2008.06826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-16T03:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"e8a7f0523fcb6078100da445ba2532c924390b087c5f01300e1d1a444ee34e4f","abstract_canon_sha256":"bfb8a5e5d81072fbe8103d09d7c8e14afee68cdc62fcfe6db9062d901a1b508f"},"schema_version":"1.0"},"canonical_sha256":"85d9446efc0ff69ec49f504806042ab7436e73703f87f33c5070940dc44e209f","source":{"kind":"arxiv","id":"2008.06826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.06826","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"2008.06826v1","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06826","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"QXMUI3X4B73J","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_16","alias_value":"QXMUI3X4B73J5RE7","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_8","alias_value":"QXMUI3X4","created_at":"2026-07-05T01:27:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QXMUI3X4B73J5RE7KBEAMBBKW5","target":"record","payload":{"canonical_record":{"source":{"id":"2008.06826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-16T03:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"e8a7f0523fcb6078100da445ba2532c924390b087c5f01300e1d1a444ee34e4f","abstract_canon_sha256":"bfb8a5e5d81072fbe8103d09d7c8e14afee68cdc62fcfe6db9062d901a1b508f"},"schema_version":"1.0"},"canonical_sha256":"85d9446efc0ff69ec49f504806042ab7436e73703f87f33c5070940dc44e209f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:33.434543Z","signature_b64":"luubzmyA43xZc27zcZQ9tAuDCOmYFbd4xxapn7KPDEoDhFzYEnRHe0Wstfxcj/sidyNRD0In+VgFPMGyEgOQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d9446efc0ff69ec49f504806042ab7436e73703f87f33c5070940dc44e209f","last_reissued_at":"2026-07-05T01:27:33.434088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:33.434088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.06826","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-07-05T01:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pd86PS3BRpSnzTTgIHU5Ny+xyqg9qqxCUUL9dn2LvQeHV7OSaHGvmXTiYkTMIJpF1WWmSXijpZs2LteTuhquCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:13:42.927889Z"},"content_sha256":"6710ed7cf63c506595ef26e4a2884b942b0a7e4d1ae5fec3637ec0d8ee285635","schema_version":"1.0","event_id":"sha256:6710ed7cf63c506595ef26e4a2884b942b0a7e4d1ae5fec3637ec0d8ee285635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QXMUI3X4B73J5RE7KBEAMBBKW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Person Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guan'an Wang, Jian Cheng, Shaogang Gong, Zengguang Hou","submitted_at":"2020-08-16T03:02:49Z","abstract_excerpt":"Fast person re-identification (ReID) aims to search person images quickly and accurately. The main idea of recent fast ReID methods is the hashing algorithm, which learns compact binary codes and performs fast Hamming distance and counting sort. However, a very long code is needed for high accuracy (e.g. 2048), which compromises search speed. In this work, we introduce a new solution for fast ReID by formulating a novel Coarse-to-Fine (CtF) hashing code search strategy, which complementarily uses short and long codes, achieving both faster speed and better accuracy. It uses shorter codes to co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06826","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/2008.06826/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"},"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-07-05T01:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5EGGC9YjziH47P/HQwjqvBpR//VFBDzqMxYbWsE9j5tz6cJK4+OqxylN0VZa6JvcOzSuUhHC7zMD5dVCHC3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:13:42.928398Z"},"content_sha256":"17c354d53af3434f425cb8d47e06f3d53a7e30ae4d3a25976016be17ca958909","schema_version":"1.0","event_id":"sha256:17c354d53af3434f425cb8d47e06f3d53a7e30ae4d3a25976016be17ca958909"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/bundle.json","state_url":"https://pith.science/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/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-08-20T07:13:42Z","links":{"resolver":"https://pith.science/pith/QXMUI3X4B73J5RE7KBEAMBBKW5","bundle":"https://pith.science/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/bundle.json","state":"https://pith.science/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXMUI3X4B73J5RE7KBEAMBBKW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QXMUI3X4B73J5RE7KBEAMBBKW5","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":"bfb8a5e5d81072fbe8103d09d7c8e14afee68cdc62fcfe6db9062d901a1b508f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-16T03:02:49Z","title_canon_sha256":"e8a7f0523fcb6078100da445ba2532c924390b087c5f01300e1d1a444ee34e4f"},"schema_version":"1.0","source":{"id":"2008.06826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.06826","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"2008.06826v1","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06826","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"QXMUI3X4B73J","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_16","alias_value":"QXMUI3X4B73J5RE7","created_at":"2026-07-05T01:27:33Z"},{"alias_kind":"pith_short_8","alias_value":"QXMUI3X4","created_at":"2026-07-05T01:27:33Z"}],"graph_snapshots":[{"event_id":"sha256:17c354d53af3434f425cb8d47e06f3d53a7e30ae4d3a25976016be17ca958909","target":"graph","created_at":"2026-07-05T01:27:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.06826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fast person re-identification (ReID) aims to search person images quickly and accurately. The main idea of recent fast ReID methods is the hashing algorithm, which learns compact binary codes and performs fast Hamming distance and counting sort. However, a very long code is needed for high accuracy (e.g. 2048), which compromises search speed. In this work, we introduce a new solution for fast ReID by formulating a novel Coarse-to-Fine (CtF) hashing code search strategy, which complementarily uses short and long codes, achieving both faster speed and better accuracy. It uses shorter codes to co","authors_text":"Guan'an Wang, Jian Cheng, Shaogang Gong, Zengguang Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-16T03:02:49Z","title":"Faster Person Re-Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06826","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:6710ed7cf63c506595ef26e4a2884b942b0a7e4d1ae5fec3637ec0d8ee285635","target":"record","created_at":"2026-07-05T01:27:33Z","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":"bfb8a5e5d81072fbe8103d09d7c8e14afee68cdc62fcfe6db9062d901a1b508f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-16T03:02:49Z","title_canon_sha256":"e8a7f0523fcb6078100da445ba2532c924390b087c5f01300e1d1a444ee34e4f"},"schema_version":"1.0","source":{"id":"2008.06826","kind":"arxiv","version":1}},"canonical_sha256":"85d9446efc0ff69ec49f504806042ab7436e73703f87f33c5070940dc44e209f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d9446efc0ff69ec49f504806042ab7436e73703f87f33c5070940dc44e209f","first_computed_at":"2026-07-05T01:27:33.434088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:33.434088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"luubzmyA43xZc27zcZQ9tAuDCOmYFbd4xxapn7KPDEoDhFzYEnRHe0Wstfxcj/sidyNRD0In+VgFPMGyEgOQCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:33.434543Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.06826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6710ed7cf63c506595ef26e4a2884b942b0a7e4d1ae5fec3637ec0d8ee285635","sha256:17c354d53af3434f425cb8d47e06f3d53a7e30ae4d3a25976016be17ca958909"],"state_sha256":"6785df9e26977c307652658d51685b1f6310e4bee44181f302138f66f553d9b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pbGBiIGG49fA9apPiYFnV6RGIy6E9Ty9FaH/0n+aSxSaaaEr0rZen0TvFHP96sGXuWOtwjgto4w75cTRyORCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:13:42.932306Z","bundle_sha256":"988b7020b46b4e7fb6b1f186fddb5f1d961206763392703d5e43fa37dbca37a3"}}