{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EQIJK7EOUYPL7KFAKWCRTYZXPA","short_pith_number":"pith:EQIJK7EO","schema_version":"1.0","canonical_sha256":"2410957c8ea61ebfa8a0558519e337781214c6d77141f98b4638d575eec506de","source":{"kind":"arxiv","id":"1408.1605","version":2},"attestation_state":"computed","paper":{"title":"Parallel Distributed Breadth First Search on the Kepler Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Enrico Mastrostefano, Massimo Bernaschi, Mauro Bisson","submitted_at":"2014-08-07T14:34:15Z","abstract_excerpt":"We present the results obtained by using an evolution of our CUDA-based solution for the exploration, via a Breadth First Search, of large graphs. This latest version exploits at its best the features of the Kepler architecture and relies on a combination of techniques to reduce both the number of communications among the GPUs and the amount of exchanged data. The final result is a code that can visit more than 800 billion edges in a second by using a cluster equipped with 4096 Tesla K20X GPUs."},"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":"1408.1605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-07T14:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"ce48351f2c9e780ffdda3a3e76e1b2450c0fe49c22e8201a141ce413916d8788","abstract_canon_sha256":"4a8f7e8319cfefc660e1e3059b61ab3c652ebc6f8620aaa57b4ed05dd516e918"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:40.021274Z","signature_b64":"A5o4dsnTJtjoliQvc1X5agTJ/a0njhHfrFXPEVC4GDbuVvphe6EoH17KYYu8xESOIQc2vDM/hz2PjX3EGwf1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2410957c8ea61ebfa8a0558519e337781214c6d77141f98b4638d575eec506de","last_reissued_at":"2026-05-18T02:30:40.020867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:40.020867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Distributed Breadth First Search on the Kepler Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Enrico Mastrostefano, Massimo Bernaschi, Mauro Bisson","submitted_at":"2014-08-07T14:34:15Z","abstract_excerpt":"We present the results obtained by using an evolution of our CUDA-based solution for the exploration, via a Breadth First Search, of large graphs. This latest version exploits at its best the features of the Kepler architecture and relies on a combination of techniques to reduce both the number of communications among the GPUs and the amount of exchanged data. The final result is a code that can visit more than 800 billion edges in a second by using a cluster equipped with 4096 Tesla K20X GPUs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1605","kind":"arxiv","version":2},"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":"1408.1605","created_at":"2026-05-18T02:30:40.020921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1605v2","created_at":"2026-05-18T02:30:40.020921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1605","created_at":"2026-05-18T02:30:40.020921+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQIJK7EOUYPL","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQIJK7EOUYPL7KFA","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQIJK7EO","created_at":"2026-05-18T12:28:28.263976+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/EQIJK7EOUYPL7KFAKWCRTYZXPA","json":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA.json","graph_json":"https://pith.science/api/pith-number/EQIJK7EOUYPL7KFAKWCRTYZXPA/graph.json","events_json":"https://pith.science/api/pith-number/EQIJK7EOUYPL7KFAKWCRTYZXPA/events.json","paper":"https://pith.science/paper/EQIJK7EO"},"agent_actions":{"view_html":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA","download_json":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA.json","view_paper":"https://pith.science/paper/EQIJK7EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1605&json=true","fetch_graph":"https://pith.science/api/pith-number/EQIJK7EOUYPL7KFAKWCRTYZXPA/graph.json","fetch_events":"https://pith.science/api/pith-number/EQIJK7EOUYPL7KFAKWCRTYZXPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA/action/storage_attestation","attest_author":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA/action/author_attestation","sign_citation":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA/action/citation_signature","submit_replication":"https://pith.science/pith/EQIJK7EOUYPL7KFAKWCRTYZXPA/action/replication_record"}},"created_at":"2026-05-18T02:30:40.020921+00:00","updated_at":"2026-05-18T02:30:40.020921+00:00"}