{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IXST5H22EWNXZ6O53MRBJVEFQT","short_pith_number":"pith:IXST5H22","canonical_record":{"source":{"id":"1204.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-04-09T05:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"2b94c41626cf41435fe8878f6ca3181f7c9081e33ad110b377b4e9af3c5eef2a","abstract_canon_sha256":"29c932204ade7a6b1a79169b5d421c445545a6924383a3fe83a2eac5b07e5bd8"},"schema_version":"1.0"},"canonical_sha256":"45e53e9f5a259b7cf9dddb2214d48584f6019b51a8dd2608e4d1524837631671","source":{"kind":"arxiv","id":"1204.1792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1792","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1792v1","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1792","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"IXST5H22EWNX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IXST5H22EWNXZ6O5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IXST5H22","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IXST5H22EWNXZ6O53MRBJVEFQT","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-04-09T05:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"2b94c41626cf41435fe8878f6ca3181f7c9081e33ad110b377b4e9af3c5eef2a","abstract_canon_sha256":"29c932204ade7a6b1a79169b5d421c445545a6924383a3fe83a2eac5b07e5bd8"},"schema_version":"1.0"},"canonical_sha256":"45e53e9f5a259b7cf9dddb2214d48584f6019b51a8dd2608e4d1524837631671","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:55.844970Z","signature_b64":"+rwkkOSD9P/qKQR6aKKeS36GUVtN2+sllJCroqp5zViIia2IcY8OnDNcPIeQ3a58zq6dq6PDvaj1zoQNo2z5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e53e9f5a259b7cf9dddb2214d48584f6019b51a8dd2608e4d1524837631671","last_reissued_at":"2026-05-18T01:57:55.844540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:55.844540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1792","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-18T01:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dX6zGqXQOCI5Dnv709oZcvrbN5ao+bi09atI/U4xipKTyl3gYtNYq1EK4JLAbd5jlZxM8Ruu9rDcqKv0AFqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:29:16.472460Z"},"content_sha256":"5d157a60c1c4d83986ca057feed3400e923f6657b25f42f28147beaffdbe259e","schema_version":"1.0","event_id":"sha256:5d157a60c1c4d83986ca057feed3400e923f6657b25f42f28147beaffdbe259e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IXST5H22EWNXZ6O53MRBJVEFQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Recursive Form of Error Bounds for RFS State and Observation with Pd<1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Hao Zhang, Huadong Meng, Huisi Tong, Xiqin Wang","submitted_at":"2012-04-09T05:07:39Z","abstract_excerpt":"In the target tracking and its engineering applications, recursive state estimation of the target is of fundamental importance. This paper presents a recursive performance bound for dynamic estimation and filtering problem, in the framework of the finite set statistics for the first time. The number of tracking algorithms with set-valued observations and state of targets is increased sharply recently. Nevertheless, the bound for these algorithms has not been fully discussed. Treating the measurement as set, this bound can be applied when the probability of detection is less than unity. Moreove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1792","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-18T01:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAU2uMMTqFpVqHARz4wzPlr4AArzrK0D+q0PqPIn3yu5f/Ps2TBV5A00LPs8zpm8kDSYpdB2T5ADfooN8JBdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:29:16.472826Z"},"content_sha256":"61fb2fac1e22b70ad3548a9d6adab861236642320ac81db4378624e2c488b82f","schema_version":"1.0","event_id":"sha256:61fb2fac1e22b70ad3548a9d6adab861236642320ac81db4378624e2c488b82f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXST5H22EWNXZ6O53MRBJVEFQT/bundle.json","state_url":"https://pith.science/pith/IXST5H22EWNXZ6O53MRBJVEFQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXST5H22EWNXZ6O53MRBJVEFQT/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-01T09:29:16Z","links":{"resolver":"https://pith.science/pith/IXST5H22EWNXZ6O53MRBJVEFQT","bundle":"https://pith.science/pith/IXST5H22EWNXZ6O53MRBJVEFQT/bundle.json","state":"https://pith.science/pith/IXST5H22EWNXZ6O53MRBJVEFQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXST5H22EWNXZ6O53MRBJVEFQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IXST5H22EWNXZ6O53MRBJVEFQT","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":"29c932204ade7a6b1a79169b5d421c445545a6924383a3fe83a2eac5b07e5bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-04-09T05:07:39Z","title_canon_sha256":"2b94c41626cf41435fe8878f6ca3181f7c9081e33ad110b377b4e9af3c5eef2a"},"schema_version":"1.0","source":{"id":"1204.1792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1792","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1792v1","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1792","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"IXST5H22EWNX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IXST5H22EWNXZ6O5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IXST5H22","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:61fb2fac1e22b70ad3548a9d6adab861236642320ac81db4378624e2c488b82f","target":"graph","created_at":"2026-05-18T01:57:55Z","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":"In the target tracking and its engineering applications, recursive state estimation of the target is of fundamental importance. This paper presents a recursive performance bound for dynamic estimation and filtering problem, in the framework of the finite set statistics for the first time. The number of tracking algorithms with set-valued observations and state of targets is increased sharply recently. Nevertheless, the bound for these algorithms has not been fully discussed. Treating the measurement as set, this bound can be applied when the probability of detection is less than unity. Moreove","authors_text":"Hao Zhang, Huadong Meng, Huisi Tong, Xiqin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-04-09T05:07:39Z","title":"The Recursive Form of Error Bounds for RFS State and Observation with Pd<1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1792","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:5d157a60c1c4d83986ca057feed3400e923f6657b25f42f28147beaffdbe259e","target":"record","created_at":"2026-05-18T01:57:55Z","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":"29c932204ade7a6b1a79169b5d421c445545a6924383a3fe83a2eac5b07e5bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-04-09T05:07:39Z","title_canon_sha256":"2b94c41626cf41435fe8878f6ca3181f7c9081e33ad110b377b4e9af3c5eef2a"},"schema_version":"1.0","source":{"id":"1204.1792","kind":"arxiv","version":1}},"canonical_sha256":"45e53e9f5a259b7cf9dddb2214d48584f6019b51a8dd2608e4d1524837631671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e53e9f5a259b7cf9dddb2214d48584f6019b51a8dd2608e4d1524837631671","first_computed_at":"2026-05-18T01:57:55.844540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:55.844540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+rwkkOSD9P/qKQR6aKKeS36GUVtN2+sllJCroqp5zViIia2IcY8OnDNcPIeQ3a58zq6dq6PDvaj1zoQNo2z5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:55.844970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d157a60c1c4d83986ca057feed3400e923f6657b25f42f28147beaffdbe259e","sha256:61fb2fac1e22b70ad3548a9d6adab861236642320ac81db4378624e2c488b82f"],"state_sha256":"92748373c6abeda8c376682eec5e7d4c8ee5fcd946c06a34022b23f024403edf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ef4Adcr472GD9S6YX8lWI4+eu8nZ0x+OFYrDe1aAsG03xPI/I3Sb8pvwwiZGSEqJDlIUKfDiA/MttdBig980AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:29:16.474724Z","bundle_sha256":"f5d12c8d746c5ff3636f7f629edb90c5b068bcad009aa5c5f3f95833493517ad"}}