{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HX5OXHDPGYQQS7QGW4IV5TTYHT","short_pith_number":"pith:HX5OXHDP","schema_version":"1.0","canonical_sha256":"3dfaeb9c6f3621097e06b7115ece783cf4fb72b2a8c7e333e8fd73e3f1018d68","source":{"kind":"arxiv","id":"1607.07647","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.07647","created_at":"2026-05-18T00:44:00.579908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07647v1","created_at":"2026-05-18T00:44:00.579908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07647","created_at":"2026-05-18T00:44:00.579908+00:00"},{"alias_kind":"pith_short_12","alias_value":"HX5OXHDPGYQQ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HX5OXHDPGYQQS7QG","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HX5OXHDP","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT","json":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT.json","graph_json":"https://pith.science/api/pith-number/HX5OXHDPGYQQS7QGW4IV5TTYHT/graph.json","events_json":"https://pith.science/api/pith-number/HX5OXHDPGYQQS7QGW4IV5TTYHT/events.json","paper":"https://pith.science/paper/HX5OXHDP"},"agent_actions":{"view_html":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT","download_json":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT.json","view_paper":"https://pith.science/paper/HX5OXHDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07647&json=true","fetch_graph":"https://pith.science/api/pith-number/HX5OXHDPGYQQS7QGW4IV5TTYHT/graph.json","fetch_events":"https://pith.science/api/pith-number/HX5OXHDPGYQQS7QGW4IV5TTYHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/action/storage_attestation","attest_author":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/action/author_attestation","sign_citation":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/action/citation_signature","submit_replication":"https://pith.science/pith/HX5OXHDPGYQQS7QGW4IV5TTYHT/action/replication_record"}},"created_at":"2026-05-18T00:44:00.579908+00:00","updated_at":"2026-05-18T00:44:00.579908+00:00"}