{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R2WVTUQBY5UTLQNZSZVUJYA7TW","short_pith_number":"pith:R2WVTUQB","canonical_record":{"source":{"id":"1802.03252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-09T13:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1c71899c8a71e5bf3e68e092e72abd9308d8e3ffcf45315e1bb94b819c6c610","abstract_canon_sha256":"3137408868cf892cc5d8ee450b211f5c5a1407045a80e4d48e3aef99929a68d0"},"schema_version":"1.0"},"canonical_sha256":"8ead59d201c76935c1b9966b44e01f9d81bb80da38eb9e3c978c72d80faccb30","source":{"kind":"arxiv","id":"1802.03252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03252","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03252v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03252","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"R2WVTUQBY5UT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2WVTUQBY5UTLQNZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2WVTUQB","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R2WVTUQBY5UTLQNZSZVUJYA7TW","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-09T13:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1c71899c8a71e5bf3e68e092e72abd9308d8e3ffcf45315e1bb94b819c6c610","abstract_canon_sha256":"3137408868cf892cc5d8ee450b211f5c5a1407045a80e4d48e3aef99929a68d0"},"schema_version":"1.0"},"canonical_sha256":"8ead59d201c76935c1b9966b44e01f9d81bb80da38eb9e3c978c72d80faccb30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.181503Z","signature_b64":"pwa7X1o6qBniTSXO+z0WhTACOdUxcqFdKQQOHsEnn2gbMy0pTJI96XQzO5a/Tn8SfzeCmz1RPBKKvA0GsOOpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ead59d201c76935c1b9966b44e01f9d81bb80da38eb9e3c978c72d80faccb30","last_reissued_at":"2026-05-18T00:23:58.180959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.180959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03252","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:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9qCWHWKfw/e45rgh3sAlEigJ8CMo9TSQCdqE7uLNlQvwjWB0PrMzeU3bK5ww17b2vCa7KHYcm+EpiB4VWZ/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:02.301698Z"},"content_sha256":"09e79456991de4e6cf946662315088141092f094cc28e8a443b304d22bff7ef5","schema_version":"1.0","event_id":"sha256:09e79456991de4e6cf946662315088141092f094cc28e8a443b304d22bff7ef5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R2WVTUQBY5UTLQNZSZVUJYA7TW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Target Tracking by Learning Feature Representation and Distance Metric Jointly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guoshuai Zhang, Jianhua Hou, Jun Xiang, Nong Sang, Rui Huang","submitted_at":"2018-02-09T13:34:21Z","abstract_excerpt":"Designing a robust affinity model is the key issue in multiple target tracking (MTT). This paper proposes a novel affinity model by learning feature representation and distance metric jointly in a unified deep architecture. Specifically, we design a CNN network to obtain appearance cue tailored towards person Re-ID, and an LSTM network for motion cue to predict target position, respectively. Both cues are combined with a triplet loss function, which performs end-to-end learning of the fused features in a desired embedding space. Experiments in the challenging MOT benchmark demonstrate, that ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03252","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:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krCWYZ8biI5Nw0gTk8qfiVYT5CVhfP0HMhl3TLFh+pOTBRjBWlCj496xtylfSdzNpblAyGQ/zOf3+tUVxxs6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:02.302048Z"},"content_sha256":"0640568e7fa721ac82bfae75c068cf2ba1ac7e3431d2142fc90b30fb5ea81b92","schema_version":"1.0","event_id":"sha256:0640568e7fa721ac82bfae75c068cf2ba1ac7e3431d2142fc90b30fb5ea81b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/bundle.json","state_url":"https://pith.science/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/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-01T06:22:02Z","links":{"resolver":"https://pith.science/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW","bundle":"https://pith.science/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/bundle.json","state":"https://pith.science/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2WVTUQBY5UTLQNZSZVUJYA7TW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R2WVTUQBY5UTLQNZSZVUJYA7TW","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":"3137408868cf892cc5d8ee450b211f5c5a1407045a80e4d48e3aef99929a68d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-09T13:34:21Z","title_canon_sha256":"b1c71899c8a71e5bf3e68e092e72abd9308d8e3ffcf45315e1bb94b819c6c610"},"schema_version":"1.0","source":{"id":"1802.03252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03252","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03252v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03252","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"R2WVTUQBY5UT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2WVTUQBY5UTLQNZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2WVTUQB","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:0640568e7fa721ac82bfae75c068cf2ba1ac7e3431d2142fc90b30fb5ea81b92","target":"graph","created_at":"2026-05-18T00:23:58Z","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":"Designing a robust affinity model is the key issue in multiple target tracking (MTT). This paper proposes a novel affinity model by learning feature representation and distance metric jointly in a unified deep architecture. Specifically, we design a CNN network to obtain appearance cue tailored towards person Re-ID, and an LSTM network for motion cue to predict target position, respectively. Both cues are combined with a triplet loss function, which performs end-to-end learning of the fused features in a desired embedding space. Experiments in the challenging MOT benchmark demonstrate, that ev","authors_text":"Guoshuai Zhang, Jianhua Hou, Jun Xiang, Nong Sang, Rui Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-09T13:34:21Z","title":"Multiple Target Tracking by Learning Feature Representation and Distance Metric Jointly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03252","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:09e79456991de4e6cf946662315088141092f094cc28e8a443b304d22bff7ef5","target":"record","created_at":"2026-05-18T00:23:58Z","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":"3137408868cf892cc5d8ee450b211f5c5a1407045a80e4d48e3aef99929a68d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-09T13:34:21Z","title_canon_sha256":"b1c71899c8a71e5bf3e68e092e72abd9308d8e3ffcf45315e1bb94b819c6c610"},"schema_version":"1.0","source":{"id":"1802.03252","kind":"arxiv","version":1}},"canonical_sha256":"8ead59d201c76935c1b9966b44e01f9d81bb80da38eb9e3c978c72d80faccb30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ead59d201c76935c1b9966b44e01f9d81bb80da38eb9e3c978c72d80faccb30","first_computed_at":"2026-05-18T00:23:58.180959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:58.180959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pwa7X1o6qBniTSXO+z0WhTACOdUxcqFdKQQOHsEnn2gbMy0pTJI96XQzO5a/Tn8SfzeCmz1RPBKKvA0GsOOpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:58.181503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09e79456991de4e6cf946662315088141092f094cc28e8a443b304d22bff7ef5","sha256:0640568e7fa721ac82bfae75c068cf2ba1ac7e3431d2142fc90b30fb5ea81b92"],"state_sha256":"b2796ac6c63215ba13c2e6d533b089bbdcda2160b98c6f7be6d3a6cac03b7e26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybQGZl9O86X0IM0DDPFP5q3qJ7diXZUTsXYz0ln7uNdrngYctwm1rwSVx2mDuta+fcgDzp3jYy5MrOBc6ZIQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:02.304403Z","bundle_sha256":"c91f3c8a410642bbf627196a63fa500cd6e4fa7e4d7686b1266ddefb9826dde9"}}