{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JKGH5FUPC2INALQQGXYQIACYIM","short_pith_number":"pith:JKGH5FUP","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"},"canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","source":{"kind":"arxiv","id":"1210.0187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0187","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0187v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0187","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"JKGH5FUPC2IN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JKGH5FUPC2INALQQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JKGH5FUP","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JKGH5FUPC2INALQQGXYQIACYIM","target":"record","payload":{"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"},"canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","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"},"source_kind":"arxiv","source_id":"1210.0187","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJBAdlAjOXOgOEz1pLizhDx+NOGAf+fO+a2Mu+m09K8o79XhCoWzEGRV4uASjuxX1eORx9JzuAPh66/EImUgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:47.713526Z"},"content_sha256":"5d7fa6bffd05253ca53fad5bcfc606dde51b41ada6273e1e97ae08fcc4867d3a","schema_version":"1.0","event_id":"sha256:5d7fa6bffd05253ca53fad5bcfc606dde51b41ada6273e1e97ae08fcc4867d3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JKGH5FUPC2INALQQGXYQIACYIM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHkE/DEU3dFffByF9+FldIcJGHwYhbpRF6WirJsKXtD141IPu00RvEd4Ei+0zL888F8253Rrev0Ee9SjuvbuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:47.714210Z"},"content_sha256":"497cc350c82bf360e5a729e42bfa7be48e0b625332a4d9d3cfa45162860033ff","schema_version":"1.0","event_id":"sha256:497cc350c82bf360e5a729e42bfa7be48e0b625332a4d9d3cfa45162860033ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/bundle.json","state_url":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKGH5FUPC2INALQQGXYQIACYIM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T22:17:47Z","links":{"resolver":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM","bundle":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/bundle.json","state":"https://pith.science/pith/JKGH5FUPC2INALQQGXYQIACYIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKGH5FUPC2INALQQGXYQIACYIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JKGH5FUPC2INALQQGXYQIACYIM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"51e56cf717d76fc30d2036289beda712c2440533d1546b7799219fb842a1b73b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-30T11:14:21Z","title_canon_sha256":"bc496125dd74a6a2253c3bb5c4b2e881b5026473c0c11e2b2137de30f18218ac"},"schema_version":"1.0","source":{"id":"1210.0187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0187","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0187v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0187","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"JKGH5FUPC2IN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JKGH5FUPC2INALQQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JKGH5FUP","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:497cc350c82bf360e5a729e42bfa7be48e0b625332a4d9d3cfa45162860033ff","target":"graph","created_at":"2026-05-18T03:44:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Sandeep Gupta","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-30T11:14:21Z","title":"External Memory based Distributed Generation of Massive Scale Social Networks on Small Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0187","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5d7fa6bffd05253ca53fad5bcfc606dde51b41ada6273e1e97ae08fcc4867d3a","target":"record","created_at":"2026-05-18T03:44:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"51e56cf717d76fc30d2036289beda712c2440533d1546b7799219fb842a1b73b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-30T11:14:21Z","title_canon_sha256":"bc496125dd74a6a2253c3bb5c4b2e881b5026473c0c11e2b2137de30f18218ac"},"schema_version":"1.0","source":{"id":"1210.0187","kind":"arxiv","version":1}},"canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a8c7e968f1690d02e1035f1040058433fd6aa2cfedc9eea4763f7858a4de9d4","first_computed_at":"2026-05-18T03:44:23.057180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:23.057180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p7K8Ji9ydDajGFXIsD8nq4QqKVcZZJoS94BRaMC0zfrEo8BKd634eVSOw22NsnuIP2uE1gry+fsbRBCR8h+sDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:23.057731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d7fa6bffd05253ca53fad5bcfc606dde51b41ada6273e1e97ae08fcc4867d3a","sha256:497cc350c82bf360e5a729e42bfa7be48e0b625332a4d9d3cfa45162860033ff"],"state_sha256":"a36be98864f74f31274030d892cbc5ba2015b20716ad7128186606879ad75606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFlnjT7aNITkjkGbFjCjRdTS9brHaXgmBqhBMVpRLdCYu6yBA96D20wgOaf0/xFPra4XZBvHhIh0lHxaShGkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:17:47.717715Z","bundle_sha256":"9c86f2c898e2a705bbd3e286fb51101f82b7990829a858504a7929665e898f76"}}