{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LWV55UELYJV54SA6Q4PZ4OY2A7","short_pith_number":"pith:LWV55UEL","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"},"canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","source":{"kind":"arxiv","id":"2001.07086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07086","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07086v1","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07086","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"LWV55UELYJV5","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_16","alias_value":"LWV55UELYJV54SA6","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_8","alias_value":"LWV55UEL","created_at":"2026-07-05T00:34:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LWV55UELYJV54SA6Q4PZ4OY2A7","target":"record","payload":{"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"},"canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","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"},"source_kind":"arxiv","source_id":"2001.07086","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-07-05T00:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sX3IGO5ecdNJOxLqamNQMjhINmP4/TsttW0IexkAq4LjdPV2JnP9Qwi+gik+2f1QFL+iKh0Csy4HeY2Hl8lOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:58:36.411281Z"},"content_sha256":"67c54bed3f44cc69a1f100849acbe308d42774478f50ecf4b676567fe26a9794","schema_version":"1.0","event_id":"sha256:67c54bed3f44cc69a1f100849acbe308d42774478f50ecf4b676567fe26a9794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LWV55UELYJV54SA6Q4PZ4OY2A7","target":"graph","payload":{"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"},"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-07-05T00:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdR1iAkpquYCJAhp1YA2MAIkx6ia08ZH6vOVunVvlr2X6Ui3ETreObQMhexgkCHPxLJGmWBWxgT/G2G/tJTWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:58:36.411787Z"},"content_sha256":"3f352fc9c490d5ec8478e94f08d4f7cdd200669846d39e5cce976c305f6a868c","schema_version":"1.0","event_id":"sha256:3f352fc9c490d5ec8478e94f08d4f7cdd200669846d39e5cce976c305f6a868c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/bundle.json","state_url":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/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-08-17T04:58:36Z","links":{"resolver":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7","bundle":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/bundle.json","state":"https://pith.science/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWV55UELYJV54SA6Q4PZ4OY2A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LWV55UELYJV54SA6Q4PZ4OY2A7","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":"4207cf2c257592d50bc8bf019c1762f9512622d56e88792028693250de48bc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-20T12:52:00Z","title_canon_sha256":"800aa60b8d101c33e419162aba3abc4ca662d1b4f2d16f0cb84d98739c25985c"},"schema_version":"1.0","source":{"id":"2001.07086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07086","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07086v1","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07086","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"LWV55UELYJV5","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_16","alias_value":"LWV55UELYJV54SA6","created_at":"2026-07-05T00:34:27Z"},{"alias_kind":"pith_short_8","alias_value":"LWV55UEL","created_at":"2026-07-05T00:34:27Z"}],"graph_snapshots":[{"event_id":"sha256:3f352fc9c490d5ec8478e94f08d4f7cdd200669846d39e5cce976c305f6a868c","target":"graph","created_at":"2026-07-05T00:34:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.07086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hans-Arno Jacobsen, Kamil Orujzade, Ruben Mayer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-20T12:52:00Z","title":"2PS: High-Quality Edge Partitioning with Two-Phase Streaming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07086","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:67c54bed3f44cc69a1f100849acbe308d42774478f50ecf4b676567fe26a9794","target":"record","created_at":"2026-07-05T00:34:27Z","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":"4207cf2c257592d50bc8bf019c1762f9512622d56e88792028693250de48bc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-20T12:52:00Z","title_canon_sha256":"800aa60b8d101c33e419162aba3abc4ca662d1b4f2d16f0cb84d98739c25985c"},"schema_version":"1.0","source":{"id":"2001.07086","kind":"arxiv","version":1}},"canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dabded08bc26bde481e871f9e3b1a07c5c071c5a5ab4bce8b30ca9dae37abbb","first_computed_at":"2026-07-05T00:34:27.364084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:34:27.364084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d6D1bFO9pn9YhDbvO0BfSmEshSlFDzkZqmUUsoFLw3RqFfL/9pngabs/2dIDmCLTuwSUWGFUgXeZ0UopC1W1Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:34:27.364679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.07086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67c54bed3f44cc69a1f100849acbe308d42774478f50ecf4b676567fe26a9794","sha256:3f352fc9c490d5ec8478e94f08d4f7cdd200669846d39e5cce976c305f6a868c"],"state_sha256":"1c7bcfa8de9c01f84e386eb067a520d50ae74c30cfd915cebd42eb3fffef170e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Xfm8k6vT6g6F53rctjT2DqcrmEY8VcPvJu1BkMWtrKMQbCUd7wTSmtEfgmcRXRqq0zzzywXkANN/oGUzSKnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T04:58:36.417307Z","bundle_sha256":"a031718188e5c2239771d10a0d0ec3143111d4a3da9e4d05d3bf7a3edd5fb16b"}}