{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3NAZ7ZE6UURIEGNAQX7LNSMJJI","short_pith_number":"pith:3NAZ7ZE6","canonical_record":{"source":{"id":"1807.06420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-16T04:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"48fcd08e0db72851c1a5fbf4ea747ee35488c6b9f155eb0bc6b76d1e71fbdda4","abstract_canon_sha256":"85a0fd9195d12b92ea6477e7c92929a64bcb60a9700eee5e22f7aba16b2d36b7"},"schema_version":"1.0"},"canonical_sha256":"db419fe49ea5228219a085feb6c9894a113fe4a35c94e8ebf4d23f49c7d4e4e8","source":{"kind":"arxiv","id":"1807.06420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06420","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06420v1","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06420","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"3NAZ7ZE6UURI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NAZ7ZE6UURIEGNA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NAZ7ZE6","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3NAZ7ZE6UURIEGNAQX7LNSMJJI","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-16T04:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"48fcd08e0db72851c1a5fbf4ea747ee35488c6b9f155eb0bc6b76d1e71fbdda4","abstract_canon_sha256":"85a0fd9195d12b92ea6477e7c92929a64bcb60a9700eee5e22f7aba16b2d36b7"},"schema_version":"1.0"},"canonical_sha256":"db419fe49ea5228219a085feb6c9894a113fe4a35c94e8ebf4d23f49c7d4e4e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.114229Z","signature_b64":"8C3FIe4H00xT5y3yB3gYrYWtIWaulMBLRtOUUq6G+ct9RQBqlD9RRWOY1gkKF41JqJGxFkmtb1I4enMw+iBmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db419fe49ea5228219a085feb6c9894a113fe4a35c94e8ebf4d23f49c7d4e4e8","last_reissued_at":"2026-05-18T00:10:33.113587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.113587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06420","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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AN087jaiV/O0IYPpv//u+XPqWkTgZoDjhF0O4EU5OZkFp5BkbvRrIIWj4NqtooWOl8RnRIJdwdOKESgGD2ZrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:20:59.086780Z"},"content_sha256":"b92402025b0eb7a01ab67951fd307144206a2d9a94fe1180066147c1c5ceca9b","schema_version":"1.0","event_id":"sha256:b92402025b0eb7a01ab67951fd307144206a2d9a94fe1180066147c1c5ceca9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3NAZ7ZE6UURIEGNAQX7LNSMJJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoidance Markov Metrics and Node Pivotality Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Boley, Golshan Golnari, Zhi-Li Zhang","submitted_at":"2018-06-16T04:31:16Z","abstract_excerpt":"We introduce the avoidance Markov metrics and theories which provide more flexibility in the design of random walk and impose new conditions on the walk to avoid (or transit) a specific node (or a set of nodes) before the stopping criteria. These theories help with applications that cannot be modeled by classical Markov chains and require more flexibility and intricacy in their modeling. Specifically, we use them for the pivotality ranking of the nodes in a network reachabilities. More often than not, it is not sufficient simply to know whether a source node $s$ can reach a target node $t$ in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06420","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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xe5jsPFVid6DnqoW8FJoX3J0gEr2BIFoZoLW2Aq+9+fSE2rVzRye7S7jn8pelYSfMU/a8a/31o9vxvVjbja8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:20:59.087115Z"},"content_sha256":"f81fc859613e698dc49c1876104dae11642b388caef400a81cfba65ff44a170c","schema_version":"1.0","event_id":"sha256:f81fc859613e698dc49c1876104dae11642b388caef400a81cfba65ff44a170c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/bundle.json","state_url":"https://pith.science/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/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-09T11:20:59Z","links":{"resolver":"https://pith.science/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI","bundle":"https://pith.science/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/bundle.json","state":"https://pith.science/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NAZ7ZE6UURIEGNAQX7LNSMJJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3NAZ7ZE6UURIEGNAQX7LNSMJJI","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":"85a0fd9195d12b92ea6477e7c92929a64bcb60a9700eee5e22f7aba16b2d36b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-16T04:31:16Z","title_canon_sha256":"48fcd08e0db72851c1a5fbf4ea747ee35488c6b9f155eb0bc6b76d1e71fbdda4"},"schema_version":"1.0","source":{"id":"1807.06420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06420","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06420v1","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06420","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"3NAZ7ZE6UURI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NAZ7ZE6UURIEGNA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NAZ7ZE6","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:f81fc859613e698dc49c1876104dae11642b388caef400a81cfba65ff44a170c","target":"graph","created_at":"2026-05-18T00:10:33Z","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 the avoidance Markov metrics and theories which provide more flexibility in the design of random walk and impose new conditions on the walk to avoid (or transit) a specific node (or a set of nodes) before the stopping criteria. These theories help with applications that cannot be modeled by classical Markov chains and require more flexibility and intricacy in their modeling. Specifically, we use them for the pivotality ranking of the nodes in a network reachabilities. More often than not, it is not sufficient simply to know whether a source node $s$ can reach a target node $t$ in ","authors_text":"Daniel Boley, Golshan Golnari, Zhi-Li Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-16T04:31:16Z","title":"Avoidance Markov Metrics and Node Pivotality Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06420","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:b92402025b0eb7a01ab67951fd307144206a2d9a94fe1180066147c1c5ceca9b","target":"record","created_at":"2026-05-18T00:10:33Z","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":"85a0fd9195d12b92ea6477e7c92929a64bcb60a9700eee5e22f7aba16b2d36b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-16T04:31:16Z","title_canon_sha256":"48fcd08e0db72851c1a5fbf4ea747ee35488c6b9f155eb0bc6b76d1e71fbdda4"},"schema_version":"1.0","source":{"id":"1807.06420","kind":"arxiv","version":1}},"canonical_sha256":"db419fe49ea5228219a085feb6c9894a113fe4a35c94e8ebf4d23f49c7d4e4e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db419fe49ea5228219a085feb6c9894a113fe4a35c94e8ebf4d23f49c7d4e4e8","first_computed_at":"2026-05-18T00:10:33.113587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:33.113587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8C3FIe4H00xT5y3yB3gYrYWtIWaulMBLRtOUUq6G+ct9RQBqlD9RRWOY1gkKF41JqJGxFkmtb1I4enMw+iBmDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:33.114229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b92402025b0eb7a01ab67951fd307144206a2d9a94fe1180066147c1c5ceca9b","sha256:f81fc859613e698dc49c1876104dae11642b388caef400a81cfba65ff44a170c"],"state_sha256":"2ce5c675a6efa0a6730c90958354165eca166fc6e9ed410f3deac76135894130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ljKg+FTE7zUMzMIqPOdg428xWFIuwRvVOStNKvYYptD0vSQ+eZrRShGuUESmgsZXapWbvgAjHCSYHZMbFtIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:20:59.088963Z","bundle_sha256":"5ff240bfe598311cf7b358b0aac09cbe92dd6b9f5537a91dc7628375953bfa07"}}