{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3JFXT5MUVGN43OY76ENL37OXP3","short_pith_number":"pith:3JFXT5MU","canonical_record":{"source":{"id":"2101.11685","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-27T20:58:20Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"26325af2d2699408184f3b3b2e8f938af2db3412de701295c16cc99b9d67265e","abstract_canon_sha256":"56cfdea87ce78591e7943aaaaa24a8f7c745ff8a44962e1f85f8b9257cc25131"},"schema_version":"1.0"},"canonical_sha256":"da4b79f594a99bcdbb1ff11abdfdd77ee91779fed3579b0172f9dc506790cf93","source":{"kind":"arxiv","id":"2101.11685","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11685","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11685v2","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11685","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"3JFXT5MUVGN4","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_16","alias_value":"3JFXT5MUVGN43OY7","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_8","alias_value":"3JFXT5MU","created_at":"2026-07-05T02:34:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3JFXT5MUVGN43OY76ENL37OXP3","target":"record","payload":{"canonical_record":{"source":{"id":"2101.11685","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-27T20:58:20Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"26325af2d2699408184f3b3b2e8f938af2db3412de701295c16cc99b9d67265e","abstract_canon_sha256":"56cfdea87ce78591e7943aaaaa24a8f7c745ff8a44962e1f85f8b9257cc25131"},"schema_version":"1.0"},"canonical_sha256":"da4b79f594a99bcdbb1ff11abdfdd77ee91779fed3579b0172f9dc506790cf93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:46.811820Z","signature_b64":"kNJlexZoUksL4vGb+DN2Y2D1mUCxSuYHCPykh7reAdS34XedoMnzJjODUNGB4i41rBgq+DAzbCZntwxrqvhZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4b79f594a99bcdbb1ff11abdfdd77ee91779fed3579b0172f9dc506790cf93","last_reissued_at":"2026-07-05T02:34:46.811457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:46.811457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.11685","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-05T02:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5jUfXGiPUiHyEdoRBuJpzzoKdJDtWvdwYqnzP+6n1uuBHBykwO9IEYZWu4T21TyIMp35b2uAOZX9cbDCEzhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:56:43.022752Z"},"content_sha256":"86243783026f9321a5ab2c638bf5bdd812a44d1cf292c4fd613bd364c1093e6d","schema_version":"1.0","event_id":"sha256:86243783026f9321a5ab2c638bf5bdd812a44d1cf292c4fd613bd364c1093e6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3JFXT5MUVGN43OY76ENL37OXP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CNN with large memory layers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Karim Iskakov, Rasul Karimov, Victor Lempitsky, Yury Malkov","submitted_at":"2021-01-27T20:58:20Z","abstract_excerpt":"This work is centred around the recently proposed product key memory structure \\cite{large_memory}, implemented for a number of computer vision applications. The memory structure can be regarded as a simple computation primitive suitable to be augmented to nearly all neural network architectures. The memory block allows implementing sparse access to memory with square root complexity scaling with respect to the memory capacity. The latter scaling is possible due to the incorporation of Cartesian product space decomposition of the key space for the nearest neighbour search. We have tested the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11685","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/2101.11685/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-05T02:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2Cv6Qsa4AhX70izEJjk/HRIQkwPSUzAtoGrzQ20FN683JK7KA2xxmEYw6Rb9nmKdMWY2CXByxmf7cIKR2hyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:56:43.023122Z"},"content_sha256":"032debe3fa5cb9ab2a6903c2a48fc052a01012c0ed2e9cfcdafb8f5b366ffb58","schema_version":"1.0","event_id":"sha256:032debe3fa5cb9ab2a6903c2a48fc052a01012c0ed2e9cfcdafb8f5b366ffb58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JFXT5MUVGN43OY76ENL37OXP3/bundle.json","state_url":"https://pith.science/pith/3JFXT5MUVGN43OY76ENL37OXP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JFXT5MUVGN43OY76ENL37OXP3/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-07T15:56:43Z","links":{"resolver":"https://pith.science/pith/3JFXT5MUVGN43OY76ENL37OXP3","bundle":"https://pith.science/pith/3JFXT5MUVGN43OY76ENL37OXP3/bundle.json","state":"https://pith.science/pith/3JFXT5MUVGN43OY76ENL37OXP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JFXT5MUVGN43OY76ENL37OXP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3JFXT5MUVGN43OY76ENL37OXP3","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":"56cfdea87ce78591e7943aaaaa24a8f7c745ff8a44962e1f85f8b9257cc25131","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-27T20:58:20Z","title_canon_sha256":"26325af2d2699408184f3b3b2e8f938af2db3412de701295c16cc99b9d67265e"},"schema_version":"1.0","source":{"id":"2101.11685","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11685","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11685v2","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11685","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"3JFXT5MUVGN4","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_16","alias_value":"3JFXT5MUVGN43OY7","created_at":"2026-07-05T02:34:46Z"},{"alias_kind":"pith_short_8","alias_value":"3JFXT5MU","created_at":"2026-07-05T02:34:46Z"}],"graph_snapshots":[{"event_id":"sha256:032debe3fa5cb9ab2a6903c2a48fc052a01012c0ed2e9cfcdafb8f5b366ffb58","target":"graph","created_at":"2026-07-05T02:34:46Z","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/2101.11685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work is centred around the recently proposed product key memory structure \\cite{large_memory}, implemented for a number of computer vision applications. The memory structure can be regarded as a simple computation primitive suitable to be augmented to nearly all neural network architectures. The memory block allows implementing sparse access to memory with square root complexity scaling with respect to the memory capacity. The latter scaling is possible due to the incorporation of Cartesian product space decomposition of the key space for the nearest neighbour search. We have tested the m","authors_text":"Karim Iskakov, Rasul Karimov, Victor Lempitsky, Yury Malkov","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-27T20:58:20Z","title":"CNN with large memory layers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11685","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:86243783026f9321a5ab2c638bf5bdd812a44d1cf292c4fd613bd364c1093e6d","target":"record","created_at":"2026-07-05T02:34:46Z","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":"56cfdea87ce78591e7943aaaaa24a8f7c745ff8a44962e1f85f8b9257cc25131","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-27T20:58:20Z","title_canon_sha256":"26325af2d2699408184f3b3b2e8f938af2db3412de701295c16cc99b9d67265e"},"schema_version":"1.0","source":{"id":"2101.11685","kind":"arxiv","version":2}},"canonical_sha256":"da4b79f594a99bcdbb1ff11abdfdd77ee91779fed3579b0172f9dc506790cf93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da4b79f594a99bcdbb1ff11abdfdd77ee91779fed3579b0172f9dc506790cf93","first_computed_at":"2026-07-05T02:34:46.811457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:46.811457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kNJlexZoUksL4vGb+DN2Y2D1mUCxSuYHCPykh7reAdS34XedoMnzJjODUNGB4i41rBgq+DAzbCZntwxrqvhZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:46.811820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.11685","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86243783026f9321a5ab2c638bf5bdd812a44d1cf292c4fd613bd364c1093e6d","sha256:032debe3fa5cb9ab2a6903c2a48fc052a01012c0ed2e9cfcdafb8f5b366ffb58"],"state_sha256":"8adc53bf13f7c91fa2efed947de6470d85301af75eb714a380cc1859886c5abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz/vO7GEBUopUW5KCX3tG5Oydil12dr64gioVzjDz3krCFlg3+w4O0+CEVSw3xu2L1PpWmRvcYqA6otr0HboCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:56:43.024970Z","bundle_sha256":"e3ddf246262c26e34ddb829c8d96d8b0f9d876455f60b7baa412fd34572a9b21"}}