{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OAXEDBIGYAJLIF6TIV7WP3WNMW","short_pith_number":"pith:OAXEDBIG","schema_version":"1.0","canonical_sha256":"702e418506c012b417d3457f67eecd65a9a8bf720f8db36c2bda8f35f0bf8575","source":{"kind":"arxiv","id":"1310.6019","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6019","created_at":"2026-05-18T03:09:23.428157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6019v1","created_at":"2026-05-18T03:09:23.428157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6019","created_at":"2026-05-18T03:09:23.428157+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAXEDBIGYAJL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAXEDBIGYAJLIF6T","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAXEDBIG","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW","json":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW.json","graph_json":"https://pith.science/api/pith-number/OAXEDBIGYAJLIF6TIV7WP3WNMW/graph.json","events_json":"https://pith.science/api/pith-number/OAXEDBIGYAJLIF6TIV7WP3WNMW/events.json","paper":"https://pith.science/paper/OAXEDBIG"},"agent_actions":{"view_html":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW","download_json":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW.json","view_paper":"https://pith.science/paper/OAXEDBIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6019&json=true","fetch_graph":"https://pith.science/api/pith-number/OAXEDBIGYAJLIF6TIV7WP3WNMW/graph.json","fetch_events":"https://pith.science/api/pith-number/OAXEDBIGYAJLIF6TIV7WP3WNMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/action/storage_attestation","attest_author":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/action/author_attestation","sign_citation":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/action/citation_signature","submit_replication":"https://pith.science/pith/OAXEDBIGYAJLIF6TIV7WP3WNMW/action/replication_record"}},"created_at":"2026-05-18T03:09:23.428157+00:00","updated_at":"2026-05-18T03:09:23.428157+00:00"}