{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YV5SNOQBYYYECKLIIF2GH6UW53","short_pith_number":"pith:YV5SNOQB","schema_version":"1.0","canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","source":{"kind":"arxiv","id":"1902.03522","version":2},"attestation_state":"computed","paper":{"title":"Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Dmitrii Avdiukhin, Grigory Yaroslavtsev, Sergey Pupyrev","submitted_at":"2019-02-10T00:23:16Z","abstract_excerpt":"Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the multi-dimensional variant when balance according to multiple weight functions is required. As we demonstrate by experimental evaluation, such multi-dimensional balance is important for achieving performance improvements for typical distributed graph processing workloads. We propose a new scalable technique for the multidimensional balanced graph partitioning problem. The"},"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":"1902.03522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T00:23:16Z","cross_cats_sorted":["cs.DB","cs.DC"],"title_canon_sha256":"68f9d3f5c9d4f3a3a5ab603f09c57750124eec0255e3897758b2cb7d3911de2c","abstract_canon_sha256":"ee7f3d05546e57f5cdf51f2ed8935c6170c036e805c884499692a636b66fc25e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.296978Z","signature_b64":"fTULrot9RkGZKYUwDJ+NTPhcng4QFlTWmfGlh5QgwcgJMDSIe7RJS9W2OW+RkUl7TR0Kvh2ml8m05pBMceqHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","last_reissued_at":"2026-05-17T23:53:49.296378Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.296378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Dmitrii Avdiukhin, Grigory Yaroslavtsev, Sergey Pupyrev","submitted_at":"2019-02-10T00:23:16Z","abstract_excerpt":"Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the multi-dimensional variant when balance according to multiple weight functions is required. As we demonstrate by experimental evaluation, such multi-dimensional balance is important for achieving performance improvements for typical distributed graph processing workloads. We propose a new scalable technique for the multidimensional balanced graph partitioning problem. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03522","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":"1902.03522","created_at":"2026-05-17T23:53:49.296462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03522v2","created_at":"2026-05-17T23:53:49.296462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03522","created_at":"2026-05-17T23:53:49.296462+00:00"},{"alias_kind":"pith_short_12","alias_value":"YV5SNOQBYYYE","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YV5SNOQBYYYECKLI","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YV5SNOQB","created_at":"2026-05-18T12:33:33.725879+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/YV5SNOQBYYYECKLIIF2GH6UW53","json":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53.json","graph_json":"https://pith.science/api/pith-number/YV5SNOQBYYYECKLIIF2GH6UW53/graph.json","events_json":"https://pith.science/api/pith-number/YV5SNOQBYYYECKLIIF2GH6UW53/events.json","paper":"https://pith.science/paper/YV5SNOQB"},"agent_actions":{"view_html":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53","download_json":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53.json","view_paper":"https://pith.science/paper/YV5SNOQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03522&json=true","fetch_graph":"https://pith.science/api/pith-number/YV5SNOQBYYYECKLIIF2GH6UW53/graph.json","fetch_events":"https://pith.science/api/pith-number/YV5SNOQBYYYECKLIIF2GH6UW53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/action/storage_attestation","attest_author":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/action/author_attestation","sign_citation":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/action/citation_signature","submit_replication":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/action/replication_record"}},"created_at":"2026-05-17T23:53:49.296462+00:00","updated_at":"2026-05-17T23:53:49.296462+00:00"}