{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JKGH5FUPC2INALQQGXYQIACYIM","short_pith_number":"pith:JKGH5FUP","schema_version":"1.0","canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","source":{"kind":"arxiv","id":"1210.0187","version":1},"attestation_state":"computed","paper":{"title":"External Memory based Distributed Generation of Massive Scale Social Networks on Small Clusters","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-09-30T11:14:21Z","abstract_excerpt":"Small distributed systems are limited by their main memory to generate massively large graphs. Trivial extension to current graph generators to utilize external memory leads to large amount of random I/O hence do not scale with size. In this work we offer a technique to generate massive scale graphs on small cluster of compute nodes with limited main memory. We develop several distributed and external memory algorithms, primarily, shuffle, relabel, redistribute, and, compressed-sparse-row (csr) convert. The algorithms are implemented in MPI/pthread model to help parallelize the operations acro"},"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.0187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-30T11:14:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"bc496125dd74a6a2253c3bb5c4b2e881b5026473c0c11e2b2137de30f18218ac","abstract_canon_sha256":"51e56cf717d76fc30d2036289beda712c2440533d1546b7799219fb842a1b73b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.057731Z","signature_b64":"p7K8Ji9ydDajGFXIsD8nq4QqKVcZZJoS94BRaMC0zfrEo8BKd634eVSOw22NsnuIP2uE1gry+fsbRBCR8h+sDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","last_reissued_at":"2026-05-18T03:44:23.057180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.057180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"External Memory based Distributed Generation of Massive Scale Social Networks on Small Clusters","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-09-30T11:14:21Z","abstract_excerpt":"Small distributed systems are limited by their main memory to generate massively large graphs. Trivial extension to current graph generators to utilize external memory leads to large amount of random I/O hence do not scale with size. In this work we offer a technique to generate massive scale graphs on small cluster of compute nodes with limited main memory. We develop several distributed and external memory algorithms, primarily, shuffle, relabel, redistribute, and, compressed-sparse-row (csr) convert. The algorithms are implemented in MPI/pthread model to help parallelize the operations acro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0187","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.0187","created_at":"2026-05-18T03:44:23.057265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0187v1","created_at":"2026-05-18T03:44:23.057265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0187","created_at":"2026-05-18T03:44:23.057265+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKGH5FUPC2IN","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKGH5FUPC2INALQQ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKGH5FUP","created_at":"2026-05-18T12:27:11.947152+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/JKGH5FUPC2INALQQGXYQIACYIM","json":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM.json","graph_json":"https://pith.science/api/pith-number/JKGH5FUPC2INALQQGXYQIACYIM/graph.json","events_json":"https://pith.science/api/pith-number/JKGH5FUPC2INALQQGXYQIACYIM/events.json","paper":"https://pith.science/paper/JKGH5FUP"},"agent_actions":{"view_html":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM","download_json":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM.json","view_paper":"https://pith.science/paper/JKGH5FUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0187&json=true","fetch_graph":"https://pith.science/api/pith-number/JKGH5FUPC2INALQQGXYQIACYIM/graph.json","fetch_events":"https://pith.science/api/pith-number/JKGH5FUPC2INALQQGXYQIACYIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/action/storage_attestation","attest_author":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/action/author_attestation","sign_citation":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/action/citation_signature","submit_replication":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/action/replication_record"}},"created_at":"2026-05-18T03:44:23.057265+00:00","updated_at":"2026-05-18T03:44:23.057265+00:00"}