{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TRWSPXQXRMEHFLGVLAXP7HEBTC","short_pith_number":"pith:TRWSPXQX","canonical_record":{"source":{"id":"1607.06541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:22:44Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"f3ca5546c41e956a3ef3edbf4d9a91ab47f2cbca7c64c589a5f424ca9a40d0f2","abstract_canon_sha256":"2f5825be79441c9af3640701bdf60209e19e226ef01482077333ef68be82e045"},"schema_version":"1.0"},"canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","source":{"kind":"arxiv","id":"1607.06541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06541","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06541v1","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06541","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"TRWSPXQXRMEH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRWSPXQXRMEHFLGV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRWSPXQX","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TRWSPXQXRMEHFLGVLAXP7HEBTC","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:22:44Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"f3ca5546c41e956a3ef3edbf4d9a91ab47f2cbca7c64c589a5f424ca9a40d0f2","abstract_canon_sha256":"2f5825be79441c9af3640701bdf60209e19e226ef01482077333ef68be82e045"},"schema_version":"1.0"},"canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.967885Z","signature_b64":"wAbIPlrWBIxUhzSisGBlfeMbnidtO0H66hQ0xYJG/oJVQ/9gys9K0xF2uHLAB0T5n4N5QkYN8lOfk2iWnAspBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","last_reissued_at":"2026-05-18T00:55:20.967144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.967144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06541","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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FY4BwU60pxrQopzcikSgaKQ0YV9/pwVeDHuhi2a/zsdCV0WFtHxExOfy5eSTEbqJZQbopMVN6L8RC56SKm9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:59.475585Z"},"content_sha256":"6274d22e03e7281f38899cf1bd4a236d85347557a5313f6532373871713c86d5","schema_version":"1.0","event_id":"sha256:6274d22e03e7281f38899cf1bd4a236d85347557a5313f6532373871713c86d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TRWSPXQXRMEHFLGVLAXP7HEBTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Graph Processor Architecture, Prototype System, and Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Alexei Lomakin, Jeremy Kepner, Vitaliy Gleyzer, William S. Song","submitted_at":"2016-07-22T02:22:44Z","abstract_excerpt":"Graph algorithms are increasingly used in applications that exploit large databases. However, conventional processor architectures are inadequate for handling the throughput and memory requirements of graph computation. Lincoln Laboratory's graph-processor architecture represents a rethinking of parallel architectures for graph problems. Our processor utilizes innovations that include a sparse matrix-based graph instruction set, a cacheless memory system, accelerator-based architecture, a systolic sorter, high-bandwidth multi-dimensional toroidal communication network, and randomized communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06541","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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPnzjV5xu9z8TCrTqh3xz/6ADn5+dMsJoJtyidvgqOGzXUa4+NbB6qny1zz7k4SZSnZjrOle0J57rgkWUWz3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:59.476130Z"},"content_sha256":"0b2d72eeea2406d69d0a85437d78b583371b35ced39a0713c8ee26bad6d130ec","schema_version":"1.0","event_id":"sha256:0b2d72eeea2406d69d0a85437d78b583371b35ced39a0713c8ee26bad6d130ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/bundle.json","state_url":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/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-06T09:08:59Z","links":{"resolver":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC","bundle":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/bundle.json","state":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TRWSPXQXRMEHFLGVLAXP7HEBTC","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":"2f5825be79441c9af3640701bdf60209e19e226ef01482077333ef68be82e045","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:22:44Z","title_canon_sha256":"f3ca5546c41e956a3ef3edbf4d9a91ab47f2cbca7c64c589a5f424ca9a40d0f2"},"schema_version":"1.0","source":{"id":"1607.06541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06541","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06541v1","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06541","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"TRWSPXQXRMEH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRWSPXQXRMEHFLGV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRWSPXQX","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:0b2d72eeea2406d69d0a85437d78b583371b35ced39a0713c8ee26bad6d130ec","target":"graph","created_at":"2026-05-18T00:55:20Z","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":"Graph algorithms are increasingly used in applications that exploit large databases. However, conventional processor architectures are inadequate for handling the throughput and memory requirements of graph computation. Lincoln Laboratory's graph-processor architecture represents a rethinking of parallel architectures for graph problems. Our processor utilizes innovations that include a sparse matrix-based graph instruction set, a cacheless memory system, accelerator-based architecture, a systolic sorter, high-bandwidth multi-dimensional toroidal communication network, and randomized communica","authors_text":"Alexei Lomakin, Jeremy Kepner, Vitaliy Gleyzer, William S. Song","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:22:44Z","title":"Novel Graph Processor Architecture, Prototype System, and Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06541","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:6274d22e03e7281f38899cf1bd4a236d85347557a5313f6532373871713c86d5","target":"record","created_at":"2026-05-18T00:55:20Z","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":"2f5825be79441c9af3640701bdf60209e19e226ef01482077333ef68be82e045","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:22:44Z","title_canon_sha256":"f3ca5546c41e956a3ef3edbf4d9a91ab47f2cbca7c64c589a5f424ca9a40d0f2"},"schema_version":"1.0","source":{"id":"1607.06541","kind":"arxiv","version":1}},"canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","first_computed_at":"2026-05-18T00:55:20.967144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:20.967144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wAbIPlrWBIxUhzSisGBlfeMbnidtO0H66hQ0xYJG/oJVQ/9gys9K0xF2uHLAB0T5n4N5QkYN8lOfk2iWnAspBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:20.967885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6274d22e03e7281f38899cf1bd4a236d85347557a5313f6532373871713c86d5","sha256:0b2d72eeea2406d69d0a85437d78b583371b35ced39a0713c8ee26bad6d130ec"],"state_sha256":"da6151357facb6cecc22364bf2230411488bcb23666277d3506837931dcc05cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OH8WtYuH0RAUJtxP2/ssd7pIgvv3POZE5kJvjn88YNRANt6of5j3lrZpziPmnMqVLHns4Qhpx0GUjUQZcC+cCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:08:59.479134Z","bundle_sha256":"98ffbe6c8df24ea6b8f27a05462b49030f43ea634224c270f8974c0c01035414"}}