{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6V46MM252C2B4VU3YIAXLIAOJW","short_pith_number":"pith:6V46MM25","canonical_record":{"source":{"id":"1304.4453","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-04-16T14:03:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b6ff72f7a07060c8edc0f89838c01767fe77bd5bc6f59c9462ff34284ab0cf8d","abstract_canon_sha256":"ea165d4df5e35a9336e2324b87cff3ec2e70a867eacd97d9eb4fc49579fab157"},"schema_version":"1.0"},"canonical_sha256":"f579e6335dd0b41e569bc20175a00e4db50816dda59099b4641dad6070ff9230","source":{"kind":"arxiv","id":"1304.4453","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4453","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4453v4","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4453","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"6V46MM252C2B","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6V46MM252C2B4VU3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6V46MM25","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6V46MM252C2B4VU3YIAXLIAOJW","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4453","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-04-16T14:03:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b6ff72f7a07060c8edc0f89838c01767fe77bd5bc6f59c9462ff34284ab0cf8d","abstract_canon_sha256":"ea165d4df5e35a9336e2324b87cff3ec2e70a867eacd97d9eb4fc49579fab157"},"schema_version":"1.0"},"canonical_sha256":"f579e6335dd0b41e569bc20175a00e4db50816dda59099b4641dad6070ff9230","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:12.244845Z","signature_b64":"e4O0ESEzd4/IFKbK0WftQUY6KBBlAHxHQBBsbkgKvuRe54DNvjUrXk9p3Q0J8RRHUVG4KvFjaro/BrlyBr/rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f579e6335dd0b41e569bc20175a00e4db50816dda59099b4641dad6070ff9230","last_reissued_at":"2026-05-18T02:28:12.244418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:12.244418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4453","source_version":4,"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-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CbmVGGi87Eayja77LWJN7NOsCf3hif+QnOuMg7YJmKVtTqMYobnUZadE0Xk1KDQZkK3E2QpQguL9C0SMWS5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:32:52.060441Z"},"content_sha256":"539266af992de04507e314ef56c0353bf1eb60b96cfb8adf7975aea9704ff2b4","schema_version":"1.0","event_id":"sha256:539266af992de04507e314ef56c0353bf1eb60b96cfb8adf7975aea9704ff2b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6V46MM252C2B4VU3YIAXLIAOJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering Parallel Algorithms for Community Detection in Massive Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DC","authors_text":"Christian L. Staudt, Henning Meyerhenke","submitted_at":"2013-04-16T14:03:38Z","abstract_excerpt":"The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and software tools are necessary. One common graph analytics kernel is disjoint community detection (or graph clustering). Despite extensive research on heuristic solvers for this task, only few parallel codes exist, although parallelism will be necessary to scale to the data volume of real-world applications. We address the deficit in computing capability by a flexible and extensible community detection framework with s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4453","kind":"arxiv","version":4},"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-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJtWdkqVurGk32U1cOnu5fzmFqGCuQh49DHHyl4S7L6Hu9td7sd9JLuYpniynpccw+3p56zxzksTUykNJCvYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:32:52.060789Z"},"content_sha256":"137f22ecfad07cd074a8d64040d59f26fba7186e66dde0fdc250266027867f92","schema_version":"1.0","event_id":"sha256:137f22ecfad07cd074a8d64040d59f26fba7186e66dde0fdc250266027867f92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6V46MM252C2B4VU3YIAXLIAOJW/bundle.json","state_url":"https://pith.science/pith/6V46MM252C2B4VU3YIAXLIAOJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6V46MM252C2B4VU3YIAXLIAOJW/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-06-06T20:32:52Z","links":{"resolver":"https://pith.science/pith/6V46MM252C2B4VU3YIAXLIAOJW","bundle":"https://pith.science/pith/6V46MM252C2B4VU3YIAXLIAOJW/bundle.json","state":"https://pith.science/pith/6V46MM252C2B4VU3YIAXLIAOJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6V46MM252C2B4VU3YIAXLIAOJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6V46MM252C2B4VU3YIAXLIAOJW","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":"ea165d4df5e35a9336e2324b87cff3ec2e70a867eacd97d9eb4fc49579fab157","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-04-16T14:03:38Z","title_canon_sha256":"b6ff72f7a07060c8edc0f89838c01767fe77bd5bc6f59c9462ff34284ab0cf8d"},"schema_version":"1.0","source":{"id":"1304.4453","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4453","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4453v4","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4453","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"6V46MM252C2B","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6V46MM252C2B4VU3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6V46MM25","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:137f22ecfad07cd074a8d64040d59f26fba7186e66dde0fdc250266027867f92","target":"graph","created_at":"2026-05-18T02:28:12Z","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":"The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and software tools are necessary. One common graph analytics kernel is disjoint community detection (or graph clustering). Despite extensive research on heuristic solvers for this task, only few parallel codes exist, although parallelism will be necessary to scale to the data volume of real-world applications. We address the deficit in computing capability by a flexible and extensible community detection framework with s","authors_text":"Christian L. Staudt, Henning Meyerhenke","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-04-16T14:03:38Z","title":"Engineering Parallel Algorithms for Community Detection in Massive Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4453","kind":"arxiv","version":4},"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:539266af992de04507e314ef56c0353bf1eb60b96cfb8adf7975aea9704ff2b4","target":"record","created_at":"2026-05-18T02:28:12Z","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":"ea165d4df5e35a9336e2324b87cff3ec2e70a867eacd97d9eb4fc49579fab157","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-04-16T14:03:38Z","title_canon_sha256":"b6ff72f7a07060c8edc0f89838c01767fe77bd5bc6f59c9462ff34284ab0cf8d"},"schema_version":"1.0","source":{"id":"1304.4453","kind":"arxiv","version":4}},"canonical_sha256":"f579e6335dd0b41e569bc20175a00e4db50816dda59099b4641dad6070ff9230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f579e6335dd0b41e569bc20175a00e4db50816dda59099b4641dad6070ff9230","first_computed_at":"2026-05-18T02:28:12.244418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:12.244418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e4O0ESEzd4/IFKbK0WftQUY6KBBlAHxHQBBsbkgKvuRe54DNvjUrXk9p3Q0J8RRHUVG4KvFjaro/BrlyBr/rBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:12.244845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4453","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:539266af992de04507e314ef56c0353bf1eb60b96cfb8adf7975aea9704ff2b4","sha256:137f22ecfad07cd074a8d64040d59f26fba7186e66dde0fdc250266027867f92"],"state_sha256":"20ffe428a67c28812260149816684c88835d695a4380df14e8528d44b2a8cc1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcyXbBe9wiBJ4MJnIT9wkkRnN/UXQUKBc0NmA9vXyngFNyjyDac7RwTzcDkQp4/Ji6nazwjv7/XnwcPS9++xDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:32:52.062732Z","bundle_sha256":"af940aa67dbf7f1cb4e915807ad4d195d32449f51ad63ea2178940d6c053324d"}}