{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IBOIQA3M5KG7CDST5AJR4A4HCB","short_pith_number":"pith:IBOIQA3M","canonical_record":{"source":{"id":"1907.09915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T23:00:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"802cedf4a80c8696a8d2360f8faf21b261f98c4af8b4feb401dbf8382770c385","abstract_canon_sha256":"9b6d319ddc0fc40f2bbfad6fed4ba46ec45be35e446a761d07ed356827d9ae9f"},"schema_version":"1.0"},"canonical_sha256":"405c88036cea8df10e53e8131e03871050db523ec39afa77c9d3f435ee68502e","source":{"kind":"arxiv","id":"1907.09915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09915","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09915v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09915","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"IBOIQA3M5KG7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBOIQA3M5KG7CDST","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBOIQA3M","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IBOIQA3M5KG7CDST5AJR4A4HCB","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T23:00:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"802cedf4a80c8696a8d2360f8faf21b261f98c4af8b4feb401dbf8382770c385","abstract_canon_sha256":"9b6d319ddc0fc40f2bbfad6fed4ba46ec45be35e446a761d07ed356827d9ae9f"},"schema_version":"1.0"},"canonical_sha256":"405c88036cea8df10e53e8131e03871050db523ec39afa77c9d3f435ee68502e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:29.839138Z","signature_b64":"ODm98Gqm3zpCGnFLs+mnJIGHVW6VgpDwi6NhgIdfjDaAec/XU0nkKrhZPBMnD/UpHbflVG07DrIzCP219PPODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405c88036cea8df10e53e8131e03871050db523ec39afa77c9d3f435ee68502e","last_reissued_at":"2026-05-17T23:39:29.838418Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:29.838418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09915","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-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmmVIKDL8NZA2etjlX63TCaHDg093nutM1jGK8/PtyAU8g9zhe21J5VYt29M1v5HB/zxTyToOx468MGYfDolBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:47:18.588906Z"},"content_sha256":"3bbe9ccce651c81395d42dfef438aaa896f14110753e1012adbf51c7063c9da3","schema_version":"1.0","event_id":"sha256:3bbe9ccce651c81395d42dfef438aaa896f14110753e1012adbf51c7063c9da3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IBOIQA3M5KG7CDST5AJR4A4HCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christoph Mertz, Huajun Liu, Hui Zhang","submitted_at":"2019-07-16T23:00:42Z","abstract_excerpt":"The Long Short-Term Memory (LSTM) neural network based data association algorithm named as DeepDA for multi-target tracking in clutters is proposed to deal with the NP-hard combinatorial optimization problem in this paper. Different from the classical data association methods involving complex models and accurate prior knowledge on clutter density, filter covariance or associated gating etc, data-driven deep learning methods have been extensively researched for this topic. Firstly, data association mathematical problem for multitarget tracking on unknown target number, missed detection and clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09915","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-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKlcGkU2o8elS+A45KsoMmv+vd1evTc67GaWDpceePipk+TaE7c7YYi7RYy5jbtUtmnSTutJu9p5MccjApbgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:47:18.589471Z"},"content_sha256":"05e61f88371d4e68b0ff3133d5baef7fd9e89167074fbb34c94db0adaa775c58","schema_version":"1.0","event_id":"sha256:05e61f88371d4e68b0ff3133d5baef7fd9e89167074fbb34c94db0adaa775c58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/bundle.json","state_url":"https://pith.science/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/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-06T02:47:18Z","links":{"resolver":"https://pith.science/pith/IBOIQA3M5KG7CDST5AJR4A4HCB","bundle":"https://pith.science/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/bundle.json","state":"https://pith.science/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBOIQA3M5KG7CDST5AJR4A4HCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IBOIQA3M5KG7CDST5AJR4A4HCB","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":"9b6d319ddc0fc40f2bbfad6fed4ba46ec45be35e446a761d07ed356827d9ae9f","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T23:00:42Z","title_canon_sha256":"802cedf4a80c8696a8d2360f8faf21b261f98c4af8b4feb401dbf8382770c385"},"schema_version":"1.0","source":{"id":"1907.09915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09915","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09915v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09915","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"IBOIQA3M5KG7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBOIQA3M5KG7CDST","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBOIQA3M","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:05e61f88371d4e68b0ff3133d5baef7fd9e89167074fbb34c94db0adaa775c58","target":"graph","created_at":"2026-05-17T23:39:29Z","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":"The Long Short-Term Memory (LSTM) neural network based data association algorithm named as DeepDA for multi-target tracking in clutters is proposed to deal with the NP-hard combinatorial optimization problem in this paper. Different from the classical data association methods involving complex models and accurate prior knowledge on clutter density, filter covariance or associated gating etc, data-driven deep learning methods have been extensively researched for this topic. Firstly, data association mathematical problem for multitarget tracking on unknown target number, missed detection and clu","authors_text":"Christoph Mertz, Huajun Liu, Hui Zhang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T23:00:42Z","title":"DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09915","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:3bbe9ccce651c81395d42dfef438aaa896f14110753e1012adbf51c7063c9da3","target":"record","created_at":"2026-05-17T23:39:29Z","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":"9b6d319ddc0fc40f2bbfad6fed4ba46ec45be35e446a761d07ed356827d9ae9f","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T23:00:42Z","title_canon_sha256":"802cedf4a80c8696a8d2360f8faf21b261f98c4af8b4feb401dbf8382770c385"},"schema_version":"1.0","source":{"id":"1907.09915","kind":"arxiv","version":1}},"canonical_sha256":"405c88036cea8df10e53e8131e03871050db523ec39afa77c9d3f435ee68502e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405c88036cea8df10e53e8131e03871050db523ec39afa77c9d3f435ee68502e","first_computed_at":"2026-05-17T23:39:29.838418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:29.838418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODm98Gqm3zpCGnFLs+mnJIGHVW6VgpDwi6NhgIdfjDaAec/XU0nkKrhZPBMnD/UpHbflVG07DrIzCP219PPODA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:29.839138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bbe9ccce651c81395d42dfef438aaa896f14110753e1012adbf51c7063c9da3","sha256:05e61f88371d4e68b0ff3133d5baef7fd9e89167074fbb34c94db0adaa775c58"],"state_sha256":"ff7d9e494c9253c87a1ff0799c1341bf49ba4b09850c52a0e04101ab2c3c5996"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2PsaiAHvqwG6yBmQoAJeTrWdTVppKNIy/pifw4I4iFYMHxyIFFJ2+AiWE/p3cWaI7NY6eNlEsDCNHxm7h8wDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:47:18.592233Z","bundle_sha256":"7d5a4c83f51a32645d260386cdf884aa8c29c9e26d6fd5554eb25b3292f7e4ba"}}