{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NEQFX3MG75ECIUS7EGI6DWLMNR","short_pith_number":"pith:NEQFX3MG","canonical_record":{"source":{"id":"1507.08526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T14:54:41Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"134eb6d029960d94261993d52984193ec5059373eec93d1cebc195dd22022501","abstract_canon_sha256":"d926540cb9853502b586bbada8e901cafae446fc27b846a7e5c7b06e4da022f4"},"schema_version":"1.0"},"canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","source":{"kind":"arxiv","id":"1507.08526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08526","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08526v1","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08526","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"NEQFX3MG75EC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEQFX3MG75ECIUS7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEQFX3MG","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NEQFX3MG75ECIUS7EGI6DWLMNR","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T14:54:41Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"134eb6d029960d94261993d52984193ec5059373eec93d1cebc195dd22022501","abstract_canon_sha256":"d926540cb9853502b586bbada8e901cafae446fc27b846a7e5c7b06e4da022f4"},"schema_version":"1.0"},"canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:04.324087Z","signature_b64":"3tgwWXbZw5vsM4aBt1w762VV+tlue7O/bi/O20qVAn/J2dHG4hd6pX9M/BpztK4RQdlShNu+x/Dd5cLIXGB0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","last_reissued_at":"2026-05-18T01:36:04.323253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:04.323253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08526","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:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRZPh2n/z5cac5KNOs7KgVx/eWaJasgFPYldu76DdFswSwSIUpLN72PpAJ4SqYPkvld2+E6WAODDGMhNnruhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:14:32.386763Z"},"content_sha256":"cf9163aa76ee6e11d4670f8be961b8616486991254f6abd011ef901e1c971770","schema_version":"1.0","event_id":"sha256:cf9163aa76ee6e11d4670f8be961b8616486991254f6abd011ef901e1c971770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NEQFX3MG75ECIUS7EGI6DWLMNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Can Subsampling Reduce Complexity in Sequential MCMC Methods and Deal with Big Data in Target Tracking?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Allan De Freitas, Fran\\c{c}ois Septier, Lyudmila Mihaylova, Simon Godsill","submitted_at":"2015-07-30T14:54:41Z","abstract_excerpt":"Target tracking faces the challenge in coping with large volumes of data which requires efficient methods for real time applications. The complexity considered in this paper is when there is a large number of measurements which are required to be processed at each time step. Sequential Markov chain Monte Carlo (MCMC) has been shown to be a promising approach to target tracking in complex environments, especially when dealing with clutter. However, a large number of measurements usually results in large processing requirements. This paper goes beyond the current state-of-the-art and presents a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08526","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:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqX65sBYqWa+iO2xF1kicHcW3EMmzd0pdW4JSU6U0iC8DdSRk+WF9mTE/4e0rtpgSNvfP4LgWvDHEStDzAAXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:14:32.387500Z"},"content_sha256":"291cead6bf76c680ab6d7d0cca4e11616b183f6d480a16ea43fc7409c09c5289","schema_version":"1.0","event_id":"sha256:291cead6bf76c680ab6d7d0cca4e11616b183f6d480a16ea43fc7409c09c5289"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/bundle.json","state_url":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/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-10T07:14:32Z","links":{"resolver":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR","bundle":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/bundle.json","state":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NEQFX3MG75ECIUS7EGI6DWLMNR","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":"d926540cb9853502b586bbada8e901cafae446fc27b846a7e5c7b06e4da022f4","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T14:54:41Z","title_canon_sha256":"134eb6d029960d94261993d52984193ec5059373eec93d1cebc195dd22022501"},"schema_version":"1.0","source":{"id":"1507.08526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08526","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08526v1","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08526","created_at":"2026-05-18T01:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"NEQFX3MG75EC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEQFX3MG75ECIUS7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEQFX3MG","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:291cead6bf76c680ab6d7d0cca4e11616b183f6d480a16ea43fc7409c09c5289","target":"graph","created_at":"2026-05-18T01:36:04Z","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":"Target tracking faces the challenge in coping with large volumes of data which requires efficient methods for real time applications. The complexity considered in this paper is when there is a large number of measurements which are required to be processed at each time step. Sequential Markov chain Monte Carlo (MCMC) has been shown to be a promising approach to target tracking in complex environments, especially when dealing with clutter. However, a large number of measurements usually results in large processing requirements. This paper goes beyond the current state-of-the-art and presents a ","authors_text":"Allan De Freitas, Fran\\c{c}ois Septier, Lyudmila Mihaylova, Simon Godsill","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T14:54:41Z","title":"How Can Subsampling Reduce Complexity in Sequential MCMC Methods and Deal with Big Data in Target Tracking?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08526","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:cf9163aa76ee6e11d4670f8be961b8616486991254f6abd011ef901e1c971770","target":"record","created_at":"2026-05-18T01:36:04Z","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":"d926540cb9853502b586bbada8e901cafae446fc27b846a7e5c7b06e4da022f4","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T14:54:41Z","title_canon_sha256":"134eb6d029960d94261993d52984193ec5059373eec93d1cebc195dd22022501"},"schema_version":"1.0","source":{"id":"1507.08526","kind":"arxiv","version":1}},"canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","first_computed_at":"2026-05-18T01:36:04.323253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:04.323253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tgwWXbZw5vsM4aBt1w762VV+tlue7O/bi/O20qVAn/J2dHG4hd6pX9M/BpztK4RQdlShNu+x/Dd5cLIXGB0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:04.324087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf9163aa76ee6e11d4670f8be961b8616486991254f6abd011ef901e1c971770","sha256:291cead6bf76c680ab6d7d0cca4e11616b183f6d480a16ea43fc7409c09c5289"],"state_sha256":"3d87d04fd5969bd8a1d3c98470f0d6a01652adbe6ee9fcc8742a9e9416ab42d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOJh5s625pwvOGjFSh5XJAfUv9S7LKAw1wGH5zJUk5jS6NGkgM3fgI31vh5rYZkxgecW9+DUxFjH9cEaQZvGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:14:32.391682Z","bundle_sha256":"c2ff239f6f89df78dce2c77fba7a20685e5c32fda06530745916d500b24d6b7f"}}