{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JR7EKRJV3VDDHWW7ZDNCURU5IC","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":"7028851ebb827f87965818240cf5f03966f456f112ad98d287955a8474410cf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-14T12:38:56Z","title_canon_sha256":"7abdf4eb8b3ea6043430b9a0ddec652587b4dfc5aee7d6917b721b59c91e1e89"},"schema_version":"1.0","source":{"id":"1608.04093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04093","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04093v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04093","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"JR7EKRJV3VDD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR7EKRJV3VDDHWW7","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR7EKRJV","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:80923ec0306685ef4ac833a7fb8c74d0d4e932367b37a28850ebbf2de0ba2075","target":"graph","created_at":"2026-05-18T01:09:04Z","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 confirm a conjecture by Everett, Sinclair, and Dankelmann~[Some Centrality results new and old, J. Math. Sociology 28 (2004), 215--227] regarding the problem of maximizing closeness centralization in two-mode data, where the number of data of each type is fixed. Intuitively, our result states that among all networks obtainable via two-mode data, the largest closeness is achieved by simply locally maximizing the closeness of a node. Mathematically, our study concerns bipartite graphs with fixed size bipartitions, and we show that the extremal configuration is a rooted tree of depth~$2$, wher","authors_text":"Jean-S\\'ebastien Sereni, Matja\\v{z} Krnc, Riste \\v{S}krekovski, Zelealem B. Yilma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-14T12:38:56Z","title":"Closeness Centralization Measure for Two-mode Data of Prescribed Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04093","kind":"arxiv","version":1},"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:0f60c48b0704ba360d3c0be1a282f46285c05a0dec55fcc2dbddba414da902ba","target":"record","created_at":"2026-05-18T01:09:04Z","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":"7028851ebb827f87965818240cf5f03966f456f112ad98d287955a8474410cf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-14T12:38:56Z","title_canon_sha256":"7abdf4eb8b3ea6043430b9a0ddec652587b4dfc5aee7d6917b721b59c91e1e89"},"schema_version":"1.0","source":{"id":"1608.04093","kind":"arxiv","version":1}},"canonical_sha256":"4c7e454535dd4633dadfc8da2a469d40a79ae8d38443b4b1c8c4277ed12241b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c7e454535dd4633dadfc8da2a469d40a79ae8d38443b4b1c8c4277ed12241b8","first_computed_at":"2026-05-18T01:09:04.277849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:04.277849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bRrkgljfH5BJL+Ybbi35u1fp9gBjR2/A1JUQo7EnHkvvzpPV4ddzfN+QjKFhzYwaL1zY1Xw33cqpgbveMD4sCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:04.278578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f60c48b0704ba360d3c0be1a282f46285c05a0dec55fcc2dbddba414da902ba","sha256:80923ec0306685ef4ac833a7fb8c74d0d4e932367b37a28850ebbf2de0ba2075"],"state_sha256":"079ad898b228f9059b954cb8b4c79faf869b9e3db953f6db6239cde7810f1a05"}