{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7IJFDU5LLSBX67UMGDLMVXRH5L","short_pith_number":"pith:7IJFDU5L","schema_version":"1.0","canonical_sha256":"fa1251d3ab5c837f7e8c30d6cade27eae9a3779207ad45803887bf1b08c25945","source":{"kind":"arxiv","id":"1604.02844","version":1},"attestation_state":"computed","paper":{"title":"Breadth First Search Vectorization on the Intel Xeon Phi","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Graham Riley, Mikel Lujan, Mireya Paredes","submitted_at":"2016-04-11T09:02:17Z","abstract_excerpt":"Breadth First Search (BFS) is a building block for graph algorithms and has recently been used for large scale analysis of information in a variety of applications including social networks, graph databases and web searching. Due to its importance, a number of different parallel programming models and architectures have been exploited to optimize the BFS. However, due to the irregular memory access patterns and the unstructured nature of the large graphs, its efficient parallelization is a challenge. The Xeon Phi is a massively parallel architecture available as an off-the-shelf accelerator, w"},"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":"1604.02844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2016-04-11T09:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"349494a88968add39aa3e96375822d27a28d2f1659a1982ed0b20c5480181573","abstract_canon_sha256":"2d2aba9944987e4a71f2b704f403476cee9a82a3917e373af9b9dec67acc6e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.025547Z","signature_b64":"/cxJlfKnMZLNbazpqQCHIWEDR5s6TDod2XUqZXdLV9760LHwB8qYyhJOwvKYNPapEbCmMqdFoR2VtdjR9LdADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa1251d3ab5c837f7e8c30d6cade27eae9a3779207ad45803887bf1b08c25945","last_reissued_at":"2026-05-18T01:17:22.024938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.024938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breadth First Search Vectorization on the Intel Xeon Phi","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Graham Riley, Mikel Lujan, Mireya Paredes","submitted_at":"2016-04-11T09:02:17Z","abstract_excerpt":"Breadth First Search (BFS) is a building block for graph algorithms and has recently been used for large scale analysis of information in a variety of applications including social networks, graph databases and web searching. Due to its importance, a number of different parallel programming models and architectures have been exploited to optimize the BFS. However, due to the irregular memory access patterns and the unstructured nature of the large graphs, its efficient parallelization is a challenge. The Xeon Phi is a massively parallel architecture available as an off-the-shelf accelerator, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02844","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":"1604.02844","created_at":"2026-05-18T01:17:22.025018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02844v1","created_at":"2026-05-18T01:17:22.025018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02844","created_at":"2026-05-18T01:17:22.025018+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IJFDU5LLSBX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IJFDU5LLSBX67UM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IJFDU5L","created_at":"2026-05-18T12:30:04.600751+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/7IJFDU5LLSBX67UMGDLMVXRH5L","json":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L.json","graph_json":"https://pith.science/api/pith-number/7IJFDU5LLSBX67UMGDLMVXRH5L/graph.json","events_json":"https://pith.science/api/pith-number/7IJFDU5LLSBX67UMGDLMVXRH5L/events.json","paper":"https://pith.science/paper/7IJFDU5L"},"agent_actions":{"view_html":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L","download_json":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L.json","view_paper":"https://pith.science/paper/7IJFDU5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02844&json=true","fetch_graph":"https://pith.science/api/pith-number/7IJFDU5LLSBX67UMGDLMVXRH5L/graph.json","fetch_events":"https://pith.science/api/pith-number/7IJFDU5LLSBX67UMGDLMVXRH5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L/action/storage_attestation","attest_author":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L/action/author_attestation","sign_citation":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L/action/citation_signature","submit_replication":"https://pith.science/pith/7IJFDU5LLSBX67UMGDLMVXRH5L/action/replication_record"}},"created_at":"2026-05-18T01:17:22.025018+00:00","updated_at":"2026-05-18T01:17:22.025018+00:00"}