{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:76ZGDWSA4DEQLG3QR7H5HSPW2U","short_pith_number":"pith:76ZGDWSA","canonical_record":{"source":{"id":"1907.11440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-26T09:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"b5ca0dfa834a3db1ce01bd2e5ef77d8cdac608d83fba92c50d90bb8a5706beb0","abstract_canon_sha256":"c6908c957d738b575e96496bc318746521fa0e0c7c591d0876690b628d99e0b1"},"schema_version":"1.0"},"canonical_sha256":"ffb261da40e0c9059b708fcfd3c9f6d5053173b2003d326d3eb1167d822d6578","source":{"kind":"arxiv","id":"1907.11440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11440","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11440v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11440","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"76ZGDWSA4DEQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76ZGDWSA4DEQLG3Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76ZGDWSA","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:76ZGDWSA4DEQLG3QR7H5HSPW2U","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-26T09:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"b5ca0dfa834a3db1ce01bd2e5ef77d8cdac608d83fba92c50d90bb8a5706beb0","abstract_canon_sha256":"c6908c957d738b575e96496bc318746521fa0e0c7c591d0876690b628d99e0b1"},"schema_version":"1.0"},"canonical_sha256":"ffb261da40e0c9059b708fcfd3c9f6d5053173b2003d326d3eb1167d822d6578","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:29.070646Z","signature_b64":"lnw6NoOYMNTp7ffhJOMCpJEgJzehptjKCzG7ZJFkdd15yHFYljBc4FxegZb74itKW/vk1hXlrR9u/2Je2nHdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffb261da40e0c9059b708fcfd3c9f6d5053173b2003d326d3eb1167d822d6578","last_reissued_at":"2026-05-17T23:39:29.069969Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:29.069969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11440","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-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbZ/YEgRC5HAvDl/H6VjoXIJVTnfq6o2aAJ/btYcxn2/+ahM4BLUFK8BlwL2K1rKFv2AUVrg7+6j0aLCS+V9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:53:43.002950Z"},"content_sha256":"3307093fda9ead35b917cff48c1724da016da11dc2dcbe459075273fa76c05d7","schema_version":"1.0","event_id":"sha256:3307093fda9ead35b917cff48c1724da016da11dc2dcbe459075273fa76c05d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:76ZGDWSA4DEQLG3QR7H5HSPW2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Pooling -- A New Pooling Method for Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Euntai Kim, Hongje Seong, Junhyuk Hyun","submitted_at":"2019-07-26T09:00:00Z","abstract_excerpt":"Pooling is one of the main elements in convolutional neural networks. The pooling reduces the size of the feature map, enabling training and testing with a limited amount of computation. This paper proposes a new pooling method named universal pooling. Unlike the existing pooling methods such as average pooling, max pooling, and stride pooling with fixed pooling function, universal pooling generates any pooling function, depending on a given problem and dataset. Universal pooling was inspired by attention methods and can be considered as a channel-wise form of local spatial attention. Universa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11440","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-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJiY9sCNEtVfUQl/DpAQTcXMVFtcPG/XonPmfi4vjm9hBm5GzF5gA30vi+yvBmjx4XARo9dA7xp2y9hMLpYOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:53:43.003621Z"},"content_sha256":"5a2885d7183d38e0502893fab337d9b74c18f84db2beaedce99879b10030697d","schema_version":"1.0","event_id":"sha256:5a2885d7183d38e0502893fab337d9b74c18f84db2beaedce99879b10030697d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/bundle.json","state_url":"https://pith.science/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/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-27T10:53:43Z","links":{"resolver":"https://pith.science/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U","bundle":"https://pith.science/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/bundle.json","state":"https://pith.science/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76ZGDWSA4DEQLG3QR7H5HSPW2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:76ZGDWSA4DEQLG3QR7H5HSPW2U","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":"c6908c957d738b575e96496bc318746521fa0e0c7c591d0876690b628d99e0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-26T09:00:00Z","title_canon_sha256":"b5ca0dfa834a3db1ce01bd2e5ef77d8cdac608d83fba92c50d90bb8a5706beb0"},"schema_version":"1.0","source":{"id":"1907.11440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11440","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11440v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11440","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"76ZGDWSA4DEQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76ZGDWSA4DEQLG3Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76ZGDWSA","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5a2885d7183d38e0502893fab337d9b74c18f84db2beaedce99879b10030697d","target":"graph","created_at":"2026-05-17T23:39:29Z","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":"Pooling is one of the main elements in convolutional neural networks. The pooling reduces the size of the feature map, enabling training and testing with a limited amount of computation. This paper proposes a new pooling method named universal pooling. Unlike the existing pooling methods such as average pooling, max pooling, and stride pooling with fixed pooling function, universal pooling generates any pooling function, depending on a given problem and dataset. Universal pooling was inspired by attention methods and can be considered as a channel-wise form of local spatial attention. Universa","authors_text":"Euntai Kim, Hongje Seong, Junhyuk Hyun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-26T09:00:00Z","title":"Universal Pooling -- A New Pooling Method for Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11440","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:3307093fda9ead35b917cff48c1724da016da11dc2dcbe459075273fa76c05d7","target":"record","created_at":"2026-05-17T23:39:29Z","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":"c6908c957d738b575e96496bc318746521fa0e0c7c591d0876690b628d99e0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-26T09:00:00Z","title_canon_sha256":"b5ca0dfa834a3db1ce01bd2e5ef77d8cdac608d83fba92c50d90bb8a5706beb0"},"schema_version":"1.0","source":{"id":"1907.11440","kind":"arxiv","version":1}},"canonical_sha256":"ffb261da40e0c9059b708fcfd3c9f6d5053173b2003d326d3eb1167d822d6578","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffb261da40e0c9059b708fcfd3c9f6d5053173b2003d326d3eb1167d822d6578","first_computed_at":"2026-05-17T23:39:29.069969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:29.069969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lnw6NoOYMNTp7ffhJOMCpJEgJzehptjKCzG7ZJFkdd15yHFYljBc4FxegZb74itKW/vk1hXlrR9u/2Je2nHdAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:29.070646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3307093fda9ead35b917cff48c1724da016da11dc2dcbe459075273fa76c05d7","sha256:5a2885d7183d38e0502893fab337d9b74c18f84db2beaedce99879b10030697d"],"state_sha256":"71751438b78807893bbd9d8364f0fb1e6a3773bebc664a907f30fd5e04c5d20e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E79kUq9CmHjoDqp+3OOEUCejGqQxKXoEHqJQx0h9LWpfBepf8i4UnqDDGPSOioxe8W8pqWluhIOQOeqPh+8fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:53:43.006616Z","bundle_sha256":"236feb2b089ddd750c5fdfdcb5f2ff7996481ba5153e7f6caae4f40ab8eadd93"}}