{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BWZOZQPTGD2QTCLBH2LMMHKGEF","short_pith_number":"pith:BWZOZQPT","canonical_record":{"source":{"id":"1610.04325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T04:29:52Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"dbf5dd3f78e0f5063de9272760d0651ad492dd37fe2ee632239eb0e1acfb02e6","abstract_canon_sha256":"a8ead2d3b0e978f1de5556782ad453bfeb2add1b7d6db0c587ff927a12ca498c"},"schema_version":"1.0"},"canonical_sha256":"0db2ecc1f330f50989613e96c61d46214beb2cf0aed67a088f7c50adc3463ff4","source":{"kind":"arxiv","id":"1610.04325","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04325","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04325v4","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04325","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"BWZOZQPTGD2Q","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWZOZQPTGD2QTCLB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWZOZQPT","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BWZOZQPTGD2QTCLBH2LMMHKGEF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T04:29:52Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"dbf5dd3f78e0f5063de9272760d0651ad492dd37fe2ee632239eb0e1acfb02e6","abstract_canon_sha256":"a8ead2d3b0e978f1de5556782ad453bfeb2add1b7d6db0c587ff927a12ca498c"},"schema_version":"1.0"},"canonical_sha256":"0db2ecc1f330f50989613e96c61d46214beb2cf0aed67a088f7c50adc3463ff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.797817Z","signature_b64":"177UeE1r6zGBxREo+qJD76+CoJEOoSlSkbwUOpUewSvBEqO2zBkEnDSEVeDL0A2HLHobRHFBOMaTn/lTe26ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db2ecc1f330f50989613e96c61d46214beb2cf0aed67a088f7c50adc3463ff4","last_reissued_at":"2026-05-18T00:47:56.797113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.797113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04325","source_version":4,"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:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Fv+Sq+mzDP5XLPyPESVS5shT1xS4VvkHeyubgIfTIXniXjgBxlMU0a0GIr7N58Xq8xh/qrFGGl9m52xuo1rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:17:17.671252Z"},"content_sha256":"de5357c0c81d041946e48eb48a0cc71d1dbbf511f58d568068785fce03bcd9f2","schema_version":"1.0","event_id":"sha256:de5357c0c81d041946e48eb48a0cc71d1dbbf511f58d568068785fce03bcd9f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BWZOZQPTGD2QTCLBH2LMMHKGEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hadamard Product for Low-rank Bilinear Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.CV","authors_text":"Byoung-Tak Zhang, Jeonghee Kim, Jin-Hwa Kim, Jung-Woo Ha, Kyoung-Woon On, Woosang Lim","submitted_at":"2016-10-14T04:29:52Z","abstract_excerpt":"Bilinear models provide rich representations compared with linear models. They have been applied in various visual tasks, such as object recognition, segmentation, and visual question-answering, to get state-of-the-art performances taking advantage of the expanded representations. However, bilinear representations tend to be high-dimensional, limiting the applicability to computationally complex tasks. We propose low-rank bilinear pooling using Hadamard product for an efficient attention mechanism of multimodal learning. We show that our model outperforms compact bilinear pooling in visual que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04325","kind":"arxiv","version":4},"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:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5CS76XaJY9VVmQIlSg7PQTtJtV6k5TtextJga48OeUCi8PI3kcJiHMuWrH231TQvxqSc9VipxeFDgyOuZH0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:17:17.671918Z"},"content_sha256":"46eb2065182d8821deb657a0491c59ad43b67555f108908f74b52d45f0027a36","schema_version":"1.0","event_id":"sha256:46eb2065182d8821deb657a0491c59ad43b67555f108908f74b52d45f0027a36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/bundle.json","state_url":"https://pith.science/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/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-27T11:17:17Z","links":{"resolver":"https://pith.science/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF","bundle":"https://pith.science/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/bundle.json","state":"https://pith.science/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWZOZQPTGD2QTCLBH2LMMHKGEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BWZOZQPTGD2QTCLBH2LMMHKGEF","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":"a8ead2d3b0e978f1de5556782ad453bfeb2add1b7d6db0c587ff927a12ca498c","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T04:29:52Z","title_canon_sha256":"dbf5dd3f78e0f5063de9272760d0651ad492dd37fe2ee632239eb0e1acfb02e6"},"schema_version":"1.0","source":{"id":"1610.04325","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04325","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04325v4","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04325","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"BWZOZQPTGD2Q","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWZOZQPTGD2QTCLB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWZOZQPT","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:46eb2065182d8821deb657a0491c59ad43b67555f108908f74b52d45f0027a36","target":"graph","created_at":"2026-05-18T00:47:56Z","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":"Bilinear models provide rich representations compared with linear models. They have been applied in various visual tasks, such as object recognition, segmentation, and visual question-answering, to get state-of-the-art performances taking advantage of the expanded representations. However, bilinear representations tend to be high-dimensional, limiting the applicability to computationally complex tasks. We propose low-rank bilinear pooling using Hadamard product for an efficient attention mechanism of multimodal learning. We show that our model outperforms compact bilinear pooling in visual que","authors_text":"Byoung-Tak Zhang, Jeonghee Kim, Jin-Hwa Kim, Jung-Woo Ha, Kyoung-Woon On, Woosang Lim","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T04:29:52Z","title":"Hadamard Product for Low-rank Bilinear Pooling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04325","kind":"arxiv","version":4},"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:de5357c0c81d041946e48eb48a0cc71d1dbbf511f58d568068785fce03bcd9f2","target":"record","created_at":"2026-05-18T00:47:56Z","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":"a8ead2d3b0e978f1de5556782ad453bfeb2add1b7d6db0c587ff927a12ca498c","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T04:29:52Z","title_canon_sha256":"dbf5dd3f78e0f5063de9272760d0651ad492dd37fe2ee632239eb0e1acfb02e6"},"schema_version":"1.0","source":{"id":"1610.04325","kind":"arxiv","version":4}},"canonical_sha256":"0db2ecc1f330f50989613e96c61d46214beb2cf0aed67a088f7c50adc3463ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db2ecc1f330f50989613e96c61d46214beb2cf0aed67a088f7c50adc3463ff4","first_computed_at":"2026-05-18T00:47:56.797113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:56.797113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"177UeE1r6zGBxREo+qJD76+CoJEOoSlSkbwUOpUewSvBEqO2zBkEnDSEVeDL0A2HLHobRHFBOMaTn/lTe26ZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:56.797817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04325","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de5357c0c81d041946e48eb48a0cc71d1dbbf511f58d568068785fce03bcd9f2","sha256:46eb2065182d8821deb657a0491c59ad43b67555f108908f74b52d45f0027a36"],"state_sha256":"6f17694669007d5867f49d6d027b77da403764295e87d7669d6f5e4fa74b7564"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sT5t1W9xG8JUi7hn4WOtF1jr7ybR+REWB24WdTis3qpJHna7aiXAQDoAZIfWmVjRKJV3JX7XYBDpCwKwRdvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:17:17.675243Z","bundle_sha256":"6557f4c4394fe0b80ed01918cfa10381fb948934642d6cdc38c60f82e3682e3f"}}