{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JPKKZNORR7OFGLCACTB54RNNDS","short_pith_number":"pith:JPKKZNOR","schema_version":"1.0","canonical_sha256":"4bd4acb5d18fdc532c4014c3de45ad1c95195634500423070801eef29f1a145d","source":{"kind":"arxiv","id":"1505.04636","version":1},"attestation_state":"computed","paper":{"title":"Graph Partitioning via Parallel Submodular Approximation to Accelerate Distributed Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DC","authors_text":"Alexander J. Smola, Dave G. Andersen, Mu Li","submitted_at":"2015-05-18T13:43:46Z","abstract_excerpt":"Distributed computing excels at processing large scale data, but the communication cost for synchronizing the shared parameters may slow down the overall performance. Fortunately, the interactions between parameter and data in many problems are sparse, which admits efficient partition in order to reduce the communication overhead.\n  In this paper, we formulate data placement as a graph partitioning problem. We propose a distributed partitioning algorithm. We give both theoretical guarantees and a highly efficient implementation. We also provide a highly efficient implementation of the algorith"},"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":"1505.04636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-18T13:43:46Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d0088daa9aca87b4063e739970582c5cda54501168914c5c0e345dfb313bcafb","abstract_canon_sha256":"9c762f0e5fa4c7992c58b19ec926866b6ba7b8473200c8f9d3a7e4f5c145a79e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:24.945622Z","signature_b64":"S/Wx52xFo91QF0OGPPFClQHiosviuvlF9T2Xr/EgBnW8PH1Fe43Aj/BCRP7Ju5w1r2Vcv0x6uVeMBZpYbB9GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bd4acb5d18fdc532c4014c3de45ad1c95195634500423070801eef29f1a145d","last_reissued_at":"2026-05-18T02:07:24.945235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:24.945235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Partitioning via Parallel Submodular Approximation to Accelerate Distributed Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DC","authors_text":"Alexander J. Smola, Dave G. Andersen, Mu Li","submitted_at":"2015-05-18T13:43:46Z","abstract_excerpt":"Distributed computing excels at processing large scale data, but the communication cost for synchronizing the shared parameters may slow down the overall performance. Fortunately, the interactions between parameter and data in many problems are sparse, which admits efficient partition in order to reduce the communication overhead.\n  In this paper, we formulate data placement as a graph partitioning problem. We propose a distributed partitioning algorithm. We give both theoretical guarantees and a highly efficient implementation. We also provide a highly efficient implementation of the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04636","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":"1505.04636","created_at":"2026-05-18T02:07:24.945305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04636v1","created_at":"2026-05-18T02:07:24.945305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04636","created_at":"2026-05-18T02:07:24.945305+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPKKZNORR7OF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPKKZNORR7OFGLCA","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPKKZNOR","created_at":"2026-05-18T12:29:27.538025+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/JPKKZNORR7OFGLCACTB54RNNDS","json":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS.json","graph_json":"https://pith.science/api/pith-number/JPKKZNORR7OFGLCACTB54RNNDS/graph.json","events_json":"https://pith.science/api/pith-number/JPKKZNORR7OFGLCACTB54RNNDS/events.json","paper":"https://pith.science/paper/JPKKZNOR"},"agent_actions":{"view_html":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS","download_json":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS.json","view_paper":"https://pith.science/paper/JPKKZNOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04636&json=true","fetch_graph":"https://pith.science/api/pith-number/JPKKZNORR7OFGLCACTB54RNNDS/graph.json","fetch_events":"https://pith.science/api/pith-number/JPKKZNORR7OFGLCACTB54RNNDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS/action/storage_attestation","attest_author":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS/action/author_attestation","sign_citation":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS/action/citation_signature","submit_replication":"https://pith.science/pith/JPKKZNORR7OFGLCACTB54RNNDS/action/replication_record"}},"created_at":"2026-05-18T02:07:24.945305+00:00","updated_at":"2026-05-18T02:07:24.945305+00:00"}