{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:33ICMUNC3UTMBRQWJI2AII3CZT","short_pith_number":"pith:33ICMUNC","canonical_record":{"source":{"id":"1212.4794","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.data-an","submitted_at":"2012-12-19T19:10:54Z","cross_cats_sorted":["physics.soc-ph","stat.ML"],"title_canon_sha256":"f412fd76386a8f5a0b84c5e3a7daa5fe88129c034e6b249ddb849f359bce5614","abstract_canon_sha256":"e52be495c49a1dfcb5f20239dc4d6c3a824d60007e69e56ccf7a16dbdb9d05d6"},"schema_version":"1.0"},"canonical_sha256":"ded02651a2dd26c0c6164a34042362cce01430a397be670b9c8e083ca352e0a6","source":{"kind":"arxiv","id":"1212.4794","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4794","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4794v4","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4794","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"33ICMUNC3UTM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33ICMUNC3UTMBRQW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33ICMUNC","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:33ICMUNC3UTMBRQWJI2AII3CZT","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4794","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.data-an","submitted_at":"2012-12-19T19:10:54Z","cross_cats_sorted":["physics.soc-ph","stat.ML"],"title_canon_sha256":"f412fd76386a8f5a0b84c5e3a7daa5fe88129c034e6b249ddb849f359bce5614","abstract_canon_sha256":"e52be495c49a1dfcb5f20239dc4d6c3a824d60007e69e56ccf7a16dbdb9d05d6"},"schema_version":"1.0"},"canonical_sha256":"ded02651a2dd26c0c6164a34042362cce01430a397be670b9c8e083ca352e0a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:45.732528Z","signature_b64":"xlb3l8c5dZVO1nu7+1tq0DSXhiA158Ej/kgFAqQEIBTlZzTJHCUhQprZ/ZP9ziAQ5UthU/uxceJ9frN7QL54Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded02651a2dd26c0c6164a34042362cce01430a397be670b9c8e083ca352e0a6","last_reissued_at":"2026-05-18T03:28:45.731593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:45.731593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4794","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-18T03:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILlmmTaRmhirA/ZRzbQcHEGrem5jNmqFAcvU9tC6iEBsZdmSas1nxcEPv5AvAB+UJIYCh8MCIX2sJXygK8K4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:38:29.092136Z"},"content_sha256":"732ba2fafd6f6cfcfe2c75d6385ef6269be8ecbe1df636bdc466d7714ae816eb","schema_version":"1.0","event_id":"sha256:732ba2fafd6f6cfcfe2c75d6385ef6269be8ecbe1df636bdc466d7714ae816eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:33ICMUNC3UTMBRQWJI2AII3CZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parsimonious module inference in large networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph","stat.ML"],"primary_cat":"physics.data-an","authors_text":"Tiago P. Peixoto","submitted_at":"2012-12-19T19:10:54Z","abstract_excerpt":"We investigate the detectability of modules in large networks when the number of modules is not known in advance. We employ the minimum description length (MDL) principle which seeks to minimize the total amount of information required to describe the network, and avoid overfitting. According to this criterion, we obtain general bounds on the detectability of any prescribed block structure, given the number of nodes and edges in the sampled network. We also obtain that the maximum number of detectable blocks scales as $\\sqrt{N}$, where $N$ is the number of nodes in the network, for a fixed ave"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4794","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-18T03:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUCFzZgtLgCUy/1TDGkX3jD3djPVErPssRSQG49XnjCiuOkAq3MnLk7/dbN5IGOpImXst00BfgFFFoFDhdk8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:38:29.092776Z"},"content_sha256":"5f56031a0cf87def2cd5e7c492a658ee74de895c78a6edef169d28baf8f503c7","schema_version":"1.0","event_id":"sha256:5f56031a0cf87def2cd5e7c492a658ee74de895c78a6edef169d28baf8f503c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33ICMUNC3UTMBRQWJI2AII3CZT/bundle.json","state_url":"https://pith.science/pith/33ICMUNC3UTMBRQWJI2AII3CZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33ICMUNC3UTMBRQWJI2AII3CZT/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-06T19:38:29Z","links":{"resolver":"https://pith.science/pith/33ICMUNC3UTMBRQWJI2AII3CZT","bundle":"https://pith.science/pith/33ICMUNC3UTMBRQWJI2AII3CZT/bundle.json","state":"https://pith.science/pith/33ICMUNC3UTMBRQWJI2AII3CZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33ICMUNC3UTMBRQWJI2AII3CZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:33ICMUNC3UTMBRQWJI2AII3CZT","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":"e52be495c49a1dfcb5f20239dc4d6c3a824d60007e69e56ccf7a16dbdb9d05d6","cross_cats_sorted":["physics.soc-ph","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.data-an","submitted_at":"2012-12-19T19:10:54Z","title_canon_sha256":"f412fd76386a8f5a0b84c5e3a7daa5fe88129c034e6b249ddb849f359bce5614"},"schema_version":"1.0","source":{"id":"1212.4794","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4794","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4794v4","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4794","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"33ICMUNC3UTM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33ICMUNC3UTMBRQW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33ICMUNC","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:5f56031a0cf87def2cd5e7c492a658ee74de895c78a6edef169d28baf8f503c7","target":"graph","created_at":"2026-05-18T03:28:45Z","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":"We investigate the detectability of modules in large networks when the number of modules is not known in advance. We employ the minimum description length (MDL) principle which seeks to minimize the total amount of information required to describe the network, and avoid overfitting. According to this criterion, we obtain general bounds on the detectability of any prescribed block structure, given the number of nodes and edges in the sampled network. We also obtain that the maximum number of detectable blocks scales as $\\sqrt{N}$, where $N$ is the number of nodes in the network, for a fixed ave","authors_text":"Tiago P. Peixoto","cross_cats":["physics.soc-ph","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.data-an","submitted_at":"2012-12-19T19:10:54Z","title":"Parsimonious module inference in large networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4794","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:732ba2fafd6f6cfcfe2c75d6385ef6269be8ecbe1df636bdc466d7714ae816eb","target":"record","created_at":"2026-05-18T03:28:45Z","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":"e52be495c49a1dfcb5f20239dc4d6c3a824d60007e69e56ccf7a16dbdb9d05d6","cross_cats_sorted":["physics.soc-ph","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.data-an","submitted_at":"2012-12-19T19:10:54Z","title_canon_sha256":"f412fd76386a8f5a0b84c5e3a7daa5fe88129c034e6b249ddb849f359bce5614"},"schema_version":"1.0","source":{"id":"1212.4794","kind":"arxiv","version":4}},"canonical_sha256":"ded02651a2dd26c0c6164a34042362cce01430a397be670b9c8e083ca352e0a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ded02651a2dd26c0c6164a34042362cce01430a397be670b9c8e083ca352e0a6","first_computed_at":"2026-05-18T03:28:45.731593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:45.731593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xlb3l8c5dZVO1nu7+1tq0DSXhiA158Ej/kgFAqQEIBTlZzTJHCUhQprZ/ZP9ziAQ5UthU/uxceJ9frN7QL54Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:45.732528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4794","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:732ba2fafd6f6cfcfe2c75d6385ef6269be8ecbe1df636bdc466d7714ae816eb","sha256:5f56031a0cf87def2cd5e7c492a658ee74de895c78a6edef169d28baf8f503c7"],"state_sha256":"19598ae0d771e168818375a11312860e97a08e624e2ab2a47d665b3491420866"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZdc0JHxYtlhti55xAX8q3Dg5O6lk0w86LvIouI0iE6bxZmPvvp5K3VjG/VKLupHPa87dN9xmST2QAQ/ibxYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:38:29.095449Z","bundle_sha256":"76f02a1eb49011cf593dd014ffd3a625053ad3733dd9101412a6b1c4ab931027"}}