{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PDCEESECVCTFKTCVXHNHGAJTGH","short_pith_number":"pith:PDCEESEC","schema_version":"1.0","canonical_sha256":"78c4424882a8a6554c55b9da73013331c1e83b0229e8cf401c026d9ceee19b40","source":{"kind":"arxiv","id":"1807.07612","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Variational Particle Filtering in Non-stationary Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Azarafrooz","submitted_at":"2018-07-19T19:06:20Z","abstract_excerpt":"Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such a framework.\n  We formulate an efficient particle filtering methods for the non-stationary environment by making connections with the online mirror descent algorithm which is known to be a universal online convex optimization algorithm.\n  As a result of this connection, our proposed particle filtering algorithm proves to achieve optimal particle efficiency."},"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":"1807.07612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-19T19:06:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d0fbe56508a71868cae0136705114742850ac9d655ada8b8700c8fbe27b49fc0","abstract_canon_sha256":"8bf0ba0685ebe0d7c9a6b3885a8d5e51d0dcab77ac92d9a609958cac609314a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.124148Z","signature_b64":"MkWZEBRPqHNt5Qeno0RbmVxdy8Yf4bjrvjKAVfM/ugZtSJzmuQ+gmM7CWA6qgIfST+tue9Y4876gndurXX5ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c4424882a8a6554c55b9da73013331c1e83b0229e8cf401c026d9ceee19b40","last_reissued_at":"2026-05-18T00:10:16.123428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.123428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Variational Particle Filtering in Non-stationary Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Azarafrooz","submitted_at":"2018-07-19T19:06:20Z","abstract_excerpt":"Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such a framework.\n  We formulate an efficient particle filtering methods for the non-stationary environment by making connections with the online mirror descent algorithm which is known to be a universal online convex optimization algorithm.\n  As a result of this connection, our proposed particle filtering algorithm proves to achieve optimal particle efficiency."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07612","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":"1807.07612","created_at":"2026-05-18T00:10:16.123532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07612v1","created_at":"2026-05-18T00:10:16.123532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07612","created_at":"2026-05-18T00:10:16.123532+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDCEESECVCTF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDCEESECVCTFKTCV","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDCEESEC","created_at":"2026-05-18T12:32:43.782077+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/PDCEESECVCTFKTCVXHNHGAJTGH","json":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH.json","graph_json":"https://pith.science/api/pith-number/PDCEESECVCTFKTCVXHNHGAJTGH/graph.json","events_json":"https://pith.science/api/pith-number/PDCEESECVCTFKTCVXHNHGAJTGH/events.json","paper":"https://pith.science/paper/PDCEESEC"},"agent_actions":{"view_html":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH","download_json":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH.json","view_paper":"https://pith.science/paper/PDCEESEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07612&json=true","fetch_graph":"https://pith.science/api/pith-number/PDCEESECVCTFKTCVXHNHGAJTGH/graph.json","fetch_events":"https://pith.science/api/pith-number/PDCEESECVCTFKTCVXHNHGAJTGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH/action/storage_attestation","attest_author":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH/action/author_attestation","sign_citation":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH/action/citation_signature","submit_replication":"https://pith.science/pith/PDCEESECVCTFKTCVXHNHGAJTGH/action/replication_record"}},"created_at":"2026-05-18T00:10:16.123532+00:00","updated_at":"2026-05-18T00:10:16.123532+00:00"}