{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:434RLCBCGUZUYCIOXOYYINPKLF","short_pith_number":"pith:434RLCBC","canonical_record":{"source":{"id":"1607.01742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T18:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"a3347c4b27c2647919255bb826821829b923390eb77df146ab917877c7d0405f","abstract_canon_sha256":"3c4a7971aeee49bb30ec0ddba8af7c3d83f446295cf0a64974d372d7652025ea"},"schema_version":"1.0"},"canonical_sha256":"e6f915882235334c090ebbb18435ea5976c7de8c7d60b39a1dfc8b60261b7a49","source":{"kind":"arxiv","id":"1607.01742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01742","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01742v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01742","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"434RLCBCGUZU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"434RLCBCGUZUYCIO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"434RLCBC","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:434RLCBCGUZUYCIOXOYYINPKLF","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T18:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"a3347c4b27c2647919255bb826821829b923390eb77df146ab917877c7d0405f","abstract_canon_sha256":"3c4a7971aeee49bb30ec0ddba8af7c3d83f446295cf0a64974d372d7652025ea"},"schema_version":"1.0"},"canonical_sha256":"e6f915882235334c090ebbb18435ea5976c7de8c7d60b39a1dfc8b60261b7a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.585225Z","signature_b64":"k7P8xnRMFMmSQv+NZC9SdZlVJHaONXXlon5xZO2DHeCp/2M8m6EseYJEw9XAmj5EeHLGmzO51uq9ZWQulNREBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6f915882235334c090ebbb18435ea5976c7de8c7d60b39a1dfc8b60261b7a49","last_reissued_at":"2026-05-18T01:11:25.584727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.584727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01742","source_version":1,"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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QI9L/0q+OHl57DjDrvLLdYEm/WGOMIlJOghnh8xLJJ4y9H3J8x1KMKR/eRG+rS7vSLnsb5nVtpOkeU/bmugAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:09:53.087018Z"},"content_sha256":"fc6014a4eb8c06d02711d22a3d7968b00d93eb487068a4226866f521bfed7674","schema_version":"1.0","event_id":"sha256:fc6014a4eb8c06d02711d22a3d7968b00d93eb487068a4226866f521bfed7674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:434RLCBCGUZUYCIOXOYYINPKLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating maximally disassortative graphs with given degree distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Egor Samosvat, Liudmila Ostroumova Prokhorenkova, Pim van der Hoorn","submitted_at":"2016-07-06T18:59:44Z","abstract_excerpt":"In this paper we consider the optimization problem of generating graphs with a prescribed degree distribution, such that the correlation between the degrees of connected nodes, as measured by Spearman's rho, is minimal. We provide an algorithm for solving this problem and obtain a complete characterization of the joint degree distribution in these maximally disassortative graphs, in terms of the size-biased degree distribution. As a result we get a lower bound for Spearman's rho on graphs with an arbitrary given degree distribution. We use this lower bound to show that for any fixed tail expon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01742","kind":"arxiv","version":1},"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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xaWgxRyiTaWRBxDRMW16+mkM8vbBnJncBgwtYh2B6mXzorcAHr/YfBNwaxbTBDJ+szSdcHS47IvdtNoJ9IlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:09:53.088153Z"},"content_sha256":"69d96d8044660fd0a1dd62ce6a3149cfb54041e079724a9b50f4719ba319c8f2","schema_version":"1.0","event_id":"sha256:69d96d8044660fd0a1dd62ce6a3149cfb54041e079724a9b50f4719ba319c8f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/434RLCBCGUZUYCIOXOYYINPKLF/bundle.json","state_url":"https://pith.science/pith/434RLCBCGUZUYCIOXOYYINPKLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/434RLCBCGUZUYCIOXOYYINPKLF/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-29T00:09:53Z","links":{"resolver":"https://pith.science/pith/434RLCBCGUZUYCIOXOYYINPKLF","bundle":"https://pith.science/pith/434RLCBCGUZUYCIOXOYYINPKLF/bundle.json","state":"https://pith.science/pith/434RLCBCGUZUYCIOXOYYINPKLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/434RLCBCGUZUYCIOXOYYINPKLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:434RLCBCGUZUYCIOXOYYINPKLF","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":"3c4a7971aeee49bb30ec0ddba8af7c3d83f446295cf0a64974d372d7652025ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T18:59:44Z","title_canon_sha256":"a3347c4b27c2647919255bb826821829b923390eb77df146ab917877c7d0405f"},"schema_version":"1.0","source":{"id":"1607.01742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01742","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01742v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01742","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"434RLCBCGUZU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"434RLCBCGUZUYCIO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"434RLCBC","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:69d96d8044660fd0a1dd62ce6a3149cfb54041e079724a9b50f4719ba319c8f2","target":"graph","created_at":"2026-05-18T01:11:25Z","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":"In this paper we consider the optimization problem of generating graphs with a prescribed degree distribution, such that the correlation between the degrees of connected nodes, as measured by Spearman's rho, is minimal. We provide an algorithm for solving this problem and obtain a complete characterization of the joint degree distribution in these maximally disassortative graphs, in terms of the size-biased degree distribution. As a result we get a lower bound for Spearman's rho on graphs with an arbitrary given degree distribution. We use this lower bound to show that for any fixed tail expon","authors_text":"Egor Samosvat, Liudmila Ostroumova Prokhorenkova, Pim van der Hoorn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T18:59:44Z","title":"Generating maximally disassortative graphs with given degree distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01742","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:fc6014a4eb8c06d02711d22a3d7968b00d93eb487068a4226866f521bfed7674","target":"record","created_at":"2026-05-18T01:11:25Z","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":"3c4a7971aeee49bb30ec0ddba8af7c3d83f446295cf0a64974d372d7652025ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T18:59:44Z","title_canon_sha256":"a3347c4b27c2647919255bb826821829b923390eb77df146ab917877c7d0405f"},"schema_version":"1.0","source":{"id":"1607.01742","kind":"arxiv","version":1}},"canonical_sha256":"e6f915882235334c090ebbb18435ea5976c7de8c7d60b39a1dfc8b60261b7a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6f915882235334c090ebbb18435ea5976c7de8c7d60b39a1dfc8b60261b7a49","first_computed_at":"2026-05-18T01:11:25.584727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:25.584727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k7P8xnRMFMmSQv+NZC9SdZlVJHaONXXlon5xZO2DHeCp/2M8m6EseYJEw9XAmj5EeHLGmzO51uq9ZWQulNREBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:25.585225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6014a4eb8c06d02711d22a3d7968b00d93eb487068a4226866f521bfed7674","sha256:69d96d8044660fd0a1dd62ce6a3149cfb54041e079724a9b50f4719ba319c8f2"],"state_sha256":"6c11f649abd05b454a3068ca8880e00e4bf962a626d9bc83e896464cccfee8c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A06dy1jtzPrxgdX2UM8cemz1r/1X0PiG24WUO4ZYj1b/GVE/4GBz448tfxU+1Ekfcs/cA+Y0sbbgtHSydHsuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T00:09:53.090123Z","bundle_sha256":"ab7d70a8260ee6a98a780f8895a4af9b32271e8cffab3c20943d50b2892e99cc"}}