{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEQFX3MG75ECIUS7EGI6DWLMNR","short_pith_number":"pith:NEQFX3MG","schema_version":"1.0","canonical_sha256":"69205bed86ff4824525f2191e1d96c6c71a9a38069c1b60daa7641cf34bd202c","source":{"kind":"arxiv","id":"1507.08526","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.08526","created_at":"2026-05-18T01:36:04.323409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08526v1","created_at":"2026-05-18T01:36:04.323409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08526","created_at":"2026-05-18T01:36:04.323409+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEQFX3MG75EC","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEQFX3MG75ECIUS7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEQFX3MG","created_at":"2026-05-18T12:29:32.376354+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/NEQFX3MG75ECIUS7EGI6DWLMNR","json":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR.json","graph_json":"https://pith.science/api/pith-number/NEQFX3MG75ECIUS7EGI6DWLMNR/graph.json","events_json":"https://pith.science/api/pith-number/NEQFX3MG75ECIUS7EGI6DWLMNR/events.json","paper":"https://pith.science/paper/NEQFX3MG"},"agent_actions":{"view_html":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR","download_json":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR.json","view_paper":"https://pith.science/paper/NEQFX3MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08526&json=true","fetch_graph":"https://pith.science/api/pith-number/NEQFX3MG75ECIUS7EGI6DWLMNR/graph.json","fetch_events":"https://pith.science/api/pith-number/NEQFX3MG75ECIUS7EGI6DWLMNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/action/storage_attestation","attest_author":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/action/author_attestation","sign_citation":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/action/citation_signature","submit_replication":"https://pith.science/pith/NEQFX3MG75ECIUS7EGI6DWLMNR/action/replication_record"}},"created_at":"2026-05-18T01:36:04.323409+00:00","updated_at":"2026-05-18T01:36:04.323409+00:00"}