{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RL7QVYDFSHFWQOHKEIQFC46SJC","short_pith_number":"pith:RL7QVYDF","canonical_record":{"source":{"id":"1905.02843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-07T23:26:03Z","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"title_canon_sha256":"e592ee4a5131c791ff9a75c02647956eaa9401eaa837a536885f77dde96bffe3","abstract_canon_sha256":"08aa714e7f968cc21514fee373978f149dcdd0172feea3505befae5308655e5a"},"schema_version":"1.0"},"canonical_sha256":"8aff0ae06591cb6838ea22205173d248b8eb357882cc7a8888fcf67a09b9d0d2","source":{"kind":"arxiv","id":"1905.02843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02843","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02843v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02843","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"RL7QVYDFSHFW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RL7QVYDFSHFWQOHK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RL7QVYDF","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RL7QVYDFSHFWQOHKEIQFC46SJC","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-07T23:26:03Z","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"title_canon_sha256":"e592ee4a5131c791ff9a75c02647956eaa9401eaa837a536885f77dde96bffe3","abstract_canon_sha256":"08aa714e7f968cc21514fee373978f149dcdd0172feea3505befae5308655e5a"},"schema_version":"1.0"},"canonical_sha256":"8aff0ae06591cb6838ea22205173d248b8eb357882cc7a8888fcf67a09b9d0d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.207263Z","signature_b64":"Pe+WdaKhMFVQd560ZCVu2YbU8V/2BJTs3LNAiOOeirKC8Zqg8fT7rove/P8/h0VxmieQstDuhl9xDcYzhFKMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aff0ae06591cb6838ea22205173d248b8eb357882cc7a8888fcf67a09b9d0d2","last_reissued_at":"2026-05-17T23:46:45.206844Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.206844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02843","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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9XvqvZmJsFkcMbL7tK7xgtrc+/1MpYCI54Fi0lsSltKuMDPkchv3WlOogRgb1B17OMaHUI9eejgLmpQzvu1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:19:30.112607Z"},"content_sha256":"5a30655918ed116f44531514fea9c001707cfdc9a8244eaf1802b44f6be3f711","schema_version":"1.0","event_id":"sha256:5a30655918ed116f44531514fea9c001707cfdc9a8244eaf1802b44f6be3f711"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RL7QVYDFSHFWQOHKEIQFC46SJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FANTrack: 3D Multi-Object Tracking with Feature Association Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.RO"],"primary_cat":"cs.CV","authors_text":"Erkan Baser, Krzysztof Czarnecki, Prarthana Bhattacharyya, Venkateshwaran Balasubramanian","submitted_at":"2019-05-07T23:26:03Z","abstract_excerpt":"We propose a data-driven approach to online multi-object tracking (MOT) that uses a convolutional neural network (CNN) for data association in a tracking-by-detection framework. The problem of multi-target tracking aims to assign noisy detections to a-priori unknown and time-varying number of tracked objects across a sequence of frames. A majority of the existing solutions focus on either tediously designing cost functions or formulating the task of data association as a complex optimization problem that can be solved effectively. Instead, we exploit the power of deep learning to formulate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02843","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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ox19ZYOuWhtvkrT3WWpEbJaImJJcJW6lWFdr7M7fcMb3l83Dy+mmDq1dwdDkO+qfPHp+FAXtlql51bVxcdgPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:19:30.112965Z"},"content_sha256":"e28154ccfa19717e71dc4b6d8097373fabf51e6c3a231111a492fe0245248ef9","schema_version":"1.0","event_id":"sha256:e28154ccfa19717e71dc4b6d8097373fabf51e6c3a231111a492fe0245248ef9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/bundle.json","state_url":"https://pith.science/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/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-01T05:19:30Z","links":{"resolver":"https://pith.science/pith/RL7QVYDFSHFWQOHKEIQFC46SJC","bundle":"https://pith.science/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/bundle.json","state":"https://pith.science/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RL7QVYDFSHFWQOHKEIQFC46SJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RL7QVYDFSHFWQOHKEIQFC46SJC","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":"08aa714e7f968cc21514fee373978f149dcdd0172feea3505befae5308655e5a","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-07T23:26:03Z","title_canon_sha256":"e592ee4a5131c791ff9a75c02647956eaa9401eaa837a536885f77dde96bffe3"},"schema_version":"1.0","source":{"id":"1905.02843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02843","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02843v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02843","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"RL7QVYDFSHFW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RL7QVYDFSHFWQOHK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RL7QVYDF","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e28154ccfa19717e71dc4b6d8097373fabf51e6c3a231111a492fe0245248ef9","target":"graph","created_at":"2026-05-17T23:46:45Z","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":"We propose a data-driven approach to online multi-object tracking (MOT) that uses a convolutional neural network (CNN) for data association in a tracking-by-detection framework. The problem of multi-target tracking aims to assign noisy detections to a-priori unknown and time-varying number of tracked objects across a sequence of frames. A majority of the existing solutions focus on either tediously designing cost functions or formulating the task of data association as a complex optimization problem that can be solved effectively. Instead, we exploit the power of deep learning to formulate the","authors_text":"Erkan Baser, Krzysztof Czarnecki, Prarthana Bhattacharyya, Venkateshwaran Balasubramanian","cross_cats":["cs.AI","cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-07T23:26:03Z","title":"FANTrack: 3D Multi-Object Tracking with Feature Association Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02843","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:5a30655918ed116f44531514fea9c001707cfdc9a8244eaf1802b44f6be3f711","target":"record","created_at":"2026-05-17T23:46:45Z","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":"08aa714e7f968cc21514fee373978f149dcdd0172feea3505befae5308655e5a","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-07T23:26:03Z","title_canon_sha256":"e592ee4a5131c791ff9a75c02647956eaa9401eaa837a536885f77dde96bffe3"},"schema_version":"1.0","source":{"id":"1905.02843","kind":"arxiv","version":1}},"canonical_sha256":"8aff0ae06591cb6838ea22205173d248b8eb357882cc7a8888fcf67a09b9d0d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aff0ae06591cb6838ea22205173d248b8eb357882cc7a8888fcf67a09b9d0d2","first_computed_at":"2026-05-17T23:46:45.206844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:45.206844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pe+WdaKhMFVQd560ZCVu2YbU8V/2BJTs3LNAiOOeirKC8Zqg8fT7rove/P8/h0VxmieQstDuhl9xDcYzhFKMBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:45.207263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a30655918ed116f44531514fea9c001707cfdc9a8244eaf1802b44f6be3f711","sha256:e28154ccfa19717e71dc4b6d8097373fabf51e6c3a231111a492fe0245248ef9"],"state_sha256":"f03d1692a53e051ca7f8c4fc76533534dd10ed32033938564887ddbdeb688a7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pK9uGKefocEkPRkIxp7y5CAhEFMc27Gd/TSa2jHD+OQ7+ET/bRGLvVQ1gool+aY2lkAg0qeNYIu9CM2SaO1HCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:19:30.115514Z","bundle_sha256":"17da6d13c39c2835a039fc402a5e1c1816ae34d78b4c6f21f10bebaabc0a2960"}}