{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PERPZHC43NDADUYVVSXCHUZ2KC","short_pith_number":"pith:PERPZHC4","canonical_record":{"source":{"id":"1702.06941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-22T18:56:44Z","cross_cats_sorted":[],"title_canon_sha256":"239c128982e44b5468dc375fd744df088c38a70e60413728559331c3212f36b9","abstract_canon_sha256":"43f1ddbecb9269b82f505948e55c35d4aad592771131c88d4e2f61201e41e82e"},"schema_version":"1.0"},"canonical_sha256":"7922fc9c5cdb4601d315acae23d33a50bbe4121499ba0afbff7dcc253c7dd4d6","source":{"kind":"arxiv","id":"1702.06941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06941","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06941v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06941","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"PERPZHC43NDA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PERPZHC43NDADUYV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PERPZHC4","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PERPZHC43NDADUYVVSXCHUZ2KC","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-22T18:56:44Z","cross_cats_sorted":[],"title_canon_sha256":"239c128982e44b5468dc375fd744df088c38a70e60413728559331c3212f36b9","abstract_canon_sha256":"43f1ddbecb9269b82f505948e55c35d4aad592771131c88d4e2f61201e41e82e"},"schema_version":"1.0"},"canonical_sha256":"7922fc9c5cdb4601d315acae23d33a50bbe4121499ba0afbff7dcc253c7dd4d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.081712Z","signature_b64":"Pu4wYiSSZxmavNE/r7B5J/pZ2czanEs0hLk0qLoTfSfDFbYdBg7Pg5PyxPsraipAMrz4pJhnCb6s1lqgXlaACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7922fc9c5cdb4601d315acae23d33a50bbe4121499ba0afbff7dcc253c7dd4d6","last_reissued_at":"2026-05-18T00:50:10.081134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.081134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06941","source_version":1,"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-18T00:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqFk5fVrbDHaq2PWMoHEb7fSiK85aFmKCeMO3KYfpVgevxqQSXjxmGx/BwmpUK78seGNnt29gvR4HEabWg9YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:45:51.638050Z"},"content_sha256":"a769257c0c6b3d5f882d73fa6ebe21017d6be6e860cc88f66325e920e60bba89","schema_version":"1.0","event_id":"sha256:a769257c0c6b3d5f882d73fa6ebe21017d6be6e860cc88f66325e920e60bba89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PERPZHC43NDADUYVVSXCHUZ2KC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algebraic Formalization of Forward and Forward-backward Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ai Azuma, Masashi Shimbo, Yuji Matsumoto","submitted_at":"2017-02-22T18:56:44Z","abstract_excerpt":"In this paper, we propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other existing algorithms is subsumed. Forward algorithms generalized in this study subsume the ordinary forward algorithm on trellises for sequence labeling, the inside algorithm on derivation forests for CYK parsing, a unidirectional message passing on acyclic factor graphs, the forward mode of automatic differentiation on computation graphs with addition and m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06941","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"},"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-18T00:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxJF19CMYo6S1iASd7dXfa40uSnqo2JlT0rYSCiFx9RyjGjcVn4I73rmAsFJfZDVYGLeFyuSZB3aPqHl3qe9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:45:51.638793Z"},"content_sha256":"4a47ea86fa8ed08deefb46962396e17312d035db701fc65fb421cd0aa3506471","schema_version":"1.0","event_id":"sha256:4a47ea86fa8ed08deefb46962396e17312d035db701fc65fb421cd0aa3506471"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PERPZHC43NDADUYVVSXCHUZ2KC/bundle.json","state_url":"https://pith.science/pith/PERPZHC43NDADUYVVSXCHUZ2KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PERPZHC43NDADUYVVSXCHUZ2KC/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-06-10T02:45:51Z","links":{"resolver":"https://pith.science/pith/PERPZHC43NDADUYVVSXCHUZ2KC","bundle":"https://pith.science/pith/PERPZHC43NDADUYVVSXCHUZ2KC/bundle.json","state":"https://pith.science/pith/PERPZHC43NDADUYVVSXCHUZ2KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PERPZHC43NDADUYVVSXCHUZ2KC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PERPZHC43NDADUYVVSXCHUZ2KC","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":"43f1ddbecb9269b82f505948e55c35d4aad592771131c88d4e2f61201e41e82e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-22T18:56:44Z","title_canon_sha256":"239c128982e44b5468dc375fd744df088c38a70e60413728559331c3212f36b9"},"schema_version":"1.0","source":{"id":"1702.06941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06941","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06941v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06941","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"PERPZHC43NDA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PERPZHC43NDADUYV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PERPZHC4","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:4a47ea86fa8ed08deefb46962396e17312d035db701fc65fb421cd0aa3506471","target":"graph","created_at":"2026-05-18T00:50:10Z","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 propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other existing algorithms is subsumed. Forward algorithms generalized in this study subsume the ordinary forward algorithm on trellises for sequence labeling, the inside algorithm on derivation forests for CYK parsing, a unidirectional message passing on acyclic factor graphs, the forward mode of automatic differentiation on computation graphs with addition and m","authors_text":"Ai Azuma, Masashi Shimbo, Yuji Matsumoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-22T18:56:44Z","title":"An Algebraic Formalization of Forward and Forward-backward Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06941","kind":"arxiv","version":1},"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:a769257c0c6b3d5f882d73fa6ebe21017d6be6e860cc88f66325e920e60bba89","target":"record","created_at":"2026-05-18T00:50:10Z","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":"43f1ddbecb9269b82f505948e55c35d4aad592771131c88d4e2f61201e41e82e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-22T18:56:44Z","title_canon_sha256":"239c128982e44b5468dc375fd744df088c38a70e60413728559331c3212f36b9"},"schema_version":"1.0","source":{"id":"1702.06941","kind":"arxiv","version":1}},"canonical_sha256":"7922fc9c5cdb4601d315acae23d33a50bbe4121499ba0afbff7dcc253c7dd4d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7922fc9c5cdb4601d315acae23d33a50bbe4121499ba0afbff7dcc253c7dd4d6","first_computed_at":"2026-05-18T00:50:10.081134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:10.081134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pu4wYiSSZxmavNE/r7B5J/pZ2czanEs0hLk0qLoTfSfDFbYdBg7Pg5PyxPsraipAMrz4pJhnCb6s1lqgXlaACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:10.081712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a769257c0c6b3d5f882d73fa6ebe21017d6be6e860cc88f66325e920e60bba89","sha256:4a47ea86fa8ed08deefb46962396e17312d035db701fc65fb421cd0aa3506471"],"state_sha256":"64dd3a8de8ced11883775e2dbfc6ef84cd702669c68a3fbdf4665ecef2ed4827"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQgM0otNcL62xgA2xqAGFhfCqiqzSF1A5gXHAJqSSNlXUF02qEFKVppPGAjo7vt9yaReR0EDioHq/4gTxNw3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:45:51.643360Z","bundle_sha256":"898d0faa32b7ace4d6df5a787d65fb334baa5a7eeb768f404e6af5812c530b01"}}