{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7WB3BUG3VOK7GTXV5QW56KZWZB","short_pith_number":"pith:7WB3BUG3","canonical_record":{"source":{"id":"1907.06768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-15T21:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"0d0d0a487e32174cce5a4c4deea4c67ef2321abfe2f6356a2dcff7bf5502d6a1","abstract_canon_sha256":"a046d957a445f4bfd16623702b1223ec038625fab4d6234a8c6dbd2b63d0d365"},"schema_version":"1.0"},"canonical_sha256":"fd83b0d0dbab95f34ef5ec2ddf2b36c850015f1acec5d0568a6806ae4f27ecaf","source":{"kind":"arxiv","id":"1907.06768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06768","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06768v2","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06768","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"7WB3BUG3VOK7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7WB3BUG3VOK7GTXV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7WB3BUG3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7WB3BUG3VOK7GTXV5QW56KZWZB","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-15T21:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"0d0d0a487e32174cce5a4c4deea4c67ef2321abfe2f6356a2dcff7bf5502d6a1","abstract_canon_sha256":"a046d957a445f4bfd16623702b1223ec038625fab4d6234a8c6dbd2b63d0d365"},"schema_version":"1.0"},"canonical_sha256":"fd83b0d0dbab95f34ef5ec2ddf2b36c850015f1acec5d0568a6806ae4f27ecaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.945431Z","signature_b64":"c5dpq6LeRYwChbyaVts7wWwns8VitMpYnhJSGokQ381Qm4zOF2nvwESTo1XkIkIWyrGpsVOAZx9CKzjDq7roAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd83b0d0dbab95f34ef5ec2ddf2b36c850015f1acec5d0568a6806ae4f27ecaf","last_reissued_at":"2026-05-17T23:40:22.944616Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.944616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06768","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:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKwK4tnbT8safPzb+/hnV/bHqRaLW3mdZfFViXwwtwCvvTQq4H8jg6cGaA81wmTijLPkzCrEbvFOwPdYsK3eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:49:51.708632Z"},"content_sha256":"5f2096cbf2741657d88def964dc6885e530dc4c72e344656c1547258fa13149e","schema_version":"1.0","event_id":"sha256:5f2096cbf2741657d88def964dc6885e530dc4c72e344656c1547258fa13149e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7WB3BUG3VOK7GTXV5QW56KZWZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Graphs for the Cloud using Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mohammad Hammoud, Mohammad Hasanzadeh Mofrad, Rami Melhem","submitted_at":"2019-07-15T21:50:56Z","abstract_excerpt":"In this paper, we propose Revolver, a parallel graph partitioning algorithm capable of partitioning large-scale graphs on a single shared-memory machine. Revolver employs an asynchronous processing framework, which leverages reinforcement learning and label propagation to adaptively partition a graph. In addition, it adopts a vertex-centric view of the graph where each vertex is assigned an autonomous agent responsible for selecting a suitable partition for it, distributing thereby the computation across all vertices. The intuition behind using a vertex-centric view is that it naturally fits t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06768","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:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Y0K7Uy67poHgqF2NiZ6yf8azMMD0rVT3khOvKJLTv1jMbaZsPAOcNoRmh/NIWkyZHWkD+dofXyk7HDf6BtNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:49:51.709195Z"},"content_sha256":"e4262cf14211acb6499932bbb08f429ba59b7668e883e3a275d5f5c216c697f4","schema_version":"1.0","event_id":"sha256:e4262cf14211acb6499932bbb08f429ba59b7668e883e3a275d5f5c216c697f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/bundle.json","state_url":"https://pith.science/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/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-30T22:49:51Z","links":{"resolver":"https://pith.science/pith/7WB3BUG3VOK7GTXV5QW56KZWZB","bundle":"https://pith.science/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/bundle.json","state":"https://pith.science/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WB3BUG3VOK7GTXV5QW56KZWZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7WB3BUG3VOK7GTXV5QW56KZWZB","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":"a046d957a445f4bfd16623702b1223ec038625fab4d6234a8c6dbd2b63d0d365","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-15T21:50:56Z","title_canon_sha256":"0d0d0a487e32174cce5a4c4deea4c67ef2321abfe2f6356a2dcff7bf5502d6a1"},"schema_version":"1.0","source":{"id":"1907.06768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06768","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06768v2","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06768","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"7WB3BUG3VOK7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7WB3BUG3VOK7GTXV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7WB3BUG3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:e4262cf14211acb6499932bbb08f429ba59b7668e883e3a275d5f5c216c697f4","target":"graph","created_at":"2026-05-17T23:40:22Z","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":"In this paper, we propose Revolver, a parallel graph partitioning algorithm capable of partitioning large-scale graphs on a single shared-memory machine. Revolver employs an asynchronous processing framework, which leverages reinforcement learning and label propagation to adaptively partition a graph. In addition, it adopts a vertex-centric view of the graph where each vertex is assigned an autonomous agent responsible for selecting a suitable partition for it, distributing thereby the computation across all vertices. The intuition behind using a vertex-centric view is that it naturally fits t","authors_text":"Mohammad Hammoud, Mohammad Hasanzadeh Mofrad, Rami Melhem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-15T21:50:56Z","title":"Partitioning Graphs for the Cloud using Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06768","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:5f2096cbf2741657d88def964dc6885e530dc4c72e344656c1547258fa13149e","target":"record","created_at":"2026-05-17T23:40:22Z","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":"a046d957a445f4bfd16623702b1223ec038625fab4d6234a8c6dbd2b63d0d365","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-15T21:50:56Z","title_canon_sha256":"0d0d0a487e32174cce5a4c4deea4c67ef2321abfe2f6356a2dcff7bf5502d6a1"},"schema_version":"1.0","source":{"id":"1907.06768","kind":"arxiv","version":2}},"canonical_sha256":"fd83b0d0dbab95f34ef5ec2ddf2b36c850015f1acec5d0568a6806ae4f27ecaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd83b0d0dbab95f34ef5ec2ddf2b36c850015f1acec5d0568a6806ae4f27ecaf","first_computed_at":"2026-05-17T23:40:22.944616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.944616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5dpq6LeRYwChbyaVts7wWwns8VitMpYnhJSGokQ381Qm4zOF2nvwESTo1XkIkIWyrGpsVOAZx9CKzjDq7roAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.945431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f2096cbf2741657d88def964dc6885e530dc4c72e344656c1547258fa13149e","sha256:e4262cf14211acb6499932bbb08f429ba59b7668e883e3a275d5f5c216c697f4"],"state_sha256":"1ca6d58d3bc7e50233796ec38504812ca6682daf2e4910d85bfb48f9623c8c8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hs5Fa8D0cXNuhx74OSU+lpfOeVkzIKxZu/q/ej8Zli0JrjglABO2pl4ziXf22B9p4e9TRKNH3OELkvSD70l/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:49:51.713146Z","bundle_sha256":"f2e8c9e3370c27d5678a12d1c23ce3b8a6e29d6a302034e2f77b2172d0623775"}}