{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UKSFWFO6C32QEBURL5FMCDBULF","short_pith_number":"pith:UKSFWFO6","canonical_record":{"source":{"id":"1112.4677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-20T13:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"a55545e210f70f7717e0af41a1b1c5678768a3d59dfdb7b81ce0beb9088658de","abstract_canon_sha256":"fcb7252a665d2447e909f855175dbb80ebb8afad56839032452ad9720204d72c"},"schema_version":"1.0"},"canonical_sha256":"a2a45b15de16f50206915f4ac10c34597226557b8ce89c5c804789058d7940a4","source":{"kind":"arxiv","id":"1112.4677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4677","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4677v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4677","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"UKSFWFO6C32Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UKSFWFO6C32QEBUR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UKSFWFO6","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UKSFWFO6C32QEBURL5FMCDBULF","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-20T13:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"a55545e210f70f7717e0af41a1b1c5678768a3d59dfdb7b81ce0beb9088658de","abstract_canon_sha256":"fcb7252a665d2447e909f855175dbb80ebb8afad56839032452ad9720204d72c"},"schema_version":"1.0"},"canonical_sha256":"a2a45b15de16f50206915f4ac10c34597226557b8ce89c5c804789058d7940a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:58.277576Z","signature_b64":"X5UMM6yivsoR6xLO6jZTYvqtUJ/tgYD16fbXBaof01q/gLQvOvgz/xwcHqbFogUi6c/3RtEVFaN8SBd3M7hTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a45b15de16f50206915f4ac10c34597226557b8ce89c5c804789058d7940a4","last_reissued_at":"2026-05-18T04:05:58.276907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:58.276907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4677","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smeyidWrwUpVRlX7Ro6KLbC0tUyI3zKxV5hEBsRoU3s2oyEatnWy4CzmmzGgL1lBIKOj2IEBRKvPtGfVyelZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:13:20.271727Z"},"content_sha256":"330ff64225fb9c4b97aeb8e114af11dddfb3da1b153e10bd7d1805cb1e914305","schema_version":"1.0","event_id":"sha256:330ff64225fb9c4b97aeb8e114af11dddfb3da1b153e10bd7d1805cb1e914305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UKSFWFO6C32QEBURL5FMCDBULF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbiased degree-preserving randomisation of directed binary networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"A. C. C. Coolen, E. S. Roberts","submitted_at":"2011-12-20T13:08:56Z","abstract_excerpt":"Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for directed graphs, which converges to a strictly uniform measure and is based on edge swaps that conserve all in- and out-degrees. The acceptance probabilities can also be generalized to define Markov chains that target any alternative desired measure on the space of directed graphs, in order to generate graphs with more sophisticated topological features. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4677","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2as1RD6ruMQ2jxtxWKbthBzOHT1RTKr/H8rMveaq1yeubP1YFxEegvPJp27qt5pr/H4xTE8sinmtL0VLx3bAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:13:20.272168Z"},"content_sha256":"6c8db697f1f954bd4ec74a21aa998263eab563e08a0390c790618ed988a00f6f","schema_version":"1.0","event_id":"sha256:6c8db697f1f954bd4ec74a21aa998263eab563e08a0390c790618ed988a00f6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKSFWFO6C32QEBURL5FMCDBULF/bundle.json","state_url":"https://pith.science/pith/UKSFWFO6C32QEBURL5FMCDBULF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKSFWFO6C32QEBURL5FMCDBULF/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-05-28T06:13:20Z","links":{"resolver":"https://pith.science/pith/UKSFWFO6C32QEBURL5FMCDBULF","bundle":"https://pith.science/pith/UKSFWFO6C32QEBURL5FMCDBULF/bundle.json","state":"https://pith.science/pith/UKSFWFO6C32QEBURL5FMCDBULF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKSFWFO6C32QEBURL5FMCDBULF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UKSFWFO6C32QEBURL5FMCDBULF","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":"fcb7252a665d2447e909f855175dbb80ebb8afad56839032452ad9720204d72c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-20T13:08:56Z","title_canon_sha256":"a55545e210f70f7717e0af41a1b1c5678768a3d59dfdb7b81ce0beb9088658de"},"schema_version":"1.0","source":{"id":"1112.4677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4677","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4677v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4677","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"UKSFWFO6C32Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UKSFWFO6C32QEBUR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UKSFWFO6","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:6c8db697f1f954bd4ec74a21aa998263eab563e08a0390c790618ed988a00f6f","target":"graph","created_at":"2026-05-18T04:05:58Z","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":"Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for directed graphs, which converges to a strictly uniform measure and is based on edge swaps that conserve all in- and out-degrees. The acceptance probabilities can also be generalized to define Markov chains that target any alternative desired measure on the space of directed graphs, in order to generate graphs with more sophisticated topological features. Thi","authors_text":"A. C. C. Coolen, E. S. Roberts","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-20T13:08:56Z","title":"Unbiased degree-preserving randomisation of directed binary networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4677","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:330ff64225fb9c4b97aeb8e114af11dddfb3da1b153e10bd7d1805cb1e914305","target":"record","created_at":"2026-05-18T04:05:58Z","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":"fcb7252a665d2447e909f855175dbb80ebb8afad56839032452ad9720204d72c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-20T13:08:56Z","title_canon_sha256":"a55545e210f70f7717e0af41a1b1c5678768a3d59dfdb7b81ce0beb9088658de"},"schema_version":"1.0","source":{"id":"1112.4677","kind":"arxiv","version":1}},"canonical_sha256":"a2a45b15de16f50206915f4ac10c34597226557b8ce89c5c804789058d7940a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a45b15de16f50206915f4ac10c34597226557b8ce89c5c804789058d7940a4","first_computed_at":"2026-05-18T04:05:58.276907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:58.276907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5UMM6yivsoR6xLO6jZTYvqtUJ/tgYD16fbXBaof01q/gLQvOvgz/xwcHqbFogUi6c/3RtEVFaN8SBd3M7hTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:58.277576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:330ff64225fb9c4b97aeb8e114af11dddfb3da1b153e10bd7d1805cb1e914305","sha256:6c8db697f1f954bd4ec74a21aa998263eab563e08a0390c790618ed988a00f6f"],"state_sha256":"7f337afdd8fa54504e01ec904a06e9a82475c31c46b62d342dd4e0aa54f3515b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xg74Wqt0D2hgFpl/Sm+k1PRINQfnTFxA4XBAvIMSb9ouwgBM6TSTC7uZ/Q7Uc75Nge6OkVOselwrtQsL+tGJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:13:20.274710Z","bundle_sha256":"43cf301954e49a5b8af93ad8c7cab802aa0f7c7b8d05ca234e001d630217f429"}}