{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LQBHCHVGBJBFL5V4OLM6RH6RJY","short_pith_number":"pith:LQBHCHVG","schema_version":"1.0","canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","source":{"kind":"arxiv","id":"1503.00445","version":2},"attestation_state":"computed","paper":{"title":"Detecting communities using asymptotical Surprise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","stat.ME"],"primary_cat":"physics.soc-ph","authors_text":"J-C. Delvenne, R. Aldecoa, V.A. Traag","submitted_at":"2015-03-02T09:02:53Z","abstract_excerpt":"Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective function, which implicitly contains the definition of a community. We here analyze a recently proposed measure called surprise, which assesses the quality of the partition of a network into communities. In its current form, the formulation of surprise is rather difficult to analyze. We here therefore develop an accurate asymptotic approximation. This allows for the development of an efficient algorithm for optimizin"},"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":"1503.00445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-02T09:02:53Z","cross_cats_sorted":["cs.DM","cs.SI","stat.ME"],"title_canon_sha256":"7d304edc08c0c30239f41dd198dbbae0396cd6631002b459acd16ba9f87b01c7","abstract_canon_sha256":"22d5ec9dc7b78792a8fab58401608663f8cd0d689760f88e71310d78fa13393c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:35.068157Z","signature_b64":"S6ieR7Y0D8qzG7OuEoGp+JhzANBILEkAFr4ymL6KOxZkf2N7RSWx0cj77eyejfX+36ffTQSPkYpmna8sqSDCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","last_reissued_at":"2026-05-18T01:33:35.067386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:35.067386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting communities using asymptotical Surprise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","stat.ME"],"primary_cat":"physics.soc-ph","authors_text":"J-C. Delvenne, R. Aldecoa, V.A. Traag","submitted_at":"2015-03-02T09:02:53Z","abstract_excerpt":"Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective function, which implicitly contains the definition of a community. We here analyze a recently proposed measure called surprise, which assesses the quality of the partition of a network into communities. In its current form, the formulation of surprise is rather difficult to analyze. We here therefore develop an accurate asymptotic approximation. This allows for the development of an efficient algorithm for optimizin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00445","kind":"arxiv","version":2},"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":"1503.00445","created_at":"2026-05-18T01:33:35.067520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00445v2","created_at":"2026-05-18T01:33:35.067520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00445","created_at":"2026-05-18T01:33:35.067520+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQBHCHVGBJBF","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQBHCHVGBJBFL5V4","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQBHCHVG","created_at":"2026-05-18T12:29:29.992203+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/LQBHCHVGBJBFL5V4OLM6RH6RJY","json":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY.json","graph_json":"https://pith.science/api/pith-number/LQBHCHVGBJBFL5V4OLM6RH6RJY/graph.json","events_json":"https://pith.science/api/pith-number/LQBHCHVGBJBFL5V4OLM6RH6RJY/events.json","paper":"https://pith.science/paper/LQBHCHVG"},"agent_actions":{"view_html":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY","download_json":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY.json","view_paper":"https://pith.science/paper/LQBHCHVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00445&json=true","fetch_graph":"https://pith.science/api/pith-number/LQBHCHVGBJBFL5V4OLM6RH6RJY/graph.json","fetch_events":"https://pith.science/api/pith-number/LQBHCHVGBJBFL5V4OLM6RH6RJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/action/storage_attestation","attest_author":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/action/author_attestation","sign_citation":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/action/citation_signature","submit_replication":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/action/replication_record"}},"created_at":"2026-05-18T01:33:35.067520+00:00","updated_at":"2026-05-18T01:33:35.067520+00:00"}