{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4QYRHGEO4VGFVMKQCQX6DWNO6A","short_pith_number":"pith:4QYRHGEO","canonical_record":{"source":{"id":"1210.0461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T16:35:51Z","cross_cats_sorted":[],"title_canon_sha256":"a16fd96acb6e43a95f739c315b29e4463604df57a8c334c3ff7ecc2800b40bae","abstract_canon_sha256":"f826c9d6a4fc0428b33eccdf05da5117d9f1685acf4b8713a8b28e39870440ef"},"schema_version":"1.0"},"canonical_sha256":"e43113988ee54c5ab150142fe1d9aef02449b34b6719134daa41bd6908ac1687","source":{"kind":"arxiv","id":"1210.0461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0461","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0461v2","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0461","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"4QYRHGEO4VGF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4QYRHGEO4VGFVMKQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4QYRHGEO","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4QYRHGEO4VGFVMKQCQX6DWNO6A","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T16:35:51Z","cross_cats_sorted":[],"title_canon_sha256":"a16fd96acb6e43a95f739c315b29e4463604df57a8c334c3ff7ecc2800b40bae","abstract_canon_sha256":"f826c9d6a4fc0428b33eccdf05da5117d9f1685acf4b8713a8b28e39870440ef"},"schema_version":"1.0"},"canonical_sha256":"e43113988ee54c5ab150142fe1d9aef02449b34b6719134daa41bd6908ac1687","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:35.820612Z","signature_b64":"P69vYIPXiYXz1CnN37QgNtxaLdofKJyzt8v7QLpDlrydVxPdRuz3xYD7crpdGr9dAtMbf8Yk0OkjgD7EzYZmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e43113988ee54c5ab150142fe1d9aef02449b34b6719134daa41bd6908ac1687","last_reissued_at":"2026-05-18T03:40:35.819965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:35.819965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0461","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-05-18T03:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUrZ273pzxvAJAMkqYvey5Znrjcn5IBZRB9NwYmp4SaOVkmqmzdHmgg1Md2b4SwOjAIv+Ls/PqabCyWeliH9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:55:17.235167Z"},"content_sha256":"cd6315800757ff3aa6c4e237d1ec860347c8c4b6a5cd1d716c5189bf92cb3354","schema_version":"1.0","event_id":"sha256:cd6315800757ff3aa6c4e237d1ec860347c8c4b6a5cd1d716c5189bf92cb3354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4QYRHGEO4VGFVMKQCQX6DWNO6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Parallelizing Matrix Multiplication by the Column-Row Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh","submitted_at":"2012-10-01T16:35:51Z","abstract_excerpt":"We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for \"consistent\" parallel processing of sparse outer products (column-row vector products) over several processors, in a communication-avoiding setting where each processor has a copy of the input. The method is consistent in the sense that a given output entry is always assigned to the same processor independently of the specific structure of the outer product. We show guarantees on the work done b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0461","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":""},"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:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeD43x4OCUqU+TwIQvdF9e/6RS5jziT+xAMsN2AtIANfj7nJUSDPkjPy5vqTtlD1ce+G/f6XQNfODxzzkwedBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:55:17.235826Z"},"content_sha256":"728ecabc9ab1d88b5a966fa2aebc5f8ce2fac80227ace97de8942cfa0ac9f72d","schema_version":"1.0","event_id":"sha256:728ecabc9ab1d88b5a966fa2aebc5f8ce2fac80227ace97de8942cfa0ac9f72d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/bundle.json","state_url":"https://pith.science/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/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-06T03:55:17Z","links":{"resolver":"https://pith.science/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A","bundle":"https://pith.science/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/bundle.json","state":"https://pith.science/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QYRHGEO4VGFVMKQCQX6DWNO6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4QYRHGEO4VGFVMKQCQX6DWNO6A","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":"f826c9d6a4fc0428b33eccdf05da5117d9f1685acf4b8713a8b28e39870440ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T16:35:51Z","title_canon_sha256":"a16fd96acb6e43a95f739c315b29e4463604df57a8c334c3ff7ecc2800b40bae"},"schema_version":"1.0","source":{"id":"1210.0461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0461","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0461v2","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0461","created_at":"2026-05-18T03:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"4QYRHGEO4VGF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4QYRHGEO4VGFVMKQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4QYRHGEO","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:728ecabc9ab1d88b5a966fa2aebc5f8ce2fac80227ace97de8942cfa0ac9f72d","target":"graph","created_at":"2026-05-18T03:40:35Z","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":"We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for \"consistent\" parallel processing of sparse outer products (column-row vector products) over several processors, in a communication-avoiding setting where each processor has a copy of the input. The method is consistent in the sense that a given output entry is always assigned to the same processor independently of the specific structure of the outer product. We show guarantees on the work done b","authors_text":"Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T16:35:51Z","title":"On Parallelizing Matrix Multiplication by the Column-Row Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0461","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:cd6315800757ff3aa6c4e237d1ec860347c8c4b6a5cd1d716c5189bf92cb3354","target":"record","created_at":"2026-05-18T03:40:35Z","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":"f826c9d6a4fc0428b33eccdf05da5117d9f1685acf4b8713a8b28e39870440ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T16:35:51Z","title_canon_sha256":"a16fd96acb6e43a95f739c315b29e4463604df57a8c334c3ff7ecc2800b40bae"},"schema_version":"1.0","source":{"id":"1210.0461","kind":"arxiv","version":2}},"canonical_sha256":"e43113988ee54c5ab150142fe1d9aef02449b34b6719134daa41bd6908ac1687","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e43113988ee54c5ab150142fe1d9aef02449b34b6719134daa41bd6908ac1687","first_computed_at":"2026-05-18T03:40:35.819965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:35.819965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P69vYIPXiYXz1CnN37QgNtxaLdofKJyzt8v7QLpDlrydVxPdRuz3xYD7crpdGr9dAtMbf8Yk0OkjgD7EzYZmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:35.820612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd6315800757ff3aa6c4e237d1ec860347c8c4b6a5cd1d716c5189bf92cb3354","sha256:728ecabc9ab1d88b5a966fa2aebc5f8ce2fac80227ace97de8942cfa0ac9f72d"],"state_sha256":"439fcf01ffda00a937a9a2bbe920424a2a81546c3581d464f896aaf676e6ebb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q0BIgS3iF8bz8IRalpxH20gGfzTaE5JiHJbyXo5J4fJpEAE/I53c2T46c/weuk95hSr5VlVdrwU5RwNu3mxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:55:17.239522Z","bundle_sha256":"55b04421096a9091aaa51133da94fafe3690c8cce755e359e50ba704b12fad3a"}}