{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YV5SNOQBYYYECKLIIF2GH6UW53","short_pith_number":"pith:YV5SNOQB","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"},"canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","source":{"kind":"arxiv","id":"1902.03522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03522","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03522v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03522","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"YV5SNOQBYYYE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YV5SNOQBYYYECKLI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YV5SNOQB","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YV5SNOQBYYYECKLIIF2GH6UW53","target":"record","payload":{"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"},"canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","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"},"source_kind":"arxiv","source_id":"1902.03522","source_version":2,"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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNkUG5P3quH/ZzNxqEOzMZujhcHJVd6oVETHoalL8q0JVhSDIRkb4RwGG4AaIoTz8AxbCa8mn9e3z3/9g5LrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:25.408284Z"},"content_sha256":"b39624ee0c66f122d36aea7fe96679535f4b455800ce8e1a5e2bc3cc9c600bb1","schema_version":"1.0","event_id":"sha256:b39624ee0c66f122d36aea7fe96679535f4b455800ce8e1a5e2bc3cc9c600bb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YV5SNOQBYYYECKLIIF2GH6UW53","target":"graph","payload":{"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"},"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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEley8pwjp0uR2qTs5kRG3etPDsAjGLl8d77QfYK5Gx68QipYQR9c016xlHcMXqEzCkbmMCGwXQZpYXI6RjPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:25.408926Z"},"content_sha256":"fdf699af903f070e5efdeb1623ea5a17f800cc0485432206e5bc8af9bee54fba","schema_version":"1.0","event_id":"sha256:fdf699af903f070e5efdeb1623ea5a17f800cc0485432206e5bc8af9bee54fba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/bundle.json","state_url":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YV5SNOQBYYYECKLIIF2GH6UW53/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-27T05:33:25Z","links":{"resolver":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53","bundle":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/bundle.json","state":"https://pith.science/pith/YV5SNOQBYYYECKLIIF2GH6UW53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YV5SNOQBYYYECKLIIF2GH6UW53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YV5SNOQBYYYECKLIIF2GH6UW53","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":"ee7f3d05546e57f5cdf51f2ed8935c6170c036e805c884499692a636b66fc25e","cross_cats_sorted":["cs.DB","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T00:23:16Z","title_canon_sha256":"68f9d3f5c9d4f3a3a5ab603f09c57750124eec0255e3897758b2cb7d3911de2c"},"schema_version":"1.0","source":{"id":"1902.03522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03522","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03522v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03522","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"YV5SNOQBYYYE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YV5SNOQBYYYECKLI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YV5SNOQB","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fdf699af903f070e5efdeb1623ea5a17f800cc0485432206e5bc8af9bee54fba","target":"graph","created_at":"2026-05-17T23:53:49Z","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":"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","authors_text":"Dmitrii Avdiukhin, Grigory Yaroslavtsev, Sergey Pupyrev","cross_cats":["cs.DB","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T00:23:16Z","title":"Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03522","kind":"arxiv","version":2},"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:b39624ee0c66f122d36aea7fe96679535f4b455800ce8e1a5e2bc3cc9c600bb1","target":"record","created_at":"2026-05-17T23:53:49Z","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":"ee7f3d05546e57f5cdf51f2ed8935c6170c036e805c884499692a636b66fc25e","cross_cats_sorted":["cs.DB","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T00:23:16Z","title_canon_sha256":"68f9d3f5c9d4f3a3a5ab603f09c57750124eec0255e3897758b2cb7d3911de2c"},"schema_version":"1.0","source":{"id":"1902.03522","kind":"arxiv","version":2}},"canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c57b26ba01c630412968417463fa96eeda8d508e19e096d28abb246925fd5fd3","first_computed_at":"2026-05-17T23:53:49.296378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:49.296378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTULrot9RkGZKYUwDJ+NTPhcng4QFlTWmfGlh5QgwcgJMDSIe7RJS9W2OW+RkUl7TR0Kvh2ml8m05pBMceqHAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:49.296978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03522","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b39624ee0c66f122d36aea7fe96679535f4b455800ce8e1a5e2bc3cc9c600bb1","sha256:fdf699af903f070e5efdeb1623ea5a17f800cc0485432206e5bc8af9bee54fba"],"state_sha256":"1f8bd3498483e48636e13af6a2f636cd6088a7816e34d5f1d31fb008be0f1782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJRpblUG+e72PLbE/Vw6B8P1ec+IBujQFFxDe4QQRh54sgdKRVo4gAnt1fdNm1dXGmMmsewDlZOk9hWVKCcyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:33:25.412357Z","bundle_sha256":"e381495f8935963ac8c6e88d53a38a1a75197f6ee0b402f97af2bd9fb27357ec"}}