{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LOM5N66P3VYJYK2D73QVOYICOU","short_pith_number":"pith:LOM5N66P","schema_version":"1.0","canonical_sha256":"5b99d6fbcfdd709c2b43fee1576102750b6f3f7ef3d4a4656cb7680e1ebaa252","source":{"kind":"arxiv","id":"1009.4409","version":1},"attestation_state":"computed","paper":{"title":"Efficient delay-tolerant particle filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"stat.AP","authors_text":"Boris N. Oreshkin, Mark J. Coates, Xuan Liu","submitted_at":"2010-09-22T16:22:41Z","abstract_excerpt":"This paper proposes a novel framework for delay-tolerant particle filtering that is computationally efficient and has limited memory requirements. Within this framework the informativeness of a delayed (out-of-sequence) measurement (OOSM) is estimated using a lightweight procedure and uninformative measurements are immediately discarded. The framework requires the identification of a threshold that separates informative from uninformative; this threshold selection task is formulated as a constrained optimization problem, where the goal is to minimize tracking error whilst controlling the compu"},"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":"1009.4409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2010-09-22T16:22:41Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"13ed9beb956294b35b5452ba49e147879ec0ab312c79b2f90076a7e528a5e2c9","abstract_canon_sha256":"3488a3574dffa29ae313c72d05a68fc3d57e5906633a304a559626dc9ad276c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:18.530232Z","signature_b64":"tJTGRkC3M3q2QFYulXNUJXjs91IK/MXscXAqCGX+3pe8kJiLiOdbm1rphXt5PZSfEboImy/oMt5qorToy10jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b99d6fbcfdd709c2b43fee1576102750b6f3f7ef3d4a4656cb7680e1ebaa252","last_reissued_at":"2026-05-18T02:05:18.529704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:18.529704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient delay-tolerant particle filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"stat.AP","authors_text":"Boris N. Oreshkin, Mark J. Coates, Xuan Liu","submitted_at":"2010-09-22T16:22:41Z","abstract_excerpt":"This paper proposes a novel framework for delay-tolerant particle filtering that is computationally efficient and has limited memory requirements. Within this framework the informativeness of a delayed (out-of-sequence) measurement (OOSM) is estimated using a lightweight procedure and uninformative measurements are immediately discarded. The framework requires the identification of a threshold that separates informative from uninformative; this threshold selection task is formulated as a constrained optimization problem, where the goal is to minimize tracking error whilst controlling the compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4409","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":"1009.4409","created_at":"2026-05-18T02:05:18.529787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4409v1","created_at":"2026-05-18T02:05:18.529787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4409","created_at":"2026-05-18T02:05:18.529787+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOM5N66P3VYJ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOM5N66P3VYJYK2D","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOM5N66P","created_at":"2026-05-18T12:26:10.704358+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/LOM5N66P3VYJYK2D73QVOYICOU","json":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU.json","graph_json":"https://pith.science/api/pith-number/LOM5N66P3VYJYK2D73QVOYICOU/graph.json","events_json":"https://pith.science/api/pith-number/LOM5N66P3VYJYK2D73QVOYICOU/events.json","paper":"https://pith.science/paper/LOM5N66P"},"agent_actions":{"view_html":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU","download_json":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU.json","view_paper":"https://pith.science/paper/LOM5N66P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4409&json=true","fetch_graph":"https://pith.science/api/pith-number/LOM5N66P3VYJYK2D73QVOYICOU/graph.json","fetch_events":"https://pith.science/api/pith-number/LOM5N66P3VYJYK2D73QVOYICOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU/action/storage_attestation","attest_author":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU/action/author_attestation","sign_citation":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU/action/citation_signature","submit_replication":"https://pith.science/pith/LOM5N66P3VYJYK2D73QVOYICOU/action/replication_record"}},"created_at":"2026-05-18T02:05:18.529787+00:00","updated_at":"2026-05-18T02:05:18.529787+00:00"}