{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CVXFVVQWRCAFWOEWHZUUTR2RLB","short_pith_number":"pith:CVXFVVQW","schema_version":"1.0","canonical_sha256":"156e5ad61688805b38963e6949c7515848d32168361709ebf0bb014f5672ef10","source":{"kind":"arxiv","id":"1210.8242","version":1},"attestation_state":"computed","paper":{"title":"Pipelined Workflow in Hybrid MPI/Pthread runtime for External Memory Graph Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Sandeep Gupta","submitted_at":"2012-10-31T06:29:10Z","abstract_excerpt":"Graph construction from a given set of edges is a data-intensive operator that appears in social network analysis, ontology enabled databases, and, other analytics processing. The operator represents an edge list to compressed sparse row (CSR) representation (or sometimes in adjacency list, or as clustered B-Tree storage). In this work, we show how to scale CSR construction to massive scale on SSD-enabled supercomputers such as Gordon using pipelined processing. We develop several abstraction and operations for external memory and parallel edge list and integer array processing that are utiliz"},"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":"1210.8242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-31T06:29:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2feae0728a96a8de9cfc83842cac2bbe2b1846fa511a0a91ca3570b0f732f5ff","abstract_canon_sha256":"e3e9176e20a917f1ceb5cab24f12941f3a47b8fe1bb7b8587fd4e3cd1dc11b1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:55.583709Z","signature_b64":"G9Y/+EM5bZn2r4z+KCDKYZGvRzLgBct4Ht7CjaOqN/3qg2r9OqmbKit+mSG5MhBKUOjp0USYzCYkJboSnMvBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"156e5ad61688805b38963e6949c7515848d32168361709ebf0bb014f5672ef10","last_reissued_at":"2026-05-18T03:41:55.583010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:55.583010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pipelined Workflow in Hybrid MPI/Pthread runtime for External Memory Graph Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Sandeep Gupta","submitted_at":"2012-10-31T06:29:10Z","abstract_excerpt":"Graph construction from a given set of edges is a data-intensive operator that appears in social network analysis, ontology enabled databases, and, other analytics processing. The operator represents an edge list to compressed sparse row (CSR) representation (or sometimes in adjacency list, or as clustered B-Tree storage). In this work, we show how to scale CSR construction to massive scale on SSD-enabled supercomputers such as Gordon using pipelined processing. We develop several abstraction and operations for external memory and parallel edge list and integer array processing that are utiliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8242","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":"1210.8242","created_at":"2026-05-18T03:41:55.583122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8242v1","created_at":"2026-05-18T03:41:55.583122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8242","created_at":"2026-05-18T03:41:55.583122+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVXFVVQWRCAF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVXFVVQWRCAFWOEW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVXFVVQW","created_at":"2026-05-18T12:27:01.376967+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/CVXFVVQWRCAFWOEWHZUUTR2RLB","json":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB.json","graph_json":"https://pith.science/api/pith-number/CVXFVVQWRCAFWOEWHZUUTR2RLB/graph.json","events_json":"https://pith.science/api/pith-number/CVXFVVQWRCAFWOEWHZUUTR2RLB/events.json","paper":"https://pith.science/paper/CVXFVVQW"},"agent_actions":{"view_html":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB","download_json":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB.json","view_paper":"https://pith.science/paper/CVXFVVQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8242&json=true","fetch_graph":"https://pith.science/api/pith-number/CVXFVVQWRCAFWOEWHZUUTR2RLB/graph.json","fetch_events":"https://pith.science/api/pith-number/CVXFVVQWRCAFWOEWHZUUTR2RLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB/action/storage_attestation","attest_author":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB/action/author_attestation","sign_citation":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB/action/citation_signature","submit_replication":"https://pith.science/pith/CVXFVVQWRCAFWOEWHZUUTR2RLB/action/replication_record"}},"created_at":"2026-05-18T03:41:55.583122+00:00","updated_at":"2026-05-18T03:41:55.583122+00:00"}