{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HX5OXHDPGYQQS7QGW4IV5TTYHT","short_pith_number":"pith:HX5OXHDP","canonical_record":{"source":{"id":"1607.07647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T11:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"194e621e633bab2f50b27b0e2129b08f113b36a76911f4d6411f95175f8098a4","abstract_canon_sha256":"422668da821bac0f44843501d0aaba0cd73375935406c0f71622fa028f3f438d"},"schema_version":"1.0"},"canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","source":{"kind":"arxiv","id":"1607.07647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07647","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07647v1","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07647","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"HX5OXHDPGYQQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HX5OXHDPGYQQS7QG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HX5OXHDP","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HX5OXHDPGYQQS7QGW4IV5TTYHT","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T11:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"194e621e633bab2f50b27b0e2129b08f113b36a76911f4d6411f95175f8098a4","abstract_canon_sha256":"422668da821bac0f44843501d0aaba0cd73375935406c0f71622fa028f3f438d"},"schema_version":"1.0"},"canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:00.580482Z","signature_b64":"GlUQGC6zM/y03ET0NALiTa2IGXqf5bOdfabF+rdx9ozl+xxsuSqeoxGz7SGZM6mv0aCT4AGHL0vfmH79QSBLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","last_reissued_at":"2026-05-18T00:44:00.579800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:00.579800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07647","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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Giblv17nrdf5zcbLBxcVjqHaC+66j5iQnAxTD8YwN3ulTH5jhR1Ga+lQT8eJAafjv0NVrdIAYjLo0Vi9pevBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:51:47.332509Z"},"content_sha256":"777a66601a498a817457c37b0624676121919fdea0da7e00076cdbdc9a0ad95e","schema_version":"1.0","event_id":"sha256:777a66601a498a817457c37b0624676121919fdea0da7e00076cdbdc9a0ad95e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HX5OXHDPGYQQS7QGW4IV5TTYHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Meyer, Franz Hlawatsch, Paolo Braca, Peter Willett","submitted_at":"2016-07-26T11:28:14Z","abstract_excerpt":"We propose a method for tracking an unknown number of targets based on measurements provided by multiple sensors. Our method achieves low computational complexity and excellent scalability by running belief propagation on a suitably devised factor graph. A redundant formulation of data association uncertainty and the use of \"augmented target states\" including binary target indicators make it possible to exploit statistical independencies for a drastic reduction of complexity. An increase in the number of targets, sensors, or measurements leads to additional variable nodes in the factor graph b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07647","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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJoWcer8DybBHlkx3+VEVVKcXBgiFokjJxJMuKPr7xn/f8RzbCmTszr1lmBVD3j018rPlNq0yt7eGbbwdn1/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:51:47.333050Z"},"content_sha256":"100250ff44ae192441800fe4c9998832ea697471b16ae621a4182562920475ca","schema_version":"1.0","event_id":"sha256:100250ff44ae192441800fe4c9998832ea697471b16ae621a4182562920475ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/bundle.json","state_url":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/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-05-27T15:51:47Z","links":{"resolver":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT","bundle":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/bundle.json","state":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HX5OXHDPGYQQS7QGW4IV5TTYHT","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":"422668da821bac0f44843501d0aaba0cd73375935406c0f71622fa028f3f438d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T11:28:14Z","title_canon_sha256":"194e621e633bab2f50b27b0e2129b08f113b36a76911f4d6411f95175f8098a4"},"schema_version":"1.0","source":{"id":"1607.07647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07647","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07647v1","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07647","created_at":"2026-05-18T00:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"HX5OXHDPGYQQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HX5OXHDPGYQQS7QG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HX5OXHDP","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:100250ff44ae192441800fe4c9998832ea697471b16ae621a4182562920475ca","target":"graph","created_at":"2026-05-18T00:44:00Z","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 method for tracking an unknown number of targets based on measurements provided by multiple sensors. Our method achieves low computational complexity and excellent scalability by running belief propagation on a suitably devised factor graph. A redundant formulation of data association uncertainty and the use of \"augmented target states\" including binary target indicators make it possible to exploit statistical independencies for a drastic reduction of complexity. An increase in the number of targets, sensors, or measurements leads to additional variable nodes in the factor graph b","authors_text":"Florian Meyer, Franz Hlawatsch, Paolo Braca, Peter Willett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T11:28:14Z","title":"A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07647","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:777a66601a498a817457c37b0624676121919fdea0da7e00076cdbdc9a0ad95e","target":"record","created_at":"2026-05-18T00:44:00Z","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":"422668da821bac0f44843501d0aaba0cd73375935406c0f71622fa028f3f438d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T11:28:14Z","title_canon_sha256":"194e621e633bab2f50b27b0e2129b08f113b36a76911f4d6411f95175f8098a4"},"schema_version":"1.0","source":{"id":"1607.07647","kind":"arxiv","version":1}},"canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","first_computed_at":"2026-05-18T00:44:00.579800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:00.579800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GlUQGC6zM/y03ET0NALiTa2IGXqf5bOdfabF+rdx9ozl+xxsuSqeoxGz7SGZM6mv0aCT4AGHL0vfmH79QSBLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:00.580482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:777a66601a498a817457c37b0624676121919fdea0da7e00076cdbdc9a0ad95e","sha256:100250ff44ae192441800fe4c9998832ea697471b16ae621a4182562920475ca"],"state_sha256":"cf04390ff392aedb41eb0ee2df4f603e99ce04f6893a064da6d768ce71825990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUcabbCWtZPxuENw5adaeBsWuCAThtThnL5PS27dtZPwLunu/0H6zwWiys873KaQ/sUqFc4d2VJdE1UIxW6LAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:51:47.336281Z","bundle_sha256":"b59a7907ec81d8fdaf798d87d061908a74431112afbe6f2650d571fd48881f95"}}