{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FJCRLHHPMF7T2LZXJOU7QKLEPQ","short_pith_number":"pith:FJCRLHHP","canonical_record":{"source":{"id":"2005.00159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-01T00:47:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"519deddcedeebd3822c1eb4f800e18406f0c3164816c93de5a69cc187a31bac5","abstract_canon_sha256":"62a42911b692c348dd7006b4b1da3969eebfc0b6987888c85a1e30981b9638f7"},"schema_version":"1.0"},"canonical_sha256":"2a45159cef617f3d2f374ba9f829647c212e0b37be545fbac5aa8b5da36cce0f","source":{"kind":"arxiv","id":"2005.00159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.00159","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"2005.00159v2","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00159","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"FJCRLHHPMF7T","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_16","alias_value":"FJCRLHHPMF7T2LZX","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_8","alias_value":"FJCRLHHP","created_at":"2026-07-05T01:47:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FJCRLHHPMF7T2LZXJOU7QKLEPQ","target":"record","payload":{"canonical_record":{"source":{"id":"2005.00159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-01T00:47:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"519deddcedeebd3822c1eb4f800e18406f0c3164816c93de5a69cc187a31bac5","abstract_canon_sha256":"62a42911b692c348dd7006b4b1da3969eebfc0b6987888c85a1e30981b9638f7"},"schema_version":"1.0"},"canonical_sha256":"2a45159cef617f3d2f374ba9f829647c212e0b37be545fbac5aa8b5da36cce0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:13.440025Z","signature_b64":"6bG03uSY42j9rqAzM3WRRdFl4ynPwBobgZNg69ejOURfysD0+wngzzrgsqV8lZ5ejn0IliQLA3BkupNjiQD3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a45159cef617f3d2f374ba9f829647c212e0b37be545fbac5aa8b5da36cce0f","last_reissued_at":"2026-07-05T01:47:13.439485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:13.439485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.00159","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-07-05T01:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r47o5mbxZBg6OuWnuDb2jky9daS/1FVVkfwbv9p7sNwaCuCaC4fGQEniqFNId+7a1qNxZkw81qg8BDQ4RMBEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T16:42:00.310408Z"},"content_sha256":"26a76843f19625e4b73a8c2d237fb13ad0d470daebdfd3a4e491fcd5afcb06fd","schema_version":"1.0","event_id":"sha256:26a76843f19625e4b73a8c2d237fb13ad0d470daebdfd3a4e491fcd5afcb06fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FJCRLHHPMF7T2LZXJOU7QKLEPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Why and when should you pool? Analyzing Pooling in Recurrent Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Danish Pruthi, Keshav Kolluru, Mausam, Pratyush Maini","submitted_at":"2020-05-01T00:47:37Z","abstract_excerpt":"Pooling-based recurrent neural architectures consistently outperform their counterparts without pooling. However, the reasons for their enhanced performance are largely unexamined. In this work, we examine three commonly used pooling techniques (mean-pooling, max-pooling, and attention), and propose max-attention, a novel variant that effectively captures interactions among predictive tokens in a sentence. We find that pooling-based architectures substantially differ from their non-pooling equivalents in their learning ability and positional biases--which elucidate their performance benefits. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.00159/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3hA+TPEEh9I2DUtTe5/Q20TkkCTuOew34+P4wqZRTQOGYR5IXGgUA1t6xLKLS/GEuWFNqpiBm4wbTX/W57GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T16:42:00.310793Z"},"content_sha256":"76101585ec56a505ea9e94b80d03614dac02445846ac3faaf0e947b2555a7ffa","schema_version":"1.0","event_id":"sha256:76101585ec56a505ea9e94b80d03614dac02445846ac3faaf0e947b2555a7ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/bundle.json","state_url":"https://pith.science/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/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-07-11T16:42:00Z","links":{"resolver":"https://pith.science/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ","bundle":"https://pith.science/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/bundle.json","state":"https://pith.science/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJCRLHHPMF7T2LZXJOU7QKLEPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FJCRLHHPMF7T2LZXJOU7QKLEPQ","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":"62a42911b692c348dd7006b4b1da3969eebfc0b6987888c85a1e30981b9638f7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-01T00:47:37Z","title_canon_sha256":"519deddcedeebd3822c1eb4f800e18406f0c3164816c93de5a69cc187a31bac5"},"schema_version":"1.0","source":{"id":"2005.00159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.00159","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"2005.00159v2","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00159","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"FJCRLHHPMF7T","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_16","alias_value":"FJCRLHHPMF7T2LZX","created_at":"2026-07-05T01:47:13Z"},{"alias_kind":"pith_short_8","alias_value":"FJCRLHHP","created_at":"2026-07-05T01:47:13Z"}],"graph_snapshots":[{"event_id":"sha256:76101585ec56a505ea9e94b80d03614dac02445846ac3faaf0e947b2555a7ffa","target":"graph","created_at":"2026-07-05T01:47:13Z","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/2005.00159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Pooling-based recurrent neural architectures consistently outperform their counterparts without pooling. However, the reasons for their enhanced performance are largely unexamined. In this work, we examine three commonly used pooling techniques (mean-pooling, max-pooling, and attention), and propose max-attention, a novel variant that effectively captures interactions among predictive tokens in a sentence. We find that pooling-based architectures substantially differ from their non-pooling equivalents in their learning ability and positional biases--which elucidate their performance benefits. ","authors_text":"Danish Pruthi, Keshav Kolluru, Mausam, Pratyush Maini","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-01T00:47:37Z","title":"Why and when should you pool? Analyzing Pooling in Recurrent Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00159","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:26a76843f19625e4b73a8c2d237fb13ad0d470daebdfd3a4e491fcd5afcb06fd","target":"record","created_at":"2026-07-05T01:47:13Z","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":"62a42911b692c348dd7006b4b1da3969eebfc0b6987888c85a1e30981b9638f7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-01T00:47:37Z","title_canon_sha256":"519deddcedeebd3822c1eb4f800e18406f0c3164816c93de5a69cc187a31bac5"},"schema_version":"1.0","source":{"id":"2005.00159","kind":"arxiv","version":2}},"canonical_sha256":"2a45159cef617f3d2f374ba9f829647c212e0b37be545fbac5aa8b5da36cce0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a45159cef617f3d2f374ba9f829647c212e0b37be545fbac5aa8b5da36cce0f","first_computed_at":"2026-07-05T01:47:13.439485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:13.439485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bG03uSY42j9rqAzM3WRRdFl4ynPwBobgZNg69ejOURfysD0+wngzzrgsqV8lZ5ejn0IliQLA3BkupNjiQD3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:13.440025Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.00159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26a76843f19625e4b73a8c2d237fb13ad0d470daebdfd3a4e491fcd5afcb06fd","sha256:76101585ec56a505ea9e94b80d03614dac02445846ac3faaf0e947b2555a7ffa"],"state_sha256":"c9d35ae4e2ed1c2e327024ee6923bfede95e5fe6156afc5fadab19276625da46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0XCalTQ1rMaQ6i++/xpKuBAdWrVYjAvSlzIVEt7/+dbrlOUAOaUz6l4b/TRbfKT3gyT2D/80iFCy9/HPzqCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T16:42:00.313595Z","bundle_sha256":"e704b6f95a511bb0f3ba53225c56c868d23df8115e1df7a7b7f3b8874cfdad33"}}