{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QIDTEHDHV7PZ724DRTB3TLGSWC","short_pith_number":"pith:QIDTEHDH","schema_version":"1.0","canonical_sha256":"8207321c67afdf9feb838cc3b9acd2b08d897683cb4f275ffaf6c419c1c38e88","source":{"kind":"arxiv","id":"1404.3861","version":2},"attestation_state":"computed","paper":{"title":"Spinner: Scalable Graph Partitioning in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Loukas, Claudio Martella, Dionysios Logothetis, Georgos Siganos","submitted_at":"2014-04-15T10:26:24Z","abstract_excerpt":"Several organizations, like social networks, store and routinely analyze large graphs as part of their daily operation. Such graphs are typically distributed across multiple servers, and graph partitioning is critical for efficient graph management. Existing partitioning algorithms focus on finding graph partitions with good locality, but disregard the pragmatic challenges of integrating partitioning into large-scale graph management systems deployed on the cloud, such as dealing with the scale and dynamicity of the graph and the compute environment.\n  In this paper, we propose Spinner, a scal"},"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":"1404.3861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-15T10:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"4f6a720c5f750118e2324461b7d837ff391503c8850b91a4a2169735ff42d246","abstract_canon_sha256":"182ce5a5ea8319b3d2ed26d77716fc0e1b9e342d987ba88bde8a353395a61348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:11.956823Z","signature_b64":"Y/7U6DFTec6Tq8WmEKpvt7c6BUH1agUM2QUOTvDcFnPJ/56R/WshejonAfN1r61nSwPCtBCgKyjLfxXd0SDkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8207321c67afdf9feb838cc3b9acd2b08d897683cb4f275ffaf6c419c1c38e88","last_reissued_at":"2026-05-18T02:28:11.956169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:11.956169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spinner: Scalable Graph Partitioning in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Loukas, Claudio Martella, Dionysios Logothetis, Georgos Siganos","submitted_at":"2014-04-15T10:26:24Z","abstract_excerpt":"Several organizations, like social networks, store and routinely analyze large graphs as part of their daily operation. Such graphs are typically distributed across multiple servers, and graph partitioning is critical for efficient graph management. Existing partitioning algorithms focus on finding graph partitions with good locality, but disregard the pragmatic challenges of integrating partitioning into large-scale graph management systems deployed on the cloud, such as dealing with the scale and dynamicity of the graph and the compute environment.\n  In this paper, we propose Spinner, a scal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3861","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":"1404.3861","created_at":"2026-05-18T02:28:11.956260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3861v2","created_at":"2026-05-18T02:28:11.956260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3861","created_at":"2026-05-18T02:28:11.956260+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIDTEHDHV7PZ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIDTEHDHV7PZ724D","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIDTEHDH","created_at":"2026-05-18T12:28:46.137349+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/QIDTEHDHV7PZ724DRTB3TLGSWC","json":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC.json","graph_json":"https://pith.science/api/pith-number/QIDTEHDHV7PZ724DRTB3TLGSWC/graph.json","events_json":"https://pith.science/api/pith-number/QIDTEHDHV7PZ724DRTB3TLGSWC/events.json","paper":"https://pith.science/paper/QIDTEHDH"},"agent_actions":{"view_html":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC","download_json":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC.json","view_paper":"https://pith.science/paper/QIDTEHDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3861&json=true","fetch_graph":"https://pith.science/api/pith-number/QIDTEHDHV7PZ724DRTB3TLGSWC/graph.json","fetch_events":"https://pith.science/api/pith-number/QIDTEHDHV7PZ724DRTB3TLGSWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC/action/storage_attestation","attest_author":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC/action/author_attestation","sign_citation":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC/action/citation_signature","submit_replication":"https://pith.science/pith/QIDTEHDHV7PZ724DRTB3TLGSWC/action/replication_record"}},"created_at":"2026-05-18T02:28:11.956260+00:00","updated_at":"2026-05-18T02:28:11.956260+00:00"}