{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HGUEISGRILYEV73ITLSN2I5QRH","short_pith_number":"pith:HGUEISGR","schema_version":"1.0","canonical_sha256":"39a84448d142f04aff689ae4dd23b089c8904680147b7aaa15537cd3bb022587","source":{"kind":"arxiv","id":"1801.07492","version":3},"attestation_state":"computed","paper":{"title":"Statistically Motivated Second Order Pooling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kaicheng Yu, Mathieu Salzmann","submitted_at":"2018-01-23T11:39:19Z","abstract_excerpt":"Second-order pooling, a.k.a.~bilinear pooling, has proven effective for deep learning based visual recognition. However, the resulting second-order networks yield a final representation that is orders of magnitude larger than that of standard, first-order ones, making them memory-intensive and cumbersome to deploy. Here, we introduce a general, parametric compression strategy that can produce more compact representations than existing compression techniques, yet outperform both compressed and uncompressed second-order models. Our approach is motivated by a statistical analysis of the network's"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.07492","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-01-23T11:39:19Z","cross_cats_sorted":[],"title_canon_sha256":"d304f1059a609f864b9d1f6373d8144454f380d13b778cb391e33a7f6f94b0b0","abstract_canon_sha256":"8ba19651d614980d8044a0494bf569eab9df3559d6b77c5b428ffb663b072045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:46.915457Z","signature_b64":"oqfA0jzoULfA21ywm0poTxR6qPc807/+q/Sx30SWhM32QIqKc/2oYnhYJSxlmZbYdX4xJKRu81kB5J4rui4TBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39a84448d142f04aff689ae4dd23b089c8904680147b7aaa15537cd3bb022587","last_reissued_at":"2026-05-18T00:10:46.914711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:46.914711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistically Motivated Second Order Pooling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kaicheng Yu, Mathieu Salzmann","submitted_at":"2018-01-23T11:39:19Z","abstract_excerpt":"Second-order pooling, a.k.a.~bilinear pooling, has proven effective for deep learning based visual recognition. However, the resulting second-order networks yield a final representation that is orders of magnitude larger than that of standard, first-order ones, making them memory-intensive and cumbersome to deploy. Here, we introduce a general, parametric compression strategy that can produce more compact representations than existing compression techniques, yet outperform both compressed and uncompressed second-order models. Our approach is motivated by a statistical analysis of the network's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07492","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.07492","created_at":"2026-05-18T00:10:46.914854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07492v3","created_at":"2026-05-18T00:10:46.914854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07492","created_at":"2026-05-18T00:10:46.914854+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGUEISGRILYE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGUEISGRILYEV73I","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGUEISGR","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH","json":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH.json","graph_json":"https://pith.science/api/pith-number/HGUEISGRILYEV73ITLSN2I5QRH/graph.json","events_json":"https://pith.science/api/pith-number/HGUEISGRILYEV73ITLSN2I5QRH/events.json","paper":"https://pith.science/paper/HGUEISGR"},"agent_actions":{"view_html":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH","download_json":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH.json","view_paper":"https://pith.science/paper/HGUEISGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07492&json=true","fetch_graph":"https://pith.science/api/pith-number/HGUEISGRILYEV73ITLSN2I5QRH/graph.json","fetch_events":"https://pith.science/api/pith-number/HGUEISGRILYEV73ITLSN2I5QRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH/action/storage_attestation","attest_author":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH/action/author_attestation","sign_citation":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH/action/citation_signature","submit_replication":"https://pith.science/pith/HGUEISGRILYEV73ITLSN2I5QRH/action/replication_record"}},"created_at":"2026-05-18T00:10:46.914854+00:00","updated_at":"2026-05-18T00:10:46.914854+00:00"}