{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GCOVADEYBYN2PNDJHEJFTX3OPN","short_pith_number":"pith:GCOVADEY","canonical_record":{"source":{"id":"1901.11483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-31T17:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"8edb9194000ace334afbbfeb769b5552e1d5d6b5181f7f1a5f30fd7a7cb21e02","abstract_canon_sha256":"ba477e1db42319a0d71afb9caadbd5c990995940961c1daad9a95ad577e06e93"},"schema_version":"1.0"},"canonical_sha256":"309d500c980e1ba7b469391259df6e7b7c738fcdc855b6e802a96bd961a1bb9d","source":{"kind":"arxiv","id":"1901.11483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11483","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11483v3","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11483","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"GCOVADEYBYN2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCOVADEYBYN2PNDJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCOVADEY","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GCOVADEYBYN2PNDJHEJFTX3OPN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.11483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-31T17:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"8edb9194000ace334afbbfeb769b5552e1d5d6b5181f7f1a5f30fd7a7cb21e02","abstract_canon_sha256":"ba477e1db42319a0d71afb9caadbd5c990995940961c1daad9a95ad577e06e93"},"schema_version":"1.0"},"canonical_sha256":"309d500c980e1ba7b469391259df6e7b7c738fcdc855b6e802a96bd961a1bb9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.123930Z","signature_b64":"UseDyogCHAQIJnyH4vDUmZHnQO9on9a5E4cZwRqIptDcd+9pDdr3AgBqehEi6E4Dy//XfJMBKTGNHZLRtu2zBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309d500c980e1ba7b469391259df6e7b7c738fcdc855b6e802a96bd961a1bb9d","last_reissued_at":"2026-05-17T23:47:12.123531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.123531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.11483","source_version":3,"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SdIkt05Btrsscj5EALRlvPJi3k2NRK/MIoSF5oXuIJryCbA4LHS+adcrVjw3LdhVhZZ0PgzCNOtJyzpN7irBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:46:49.297283Z"},"content_sha256":"f8a577227c31c46f298759ecc5c94837d1afe139a8f6223ad2dc5d9e4c08107c","schema_version":"1.0","event_id":"sha256:f8a577227c31c46f298759ecc5c94837d1afe139a8f6223ad2dc5d9e4c08107c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GCOVADEYBYN2PNDJHEJFTX3OPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbed Markov Chains and Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Benard Abola, Christopher Engstr\\\"om, Dmitrii Silvestrov, Godwin Kakuba, John Magero Mango, Pitos Seleka Biganda, Sergei Silvestrov","submitted_at":"2019-01-31T17:21:59Z","abstract_excerpt":"The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularised by adding a special damping matrix multiplied by a small damping (perturbation) parameter $\\varepsilon$. We give effective upper bounds for the rate of approximation for stationary distributions of unperturbed Markov chains by stationary distributions of perturbed Markov chains with regularised matrices of transition probabilities, asymptotic expansions for approximating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11483","kind":"arxiv","version":3},"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNvIZu5rVopQvB5lXY8SHswVnmSl69ndsxhCJgwKXQisDkmSwGqGvkUMOVm5g7cWz1eispu9zcIRxhsjUmsZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:46:49.297632Z"},"content_sha256":"6adafa376aa8e8d6bd7c892e8c01d3927fdc1eedc8c7f2ccbeae4514c3216cd5","schema_version":"1.0","event_id":"sha256:6adafa376aa8e8d6bd7c892e8c01d3927fdc1eedc8c7f2ccbeae4514c3216cd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/bundle.json","state_url":"https://pith.science/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/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-27T20:46:49Z","links":{"resolver":"https://pith.science/pith/GCOVADEYBYN2PNDJHEJFTX3OPN","bundle":"https://pith.science/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/bundle.json","state":"https://pith.science/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCOVADEYBYN2PNDJHEJFTX3OPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GCOVADEYBYN2PNDJHEJFTX3OPN","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":"ba477e1db42319a0d71afb9caadbd5c990995940961c1daad9a95ad577e06e93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-31T17:21:59Z","title_canon_sha256":"8edb9194000ace334afbbfeb769b5552e1d5d6b5181f7f1a5f30fd7a7cb21e02"},"schema_version":"1.0","source":{"id":"1901.11483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11483","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11483v3","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11483","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"GCOVADEYBYN2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCOVADEYBYN2PNDJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCOVADEY","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:6adafa376aa8e8d6bd7c892e8c01d3927fdc1eedc8c7f2ccbeae4514c3216cd5","target":"graph","created_at":"2026-05-17T23:47:12Z","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":"The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularised by adding a special damping matrix multiplied by a small damping (perturbation) parameter $\\varepsilon$. We give effective upper bounds for the rate of approximation for stationary distributions of unperturbed Markov chains by stationary distributions of perturbed Markov chains with regularised matrices of transition probabilities, asymptotic expansions for approximating","authors_text":"Benard Abola, Christopher Engstr\\\"om, Dmitrii Silvestrov, Godwin Kakuba, John Magero Mango, Pitos Seleka Biganda, Sergei Silvestrov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-31T17:21:59Z","title":"Perturbed Markov Chains and Information Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11483","kind":"arxiv","version":3},"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:f8a577227c31c46f298759ecc5c94837d1afe139a8f6223ad2dc5d9e4c08107c","target":"record","created_at":"2026-05-17T23:47:12Z","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":"ba477e1db42319a0d71afb9caadbd5c990995940961c1daad9a95ad577e06e93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-31T17:21:59Z","title_canon_sha256":"8edb9194000ace334afbbfeb769b5552e1d5d6b5181f7f1a5f30fd7a7cb21e02"},"schema_version":"1.0","source":{"id":"1901.11483","kind":"arxiv","version":3}},"canonical_sha256":"309d500c980e1ba7b469391259df6e7b7c738fcdc855b6e802a96bd961a1bb9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"309d500c980e1ba7b469391259df6e7b7c738fcdc855b6e802a96bd961a1bb9d","first_computed_at":"2026-05-17T23:47:12.123531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.123531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UseDyogCHAQIJnyH4vDUmZHnQO9on9a5E4cZwRqIptDcd+9pDdr3AgBqehEi6E4Dy//XfJMBKTGNHZLRtu2zBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.123930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8a577227c31c46f298759ecc5c94837d1afe139a8f6223ad2dc5d9e4c08107c","sha256:6adafa376aa8e8d6bd7c892e8c01d3927fdc1eedc8c7f2ccbeae4514c3216cd5"],"state_sha256":"da9f25792f0ba5a77baf63e64a1c7405060cdb79254e5fcfe37bf54b76f65a54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDbJMegecc27xitndjfIpFjlKyxXP6AR7Dr2I7WL1eHn/3SHdhdnT8zNh0ZJAypcaWaK1HRvF/gZ0VdSbRAqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:46:49.299465Z","bundle_sha256":"cf677ef8f04beababd3df52653a4f52e3f00e71f52e08a5dcaa9cc70e53a5e21"}}