{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LHI562OPGZ5VYV3AMVVOUWJCSD","short_pith_number":"pith:LHI562OP","schema_version":"1.0","canonical_sha256":"59d1df69cf367b5c5760656aea592290edc3b9add4195c6bf8119c2040f95b59","source":{"kind":"arxiv","id":"1404.7408","version":4},"attestation_state":"computed","paper":{"title":"Multi-target filtering with linearised complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"D. E. Clark, J. Houssineau","submitted_at":"2014-04-29T15:55:54Z","abstract_excerpt":"An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of partially-distinguishable multi-target system. It combines the advantages of engineering solutions like MHT with the rigour of point-process-based methods. It is demonstrated that under intuitive assumptions and approximations, the complexity of the proposed multi-target estimation algorithm can be made linear in the number of tracks and linear in the number of observations, while naturally preserving distinct tracks for detected targets, unlike point-process-based "},"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":"1404.7408","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-29T15:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"a4bad1c76e07e0ab1277798848e04acea5a94ba5dce6e5879cd6c3033ff5b732","abstract_canon_sha256":"85c009c50c2085ac8241a6e7c4302188515e1026d73b93371f603923b0c49941"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:02.122571Z","signature_b64":"G+EgxhBq1BkoFAD4ko9uc2suV6reG9qVAAIIoSxQoqx/BKVpmbS0LobCFX/3p583n518Ks1670jtdepWwJQ0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d1df69cf367b5c5760656aea592290edc3b9add4195c6bf8119c2040f95b59","last_reissued_at":"2026-05-18T00:29:02.122135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:02.122135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-target filtering with linearised complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"D. E. Clark, J. Houssineau","submitted_at":"2014-04-29T15:55:54Z","abstract_excerpt":"An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of partially-distinguishable multi-target system. It combines the advantages of engineering solutions like MHT with the rigour of point-process-based methods. It is demonstrated that under intuitive assumptions and approximations, the complexity of the proposed multi-target estimation algorithm can be made linear in the number of tracks and linear in the number of observations, while naturally preserving distinct tracks for detected targets, unlike point-process-based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7408","kind":"arxiv","version":4},"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":"1404.7408","created_at":"2026-05-18T00:29:02.122208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7408v4","created_at":"2026-05-18T00:29:02.122208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7408","created_at":"2026-05-18T00:29:02.122208+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHI562OPGZ5V","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHI562OPGZ5VYV3A","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHI562OP","created_at":"2026-05-18T12:28:38.356838+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/LHI562OPGZ5VYV3AMVVOUWJCSD","json":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD.json","graph_json":"https://pith.science/api/pith-number/LHI562OPGZ5VYV3AMVVOUWJCSD/graph.json","events_json":"https://pith.science/api/pith-number/LHI562OPGZ5VYV3AMVVOUWJCSD/events.json","paper":"https://pith.science/paper/LHI562OP"},"agent_actions":{"view_html":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD","download_json":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD.json","view_paper":"https://pith.science/paper/LHI562OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7408&json=true","fetch_graph":"https://pith.science/api/pith-number/LHI562OPGZ5VYV3AMVVOUWJCSD/graph.json","fetch_events":"https://pith.science/api/pith-number/LHI562OPGZ5VYV3AMVVOUWJCSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD/action/storage_attestation","attest_author":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD/action/author_attestation","sign_citation":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD/action/citation_signature","submit_replication":"https://pith.science/pith/LHI562OPGZ5VYV3AMVVOUWJCSD/action/replication_record"}},"created_at":"2026-05-18T00:29:02.122208+00:00","updated_at":"2026-05-18T00:29:02.122208+00:00"}