{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VYFMEI6NZU7KT3HGMHB43KVZKQ","short_pith_number":"pith:VYFMEI6N","canonical_record":{"source":{"id":"1811.00313","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T11:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"9fcb09142e8e0b6f061ac758540379dfda00881b6581c9e061fcac14020b27ed","abstract_canon_sha256":"edd39f92d54e67295caa2870891a0315ae5979767368ef047b16e69b658d7694"},"schema_version":"1.0"},"canonical_sha256":"ae0ac223cdcd3ea9ece661c3cdaab95439d50b8dff6f7ba80de92268a0e00d26","source":{"kind":"arxiv","id":"1811.00313","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00313","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00313v3","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00313","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"VYFMEI6NZU7K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYFMEI6NZU7KT3HG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYFMEI6N","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VYFMEI6NZU7KT3HGMHB43KVZKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00313","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T11:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"9fcb09142e8e0b6f061ac758540379dfda00881b6581c9e061fcac14020b27ed","abstract_canon_sha256":"edd39f92d54e67295caa2870891a0315ae5979767368ef047b16e69b658d7694"},"schema_version":"1.0"},"canonical_sha256":"ae0ac223cdcd3ea9ece661c3cdaab95439d50b8dff6f7ba80de92268a0e00d26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:25.375644Z","signature_b64":"TR7OWgHwqWESldmV2QqoIABmcoNBdt/OOnWyp9dbo++XshXIrdDMD00nD/wuvSvtTf2aDsO4QMprhqQPwzmSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0ac223cdcd3ea9ece661c3cdaab95439d50b8dff6f7ba80de92268a0e00d26","last_reissued_at":"2026-05-17T23:39:25.375184Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:25.375184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00313","source_version":3,"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZI8/hE+Ly/H8KYeO49rG2BV/JZ7wmUV8lCiOl2BCm2bTwxz66w/zR60APnZv5i5vpaWshPU2f3LSNSTMFpVjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:01:15.515515Z"},"content_sha256":"2ac86a12de9c5386b34abb6d9c5706623ddb6c1cd57217a85ea096fbafeffd68","schema_version":"1.0","event_id":"sha256:2ac86a12de9c5386b34abb6d9c5706623ddb6c1cd57217a85ea096fbafeffd68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VYFMEI6NZU7KT3HGMHB43KVZKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional Recurrent Predictor: Implicit Representation for Multi-target Filtering and Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alessandro Bay, Eduard Vazquez, Mehryar Emambakhsh","submitted_at":"2018-11-01T11:06:57Z","abstract_excerpt":"Defining a multi-target motion model, which is an important step of tracking algorithms, can be very challenging. Using fixed models (as in several generative Bayesian algorithms, such as Kalman filters) can fail to accurately predict sophisticated target motions. On the other hand, sequential learning of the motion model (for example, using recurrent neural networks) can be computationally complex and difficult due to the variable unknown number of targets. In this paper, we propose a multi-target filtering and tracking algorithm which learns the motion model, simultaneously for all targets, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00313","kind":"arxiv","version":3},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLZ1pZ1VMSVBBoI4UBIv+X1Yz6NozNSddNDPnFJemPZLKLSpwRemPULM5hCdMDw437gjALGxXrYfM+BeExceAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:01:15.515865Z"},"content_sha256":"970842ad76466eac75958920eb80729c175666cd227f045d63d32743ead32b16","schema_version":"1.0","event_id":"sha256:970842ad76466eac75958920eb80729c175666cd227f045d63d32743ead32b16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/bundle.json","state_url":"https://pith.science/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/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-03T20:01:15Z","links":{"resolver":"https://pith.science/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ","bundle":"https://pith.science/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/bundle.json","state":"https://pith.science/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYFMEI6NZU7KT3HGMHB43KVZKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VYFMEI6NZU7KT3HGMHB43KVZKQ","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":"edd39f92d54e67295caa2870891a0315ae5979767368ef047b16e69b658d7694","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T11:06:57Z","title_canon_sha256":"9fcb09142e8e0b6f061ac758540379dfda00881b6581c9e061fcac14020b27ed"},"schema_version":"1.0","source":{"id":"1811.00313","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00313","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00313v3","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00313","created_at":"2026-05-17T23:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"VYFMEI6NZU7K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYFMEI6NZU7KT3HG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYFMEI6N","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:970842ad76466eac75958920eb80729c175666cd227f045d63d32743ead32b16","target":"graph","created_at":"2026-05-17T23:39:25Z","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":"Defining a multi-target motion model, which is an important step of tracking algorithms, can be very challenging. Using fixed models (as in several generative Bayesian algorithms, such as Kalman filters) can fail to accurately predict sophisticated target motions. On the other hand, sequential learning of the motion model (for example, using recurrent neural networks) can be computationally complex and difficult due to the variable unknown number of targets. In this paper, we propose a multi-target filtering and tracking algorithm which learns the motion model, simultaneously for all targets, ","authors_text":"Alessandro Bay, Eduard Vazquez, Mehryar Emambakhsh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T11:06:57Z","title":"Convolutional Recurrent Predictor: Implicit Representation for Multi-target Filtering and Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00313","kind":"arxiv","version":3},"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:2ac86a12de9c5386b34abb6d9c5706623ddb6c1cd57217a85ea096fbafeffd68","target":"record","created_at":"2026-05-17T23:39:25Z","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":"edd39f92d54e67295caa2870891a0315ae5979767368ef047b16e69b658d7694","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T11:06:57Z","title_canon_sha256":"9fcb09142e8e0b6f061ac758540379dfda00881b6581c9e061fcac14020b27ed"},"schema_version":"1.0","source":{"id":"1811.00313","kind":"arxiv","version":3}},"canonical_sha256":"ae0ac223cdcd3ea9ece661c3cdaab95439d50b8dff6f7ba80de92268a0e00d26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0ac223cdcd3ea9ece661c3cdaab95439d50b8dff6f7ba80de92268a0e00d26","first_computed_at":"2026-05-17T23:39:25.375184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:25.375184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TR7OWgHwqWESldmV2QqoIABmcoNBdt/OOnWyp9dbo++XshXIrdDMD00nD/wuvSvtTf2aDsO4QMprhqQPwzmSAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:25.375644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00313","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ac86a12de9c5386b34abb6d9c5706623ddb6c1cd57217a85ea096fbafeffd68","sha256:970842ad76466eac75958920eb80729c175666cd227f045d63d32743ead32b16"],"state_sha256":"3aaa5da45d79e48837c76c1829575b94d2075e6779757c915d6b8a8a35a5b7d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMrlVAfwbjbxcEtGOlwvrg89ZQ8ax1O9ubwjSOoiVjuqJ1yARPsNt38o54e1/RhfW3jlsknauiy5jtpWKLg6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:01:15.517771Z","bundle_sha256":"5459335a44f5333a24a9ed6c01f2de05bb20a3d03c2d004ca57a3960b8e012ab"}}