{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TBSSCQMCYQLV26Z6ZTFEISMCRE","short_pith_number":"pith:TBSSCQMC","canonical_record":{"source":{"id":"1511.02586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-09T07:28:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cb665afeb1a73083e607a5baee9f48f1198a257e76343273f875aaabf5b7389b","abstract_canon_sha256":"d2f484766854271075a3ca0eb2a6ab32822d6250e1ec8962af9df9235a98c3d1"},"schema_version":"1.0"},"canonical_sha256":"9865214182c4175d7b3eccca444982892acb96e7820d796fe7b34c185bdf8243","source":{"kind":"arxiv","id":"1511.02586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02586","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02586v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02586","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"TBSSCQMCYQLV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBSSCQMCYQLV26Z6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBSSCQMC","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TBSSCQMCYQLV26Z6ZTFEISMCRE","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-09T07:28:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cb665afeb1a73083e607a5baee9f48f1198a257e76343273f875aaabf5b7389b","abstract_canon_sha256":"d2f484766854271075a3ca0eb2a6ab32822d6250e1ec8962af9df9235a98c3d1"},"schema_version":"1.0"},"canonical_sha256":"9865214182c4175d7b3eccca444982892acb96e7820d796fe7b34c185bdf8243","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:29.883197Z","signature_b64":"KfgzKgBX9pyRjW5hjukCztBYEwn++bxT308z3FTVSVIBD1Hp6xxILO0ahBJXir4/y2ERGA29DTNHAiMBqwBuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9865214182c4175d7b3eccca444982892acb96e7820d796fe7b34c185bdf8243","last_reissued_at":"2026-05-18T01:27:29.882527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:29.882527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02586","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCz7/NTt+Ixm/8CgmYhRpzj66k69Ofs7dAy6yzVKnexhnpOaCjzJpOmw7OQi6db+3zQN9Nhrm1eVc4IZOUOuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:55.005672Z"},"content_sha256":"d81504555e44707ff10e4759d82a703e84fe300aa8ab625e599f5e073b1419dc","schema_version":"1.0","event_id":"sha256:d81504555e44707ff10e4759d82a703e84fe300aa8ab625e599f5e073b1419dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TBSSCQMCYQLV26Z6ZTFEISMCRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Cong Xie, Wu-Jun Li, Zhihua Zhang","submitted_at":"2015-11-09T07:28:33Z","abstract_excerpt":"One standard solution for analyzing large natural graphs is to adopt distributed computation on clusters. In distributed computation, graph partitioning (GP) methods assign the vertices or edges of a graph to different machines in a balanced way so that some distributed algorithms can be adapted for. Most of traditional GP methods are offline, which means that the whole graph has been observed before partitioning. However, the offline methods often incur high computation cost. Hence, streaming graph partitioning (SGP) methods, which can partition graphs in an online way, have recently attracte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02586","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxuYsDIizWGYmAAcOMa5bni6yXRGcy7SReJddRq4iWX4CtwQPLKy1lc5uT14wLz8gj89jwDRNlQ9Dru7VrhgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:55.006341Z"},"content_sha256":"3477c959cc38893eed55a30badf873da077d55fa332d6c8e445c2307ada341a0","schema_version":"1.0","event_id":"sha256:3477c959cc38893eed55a30badf873da077d55fa332d6c8e445c2307ada341a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/bundle.json","state_url":"https://pith.science/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/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-26T10:23:55Z","links":{"resolver":"https://pith.science/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE","bundle":"https://pith.science/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/bundle.json","state":"https://pith.science/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBSSCQMCYQLV26Z6ZTFEISMCRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TBSSCQMCYQLV26Z6ZTFEISMCRE","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":"d2f484766854271075a3ca0eb2a6ab32822d6250e1ec8962af9df9235a98c3d1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-09T07:28:33Z","title_canon_sha256":"cb665afeb1a73083e607a5baee9f48f1198a257e76343273f875aaabf5b7389b"},"schema_version":"1.0","source":{"id":"1511.02586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02586","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02586v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02586","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"TBSSCQMCYQLV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBSSCQMCYQLV26Z6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBSSCQMC","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:3477c959cc38893eed55a30badf873da077d55fa332d6c8e445c2307ada341a0","target":"graph","created_at":"2026-05-18T01:27:29Z","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":"One standard solution for analyzing large natural graphs is to adopt distributed computation on clusters. In distributed computation, graph partitioning (GP) methods assign the vertices or edges of a graph to different machines in a balanced way so that some distributed algorithms can be adapted for. Most of traditional GP methods are offline, which means that the whole graph has been observed before partitioning. However, the offline methods often incur high computation cost. Hence, streaming graph partitioning (SGP) methods, which can partition graphs in an online way, have recently attracte","authors_text":"Cong Xie, Wu-Jun Li, Zhihua Zhang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-09T07:28:33Z","title":"S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02586","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:d81504555e44707ff10e4759d82a703e84fe300aa8ab625e599f5e073b1419dc","target":"record","created_at":"2026-05-18T01:27:29Z","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":"d2f484766854271075a3ca0eb2a6ab32822d6250e1ec8962af9df9235a98c3d1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-09T07:28:33Z","title_canon_sha256":"cb665afeb1a73083e607a5baee9f48f1198a257e76343273f875aaabf5b7389b"},"schema_version":"1.0","source":{"id":"1511.02586","kind":"arxiv","version":1}},"canonical_sha256":"9865214182c4175d7b3eccca444982892acb96e7820d796fe7b34c185bdf8243","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9865214182c4175d7b3eccca444982892acb96e7820d796fe7b34c185bdf8243","first_computed_at":"2026-05-18T01:27:29.882527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:29.882527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfgzKgBX9pyRjW5hjukCztBYEwn++bxT308z3FTVSVIBD1Hp6xxILO0ahBJXir4/y2ERGA29DTNHAiMBqwBuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:29.883197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d81504555e44707ff10e4759d82a703e84fe300aa8ab625e599f5e073b1419dc","sha256:3477c959cc38893eed55a30badf873da077d55fa332d6c8e445c2307ada341a0"],"state_sha256":"6c47a7c57f664ef01ae209241d5f402edfc2c292ae2305517e3781ef2327bfdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUnxmcutj5CyWg+W8DCauO1XA2oXUZkGRyEBDrhWznji6D8Nn2+g77WASnHAlBzxqweOVqFq+Ke1oJVD1EyeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:23:55.009925Z","bundle_sha256":"2c311706cef4f1496a9762670663ed69e2b324b2f398b56a7fd0767ef9e73e90"}}