{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LQBHCHVGBJBFL5V4OLM6RH6RJY","short_pith_number":"pith:LQBHCHVG","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"},"canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","source":{"kind":"arxiv","id":"1503.00445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00445","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00445v2","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00445","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQBHCHVGBJBF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQBHCHVGBJBFL5V4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQBHCHVG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LQBHCHVGBJBFL5V4OLM6RH6RJY","target":"record","payload":{"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"},"canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","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"},"source_kind":"arxiv","source_id":"1503.00445","source_version":2,"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:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QotXL1y1/u6gy0MZpQPCTD6bWnTzGI17dZPzzyZE1KiwXB5E+F4lCOvJjTEvwdSCMCufhnsBfkB5cTWFp9Z/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:16:09.865299Z"},"content_sha256":"d3a1180a943ce0112ba03a1e17c38559a36c34462d2bdadf0c82b357ce2a4c9a","schema_version":"1.0","event_id":"sha256:d3a1180a943ce0112ba03a1e17c38559a36c34462d2bdadf0c82b357ce2a4c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LQBHCHVGBJBFL5V4OLM6RH6RJY","target":"graph","payload":{"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"},"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:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9Av6/rXV8BlP4rhfQUyscuJ7lUiw6vxPgU2gQofkE0D+vlHPwQkGUv8upWTgYy2O8zleakaY+yDHoCSD5cvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:16:09.865669Z"},"content_sha256":"e95f45299f884f74e5cfc977f0873139259811b829e60d80fc0e739e456de5fc","schema_version":"1.0","event_id":"sha256:e95f45299f884f74e5cfc977f0873139259811b829e60d80fc0e739e456de5fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/bundle.json","state_url":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/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-07-04T13:16:09Z","links":{"resolver":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY","bundle":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/bundle.json","state":"https://pith.science/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQBHCHVGBJBFL5V4OLM6RH6RJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LQBHCHVGBJBFL5V4OLM6RH6RJY","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":"22d5ec9dc7b78792a8fab58401608663f8cd0d689760f88e71310d78fa13393c","cross_cats_sorted":["cs.DM","cs.SI","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-02T09:02:53Z","title_canon_sha256":"7d304edc08c0c30239f41dd198dbbae0396cd6631002b459acd16ba9f87b01c7"},"schema_version":"1.0","source":{"id":"1503.00445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00445","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00445v2","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00445","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQBHCHVGBJBF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQBHCHVGBJBFL5V4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQBHCHVG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:e95f45299f884f74e5cfc977f0873139259811b829e60d80fc0e739e456de5fc","target":"graph","created_at":"2026-05-18T01:33:35Z","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":"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","authors_text":"J-C. Delvenne, R. Aldecoa, V.A. Traag","cross_cats":["cs.DM","cs.SI","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-02T09:02:53Z","title":"Detecting communities using asymptotical Surprise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00445","kind":"arxiv","version":2},"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:d3a1180a943ce0112ba03a1e17c38559a36c34462d2bdadf0c82b357ce2a4c9a","target":"record","created_at":"2026-05-18T01:33:35Z","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":"22d5ec9dc7b78792a8fab58401608663f8cd0d689760f88e71310d78fa13393c","cross_cats_sorted":["cs.DM","cs.SI","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-02T09:02:53Z","title_canon_sha256":"7d304edc08c0c30239f41dd198dbbae0396cd6631002b459acd16ba9f87b01c7"},"schema_version":"1.0","source":{"id":"1503.00445","kind":"arxiv","version":2}},"canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c02711ea60a4255f6bc72d9e89fd14e05f620412d5f2aa61ea223d27f5e5579","first_computed_at":"2026-05-18T01:33:35.067386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:35.067386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6ieR7Y0D8qzG7OuEoGp+JhzANBILEkAFr4ymL6KOxZkf2N7RSWx0cj77eyejfX+36ffTQSPkYpmna8sqSDCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:35.068157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3a1180a943ce0112ba03a1e17c38559a36c34462d2bdadf0c82b357ce2a4c9a","sha256:e95f45299f884f74e5cfc977f0873139259811b829e60d80fc0e739e456de5fc"],"state_sha256":"90305b9d53427a6beb81d487d1cce80c7e5ca527e9f0c1f26b513ee4da6ceebb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMmuq40adaMnj8f5mmhe8bIgASxLT2N9jj0wtz7lf1bmkv6ZEdbLTyff5Dzxx0wtZtjC3HIo0VO+AVgu1FhXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:16:09.867658Z","bundle_sha256":"1eed25c92f7b20490370898deb577b925cd746ad541e0c3514ed889918bc8810"}}