{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:72RVPERRPXPLD7UMCSZXOJLEST","short_pith_number":"pith:72RVPERR","canonical_record":{"source":{"id":"1701.06415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-01-20T16:21:41Z","cross_cats_sorted":[],"title_canon_sha256":"3aac6c6f7e76b169906e3c55070956bef9520a34d2a266fa7d8a135b1da020a7","abstract_canon_sha256":"3aedf8c7f68b69db60e68f49f3ee76e707b5984a76cda226c6480e544d39b3e3"},"schema_version":"1.0"},"canonical_sha256":"fea35792317ddeb1fe8c14b377256494fe7ae12730885968c1d188fbd9aa4363","source":{"kind":"arxiv","id":"1701.06415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06415","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06415v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06415","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"72RVPERRPXPL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"72RVPERRPXPLD7UM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"72RVPERR","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:72RVPERRPXPLD7UMCSZXOJLEST","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-01-20T16:21:41Z","cross_cats_sorted":[],"title_canon_sha256":"3aac6c6f7e76b169906e3c55070956bef9520a34d2a266fa7d8a135b1da020a7","abstract_canon_sha256":"3aedf8c7f68b69db60e68f49f3ee76e707b5984a76cda226c6480e544d39b3e3"},"schema_version":"1.0"},"canonical_sha256":"fea35792317ddeb1fe8c14b377256494fe7ae12730885968c1d188fbd9aa4363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.483862Z","signature_b64":"RKL1DtMuONJaYLiQpWr3gZT8cyg4tx5um+ANKkJtbzVSwCMngm8J4nAkv8/KN0j15EAgZOyBtb+fMtbYweDlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea35792317ddeb1fe8c14b377256494fe7ae12730885968c1d188fbd9aa4363","last_reissued_at":"2026-05-18T00:52:18.483461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.483461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06415","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-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1m7BKoLfSMyVsAz+0yp5wJVYxI3hlF0ZqwUJnSyFmGwAVMhgLWyDp1VQwa0BWxqJQmuP/+k1hAx7d+Sfp/QhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:23:04.209009Z"},"content_sha256":"d90f08e3eda9ab4631a5db64e462108caadf20feafda940d8144e90201ab3700","schema_version":"1.0","event_id":"sha256:d90f08e3eda9ab4631a5db64e462108caadf20feafda940d8144e90201ab3700"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:72RVPERRPXPLD7UMCSZXOJLEST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steady state availability general equations of decision and sequential processes in Continuous Time Markov Chain models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Eduardo M. Vasconcelos","submitted_at":"2017-01-20T16:21:41Z","abstract_excerpt":"Continuous Time Markov Chain (CMTC) is widely used to describe and analyze systems in several knowledge areas. Steady state availability is one important analysis that can be made through Markov chain formalism that allows researchers generate equations for several purposes, such as channel capacity estimation in wireless networks as well as system performance estimations. The problem with this kind of analysis is the complex process to generating these equations. In this letter, we have developed general equations for decision and sequential processes of CMTC Models, aiming to help researcher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06415","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-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkhPDWfE3vqFnvr9cfv/c/JIy3eJgwMbzhYSuFhRpaCqOAFMZsCRCd1tAQg7DU9dgKSvqsFW1UtzpArnQorDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:23:04.209373Z"},"content_sha256":"ea4d33d574ac2f6b3eadd94f26c0bac04ab495d0566b55b31a1b8745ab508200","schema_version":"1.0","event_id":"sha256:ea4d33d574ac2f6b3eadd94f26c0bac04ab495d0566b55b31a1b8745ab508200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72RVPERRPXPLD7UMCSZXOJLEST/bundle.json","state_url":"https://pith.science/pith/72RVPERRPXPLD7UMCSZXOJLEST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72RVPERRPXPLD7UMCSZXOJLEST/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-30T21:23:04Z","links":{"resolver":"https://pith.science/pith/72RVPERRPXPLD7UMCSZXOJLEST","bundle":"https://pith.science/pith/72RVPERRPXPLD7UMCSZXOJLEST/bundle.json","state":"https://pith.science/pith/72RVPERRPXPLD7UMCSZXOJLEST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72RVPERRPXPLD7UMCSZXOJLEST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:72RVPERRPXPLD7UMCSZXOJLEST","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":"3aedf8c7f68b69db60e68f49f3ee76e707b5984a76cda226c6480e544d39b3e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-01-20T16:21:41Z","title_canon_sha256":"3aac6c6f7e76b169906e3c55070956bef9520a34d2a266fa7d8a135b1da020a7"},"schema_version":"1.0","source":{"id":"1701.06415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06415","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06415v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06415","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"72RVPERRPXPL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"72RVPERRPXPLD7UM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"72RVPERR","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:ea4d33d574ac2f6b3eadd94f26c0bac04ab495d0566b55b31a1b8745ab508200","target":"graph","created_at":"2026-05-18T00:52:18Z","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":"Continuous Time Markov Chain (CMTC) is widely used to describe and analyze systems in several knowledge areas. Steady state availability is one important analysis that can be made through Markov chain formalism that allows researchers generate equations for several purposes, such as channel capacity estimation in wireless networks as well as system performance estimations. The problem with this kind of analysis is the complex process to generating these equations. In this letter, we have developed general equations for decision and sequential processes of CMTC Models, aiming to help researcher","authors_text":"Eduardo M. Vasconcelos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-01-20T16:21:41Z","title":"Steady state availability general equations of decision and sequential processes in Continuous Time Markov Chain models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06415","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:d90f08e3eda9ab4631a5db64e462108caadf20feafda940d8144e90201ab3700","target":"record","created_at":"2026-05-18T00:52:18Z","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":"3aedf8c7f68b69db60e68f49f3ee76e707b5984a76cda226c6480e544d39b3e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-01-20T16:21:41Z","title_canon_sha256":"3aac6c6f7e76b169906e3c55070956bef9520a34d2a266fa7d8a135b1da020a7"},"schema_version":"1.0","source":{"id":"1701.06415","kind":"arxiv","version":1}},"canonical_sha256":"fea35792317ddeb1fe8c14b377256494fe7ae12730885968c1d188fbd9aa4363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fea35792317ddeb1fe8c14b377256494fe7ae12730885968c1d188fbd9aa4363","first_computed_at":"2026-05-18T00:52:18.483461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.483461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKL1DtMuONJaYLiQpWr3gZT8cyg4tx5um+ANKkJtbzVSwCMngm8J4nAkv8/KN0j15EAgZOyBtb+fMtbYweDlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.483862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d90f08e3eda9ab4631a5db64e462108caadf20feafda940d8144e90201ab3700","sha256:ea4d33d574ac2f6b3eadd94f26c0bac04ab495d0566b55b31a1b8745ab508200"],"state_sha256":"da120c578a97d1a758b52c2fdef64cbf17896109a72c2891f9b65aebfa212609"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zEgZDdYlxWT48jgC7g+tioFLAyCIJ5iX4dskkiQrYARVcs9rgvFrHtt/paRcCy6LwDMZFrfUWTem+f5evEwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:23:04.211409Z","bundle_sha256":"7782f9f16f6a51dbd355ed121054f1781efbd43a12d0b388edf072843613e8a7"}}