{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EQRBDWTTLNYHUHC2AXUFZS3P7C","short_pith_number":"pith:EQRBDWTT","canonical_record":{"source":{"id":"2111.09947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-18T21:03:00Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"bb92a0490bda921365b9ad7662b6a44208c49878bcb8849ad00eb5f577426371","abstract_canon_sha256":"c1b3b537b5d1cd2a2130722e03ba54bae54237ce9ae838b5928a87be71828ea5"},"schema_version":"1.0"},"canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","source":{"kind":"arxiv","id":"2111.09947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09947","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09947v1","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09947","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"EQRBDWTTLNYH","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_16","alias_value":"EQRBDWTTLNYHUHC2","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_8","alias_value":"EQRBDWTT","created_at":"2026-07-05T03:33:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EQRBDWTTLNYHUHC2AXUFZS3P7C","target":"record","payload":{"canonical_record":{"source":{"id":"2111.09947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-18T21:03:00Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"bb92a0490bda921365b9ad7662b6a44208c49878bcb8849ad00eb5f577426371","abstract_canon_sha256":"c1b3b537b5d1cd2a2130722e03ba54bae54237ce9ae838b5928a87be71828ea5"},"schema_version":"1.0"},"canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:26.117067Z","signature_b64":"swIWULKAw4N592gFU8L6l8au680YMFZJ3DsvhqiBO1Z8G3VsoWVEQV33FFEFqsu4BIYLAjnDTJstmB5RYw5dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","last_reissued_at":"2026-07-05T03:33:26.116573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:26.116573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.09947","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-07-05T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+irL84YmZg+rlma/KfvuFtiEzeuKTPBihnPlWRzZR+T6XnhOJj1QV0Ezj+DgoATxEB7y1vzIWuide1lTroaoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:55:10.940834Z"},"content_sha256":"5986e1c73e5db3d0202db7691bbe31025967fa30974bcc2710badc0cd46ec57d","schema_version":"1.0","event_id":"sha256:5986e1c73e5db3d0202db7691bbe31025967fa30974bcc2710badc0cd46ec57d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EQRBDWTTLNYHUHC2AXUFZS3P7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Algorithms for Masked Sparse Matrix-Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.DC","authors_text":"Aydin Buluc, Israt Nisa, Oguz Selvitopi, Sr{\\dj}an Milakovi\\'c, Zoran Budimli\\'c","submitted_at":"2021-11-18T21:03:00Z","abstract_excerpt":"Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is known as Masked SpGEMM since a subset of the output entries is considered to be \"masked out\". Existing algorithms for Masked SpGEMM usually do not consider mask as part of multiplication and either first compute a regular SpGEMM followed by masking"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09947","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.09947/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-05T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9akc4QR5VFVUG46tER4TGkf3sNK3iSD42cQqKqKd56TebaY9RrzGwmNzOYk0bgj77ICHIhwO0FXXq/HiHFKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:55:10.941619Z"},"content_sha256":"80c1d8b590026658e38d8a88d55e92e407d5fce6b166d377fc163961c890d8bc","schema_version":"1.0","event_id":"sha256:80c1d8b590026658e38d8a88d55e92e407d5fce6b166d377fc163961c890d8bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/bundle.json","state_url":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/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-08-04T15:55:10Z","links":{"resolver":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C","bundle":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/bundle.json","state":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EQRBDWTTLNYHUHC2AXUFZS3P7C","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":"c1b3b537b5d1cd2a2130722e03ba54bae54237ce9ae838b5928a87be71828ea5","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-18T21:03:00Z","title_canon_sha256":"bb92a0490bda921365b9ad7662b6a44208c49878bcb8849ad00eb5f577426371"},"schema_version":"1.0","source":{"id":"2111.09947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09947","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09947v1","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09947","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"EQRBDWTTLNYH","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_16","alias_value":"EQRBDWTTLNYHUHC2","created_at":"2026-07-05T03:33:26Z"},{"alias_kind":"pith_short_8","alias_value":"EQRBDWTT","created_at":"2026-07-05T03:33:26Z"}],"graph_snapshots":[{"event_id":"sha256:80c1d8b590026658e38d8a88d55e92e407d5fce6b166d377fc163961c890d8bc","target":"graph","created_at":"2026-07-05T03:33:26Z","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/2111.09947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is known as Masked SpGEMM since a subset of the output entries is considered to be \"masked out\". Existing algorithms for Masked SpGEMM usually do not consider mask as part of multiplication and either first compute a regular SpGEMM followed by masking","authors_text":"Aydin Buluc, Israt Nisa, Oguz Selvitopi, Sr{\\dj}an Milakovi\\'c, Zoran Budimli\\'c","cross_cats":["cs.DS","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-18T21:03:00Z","title":"Parallel Algorithms for Masked Sparse Matrix-Matrix Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09947","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:5986e1c73e5db3d0202db7691bbe31025967fa30974bcc2710badc0cd46ec57d","target":"record","created_at":"2026-07-05T03:33:26Z","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":"c1b3b537b5d1cd2a2130722e03ba54bae54237ce9ae838b5928a87be71828ea5","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-18T21:03:00Z","title_canon_sha256":"bb92a0490bda921365b9ad7662b6a44208c49878bcb8849ad00eb5f577426371"},"schema_version":"1.0","source":{"id":"2111.09947","kind":"arxiv","version":1}},"canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","first_computed_at":"2026-07-05T03:33:26.116573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:33:26.116573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swIWULKAw4N592gFU8L6l8au680YMFZJ3DsvhqiBO1Z8G3VsoWVEQV33FFEFqsu4BIYLAjnDTJstmB5RYw5dCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:33:26.117067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.09947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5986e1c73e5db3d0202db7691bbe31025967fa30974bcc2710badc0cd46ec57d","sha256:80c1d8b590026658e38d8a88d55e92e407d5fce6b166d377fc163961c890d8bc"],"state_sha256":"a3d6a877e2ca12e8cc926aa0fd44172db1cb18c809bea2adb55300fb1618279e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzULeOUJH6pWN9O50BVItjnTq8M++z4DOO9msCaLxUBhSZW3lOsEx5MT9/SDa2ihXxZ5iP7AYzKp2wXIXaD6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:55:10.949785Z","bundle_sha256":"4a1d0e83a0176efd8979b2838a70da6f84305e207904f131cb9ea6e1ce9241a6"}}