{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JIDERDSR4RMY5ZVJ2MO5OESQQA","short_pith_number":"pith:JIDERDSR","canonical_record":{"source":{"id":"1309.6129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T12:32:34Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"7e7d154e607943a794e97f43ab5a0f0888232c5759fb8bd79d48428dfb634ecf","abstract_canon_sha256":"d502960f271e28b41d6a1580483233e952718e3f4f3e365f1b0ef6b296c96a2d"},"schema_version":"1.0"},"canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","source":{"kind":"arxiv","id":"1309.6129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6129","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6129v1","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6129","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"JIDERDSR4RMY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JIDERDSR4RMY5ZVJ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JIDERDSR","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JIDERDSR4RMY5ZVJ2MO5OESQQA","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T12:32:34Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"7e7d154e607943a794e97f43ab5a0f0888232c5759fb8bd79d48428dfb634ecf","abstract_canon_sha256":"d502960f271e28b41d6a1580483233e952718e3f4f3e365f1b0ef6b296c96a2d"},"schema_version":"1.0"},"canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:23.798482Z","signature_b64":"7cE0CZUJT/0y8I5Afx2tJ7yVSnIsGkR/9INwdJkLb9ont8otEEpobRS0DZAzUPorml/Ii0g5pyRGaE+FQFFwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","last_reissued_at":"2026-05-18T03:12:23.797563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:23.797563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6129","source_version":1,"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-18T03:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoJhQle40g+suXPAuBCANwsx91WgdW8LIX/fsYfQzS48IAYV73QTMnRRj+KWrZBGtiLpb+bxHyv/8IcfsiRCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:26.457935Z"},"content_sha256":"e3f8b796051816567e2f7efec1f2bdf779fc8694dcdd1cf6aeac80c0cf2d3880","schema_version":"1.0","event_id":"sha256:e3f8b796051816567e2f7efec1f2bdf779fc8694dcdd1cf6aeac80c0cf2d3880"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JIDERDSR4RMY5ZVJ2MO5OESQQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partition-Merge: Distributed Inference and Modularity Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.DS","authors_text":"Devavrat Shah, Kyomin Jung, Pushmeet Kohli, Vincent Blondel","submitted_at":"2013-09-24T12:32:34Z","abstract_excerpt":"This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized partitioning scheme, runs the centralized algorithm on each partition separately, and then stitches the resulting solutions to produce a global solution. We demonstrate the efficiency of the PM algorithm on two popular problems: computation of Maximum A Posteriori (MAP) assignment in an arbitrary pairwise Markov Random Field (MRF), and modular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6129","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"},"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-18T03:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Om1zmxZ9ayxYBgaQaPTKx+Ruagripy6B4QPR0wUDpyJ2ckX0IAwhZQ6iKRBum8qgqDTcMM/iLsYsBlCui4QzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:26.458282Z"},"content_sha256":"b5108c9af13828037e75bf33eeefe020fbb865b39a3ad1fad14d97c9b9d3dd6a","schema_version":"1.0","event_id":"sha256:b5108c9af13828037e75bf33eeefe020fbb865b39a3ad1fad14d97c9b9d3dd6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/bundle.json","state_url":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/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-28T12:15:26Z","links":{"resolver":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA","bundle":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/bundle.json","state":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JIDERDSR4RMY5ZVJ2MO5OESQQA","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":"d502960f271e28b41d6a1580483233e952718e3f4f3e365f1b0ef6b296c96a2d","cross_cats_sorted":["cs.AI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T12:32:34Z","title_canon_sha256":"7e7d154e607943a794e97f43ab5a0f0888232c5759fb8bd79d48428dfb634ecf"},"schema_version":"1.0","source":{"id":"1309.6129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6129","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6129v1","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6129","created_at":"2026-05-18T03:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"JIDERDSR4RMY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JIDERDSR4RMY5ZVJ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JIDERDSR","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:b5108c9af13828037e75bf33eeefe020fbb865b39a3ad1fad14d97c9b9d3dd6a","target":"graph","created_at":"2026-05-18T03:12:23Z","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":"This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized partitioning scheme, runs the centralized algorithm on each partition separately, and then stitches the resulting solutions to produce a global solution. We demonstrate the efficiency of the PM algorithm on two popular problems: computation of Maximum A Posteriori (MAP) assignment in an arbitrary pairwise Markov Random Field (MRF), and modular","authors_text":"Devavrat Shah, Kyomin Jung, Pushmeet Kohli, Vincent Blondel","cross_cats":["cs.AI","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T12:32:34Z","title":"Partition-Merge: Distributed Inference and Modularity Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6129","kind":"arxiv","version":1},"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:e3f8b796051816567e2f7efec1f2bdf779fc8694dcdd1cf6aeac80c0cf2d3880","target":"record","created_at":"2026-05-18T03:12:23Z","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":"d502960f271e28b41d6a1580483233e952718e3f4f3e365f1b0ef6b296c96a2d","cross_cats_sorted":["cs.AI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T12:32:34Z","title_canon_sha256":"7e7d154e607943a794e97f43ab5a0f0888232c5759fb8bd79d48428dfb634ecf"},"schema_version":"1.0","source":{"id":"1309.6129","kind":"arxiv","version":1}},"canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","first_computed_at":"2026-05-18T03:12:23.797563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:23.797563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7cE0CZUJT/0y8I5Afx2tJ7yVSnIsGkR/9INwdJkLb9ont8otEEpobRS0DZAzUPorml/Ii0g5pyRGaE+FQFFwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:23.798482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3f8b796051816567e2f7efec1f2bdf779fc8694dcdd1cf6aeac80c0cf2d3880","sha256:b5108c9af13828037e75bf33eeefe020fbb865b39a3ad1fad14d97c9b9d3dd6a"],"state_sha256":"9bd89332ff117f68b2767d0f9569fbddf654f0446819f1f90cbe81fefb50023c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2LGtc/n39aBVyxQY3WILC+qvK2iJG1hGCbd/pBdYX3a3UlJUaATzOKuo1XoZI/O+S6cKY6JBYamxSc1aIN5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:26.460929Z","bundle_sha256":"b3c5d5550a837521d3797081521a436bd20b30ca43741ab0b7943a2345837ff1"}}