{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TBXCBLTUMNY2334VBA5LKDXNIJ","short_pith_number":"pith:TBXCBLTU","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"},"canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","source":{"kind":"arxiv","id":"1503.07241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07241","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07241v1","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07241","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"TBXCBLTUMNY2","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBXCBLTUMNY2334V","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBXCBLTU","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TBXCBLTUMNY2334VBA5LKDXNIJ","target":"record","payload":{"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"},"canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","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"},"source_kind":"arxiv","source_id":"1503.07241","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-18T02:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90aB7cJqVc8uZ86fGtwqpMoaMKFzlGRna13NIaVEDHt+T+PPYV+AlptzN84DNMA0iqPpbb2xWQY9AB0N76QQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:14:43.692383Z"},"content_sha256":"25c0f590136e9e4452924603bdbf4b588f03f9a3eea5bcca3286256a717736b6","schema_version":"1.0","event_id":"sha256:25c0f590136e9e4452924603bdbf4b588f03f9a3eea5bcca3286256a717736b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TBXCBLTUMNY2334VBA5LKDXNIJ","target":"graph","payload":{"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"},"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-18T02:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vs7xn+aiy/aMpoYNijeQ1wPqaR066sOlvtQnVg166awmLD4UXYR9ITu2gQo930aHUV7yyQV0psqFGokbRCKFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:14:43.692728Z"},"content_sha256":"18e816c70ee30a3b950bbe7e8d4d2e719b6c88db5249acae5389afa2242175c4","schema_version":"1.0","event_id":"sha256:18e816c70ee30a3b950bbe7e8d4d2e719b6c88db5249acae5389afa2242175c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/bundle.json","state_url":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/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-04T04:14:43Z","links":{"resolver":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ","bundle":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/bundle.json","state":"https://pith.science/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBXCBLTUMNY2334VBA5LKDXNIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TBXCBLTUMNY2334VBA5LKDXNIJ","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":"2a460a818b1d09010520bb583bf18609ca3fe6a336c1b552b70bb8ec811e6b34","cross_cats_sorted":["cs.DB","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-25T00:10:50Z","title_canon_sha256":"5d25f49ac65053842b28827888f0fe054075f13b4f89c85fa5b471d8cded315a"},"schema_version":"1.0","source":{"id":"1503.07241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07241","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07241v1","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07241","created_at":"2026-05-18T02:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"TBXCBLTUMNY2","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBXCBLTUMNY2334V","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBXCBLTU","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:18e816c70ee30a3b950bbe7e8d4d2e719b6c88db5249acae5389afa2242175c4","target":"graph","created_at":"2026-05-18T02:20:27Z","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":"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","authors_text":"Dipankar Das, Md Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Pradeep Dubey, Satya Gautam Vadlamudi, Subramanya R Dulloor","cross_cats":["cs.DB","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-25T00:10:50Z","title":"GraphMat: High performance graph analytics made productive"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07241","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:25c0f590136e9e4452924603bdbf4b588f03f9a3eea5bcca3286256a717736b6","target":"record","created_at":"2026-05-18T02:20:27Z","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":"2a460a818b1d09010520bb583bf18609ca3fe6a336c1b552b70bb8ec811e6b34","cross_cats_sorted":["cs.DB","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-25T00:10:50Z","title_canon_sha256":"5d25f49ac65053842b28827888f0fe054075f13b4f89c85fa5b471d8cded315a"},"schema_version":"1.0","source":{"id":"1503.07241","kind":"arxiv","version":1}},"canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"986e20ae746371adef95083ab50eed426d5cd29e72bf9dbcb86e98a17db7d31a","first_computed_at":"2026-05-18T02:20:27.946820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:27.946820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kS+95nswE6JcvxVHOnW/qNG7zUlciNMNr2VvRqUYRCYu4SFzw9f5J9ANXB2qIKqewtxaUqGpYOHttFwhlcqQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:27.947484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c0f590136e9e4452924603bdbf4b588f03f9a3eea5bcca3286256a717736b6","sha256:18e816c70ee30a3b950bbe7e8d4d2e719b6c88db5249acae5389afa2242175c4"],"state_sha256":"eba9d306bcdf0cdd91de52127fe2e5f3099c0bac94316aaaf914d4716519e17a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XChkN5QmdsR3mCQ+2SRUycenSqiN6SzihO/DKVi4tJdPvnp4hi3nLMeQkpdmwN8xU7ovhZh2Xlco6e+3woRgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:14:43.694654Z","bundle_sha256":"fb210c1abf171c8cc8bc6f7fd906e0b276d829f5973638324751f572827884f7"}}