{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TRWSPXQXRMEHFLGVLAXP7HEBTC","short_pith_number":"pith:TRWSPXQX","schema_version":"1.0","canonical_sha256":"9c6d27de178b0872acd5582eff9c81989679c557bf73e1aa511cabeb30d10cee","source":{"kind":"arxiv","id":"1607.06541","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.06541","created_at":"2026-05-18T00:55:20.967258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06541v1","created_at":"2026-05-18T00:55:20.967258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06541","created_at":"2026-05-18T00:55:20.967258+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRWSPXQXRMEH","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRWSPXQXRMEHFLGV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRWSPXQX","created_at":"2026-05-18T12:30:46.583412+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/TRWSPXQXRMEHFLGVLAXP7HEBTC","json":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC.json","graph_json":"https://pith.science/api/pith-number/TRWSPXQXRMEHFLGVLAXP7HEBTC/graph.json","events_json":"https://pith.science/api/pith-number/TRWSPXQXRMEHFLGVLAXP7HEBTC/events.json","paper":"https://pith.science/paper/TRWSPXQX"},"agent_actions":{"view_html":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC","download_json":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC.json","view_paper":"https://pith.science/paper/TRWSPXQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06541&json=true","fetch_graph":"https://pith.science/api/pith-number/TRWSPXQXRMEHFLGVLAXP7HEBTC/graph.json","fetch_events":"https://pith.science/api/pith-number/TRWSPXQXRMEHFLGVLAXP7HEBTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/action/storage_attestation","attest_author":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/action/author_attestation","sign_citation":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/action/citation_signature","submit_replication":"https://pith.science/pith/TRWSPXQXRMEHFLGVLAXP7HEBTC/action/replication_record"}},"created_at":"2026-05-18T00:55:20.967258+00:00","updated_at":"2026-05-18T00:55:20.967258+00:00"}