{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XG5E4IQHJ6I2UKO26VICOEKURE","short_pith_number":"pith:XG5E4IQH","canonical_record":{"source":{"id":"1110.4197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-10-19T07:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"ed8de5ef8aea8b86d3ba7254c9324299fa53233ec94e692f7b345638e43dda74","abstract_canon_sha256":"95c10f465c9a5ba7bc910b21c8a5c06f654d4bb3e17aa249c6ff5a370e6a7515"},"schema_version":"1.0"},"canonical_sha256":"b9ba4e22074f91aa29daf550271154890f5ae9b43bdc28d4bf56438a7af90154","source":{"kind":"arxiv","id":"1110.4197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4197","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4197v2","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4197","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"XG5E4IQHJ6I2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XG5E4IQHJ6I2UKO2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XG5E4IQH","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XG5E4IQHJ6I2UKO26VICOEKURE","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-10-19T07:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"ed8de5ef8aea8b86d3ba7254c9324299fa53233ec94e692f7b345638e43dda74","abstract_canon_sha256":"95c10f465c9a5ba7bc910b21c8a5c06f654d4bb3e17aa249c6ff5a370e6a7515"},"schema_version":"1.0"},"canonical_sha256":"b9ba4e22074f91aa29daf550271154890f5ae9b43bdc28d4bf56438a7af90154","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:50.483562Z","signature_b64":"PcKoJOy2JCnIP+s/c5dpVPLGmlnyBGDkHuUku+NQKBGCpa3FFDh/mPO+HonWuByfKL9glEP2VAN8wQ+dzBQYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ba4e22074f91aa29daf550271154890f5ae9b43bdc28d4bf56438a7af90154","last_reissued_at":"2026-05-18T03:50:50.482803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:50.482803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4197","source_version":2,"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-18T03:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qy4YI5N/JXTytza3WYvbyNYgX3ffF7mXoEDLw8NEACEPSHfAtDBZu/HBgMoRMfQUwlWiBFG6TFYRmvS5P8DTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:06:33.428422Z"},"content_sha256":"4309997a0b438b02ce2533380b1230a6c49683b76025930f0abb03da6437fcf4","schema_version":"1.0","event_id":"sha256:4309997a0b438b02ce2533380b1230a6c49683b76025930f0abb03da6437fcf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XG5E4IQHJ6I2UKO26VICOEKURE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Parallel Kalman Filters for Multiple Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Wang, Gangfeng Yan, Zhiyun Lin","submitted_at":"2011-10-19T07:17:24Z","abstract_excerpt":"In this paper, we investigate the problem of scheduling parallel Kalman filters for multiple processes, where each process is observed by a Kalman filter and at each time step only one Kalman filter could obtain observation due to practical constraints. To solve the problem, two novel notions, permissible consecutive observation loss (PCOL) and least consecutive observation (LCO), are introduced as criteria to describe feasible observation sequences for a process ensuring desired estimation qualities. Then two methods, namely, threshold method and periodic method, are proposed to calculate PCO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4197","kind":"arxiv","version":2},"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-18T03:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TaCTS3tNokU38RBEotMhfcp9QJiJIQvSkm4mYagUWgR5e2PHAfqtd8VpWKICaSCOMdmGx5V8/V9j0kJFfGSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:06:33.428758Z"},"content_sha256":"34e8295cac8303a7f4f79377ba039b1497e5cf30c565e123134e425551d022f0","schema_version":"1.0","event_id":"sha256:34e8295cac8303a7f4f79377ba039b1497e5cf30c565e123134e425551d022f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XG5E4IQHJ6I2UKO26VICOEKURE/bundle.json","state_url":"https://pith.science/pith/XG5E4IQHJ6I2UKO26VICOEKURE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XG5E4IQHJ6I2UKO26VICOEKURE/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-07-01T21:06:33Z","links":{"resolver":"https://pith.science/pith/XG5E4IQHJ6I2UKO26VICOEKURE","bundle":"https://pith.science/pith/XG5E4IQHJ6I2UKO26VICOEKURE/bundle.json","state":"https://pith.science/pith/XG5E4IQHJ6I2UKO26VICOEKURE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XG5E4IQHJ6I2UKO26VICOEKURE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XG5E4IQHJ6I2UKO26VICOEKURE","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":"95c10f465c9a5ba7bc910b21c8a5c06f654d4bb3e17aa249c6ff5a370e6a7515","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-10-19T07:17:24Z","title_canon_sha256":"ed8de5ef8aea8b86d3ba7254c9324299fa53233ec94e692f7b345638e43dda74"},"schema_version":"1.0","source":{"id":"1110.4197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4197","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4197v2","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4197","created_at":"2026-05-18T03:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"XG5E4IQHJ6I2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XG5E4IQHJ6I2UKO2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XG5E4IQH","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:34e8295cac8303a7f4f79377ba039b1497e5cf30c565e123134e425551d022f0","target":"graph","created_at":"2026-05-18T03:50:50Z","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 this paper, we investigate the problem of scheduling parallel Kalman filters for multiple processes, where each process is observed by a Kalman filter and at each time step only one Kalman filter could obtain observation due to practical constraints. To solve the problem, two novel notions, permissible consecutive observation loss (PCOL) and least consecutive observation (LCO), are introduced as criteria to describe feasible observation sequences for a process ensuring desired estimation qualities. Then two methods, namely, threshold method and periodic method, are proposed to calculate PCO","authors_text":"Chen Wang, Gangfeng Yan, Zhiyun Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-10-19T07:17:24Z","title":"Scheduling Parallel Kalman Filters for Multiple Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4197","kind":"arxiv","version":2},"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:4309997a0b438b02ce2533380b1230a6c49683b76025930f0abb03da6437fcf4","target":"record","created_at":"2026-05-18T03:50:50Z","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":"95c10f465c9a5ba7bc910b21c8a5c06f654d4bb3e17aa249c6ff5a370e6a7515","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-10-19T07:17:24Z","title_canon_sha256":"ed8de5ef8aea8b86d3ba7254c9324299fa53233ec94e692f7b345638e43dda74"},"schema_version":"1.0","source":{"id":"1110.4197","kind":"arxiv","version":2}},"canonical_sha256":"b9ba4e22074f91aa29daf550271154890f5ae9b43bdc28d4bf56438a7af90154","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9ba4e22074f91aa29daf550271154890f5ae9b43bdc28d4bf56438a7af90154","first_computed_at":"2026-05-18T03:50:50.482803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:50.482803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PcKoJOy2JCnIP+s/c5dpVPLGmlnyBGDkHuUku+NQKBGCpa3FFDh/mPO+HonWuByfKL9glEP2VAN8wQ+dzBQYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:50.483562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4309997a0b438b02ce2533380b1230a6c49683b76025930f0abb03da6437fcf4","sha256:34e8295cac8303a7f4f79377ba039b1497e5cf30c565e123134e425551d022f0"],"state_sha256":"cda55c597a2a2a08603147a9fe9e1cf01eed567b0585c69116e09720f2693d5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsfTI9pKGBJyxFp/e7g+HnWvtVJhhE2j5T1JED/p7qBX1UMYTNVG2LUUUFWipOwV+yCZvNiv6U6RM0hSwu5eDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:06:33.430628Z","bundle_sha256":"b8562a3e9159278841aba8374257c49c1105cf904214649b77085f5a5ef64790"}}