{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZHAYF7LPKDFE7PP4KLPUUDO7II","short_pith_number":"pith:ZHAYF7LP","schema_version":"1.0","canonical_sha256":"c9c182fd6f50ca4fbdfc52df4a0ddf4218ff2be30fc89acb760026f2f17e3aea","source":{"kind":"arxiv","id":"1701.00503","version":1},"attestation_state":"computed","paper":{"title":"Distributed Graph Layout for Scalable Small-world Network Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George M Slota, Kamesh Madduri, Sivasankaran Rajamanickam","submitted_at":"2017-01-02T19:17:55Z","abstract_excerpt":"The in-memory graph layout or organization has a considerable impact on the time and energy efficiency of distributed memory graph computations. It affects memory locality, inter-task load balance, communication time, and overall memory utilization. Graph layout could refer to partitioning or replication of vertex and edge arrays, selective replication of data structures that hold meta-data, and reordering vertex and edge identifiers. In this work, we present DGL, a fast, parallel, and memory-efficient distributed graph layout strategy that is specifically designed for small-world networks (lo"},"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":"1701.00503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T19:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"5577e891de29e5b94acf8717858876c12c3d89778ce5813a30c16bf0eb1e809b","abstract_canon_sha256":"052a7b232898360f8e18ddeaf53b9c309f3deddf68874c819ca5afd4f685c760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:29.102499Z","signature_b64":"oPXelnz76GpHgmzknFTCMhIHweLkwdZwb6YljrsAZiW+Hw1y6r5sifZnvOPMxatEYn72XijLaRWt6nUy8VUmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c182fd6f50ca4fbdfc52df4a0ddf4218ff2be30fc89acb760026f2f17e3aea","last_reissued_at":"2026-05-18T00:53:29.102004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:29.102004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Graph Layout for Scalable Small-world Network Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George M Slota, Kamesh Madduri, Sivasankaran Rajamanickam","submitted_at":"2017-01-02T19:17:55Z","abstract_excerpt":"The in-memory graph layout or organization has a considerable impact on the time and energy efficiency of distributed memory graph computations. It affects memory locality, inter-task load balance, communication time, and overall memory utilization. Graph layout could refer to partitioning or replication of vertex and edge arrays, selective replication of data structures that hold meta-data, and reordering vertex and edge identifiers. In this work, we present DGL, a fast, parallel, and memory-efficient distributed graph layout strategy that is specifically designed for small-world networks (lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00503","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":"1701.00503","created_at":"2026-05-18T00:53:29.102078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00503v1","created_at":"2026-05-18T00:53:29.102078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00503","created_at":"2026-05-18T00:53:29.102078+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHAYF7LPKDFE","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHAYF7LPKDFE7PP4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHAYF7LP","created_at":"2026-05-18T12:31:59.375834+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/ZHAYF7LPKDFE7PP4KLPUUDO7II","json":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II.json","graph_json":"https://pith.science/api/pith-number/ZHAYF7LPKDFE7PP4KLPUUDO7II/graph.json","events_json":"https://pith.science/api/pith-number/ZHAYF7LPKDFE7PP4KLPUUDO7II/events.json","paper":"https://pith.science/paper/ZHAYF7LP"},"agent_actions":{"view_html":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II","download_json":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II.json","view_paper":"https://pith.science/paper/ZHAYF7LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00503&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHAYF7LPKDFE7PP4KLPUUDO7II/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHAYF7LPKDFE7PP4KLPUUDO7II/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II/action/storage_attestation","attest_author":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II/action/author_attestation","sign_citation":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II/action/citation_signature","submit_replication":"https://pith.science/pith/ZHAYF7LPKDFE7PP4KLPUUDO7II/action/replication_record"}},"created_at":"2026-05-18T00:53:29.102078+00:00","updated_at":"2026-05-18T00:53:29.102078+00:00"}