{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OAXEDBIGYAJLIF6TIV7WP3WNMW","short_pith_number":"pith:OAXEDBIG","canonical_record":{"source":{"id":"1310.6019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T15:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"618f47889cf26ad842a58128a9339d1952c4b2af2b5422350841d5afa7747b6c","abstract_canon_sha256":"72f18f95be54984b2838da53e3fa29f03b592be481ed5974f86496ea47c32b93"},"schema_version":"1.0"},"canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","source":{"kind":"arxiv","id":"1310.6019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6019","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6019v1","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6019","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"OAXEDBIGYAJL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OAXEDBIGYAJLIF6T","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OAXEDBIG","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OAXEDBIGYAJLIF6TIV7WP3WNMW","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T15:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"618f47889cf26ad842a58128a9339d1952c4b2af2b5422350841d5afa7747b6c","abstract_canon_sha256":"72f18f95be54984b2838da53e3fa29f03b592be481ed5974f86496ea47c32b93"},"schema_version":"1.0"},"canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:23.428778Z","signature_b64":"Dm+ThiwI1pVVYzolsAie5f5C+Ulb0Vwo/J7zO3Un24DA4KiETOM4/tUlz27OAQpZ2TVSHP1jl1CR1KZVIqTiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","last_reissued_at":"2026-05-18T03:09:23.428051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:23.428051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6019","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-18T03:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGrslwRMRjoS8tt8smwW0IT08gnj74lY32C8j7bLBH4ua5k7t0HVlGJba1DzCuk+cpZ5dxSVKGBLACZknYJDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:39:32.463006Z"},"content_sha256":"69b7d2bda79837bc2898f53d660114153ef8afbfab64e3a9b4c630e9186a6059","schema_version":"1.0","event_id":"sha256:69b7d2bda79837bc2898f53d660114153ef8afbfab64e3a9b4c630e9186a6059"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OAXEDBIGYAJLIF6TIV7WP3WNMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Clustering with Surprise: Complexity and Exact Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Kappes, Dorothea Wagner, Tobias Fleck","submitted_at":"2013-10-21T15:07:16Z","abstract_excerpt":"Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a related, but slightly different approach leading to the quality measure surprise, and reported good behavior in the context of synthetic and real world benchmarks. We show that the problem of finding a clustering with optimum surprise is NP-hard. Moreover, a bicriterial view on the problem permits to compute optimum solutions for small instances by solving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6019","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-18T03:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVoEygVWy/LPRtGbxkjiXNYhaheFHgOOTMpL7GK+OpUL76NlFGpDqFbftRsOte2Hu79WTcPbjDZfmBSd5hQYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:39:32.463740Z"},"content_sha256":"0e89baa3ba7fef29b51381a87e2f5a7efc82f31caddfdd2ad5493052b5d534be","schema_version":"1.0","event_id":"sha256:0e89baa3ba7fef29b51381a87e2f5a7efc82f31caddfdd2ad5493052b5d534be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/bundle.json","state_url":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/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-26T20:39:32Z","links":{"resolver":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW","bundle":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/bundle.json","state":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OAXEDBIGYAJLIF6TIV7WP3WNMW","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":"72f18f95be54984b2838da53e3fa29f03b592be481ed5974f86496ea47c32b93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T15:07:16Z","title_canon_sha256":"618f47889cf26ad842a58128a9339d1952c4b2af2b5422350841d5afa7747b6c"},"schema_version":"1.0","source":{"id":"1310.6019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6019","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6019v1","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6019","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"OAXEDBIGYAJL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OAXEDBIGYAJLIF6T","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OAXEDBIG","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:0e89baa3ba7fef29b51381a87e2f5a7efc82f31caddfdd2ad5493052b5d534be","target":"graph","created_at":"2026-05-18T03:09:23Z","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":"Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a related, but slightly different approach leading to the quality measure surprise, and reported good behavior in the context of synthetic and real world benchmarks. We show that the problem of finding a clustering with optimum surprise is NP-hard. Moreover, a bicriterial view on the problem permits to compute optimum solutions for small instances by solving ","authors_text":"Andrea Kappes, Dorothea Wagner, Tobias Fleck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T15:07:16Z","title":"Graph Clustering with Surprise: Complexity and Exact Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6019","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:69b7d2bda79837bc2898f53d660114153ef8afbfab64e3a9b4c630e9186a6059","target":"record","created_at":"2026-05-18T03:09:23Z","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":"72f18f95be54984b2838da53e3fa29f03b592be481ed5974f86496ea47c32b93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T15:07:16Z","title_canon_sha256":"618f47889cf26ad842a58128a9339d1952c4b2af2b5422350841d5afa7747b6c"},"schema_version":"1.0","source":{"id":"1310.6019","kind":"arxiv","version":1}},"canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","first_computed_at":"2026-05-18T03:09:23.428051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:23.428051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dm+ThiwI1pVVYzolsAie5f5C+Ulb0Vwo/J7zO3Un24DA4KiETOM4/tUlz27OAQpZ2TVSHP1jl1CR1KZVIqTiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:23.428778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69b7d2bda79837bc2898f53d660114153ef8afbfab64e3a9b4c630e9186a6059","sha256:0e89baa3ba7fef29b51381a87e2f5a7efc82f31caddfdd2ad5493052b5d534be"],"state_sha256":"f4fde25b2bdcf01719e5ab8d4cae8e37b247285a3b1a447570bf33183634138c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFk0A7B1iIz5yDpPYXM5vFJoYGHhvmpyy34Ct9hMhGAHaQ2KjnQXcYY19JSg+KhXsuGx1RZKg6ymYg7xevPbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:39:32.467620Z","bundle_sha256":"d20446afd4325bfe6c940451d85f4540d738837924e8b355adb9dfe57e499f74"}}