{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:O34LLLYSRXNZW62X3NUDHGEVHS","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":"b00ddbe373e75fefcfa1ade34cee6ba0c59e0fd62422ed7370efc7aa73345191","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-05T07:06:19Z","title_canon_sha256":"ff1d6e10f1fe98318f51b736b5c0a56fca0abd8473e2da825246cffca9038e78"},"schema_version":"1.0","source":{"id":"2006.03258","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.03258","created_at":"2026-07-05T03:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"2006.03258v4","created_at":"2026-07-05T03:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03258","created_at":"2026-07-05T03:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"O34LLLYSRXNZ","created_at":"2026-07-05T03:43:35Z"},{"alias_kind":"pith_short_16","alias_value":"O34LLLYSRXNZW62X","created_at":"2026-07-05T03:43:35Z"},{"alias_kind":"pith_short_8","alias_value":"O34LLLYS","created_at":"2026-07-05T03:43:35Z"}],"graph_snapshots":[{"event_id":"sha256:7322267fb125791211593c4040044999f759f864753acf1b95c5cd9249916e2e","target":"graph","created_at":"2026-07-05T03:43:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.03258/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The design of methods for inference from time sequences has traditionally relied on statistical models that describe the relation between a latent desired sequence and the observed one. A broad family of model-based algorithms have been derived to carry out inference at controllable complexity using recursive computations over the factor graph representing the underlying distribution. An alternative model-agnostic approach utilizes machine learning (ML) methods. Here we propose a framework that combines model-based algorithms and data-driven ML tools for stationary time sequences. In the propo","authors_text":"Andrea J. Goldsmith, Nariman Farsad, Nir Shlezinger, Yonina C. Eldar","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-05T07:06:19Z","title":"Learned Factor Graphs for Inference from Stationary Time Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03258","kind":"arxiv","version":4},"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:81b19f3e1eb448b77813c04b87313ec3405f9bdf0ba18a2b80b433af17e60121","target":"record","created_at":"2026-07-05T03:43:35Z","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":"b00ddbe373e75fefcfa1ade34cee6ba0c59e0fd62422ed7370efc7aa73345191","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-05T07:06:19Z","title_canon_sha256":"ff1d6e10f1fe98318f51b736b5c0a56fca0abd8473e2da825246cffca9038e78"},"schema_version":"1.0","source":{"id":"2006.03258","kind":"arxiv","version":4}},"canonical_sha256":"76f8b5af128ddb9b7b57db683398953c848c4856d0cc22ad3c53aa7700356722","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76f8b5af128ddb9b7b57db683398953c848c4856d0cc22ad3c53aa7700356722","first_computed_at":"2026-07-05T03:43:35.949708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:43:35.949708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S4YJt2dOMbhCBVhgIheKnfUOfL9/XSmOha9suD3Au41ti6i4qRwSIhpeN+AP8kPWJmSrM2TWCNsBpNDx5U0OAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:43:35.950129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.03258","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81b19f3e1eb448b77813c04b87313ec3405f9bdf0ba18a2b80b433af17e60121","sha256:7322267fb125791211593c4040044999f759f864753acf1b95c5cd9249916e2e"],"state_sha256":"d7bba1e1ce76bcafe92b67c94d551041a2b8677517d4e0a4d57f985125c2d816"}