{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BBWGLBLLFAO4GKMWZY42Z552UO","short_pith_number":"pith:BBWGLBLL","schema_version":"1.0","canonical_sha256":"086c65856b281dc32996ce39acf7baa38b0650b173eeb0d6fad6de4c0566c4c0","source":{"kind":"arxiv","id":"1105.3298","version":2},"attestation_state":"computed","paper":{"title":"Graphical model approximations of random finite set filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Jason L. Williams","submitted_at":"2011-05-17T08:09:44Z","abstract_excerpt":"Random finite sets (RFSs) has been a fruitful area of research in recent years, yielding new approximate filters such as the probability hypothesis density (PHD), cardinalised PHD (CPHD), and multiple target multi-Bernoulli (MeMBer). These new methods have largely been based on approximations that side-step the need for measurement-to-track association. Comparably, RFS methods that incorporate data association, such as Morelande and Challa's (M-C) method, have received little attention. This paper provides a RFS algorithm that incorporates data association similarly to the M-C method, but reta"},"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":"1105.3298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-05-17T08:09:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1ff04e3f4d9f75d1a02ad41e0653f9eeb9e65dcde8453f9dd320dda453f2c983","abstract_canon_sha256":"f2730057ead0a65123125c91b657c1407510676f746013e0465c6825b331f5fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:59.852658Z","signature_b64":"xuTawS7nARkXZdjPK+OH1Xd/VibYM6Bh2+cRuOZg3O1xGb3zZ94QDuKvG5Cdr/nrxu1fMkxCMhCmNcQUk4L0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"086c65856b281dc32996ce39acf7baa38b0650b173eeb0d6fad6de4c0566c4c0","last_reissued_at":"2026-05-18T02:21:59.852016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:59.852016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical model approximations of random finite set filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Jason L. Williams","submitted_at":"2011-05-17T08:09:44Z","abstract_excerpt":"Random finite sets (RFSs) has been a fruitful area of research in recent years, yielding new approximate filters such as the probability hypothesis density (PHD), cardinalised PHD (CPHD), and multiple target multi-Bernoulli (MeMBer). These new methods have largely been based on approximations that side-step the need for measurement-to-track association. Comparably, RFS methods that incorporate data association, such as Morelande and Challa's (M-C) method, have received little attention. This paper provides a RFS algorithm that incorporates data association similarly to the M-C method, but reta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3298","kind":"arxiv","version":2},"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":"1105.3298","created_at":"2026-05-18T02:21:59.852115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3298v2","created_at":"2026-05-18T02:21:59.852115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3298","created_at":"2026-05-18T02:21:59.852115+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBWGLBLLFAO4","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBWGLBLLFAO4GKMW","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBWGLBLL","created_at":"2026-05-18T12:26:24.575870+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/BBWGLBLLFAO4GKMWZY42Z552UO","json":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO.json","graph_json":"https://pith.science/api/pith-number/BBWGLBLLFAO4GKMWZY42Z552UO/graph.json","events_json":"https://pith.science/api/pith-number/BBWGLBLLFAO4GKMWZY42Z552UO/events.json","paper":"https://pith.science/paper/BBWGLBLL"},"agent_actions":{"view_html":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO","download_json":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO.json","view_paper":"https://pith.science/paper/BBWGLBLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3298&json=true","fetch_graph":"https://pith.science/api/pith-number/BBWGLBLLFAO4GKMWZY42Z552UO/graph.json","fetch_events":"https://pith.science/api/pith-number/BBWGLBLLFAO4GKMWZY42Z552UO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO/action/storage_attestation","attest_author":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO/action/author_attestation","sign_citation":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO/action/citation_signature","submit_replication":"https://pith.science/pith/BBWGLBLLFAO4GKMWZY42Z552UO/action/replication_record"}},"created_at":"2026-05-18T02:21:59.852115+00:00","updated_at":"2026-05-18T02:21:59.852115+00:00"}