{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TBXCBLTUMNY2334VBA5LKDXNIJ","short_pith_number":"pith:TBXCBLTU","schema_version":"1.0","canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","source":{"kind":"arxiv","id":"1503.07241","version":1},"attestation_state":"computed","paper":{"title":"GraphMat: High performance graph analytics made productive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.PF","authors_text":"Dipankar Das, Md Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Pradeep Dubey, Satya Gautam Vadlamudi, Subramanya R Dulloor","submitted_at":"2015-03-25T00:10:50Z","abstract_excerpt":"Given the growing importance of large-scale graph analytics, there is a need to improve the performance of graph analysis frameworks without compromising on productivity. GraphMat is our solution to bridge this gap between a user-friendly graph analytics framework and native, hand-optimized code. GraphMat functions by taking vertex programs and mapping them to high performance sparse matrix operations in the backend. We get the productivity benefits of a vertex programming framework without sacrificing performance. GraphMat is in C++, and we have been able to write a diverse set of graph algor"},"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":"1503.07241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-25T00:10:50Z","cross_cats_sorted":["cs.DB","cs.DC"],"title_canon_sha256":"5d25f49ac65053842b28827888f0fe054075f13b4f89c85fa5b471d8cded315a","abstract_canon_sha256":"2a460a818b1d09010520bb583bf18609ca3fe6a336c1b552b70bb8ec811e6b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:27.947484Z","signature_b64":"kS+95nswE6JcvxVHOnW/qNG7zUlciNMNr2VvRqUYRCYu4SFzw9f5J9ANXB2qIKqewtxaUqGpYOHttFwhlcqQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","last_reissued_at":"2026-05-18T02:20:27.946820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:27.946820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphMat: High performance graph analytics made productive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.PF","authors_text":"Dipankar Das, Md Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Pradeep Dubey, Satya Gautam Vadlamudi, Subramanya R Dulloor","submitted_at":"2015-03-25T00:10:50Z","abstract_excerpt":"Given the growing importance of large-scale graph analytics, there is a need to improve the performance of graph analysis frameworks without compromising on productivity. GraphMat is our solution to bridge this gap between a user-friendly graph analytics framework and native, hand-optimized code. GraphMat functions by taking vertex programs and mapping them to high performance sparse matrix operations in the backend. We get the productivity benefits of a vertex programming framework without sacrificing performance. GraphMat is in C++, and we have been able to write a diverse set of graph algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07241","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.07241","created_at":"2026-05-18T02:20:27.946926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07241v1","created_at":"2026-05-18T02:20:27.946926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07241","created_at":"2026-05-18T02:20:27.946926+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBXCBLTUMNY2","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBXCBLTUMNY2334V","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBXCBLTU","created_at":"2026-05-18T12:29:42.218222+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/TBXCBLTUMNY2334VBA5LKDXNIJ","json":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ.json","graph_json":"https://pith.science/api/pith-number/TBXCBLTUMNY2334VBA5LKDXNIJ/graph.json","events_json":"https://pith.science/api/pith-number/TBXCBLTUMNY2334VBA5LKDXNIJ/events.json","paper":"https://pith.science/paper/TBXCBLTU"},"agent_actions":{"view_html":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ","download_json":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ.json","view_paper":"https://pith.science/paper/TBXCBLTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07241&json=true","fetch_graph":"https://pith.science/api/pith-number/TBXCBLTUMNY2334VBA5LKDXNIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TBXCBLTUMNY2334VBA5LKDXNIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/action/storage_attestation","attest_author":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/action/author_attestation","sign_citation":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/action/citation_signature","submit_replication":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/action/replication_record"}},"created_at":"2026-05-18T02:20:27.946926+00:00","updated_at":"2026-05-18T02:20:27.946926+00:00"}