{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:V2HAYWJKBG4X4BSRFOULGGWJVX","short_pith_number":"pith:V2HAYWJK","canonical_record":{"source":{"id":"0905.4155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-05-26T10:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"28b45f08396b0aadb6af9d616a400171dfe224b4b9df32419b98c5913683c803","abstract_canon_sha256":"bbec132159111d6f928f42a87234cd6fb9cb4e48c7489db1cd845de2d823ec26"},"schema_version":"1.0"},"canonical_sha256":"ae8e0c592a09b97e06512ba8b31ac9add88f8dd98caf5acb3a52b42b178149e0","source":{"kind":"arxiv","id":"0905.4155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4155","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4155v1","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4155","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"V2HAYWJKBG4X","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2HAYWJKBG4X4BSR","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2HAYWJK","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:V2HAYWJKBG4X4BSRFOULGGWJVX","target":"record","payload":{"canonical_record":{"source":{"id":"0905.4155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-05-26T10:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"28b45f08396b0aadb6af9d616a400171dfe224b4b9df32419b98c5913683c803","abstract_canon_sha256":"bbec132159111d6f928f42a87234cd6fb9cb4e48c7489db1cd845de2d823ec26"},"schema_version":"1.0"},"canonical_sha256":"ae8e0c592a09b97e06512ba8b31ac9add88f8dd98caf5acb3a52b42b178149e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:37.544688Z","signature_b64":"kYOFagEO7eKcnbGDGmOM+U6aWGa9zgKrwXyGorW9vWHajRncXJ6d2C20CUKE1jgpbaE/OjpewyyLiYg7LuInCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae8e0c592a09b97e06512ba8b31ac9add88f8dd98caf5acb3a52b42b178149e0","last_reissued_at":"2026-05-18T02:13:37.544146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:37.544146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.4155","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-18T02:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NV9KI2dauF7gcRJ/bFkt8/J70XmplSIdF8pmw55R9NdzQlAR9doecrZTp+nlrSpJWy6OO+lblb4B5pQubaBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:33:45.511931Z"},"content_sha256":"20831c50b63fb34af08700eddcbd4fa63ae3935aa1560ca1def5ee984376bac1","schema_version":"1.0","event_id":"sha256:20831c50b63fb34af08700eddcbd4fa63ae3935aa1560ca1def5ee984376bac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:V2HAYWJKBG4X4BSRFOULGGWJVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Markovian dynamics of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"A. Annibale, A.C.C. Coolen, A. De Martino","submitted_at":"2009-05-26T10:06:48Z","abstract_excerpt":"We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the `mobility' (the number of allowed moves for any given graph). As an application of the general theory we analyze the properties of degree-preserving Markov chains based on elementary edge switchings. We give an exact yet simple formula for the mobility in terms of the graph's adjacency matrix and its spectrum. This formula allows us to define acceptance proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4155","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-18T02:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbJJQ50aNOvEFikJA8By70I/w2+xQVXdHw/XXPD4Rm7szcUHMD06ki+PZh9d7A5n0D4CEXWpwS43eDWIHNggDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:33:45.512584Z"},"content_sha256":"f3f4e305371694953f5ad0970b4f708fac4173ba020a6271523a30b739a8a348","schema_version":"1.0","event_id":"sha256:f3f4e305371694953f5ad0970b4f708fac4173ba020a6271523a30b739a8a348"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/bundle.json","state_url":"https://pith.science/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/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-26T22:33:45Z","links":{"resolver":"https://pith.science/pith/V2HAYWJKBG4X4BSRFOULGGWJVX","bundle":"https://pith.science/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/bundle.json","state":"https://pith.science/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2HAYWJKBG4X4BSRFOULGGWJVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:V2HAYWJKBG4X4BSRFOULGGWJVX","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":"bbec132159111d6f928f42a87234cd6fb9cb4e48c7489db1cd845de2d823ec26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-05-26T10:06:48Z","title_canon_sha256":"28b45f08396b0aadb6af9d616a400171dfe224b4b9df32419b98c5913683c803"},"schema_version":"1.0","source":{"id":"0905.4155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4155","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4155v1","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4155","created_at":"2026-05-18T02:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"V2HAYWJKBG4X","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2HAYWJKBG4X4BSR","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2HAYWJK","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:f3f4e305371694953f5ad0970b4f708fac4173ba020a6271523a30b739a8a348","target":"graph","created_at":"2026-05-18T02:13:37Z","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 introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the `mobility' (the number of allowed moves for any given graph). As an application of the general theory we analyze the properties of degree-preserving Markov chains based on elementary edge switchings. We give an exact yet simple formula for the mobility in terms of the graph's adjacency matrix and its spectrum. This formula allows us to define acceptance proba","authors_text":"A. Annibale, A.C.C. Coolen, A. De Martino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-05-26T10:06:48Z","title":"Constrained Markovian dynamics of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4155","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:20831c50b63fb34af08700eddcbd4fa63ae3935aa1560ca1def5ee984376bac1","target":"record","created_at":"2026-05-18T02:13:37Z","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":"bbec132159111d6f928f42a87234cd6fb9cb4e48c7489db1cd845de2d823ec26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-05-26T10:06:48Z","title_canon_sha256":"28b45f08396b0aadb6af9d616a400171dfe224b4b9df32419b98c5913683c803"},"schema_version":"1.0","source":{"id":"0905.4155","kind":"arxiv","version":1}},"canonical_sha256":"ae8e0c592a09b97e06512ba8b31ac9add88f8dd98caf5acb3a52b42b178149e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae8e0c592a09b97e06512ba8b31ac9add88f8dd98caf5acb3a52b42b178149e0","first_computed_at":"2026-05-18T02:13:37.544146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:37.544146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kYOFagEO7eKcnbGDGmOM+U6aWGa9zgKrwXyGorW9vWHajRncXJ6d2C20CUKE1jgpbaE/OjpewyyLiYg7LuInCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:37.544688Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.4155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20831c50b63fb34af08700eddcbd4fa63ae3935aa1560ca1def5ee984376bac1","sha256:f3f4e305371694953f5ad0970b4f708fac4173ba020a6271523a30b739a8a348"],"state_sha256":"d01984794b083f85e86a4ae4e3c71d070e2c4ba0b242b6de13a1f9293c6b1271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kp4z5r6rEbNtjU4T6xYPYJWaQg402jKKrXQms20idkDMdFRsUA1TY4j/+vpZEbE2rglfgisIfs3K5HYRWIwYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:33:45.516009Z","bundle_sha256":"319267d976c79b2fa453b02400ffa68ac1530a30f2003e4af60bb097f982195e"}}