{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HTJXMNSS2O3L6PLBNDUM3QM4S4","short_pith_number":"pith:HTJXMNSS","canonical_record":{"source":{"id":"1706.07206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-22T08:24:59Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"c131684f81cfd59af60ac242c5da25cacf01948f8a3ac89b4e8a75e47aa6e929","abstract_canon_sha256":"b9679dcf889bbef52b4ed31284542bdd94aa39a44e6187786167551364ddff95"},"schema_version":"1.0"},"canonical_sha256":"3cd3763652d3b6bf3d6168e8cdc19c97305eb2420beca7f497ab48a43fd7abed","source":{"kind":"arxiv","id":"1706.07206","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07206","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07206v2","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07206","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"HTJXMNSS2O3L","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTJXMNSS2O3L6PLB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTJXMNSS","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HTJXMNSS2O3L6PLBNDUM3QM4S4","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-22T08:24:59Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"c131684f81cfd59af60ac242c5da25cacf01948f8a3ac89b4e8a75e47aa6e929","abstract_canon_sha256":"b9679dcf889bbef52b4ed31284542bdd94aa39a44e6187786167551364ddff95"},"schema_version":"1.0"},"canonical_sha256":"3cd3763652d3b6bf3d6168e8cdc19c97305eb2420beca7f497ab48a43fd7abed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.521306Z","signature_b64":"4Uh9Tkqa4g+3DfG50Y+FprHLcvSYOEzTLC1byvxt4V9i7CJ1oU262MQRuJjbGJcDZANUcp0GzYe9/uYLCYHJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cd3763652d3b6bf3d6168e8cdc19c97305eb2420beca7f497ab48a43fd7abed","last_reissued_at":"2026-05-18T00:38:35.520922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.520922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07206","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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8z1wzrJg4mDXA3J/RJZjEnML9gKmqR8ZJlfAr3FZoVuqm66noIm3R6FrOvX1ix4KtihSP0pWVsww0JLNNa1BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:06:50.107567Z"},"content_sha256":"ef7802379ced28b980237a92e296372cec69d1480fac5143cafdd7d4aeffbf24","schema_version":"1.0","event_id":"sha256:ef7802379ced28b980237a92e296372cec69d1480fac5143cafdd7d4aeffbf24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HTJXMNSS2O3L6PLBNDUM3QM4S4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explaining Recurrent Neural Network Predictions in Sentiment Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.CL","authors_text":"Gr\\'egoire Montavon, Klaus-Robert M\\\"uller, Leila Arras, Wojciech Samek","submitted_at":"2017-06-22T08:24:59Z","abstract_excerpt":"Recently, a technique called Layer-wise Relevance Propagation (LRP) was shown to deliver insightful explanations in the form of input space relevances for understanding feed-forward neural network classification decisions. In the present work, we extend the usage of LRP to recurrent neural networks. We propose a specific propagation rule applicable to multiplicative connections as they arise in recurrent network architectures such as LSTMs and GRUs. We apply our technique to a word-based bi-directional LSTM model on a five-class sentiment prediction task, and evaluate the resulting LRP relevan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07206","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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3OWRGbQuHNtrfvP0T4lJ9rCdRrwQYNoVeOE4ZhYSH32JZ47/qbQ2PFyhMZXfbhYJlI5mCEUyHkH59z+6ZbVOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:06:50.107929Z"},"content_sha256":"a3ec315ea24d3bcdc5cd99c3d3941ceaa3b87913685a909e0fd1bcc6d7991692","schema_version":"1.0","event_id":"sha256:a3ec315ea24d3bcdc5cd99c3d3941ceaa3b87913685a909e0fd1bcc6d7991692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/bundle.json","state_url":"https://pith.science/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/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-05-24T00:06:50Z","links":{"resolver":"https://pith.science/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4","bundle":"https://pith.science/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/bundle.json","state":"https://pith.science/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTJXMNSS2O3L6PLBNDUM3QM4S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HTJXMNSS2O3L6PLBNDUM3QM4S4","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":"b9679dcf889bbef52b4ed31284542bdd94aa39a44e6187786167551364ddff95","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-22T08:24:59Z","title_canon_sha256":"c131684f81cfd59af60ac242c5da25cacf01948f8a3ac89b4e8a75e47aa6e929"},"schema_version":"1.0","source":{"id":"1706.07206","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07206","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07206v2","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07206","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"HTJXMNSS2O3L","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTJXMNSS2O3L6PLB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTJXMNSS","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:a3ec315ea24d3bcdc5cd99c3d3941ceaa3b87913685a909e0fd1bcc6d7991692","target":"graph","created_at":"2026-05-18T00:38: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"},"paper":{"abstract_excerpt":"Recently, a technique called Layer-wise Relevance Propagation (LRP) was shown to deliver insightful explanations in the form of input space relevances for understanding feed-forward neural network classification decisions. In the present work, we extend the usage of LRP to recurrent neural networks. We propose a specific propagation rule applicable to multiplicative connections as they arise in recurrent network architectures such as LSTMs and GRUs. We apply our technique to a word-based bi-directional LSTM model on a five-class sentiment prediction task, and evaluate the resulting LRP relevan","authors_text":"Gr\\'egoire Montavon, Klaus-Robert M\\\"uller, Leila Arras, Wojciech Samek","cross_cats":["cs.AI","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-22T08:24:59Z","title":"Explaining Recurrent Neural Network Predictions in Sentiment Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07206","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:ef7802379ced28b980237a92e296372cec69d1480fac5143cafdd7d4aeffbf24","target":"record","created_at":"2026-05-18T00:38: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":"b9679dcf889bbef52b4ed31284542bdd94aa39a44e6187786167551364ddff95","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-22T08:24:59Z","title_canon_sha256":"c131684f81cfd59af60ac242c5da25cacf01948f8a3ac89b4e8a75e47aa6e929"},"schema_version":"1.0","source":{"id":"1706.07206","kind":"arxiv","version":2}},"canonical_sha256":"3cd3763652d3b6bf3d6168e8cdc19c97305eb2420beca7f497ab48a43fd7abed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cd3763652d3b6bf3d6168e8cdc19c97305eb2420beca7f497ab48a43fd7abed","first_computed_at":"2026-05-18T00:38:35.520922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.520922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Uh9Tkqa4g+3DfG50Y+FprHLcvSYOEzTLC1byvxt4V9i7CJ1oU262MQRuJjbGJcDZANUcp0GzYe9/uYLCYHJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.521306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07206","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef7802379ced28b980237a92e296372cec69d1480fac5143cafdd7d4aeffbf24","sha256:a3ec315ea24d3bcdc5cd99c3d3941ceaa3b87913685a909e0fd1bcc6d7991692"],"state_sha256":"6d5b42b1475735cfb1303cb8eca21c6a220b6c69b8fdee50ea76152bac3efb63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGHn8IH0j9lcWn5vxIyst5J431GiHwqKSQGG9eZrEwQLn4zbksWUx8nXT8amorRK35Fc4T+XuNhY0m7BF24ZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:06:50.110543Z","bundle_sha256":"723efe4499325dc402ecef03d5dc5abe9e911707023501653e26037707150f62"}}