{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EKC5V2WFVPQWGVRECF7AQXLOKU","short_pith_number":"pith:EKC5V2WF","canonical_record":{"source":{"id":"1705.04757","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-05-12T21:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"d25bb480a82c9505d0f83e79fe771bb7c3474208f1a9ccc99a9df0b2d33116e2","abstract_canon_sha256":"d0765886f7897789587bb92687fbb5f0a12c20a0d69296d0b324fad364e2e196"},"schema_version":"1.0"},"canonical_sha256":"2285daeac5abe1635624117e085d6e553600d1fcb062df16407b3a53f8886ded","source":{"kind":"arxiv","id":"1705.04757","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04757","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04757v6","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04757","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"EKC5V2WFVPQW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKC5V2WFVPQWGVRE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKC5V2WF","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EKC5V2WFVPQWGVRECF7AQXLOKU","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04757","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-05-12T21:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"d25bb480a82c9505d0f83e79fe771bb7c3474208f1a9ccc99a9df0b2d33116e2","abstract_canon_sha256":"d0765886f7897789587bb92687fbb5f0a12c20a0d69296d0b324fad364e2e196"},"schema_version":"1.0"},"canonical_sha256":"2285daeac5abe1635624117e085d6e553600d1fcb062df16407b3a53f8886ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.741438Z","signature_b64":"3zWCTZEtWo61es6Mf8JYT0Ll9AFZ7ax9mTRC/dw/xvvYAAtVd100wLKKtAKEzhixa9Z0wOR5jXjjb3TLQKYnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2285daeac5abe1635624117e085d6e553600d1fcb062df16407b3a53f8886ded","last_reissued_at":"2026-05-17T23:54:48.740885Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.740885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04757","source_version":6,"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rPn9j+5zBvboVqLFEHSgKU+7A2Aazy3PA875aY8dEghcct03Py2y+rYS5iYCNrGinprQKa8n7uWueDnLSckBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:34:22.010087Z"},"content_sha256":"bc11d421ba65e08d1e120680ac780a7c4448cbcb0ddce7484925f1f77aef1d48","schema_version":"1.0","event_id":"sha256:bc11d421ba65e08d1e120680ac780a7c4448cbcb0ddce7484925f1f77aef1d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EKC5V2WFVPQWGVRECF7AQXLOKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Target, Multiple Type Filtering in the RFS Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Andrew Wallace, Nathanael L. Baisa","submitted_at":"2017-05-12T21:33:49Z","abstract_excerpt":"A Multiple Target, Multiple Type Filtering (MTMTF) algorithm is developed using Random Finite Set (RFS) theory. First, we extend the standard Probability Hypothesis Density (PHD) filter for multiple types of targets, each with distinct detection properties, to develop a multiple target, multiple type filtering, N-type PHD filter, where $N\\geq2$, for handling confusions among target types. In this approach, we assume that there will be confusions between detections, i.e. clutter arises not just from background false positives, but also from target confusions. Then, under the assumptions of Gaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04757","kind":"arxiv","version":6},"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcx+WbpjKfO6uHzftaZzp5P2nuFq3freiNPZN8XOsgr3bZcmDLRuCC2357rtGh0p28MMgzKCi4QzlmT23EYUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:34:22.010485Z"},"content_sha256":"11fdca491129e1624a555b283ed9ef2a8288658bdc9a79787f617faca97410e7","schema_version":"1.0","event_id":"sha256:11fdca491129e1624a555b283ed9ef2a8288658bdc9a79787f617faca97410e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/bundle.json","state_url":"https://pith.science/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/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-04T06:34:22Z","links":{"resolver":"https://pith.science/pith/EKC5V2WFVPQWGVRECF7AQXLOKU","bundle":"https://pith.science/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/bundle.json","state":"https://pith.science/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKC5V2WFVPQWGVRECF7AQXLOKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EKC5V2WFVPQWGVRECF7AQXLOKU","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":"d0765886f7897789587bb92687fbb5f0a12c20a0d69296d0b324fad364e2e196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-05-12T21:33:49Z","title_canon_sha256":"d25bb480a82c9505d0f83e79fe771bb7c3474208f1a9ccc99a9df0b2d33116e2"},"schema_version":"1.0","source":{"id":"1705.04757","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04757","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04757v6","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04757","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"EKC5V2WFVPQW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKC5V2WFVPQWGVRE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKC5V2WF","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:11fdca491129e1624a555b283ed9ef2a8288658bdc9a79787f617faca97410e7","target":"graph","created_at":"2026-05-17T23:54:48Z","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":"A Multiple Target, Multiple Type Filtering (MTMTF) algorithm is developed using Random Finite Set (RFS) theory. First, we extend the standard Probability Hypothesis Density (PHD) filter for multiple types of targets, each with distinct detection properties, to develop a multiple target, multiple type filtering, N-type PHD filter, where $N\\geq2$, for handling confusions among target types. In this approach, we assume that there will be confusions between detections, i.e. clutter arises not just from background false positives, but also from target confusions. Then, under the assumptions of Gaus","authors_text":"Andrew Wallace, Nathanael L. Baisa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-05-12T21:33:49Z","title":"Multiple Target, Multiple Type Filtering in the RFS Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04757","kind":"arxiv","version":6},"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:bc11d421ba65e08d1e120680ac780a7c4448cbcb0ddce7484925f1f77aef1d48","target":"record","created_at":"2026-05-17T23:54:48Z","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":"d0765886f7897789587bb92687fbb5f0a12c20a0d69296d0b324fad364e2e196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-05-12T21:33:49Z","title_canon_sha256":"d25bb480a82c9505d0f83e79fe771bb7c3474208f1a9ccc99a9df0b2d33116e2"},"schema_version":"1.0","source":{"id":"1705.04757","kind":"arxiv","version":6}},"canonical_sha256":"2285daeac5abe1635624117e085d6e553600d1fcb062df16407b3a53f8886ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2285daeac5abe1635624117e085d6e553600d1fcb062df16407b3a53f8886ded","first_computed_at":"2026-05-17T23:54:48.740885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:48.740885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3zWCTZEtWo61es6Mf8JYT0Ll9AFZ7ax9mTRC/dw/xvvYAAtVd100wLKKtAKEzhixa9Z0wOR5jXjjb3TLQKYnCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:48.741438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04757","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc11d421ba65e08d1e120680ac780a7c4448cbcb0ddce7484925f1f77aef1d48","sha256:11fdca491129e1624a555b283ed9ef2a8288658bdc9a79787f617faca97410e7"],"state_sha256":"a1089af5b27445debf14b7a18e0c780b4abc2c1435a3f6578a1f2946f3f74667"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzNa2lLjadrzhMxeBD7EZ1NKPgWVtzfP9NMBQMsojrM4T6nuF4uEHo94ii63OWlfyANMI0eDXFPglWUKGbd3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:34:22.012944Z","bundle_sha256":"a7ce9781eb967ca5a3d59d8e41f594125b4727cb4e07ca5c69cc1e8249add990"}}