{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JIDERDSR4RMY5ZVJ2MO5OESQQA","short_pith_number":"pith:JIDERDSR","schema_version":"1.0","canonical_sha256":"4a06488e51e4598ee6a9d31dd71250802d0d160ec6b9e6902a673ec6ca9ff531","source":{"kind":"arxiv","id":"1309.6129","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.6129","created_at":"2026-05-18T03:12:23.797722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6129v1","created_at":"2026-05-18T03:12:23.797722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6129","created_at":"2026-05-18T03:12:23.797722+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIDERDSR4RMY","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIDERDSR4RMY5ZVJ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIDERDSR","created_at":"2026-05-18T12:27:49.015174+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/JIDERDSR4RMY5ZVJ2MO5OESQQA","json":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA.json","graph_json":"https://pith.science/api/pith-number/JIDERDSR4RMY5ZVJ2MO5OESQQA/graph.json","events_json":"https://pith.science/api/pith-number/JIDERDSR4RMY5ZVJ2MO5OESQQA/events.json","paper":"https://pith.science/paper/JIDERDSR"},"agent_actions":{"view_html":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA","download_json":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA.json","view_paper":"https://pith.science/paper/JIDERDSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6129&json=true","fetch_graph":"https://pith.science/api/pith-number/JIDERDSR4RMY5ZVJ2MO5OESQQA/graph.json","fetch_events":"https://pith.science/api/pith-number/JIDERDSR4RMY5ZVJ2MO5OESQQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/action/storage_attestation","attest_author":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/action/author_attestation","sign_citation":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/action/citation_signature","submit_replication":"https://pith.science/pith/JIDERDSR4RMY5ZVJ2MO5OESQQA/action/replication_record"}},"created_at":"2026-05-18T03:12:23.797722+00:00","updated_at":"2026-05-18T03:12:23.797722+00:00"}