{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:X5YGR5MQQNK3F52LPLHXYCQIMK","short_pith_number":"pith:X5YGR5MQ","schema_version":"1.0","canonical_sha256":"bf7068f5908355b2f74b7acf7c0a0862a3ae966b202f493d2bd5b04ae39e4f45","source":{"kind":"arxiv","id":"math/0609377","version":3},"attestation_state":"computed","paper":{"title":"Prediction of missing observations by a control method","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Fima C. Klebaner, Vyacheslav M. Abramov","submitted_at":"2006-09-14T02:22:06Z","abstract_excerpt":"Consider a time series with missing observations but a known final point. Using control theory ideas we estimate/predict these missing observations. We obtain recurrence equations which minimize sum of squares of a control sequence. An advantage of this method is in easily computable formulae and flexibility of its application to different structures of missing data."},"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":"math/0609377","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2006-09-14T02:22:06Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"efcf848e29b53bce2a93976a972359498f9c8b08da1f7e4ef96892154ee7eb55","abstract_canon_sha256":"0865cc7d97aec1a7f4c197b07a0cde76f5c1a9a55d08215071a3da1e26804d27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:53.242670Z","signature_b64":"mru4feRLgzk6rLnv6FE8jUfZz9cxVamVKh/P8x6sEFGnPfDtEhYCtFPDmgMuO3dGUhiiIEkD3VA5CJaCmAvVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf7068f5908355b2f74b7acf7c0a0862a3ae966b202f493d2bd5b04ae39e4f45","last_reissued_at":"2026-05-18T04:08:53.242249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:53.242249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prediction of missing observations by a control method","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Fima C. Klebaner, Vyacheslav M. Abramov","submitted_at":"2006-09-14T02:22:06Z","abstract_excerpt":"Consider a time series with missing observations but a known final point. Using control theory ideas we estimate/predict these missing observations. We obtain recurrence equations which minimize sum of squares of a control sequence. An advantage of this method is in easily computable formulae and flexibility of its application to different structures of missing data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0609377","kind":"arxiv","version":3},"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":"math/0609377","created_at":"2026-05-18T04:08:53.242306+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0609377v3","created_at":"2026-05-18T04:08:53.242306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0609377","created_at":"2026-05-18T04:08:53.242306+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5YGR5MQQNK3","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5YGR5MQQNK3F52L","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5YGR5MQ","created_at":"2026-05-18T12:25:54.717736+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/X5YGR5MQQNK3F52LPLHXYCQIMK","json":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK.json","graph_json":"https://pith.science/api/pith-number/X5YGR5MQQNK3F52LPLHXYCQIMK/graph.json","events_json":"https://pith.science/api/pith-number/X5YGR5MQQNK3F52LPLHXYCQIMK/events.json","paper":"https://pith.science/paper/X5YGR5MQ"},"agent_actions":{"view_html":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK","download_json":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK.json","view_paper":"https://pith.science/paper/X5YGR5MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0609377&json=true","fetch_graph":"https://pith.science/api/pith-number/X5YGR5MQQNK3F52LPLHXYCQIMK/graph.json","fetch_events":"https://pith.science/api/pith-number/X5YGR5MQQNK3F52LPLHXYCQIMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK/action/storage_attestation","attest_author":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK/action/author_attestation","sign_citation":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK/action/citation_signature","submit_replication":"https://pith.science/pith/X5YGR5MQQNK3F52LPLHXYCQIMK/action/replication_record"}},"created_at":"2026-05-18T04:08:53.242306+00:00","updated_at":"2026-05-18T04:08:53.242306+00:00"}