{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EQRBDWTTLNYHUHC2AXUFZS3P7C","short_pith_number":"pith:EQRBDWTT","schema_version":"1.0","canonical_sha256":"242211da735b707a1c5a05e85ccb6ff8bcd7c19b4a50b6aaecac6eca2a9b6b75","source":{"kind":"arxiv","id":"2111.09947","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.09947","created_at":"2026-07-05T03:33:26.116631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.09947v1","created_at":"2026-07-05T03:33:26.116631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09947","created_at":"2026-07-05T03:33:26.116631+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQRBDWTTLNYH","created_at":"2026-07-05T03:33:26.116631+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQRBDWTTLNYHUHC2","created_at":"2026-07-05T03:33:26.116631+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQRBDWTT","created_at":"2026-07-05T03:33:26.116631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C","json":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C.json","graph_json":"https://pith.science/api/pith-number/EQRBDWTTLNYHUHC2AXUFZS3P7C/graph.json","events_json":"https://pith.science/api/pith-number/EQRBDWTTLNYHUHC2AXUFZS3P7C/events.json","paper":"https://pith.science/paper/EQRBDWTT"},"agent_actions":{"view_html":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C","download_json":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C.json","view_paper":"https://pith.science/paper/EQRBDWTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.09947&json=true","fetch_graph":"https://pith.science/api/pith-number/EQRBDWTTLNYHUHC2AXUFZS3P7C/graph.json","fetch_events":"https://pith.science/api/pith-number/EQRBDWTTLNYHUHC2AXUFZS3P7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/action/storage_attestation","attest_author":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/action/author_attestation","sign_citation":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/action/citation_signature","submit_replication":"https://pith.science/pith/EQRBDWTTLNYHUHC2AXUFZS3P7C/action/replication_record"}},"created_at":"2026-07-05T03:33:26.116631+00:00","updated_at":"2026-07-05T03:33:26.116631+00:00"}