{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WVHH3FNMMO2M62XU2E5G42NU3L","short_pith_number":"pith:WVHH3FNM","canonical_record":{"source":{"id":"1808.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-30T20:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"695d0a8d88b752afb9b8b2c803e620c7de60db387143fbe69c187777f62774ea","abstract_canon_sha256":"a1557d49fb542a6ed170fbcf303eb4a30b4c164a1772cc19f71ae8ace808fa45"},"schema_version":"1.0"},"canonical_sha256":"b54e7d95ac63b4cf6af4d13a6e69b4dadad31fc2a36ef119b58d1557876b9938","source":{"kind":"arxiv","id":"1808.10503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10503","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10503v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10503","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"WVHH3FNMMO2M","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVHH3FNMMO2M62XU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVHH3FNM","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WVHH3FNMMO2M62XU2E5G42NU3L","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-30T20:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"695d0a8d88b752afb9b8b2c803e620c7de60db387143fbe69c187777f62774ea","abstract_canon_sha256":"a1557d49fb542a6ed170fbcf303eb4a30b4c164a1772cc19f71ae8ace808fa45"},"schema_version":"1.0"},"canonical_sha256":"b54e7d95ac63b4cf6af4d13a6e69b4dadad31fc2a36ef119b58d1557876b9938","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:45.499073Z","signature_b64":"GtnTvzad0QkCBgwDzKLaeDkyyY5uEllvXYXNF+wl++ZGaXLBQhJljzalOmURUNGvr3IpCsyXCUDMgx2GRqGkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b54e7d95ac63b4cf6af4d13a6e69b4dadad31fc2a36ef119b58d1557876b9938","last_reissued_at":"2026-05-18T00:06:45.498530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:45.498530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10503","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:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3TUnRV90+Gh/ARLO+nJowmkoQmU6K5h13N6pAd0L41zSUWn4HzUybAHcyu7j3LwI+eLPVnxYssoelwVyQrgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:10:41.868282Z"},"content_sha256":"c7d17fabebd224b2582d20f78f35e4c7114f7d03bf8a68a9f13e5e44db6412d4","schema_version":"1.0","event_id":"sha256:c7d17fabebd224b2582d20f78f35e4c7114f7d03bf8a68a9f13e5e44db6412d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WVHH3FNMMO2M62XU2E5G42NU3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Recursive Attention Model for Interpretable Sequence Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jan \\v{S}najder, Martin Tutek","submitted_at":"2018-08-30T20:19:02Z","abstract_excerpt":"Natural language processing has greatly benefited from the introduction of the attention mechanism. However, standard attention models are of limited interpretability for tasks that involve a series of inference steps. We describe an iterative recursive attention model, which constructs incremental representations of input data through reusing results of previously computed queries. We train our model on sentiment classification datasets and demonstrate its capacity to identify and combine different aspects of the input in an easily interpretable manner, while obtaining performance close to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10503","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:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTHsb0Bt5HW7HVdbMDMKuCAFKAKKNW1N6Cw7xNI14+REhEV9xWXJG1HAe3TvOrpHrQBjNgw6gzjr7Yg4BW5NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:10:41.868666Z"},"content_sha256":"5d3007308bb497b8573e4003c76432fee6bc13afaa58590a4696091fcb272a06","schema_version":"1.0","event_id":"sha256:5d3007308bb497b8573e4003c76432fee6bc13afaa58590a4696091fcb272a06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVHH3FNMMO2M62XU2E5G42NU3L/bundle.json","state_url":"https://pith.science/pith/WVHH3FNMMO2M62XU2E5G42NU3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVHH3FNMMO2M62XU2E5G42NU3L/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-03T05:10:41Z","links":{"resolver":"https://pith.science/pith/WVHH3FNMMO2M62XU2E5G42NU3L","bundle":"https://pith.science/pith/WVHH3FNMMO2M62XU2E5G42NU3L/bundle.json","state":"https://pith.science/pith/WVHH3FNMMO2M62XU2E5G42NU3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVHH3FNMMO2M62XU2E5G42NU3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WVHH3FNMMO2M62XU2E5G42NU3L","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":"a1557d49fb542a6ed170fbcf303eb4a30b4c164a1772cc19f71ae8ace808fa45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-30T20:19:02Z","title_canon_sha256":"695d0a8d88b752afb9b8b2c803e620c7de60db387143fbe69c187777f62774ea"},"schema_version":"1.0","source":{"id":"1808.10503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10503","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10503v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10503","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"WVHH3FNMMO2M","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVHH3FNMMO2M62XU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVHH3FNM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:5d3007308bb497b8573e4003c76432fee6bc13afaa58590a4696091fcb272a06","target":"graph","created_at":"2026-05-18T00:06:45Z","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":"Natural language processing has greatly benefited from the introduction of the attention mechanism. However, standard attention models are of limited interpretability for tasks that involve a series of inference steps. We describe an iterative recursive attention model, which constructs incremental representations of input data through reusing results of previously computed queries. We train our model on sentiment classification datasets and demonstrate its capacity to identify and combine different aspects of the input in an easily interpretable manner, while obtaining performance close to th","authors_text":"Jan \\v{S}najder, Martin Tutek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-30T20:19:02Z","title":"Iterative Recursive Attention Model for Interpretable Sequence Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10503","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:c7d17fabebd224b2582d20f78f35e4c7114f7d03bf8a68a9f13e5e44db6412d4","target":"record","created_at":"2026-05-18T00:06:45Z","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":"a1557d49fb542a6ed170fbcf303eb4a30b4c164a1772cc19f71ae8ace808fa45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-30T20:19:02Z","title_canon_sha256":"695d0a8d88b752afb9b8b2c803e620c7de60db387143fbe69c187777f62774ea"},"schema_version":"1.0","source":{"id":"1808.10503","kind":"arxiv","version":1}},"canonical_sha256":"b54e7d95ac63b4cf6af4d13a6e69b4dadad31fc2a36ef119b58d1557876b9938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54e7d95ac63b4cf6af4d13a6e69b4dadad31fc2a36ef119b58d1557876b9938","first_computed_at":"2026-05-18T00:06:45.498530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:45.498530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtnTvzad0QkCBgwDzKLaeDkyyY5uEllvXYXNF+wl++ZGaXLBQhJljzalOmURUNGvr3IpCsyXCUDMgx2GRqGkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:45.499073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7d17fabebd224b2582d20f78f35e4c7114f7d03bf8a68a9f13e5e44db6412d4","sha256:5d3007308bb497b8573e4003c76432fee6bc13afaa58590a4696091fcb272a06"],"state_sha256":"93fe35b9b0824e62a763474eb5a5fdbb331930c79e913cbcd34a46074493ce58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yFHEMXL/NQQ+wZSZM4feqq83Mi75lMQ6dv46MY7G21aSluaxtOaCAndOg9crrXHrMJNb3h9h1Nu4A5HHa+cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:10:41.870608Z","bundle_sha256":"38ed926799fad3bc51818aa0767e48c348ff54f498a633fe80d1ee7e8d05a591"}}