{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:56MMO3JQQHZKURBZFTNURNHEXO","short_pith_number":"pith:56MMO3JQ","canonical_record":{"source":{"id":"1903.10982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-03-26T16:11:47Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"e072609e35f35c11d105e5cec79dc71b9607d958117e09d61a4503282d2eb49c","abstract_canon_sha256":"226adb7249e8eb0c2ef4b9f2bc5675fa6c7db84f3f8cf5550332f106e267272c"},"schema_version":"1.0"},"canonical_sha256":"ef98c76d3081f2aa44392cdb48b4e4bb8ed44d1749cfe2b3f0734d08ef3ed2cb","source":{"kind":"arxiv","id":"1903.10982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10982","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10982v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10982","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"56MMO3JQQHZK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"56MMO3JQQHZKURBZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"56MMO3JQ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:56MMO3JQQHZKURBZFTNURNHEXO","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-03-26T16:11:47Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"e072609e35f35c11d105e5cec79dc71b9607d958117e09d61a4503282d2eb49c","abstract_canon_sha256":"226adb7249e8eb0c2ef4b9f2bc5675fa6c7db84f3f8cf5550332f106e267272c"},"schema_version":"1.0"},"canonical_sha256":"ef98c76d3081f2aa44392cdb48b4e4bb8ed44d1749cfe2b3f0734d08ef3ed2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.039007Z","signature_b64":"quzr2vHQA7XH8tGSO2XEJs4U+KPbup3esyvXSx6j/ce1oRTiG7ofpnQI8Iq4CrNJqRIU86cc7j58GL4O9Lg8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef98c76d3081f2aa44392cdb48b4e4bb8ed44d1749cfe2b3f0734d08ef3ed2cb","last_reissued_at":"2026-05-17T23:50:17.038326Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.038326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10982","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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ap4T6bcHY/UNfDlQCMOAsFn2VgPt9lc5DWLyvRNIRGmSxJUSaTzf6eChU4CXKo786K8klNYGzN2b8sxfIWTnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:06:10.626988Z"},"content_sha256":"a99bb21f0411f7c9dc42b13682ebc3719e1a94456b50c85580ef346dd09d25ef","schema_version":"1.0","event_id":"sha256:a99bb21f0411f7c9dc42b13682ebc3719e1a94456b50c85580ef346dd09d25ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:56MMO3JQQHZKURBZFTNURNHEXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix multiplication and universal scalability of the time on the Intel Scalable processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alexander Russkov, Lev Shchur","submitted_at":"2019-03-26T16:11:47Z","abstract_excerpt":"Matrix multiplication is one of the core operations in many areas of scientific computing. We present the results of the experiments with the matrix multiplication of the big size comparable with the big size of the onboard memory, which is 1.5 terabyte in our case. We run experiments on the computing board with two sockets and with two Intel Xeon Platinum 8164 processors, each with 26 cores and with multi-threading. The most interesting result of our study is the observation of the perfect scalability law of the matrix multiplication, and of the universality of this law."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10982","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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fC/tCzIdugAMAzDDT7zJkvWea1jKEIMwvbl5wjbHJ+xGrb7ti9exJNAJ7/0M/BOvJTxHgEFuR0fDPzznvZRIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:06:10.627344Z"},"content_sha256":"6d7ec44b9d9f504a622dc9be81c2d864786042f1e3fdc46d1c7e3e990ed51dc1","schema_version":"1.0","event_id":"sha256:6d7ec44b9d9f504a622dc9be81c2d864786042f1e3fdc46d1c7e3e990ed51dc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56MMO3JQQHZKURBZFTNURNHEXO/bundle.json","state_url":"https://pith.science/pith/56MMO3JQQHZKURBZFTNURNHEXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56MMO3JQQHZKURBZFTNURNHEXO/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-06-02T17:06:10Z","links":{"resolver":"https://pith.science/pith/56MMO3JQQHZKURBZFTNURNHEXO","bundle":"https://pith.science/pith/56MMO3JQQHZKURBZFTNURNHEXO/bundle.json","state":"https://pith.science/pith/56MMO3JQQHZKURBZFTNURNHEXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56MMO3JQQHZKURBZFTNURNHEXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:56MMO3JQQHZKURBZFTNURNHEXO","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":"226adb7249e8eb0c2ef4b9f2bc5675fa6c7db84f3f8cf5550332f106e267272c","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-03-26T16:11:47Z","title_canon_sha256":"e072609e35f35c11d105e5cec79dc71b9607d958117e09d61a4503282d2eb49c"},"schema_version":"1.0","source":{"id":"1903.10982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10982","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10982v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10982","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"56MMO3JQQHZK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"56MMO3JQQHZKURBZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"56MMO3JQ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6d7ec44b9d9f504a622dc9be81c2d864786042f1e3fdc46d1c7e3e990ed51dc1","target":"graph","created_at":"2026-05-17T23:50:17Z","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":"Matrix multiplication is one of the core operations in many areas of scientific computing. We present the results of the experiments with the matrix multiplication of the big size comparable with the big size of the onboard memory, which is 1.5 terabyte in our case. We run experiments on the computing board with two sockets and with two Intel Xeon Platinum 8164 processors, each with 26 cores and with multi-threading. The most interesting result of our study is the observation of the perfect scalability law of the matrix multiplication, and of the universality of this law.","authors_text":"Alexander Russkov, Lev Shchur","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-03-26T16:11:47Z","title":"Matrix multiplication and universal scalability of the time on the Intel Scalable processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10982","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:a99bb21f0411f7c9dc42b13682ebc3719e1a94456b50c85580ef346dd09d25ef","target":"record","created_at":"2026-05-17T23:50:17Z","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":"226adb7249e8eb0c2ef4b9f2bc5675fa6c7db84f3f8cf5550332f106e267272c","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-03-26T16:11:47Z","title_canon_sha256":"e072609e35f35c11d105e5cec79dc71b9607d958117e09d61a4503282d2eb49c"},"schema_version":"1.0","source":{"id":"1903.10982","kind":"arxiv","version":1}},"canonical_sha256":"ef98c76d3081f2aa44392cdb48b4e4bb8ed44d1749cfe2b3f0734d08ef3ed2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef98c76d3081f2aa44392cdb48b4e4bb8ed44d1749cfe2b3f0734d08ef3ed2cb","first_computed_at":"2026-05-17T23:50:17.038326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:17.038326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quzr2vHQA7XH8tGSO2XEJs4U+KPbup3esyvXSx6j/ce1oRTiG7ofpnQI8Iq4CrNJqRIU86cc7j58GL4O9Lg8Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:17.039007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a99bb21f0411f7c9dc42b13682ebc3719e1a94456b50c85580ef346dd09d25ef","sha256:6d7ec44b9d9f504a622dc9be81c2d864786042f1e3fdc46d1c7e3e990ed51dc1"],"state_sha256":"aa4d148680cf17e77bf6d1c928d4616934cb122eae07b36bdc773c5fc8ec43fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+46wmVv72o59BOFCBhnxRDCoTPSC2R0P7qv6LisaMZo/VwSr9IRn7x8a62QCik6x/rIuQxOvVPDzLmt5uKbrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:06:10.629399Z","bundle_sha256":"c3915b42b497f81dac05f8b32b72dcfe087e731ef40b9c616e77bd30aa95c180"}}