{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LWV55UELYJV54SA6Q4PZ4OY2A7","short_pith_number":"pith:LWV55UEL","schema_version":"1.0","canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","source":{"kind":"arxiv","id":"2001.07086","version":1},"attestation_state":"computed","paper":{"title":"2PS: High-Quality Edge Partitioning with Two-Phase Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hans-Arno Jacobsen, Kamil Orujzade, Ruben Mayer","submitted_at":"2020-01-20T12:52:00Z","abstract_excerpt":"Graph partitioning is an important preprocessing step to distributed graph processing. In edge partitioning, the edge set of a given graph is split into $k$ equally-sized partitions, such that the replication of vertices across partitions is minimized. Streaming is a viable approach to partition graphs that exceed the memory capacities of a single server. The graph is ingested as a stream of edges, and one edge at a time is immediately and irrevocably assigned to a partition based on a scoring function. However, streaming partitioning suffers from the uninformed assignment problem: At the time"},"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":"2001.07086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-20T12:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"800aa60b8d101c33e419162aba3abc4ca662d1b4f2d16f0cb84d98739c25985c","abstract_canon_sha256":"4207cf2c257592d50bc8bf019c1762f9512622d56e88792028693250de48bc89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:27.364679Z","signature_b64":"d6D1bFO9pn9YhDbvO0BfSmEshSlFDzkZqmUUsoFLw3RqFfL/9pngabs/2dIDmCLTuwSUWGFUgXeZ0UopC1W1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","last_reissued_at":"2026-07-05T00:34:27.364084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:27.364084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2PS: High-Quality Edge Partitioning with Two-Phase Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hans-Arno Jacobsen, Kamil Orujzade, Ruben Mayer","submitted_at":"2020-01-20T12:52:00Z","abstract_excerpt":"Graph partitioning is an important preprocessing step to distributed graph processing. In edge partitioning, the edge set of a given graph is split into $k$ equally-sized partitions, such that the replication of vertices across partitions is minimized. Streaming is a viable approach to partition graphs that exceed the memory capacities of a single server. The graph is ingested as a stream of edges, and one edge at a time is immediately and irrevocably assigned to a partition based on a scoring function. However, streaming partitioning suffers from the uninformed assignment problem: At the time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.07086/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.07086","created_at":"2026-07-05T00:34:27.364173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.07086v1","created_at":"2026-07-05T00:34:27.364173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07086","created_at":"2026-07-05T00:34:27.364173+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWV55UELYJV5","created_at":"2026-07-05T00:34:27.364173+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWV55UELYJV54SA6","created_at":"2026-07-05T00:34:27.364173+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWV55UEL","created_at":"2026-07-05T00:34:27.364173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13491","citing_title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7","json":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7.json","graph_json":"https://pith.science/api/pith-number/LWV55UELYJV54SA6Q4PZ4OY2A7/graph.json","events_json":"https://pith.science/api/pith-number/LWV55UELYJV54SA6Q4PZ4OY2A7/events.json","paper":"https://pith.science/paper/LWV55UEL"},"agent_actions":{"view_html":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7","download_json":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7.json","view_paper":"https://pith.science/paper/LWV55UEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.07086&json=true","fetch_graph":"https://pith.science/api/pith-number/LWV55UELYJV54SA6Q4PZ4OY2A7/graph.json","fetch_events":"https://pith.science/api/pith-number/LWV55UELYJV54SA6Q4PZ4OY2A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/action/storage_attestation","attest_author":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/action/author_attestation","sign_citation":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/action/citation_signature","submit_replication":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/action/replication_record"}},"created_at":"2026-07-05T00:34:27.364173+00:00","updated_at":"2026-07-05T00:34:27.364173+00:00"}