{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FLQF3YFVIXR56NYCEQC2OJPKXP","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":"2ec71e03cbe0cc9aa668cc46878f230658afc02d668e3884128d9bd0f4ba3b26","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-11T19:57:06Z","title_canon_sha256":"a4925f8149df3f5cd9e14b4947570196d4ac8a7fd35ab7414a9f56c3f0a7e0a4"},"schema_version":"1.0","source":{"id":"1701.03141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03141","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03141v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03141","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"FLQF3YFVIXR5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLQF3YFVIXR56NYC","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLQF3YFV","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:63feded19c713fafb28d6cbacfe7e4e904d9fe9eef4f385585a364476c9c46b6","target":"graph","created_at":"2026-05-18T00:40:13Z","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":"Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the vertices within clusters but sparse connections between vertices of different clusters. As a result, modularity is often used in optimization methods for detecting community structure in networks, and so it is an important graph parameter from a practical point of view. Unfortunately, many existing non-spatial models of complex networks do not generate graphs with high modularity; on the other hand, spatial models na","authors_text":"Andrei Raigorodskii, Liudmila Ostroumova Prokhorenkova, Pawel Pralat","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-11T19:57:06Z","title":"Modularity of complex networks models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03141","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:d64e14b002ea3f28202ed2b463e393ad96777427317f192d86a11419fe73834a","target":"record","created_at":"2026-05-18T00:40:13Z","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":"2ec71e03cbe0cc9aa668cc46878f230658afc02d668e3884128d9bd0f4ba3b26","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-11T19:57:06Z","title_canon_sha256":"a4925f8149df3f5cd9e14b4947570196d4ac8a7fd35ab7414a9f56c3f0a7e0a4"},"schema_version":"1.0","source":{"id":"1701.03141","kind":"arxiv","version":2}},"canonical_sha256":"2ae05de0b545e3df37022405a725eabbfa1ce268f4ef65b8ab16ea2c4172ca67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ae05de0b545e3df37022405a725eabbfa1ce268f4ef65b8ab16ea2c4172ca67","first_computed_at":"2026-05-18T00:40:13.422649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:13.422649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iv5OmcODkKkgsl4TRKBKvIRvN8oGqGo1BgypjIoNxKomPZRgWE8EdPxpZQJbP2OKrws73ntqHkqipi/MlGGHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:13.423260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d64e14b002ea3f28202ed2b463e393ad96777427317f192d86a11419fe73834a","sha256:63feded19c713fafb28d6cbacfe7e4e904d9fe9eef4f385585a364476c9c46b6"],"state_sha256":"f2c755cffd279d91ea4c4ae1e0200aa13283162c1e86ffb02188374130b8729f"}