{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U66M6OZUXTXCQZHEIIFRP5WQW3","short_pith_number":"pith:U66M6OZU","canonical_record":{"source":{"id":"1307.6410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-24T13:24:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"579486b117b4d7fb5652724a100d3fc0d788506b77595abddefaf93058cb4004","abstract_canon_sha256":"c3ff0a568c15b18a5ae7279bfb0bb00316a2ce5b6d68f40e7cccfdb3fbfdbfcb"},"schema_version":"1.0"},"canonical_sha256":"a7bccf3b34bcee2864e4420b17f6d0b6dfb856ccb9443c5508d8f57f08cfa084","source":{"kind":"arxiv","id":"1307.6410","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6410","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6410v1","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6410","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"U66M6OZUXTXC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U66M6OZUXTXCQZHE","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U66M6OZU","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U66M6OZUXTXCQZHEIIFRP5WQW3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-24T13:24:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"579486b117b4d7fb5652724a100d3fc0d788506b77595abddefaf93058cb4004","abstract_canon_sha256":"c3ff0a568c15b18a5ae7279bfb0bb00316a2ce5b6d68f40e7cccfdb3fbfdbfcb"},"schema_version":"1.0"},"canonical_sha256":"a7bccf3b34bcee2864e4420b17f6d0b6dfb856ccb9443c5508d8f57f08cfa084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:36.603423Z","signature_b64":"f0TjwHLKId1nTz5DgFjuuKSbFnNbF18zzcC679z0EbOs0Rf5i2go8tparir7zrlhvG0HrL5FSqlQBNixH7WxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7bccf3b34bcee2864e4420b17f6d0b6dfb856ccb9443c5508d8f57f08cfa084","last_reissued_at":"2026-05-18T03:17:36.602676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:36.602676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6410","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-18T03:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyFePVEFDfn57d0wd41jg8MPcNXZfMGJEkRCby1L2PoGqK349qDXHSu+Q14dPtaEr2vcdX2cWBjIxS7sshy6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:13.772228Z"},"content_sha256":"50495ce65f3291585fdc3d06d65723d6e568ce14b58b99daab90a5f6452f4c3b","schema_version":"1.0","event_id":"sha256:50495ce65f3291585fdc3d06d65723d6e568ce14b58b99daab90a5f6452f4c3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U66M6OZUXTXCQZHEIIFRP5WQW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Storing non-uniformly distributed messages in networks of neural cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NE","authors_text":"Bartosz Boguslawski, Fabrice Seguin, Fr\\'ed\\'eric Heitzmann, Vincent Gripon","submitted_at":"2013-07-24T13:24:04Z","abstract_excerpt":"Associative memories are data structures that allow retrieval of stored messages from part of their content. They thus behave similarly to human brain that is capable for instance of retrieving the end of a song given its beginning. Among different families of associative memories, sparse ones are known to provide the best efficiency (ratio of the number of bits stored to that of bits used). Nevertheless, it is well known that non-uniformity of the stored messages can lead to dramatic decrease in performance. We introduce several strategies to allow efficient storage of non-uniform messages in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6410","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-18T03:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2BkmFj1kTe9vdSyP977FC23czE3zks20k9gIr78ZL1lQyA7zpvZTqaOSrdXJqGHvBARPrckgp7PDG6liRqwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:13.772994Z"},"content_sha256":"2103807036497381b6b230aa8e7e40f0dc41e9248f6a397cb365b240d9d004e8","schema_version":"1.0","event_id":"sha256:2103807036497381b6b230aa8e7e40f0dc41e9248f6a397cb365b240d9d004e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/bundle.json","state_url":"https://pith.science/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/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-31T07:42:13Z","links":{"resolver":"https://pith.science/pith/U66M6OZUXTXCQZHEIIFRP5WQW3","bundle":"https://pith.science/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/bundle.json","state":"https://pith.science/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U66M6OZUXTXCQZHEIIFRP5WQW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U66M6OZUXTXCQZHEIIFRP5WQW3","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":"c3ff0a568c15b18a5ae7279bfb0bb00316a2ce5b6d68f40e7cccfdb3fbfdbfcb","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-24T13:24:04Z","title_canon_sha256":"579486b117b4d7fb5652724a100d3fc0d788506b77595abddefaf93058cb4004"},"schema_version":"1.0","source":{"id":"1307.6410","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6410","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6410v1","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6410","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"U66M6OZUXTXC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U66M6OZUXTXCQZHE","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U66M6OZU","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:2103807036497381b6b230aa8e7e40f0dc41e9248f6a397cb365b240d9d004e8","target":"graph","created_at":"2026-05-18T03:17:36Z","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":"Associative memories are data structures that allow retrieval of stored messages from part of their content. They thus behave similarly to human brain that is capable for instance of retrieving the end of a song given its beginning. Among different families of associative memories, sparse ones are known to provide the best efficiency (ratio of the number of bits stored to that of bits used). Nevertheless, it is well known that non-uniformity of the stored messages can lead to dramatic decrease in performance. We introduce several strategies to allow efficient storage of non-uniform messages in","authors_text":"Bartosz Boguslawski, Fabrice Seguin, Fr\\'ed\\'eric Heitzmann, Vincent Gripon","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-24T13:24:04Z","title":"Storing non-uniformly distributed messages in networks of neural cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6410","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:50495ce65f3291585fdc3d06d65723d6e568ce14b58b99daab90a5f6452f4c3b","target":"record","created_at":"2026-05-18T03:17:36Z","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":"c3ff0a568c15b18a5ae7279bfb0bb00316a2ce5b6d68f40e7cccfdb3fbfdbfcb","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-24T13:24:04Z","title_canon_sha256":"579486b117b4d7fb5652724a100d3fc0d788506b77595abddefaf93058cb4004"},"schema_version":"1.0","source":{"id":"1307.6410","kind":"arxiv","version":1}},"canonical_sha256":"a7bccf3b34bcee2864e4420b17f6d0b6dfb856ccb9443c5508d8f57f08cfa084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7bccf3b34bcee2864e4420b17f6d0b6dfb856ccb9443c5508d8f57f08cfa084","first_computed_at":"2026-05-18T03:17:36.602676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:36.602676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f0TjwHLKId1nTz5DgFjuuKSbFnNbF18zzcC679z0EbOs0Rf5i2go8tparir7zrlhvG0HrL5FSqlQBNixH7WxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:36.603423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6410","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50495ce65f3291585fdc3d06d65723d6e568ce14b58b99daab90a5f6452f4c3b","sha256:2103807036497381b6b230aa8e7e40f0dc41e9248f6a397cb365b240d9d004e8"],"state_sha256":"de32bc80d9889a531923b4059849bdcf4823e8856ef68691f27b8815027ff7f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOLcGFRTwjwlZ8FAZMnTD2dUZZQ/ia3dKg48CRjrRpAcRpO5NTX331va85iE6YTngvpOA+ct6zBi92ZbqkTgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:42:13.777256Z","bundle_sha256":"042a6985d2bf1ee53aa10266a0c3e4c06ef694b2d6eba4714739da4a75f1fe67"}}