{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NYRM4Y3JBNPS4GSHJ76BGWD7ZB","short_pith_number":"pith:NYRM4Y3J","canonical_record":{"source":{"id":"1512.03563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-11T09:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"b72ac7bfa64f67d853a8b96a8bfb5e0d5f34803f1960335c4a6402d54e664daa","abstract_canon_sha256":"0bf115125fa1b1af568fd342d770d5eefa16f1943881b631b2a2e1b2b88711a6"},"schema_version":"1.0"},"canonical_sha256":"6e22ce63690b5f2e1a474ffc13587fc87557fb78fd376ff7e05f3ec1e8bfb6f2","source":{"kind":"arxiv","id":"1512.03563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03563","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03563v1","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03563","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"NYRM4Y3JBNPS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYRM4Y3JBNPS4GSH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYRM4Y3J","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NYRM4Y3JBNPS4GSHJ76BGWD7ZB","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-11T09:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"b72ac7bfa64f67d853a8b96a8bfb5e0d5f34803f1960335c4a6402d54e664daa","abstract_canon_sha256":"0bf115125fa1b1af568fd342d770d5eefa16f1943881b631b2a2e1b2b88711a6"},"schema_version":"1.0"},"canonical_sha256":"6e22ce63690b5f2e1a474ffc13587fc87557fb78fd376ff7e05f3ec1e8bfb6f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:51.626066Z","signature_b64":"AXtU5qm7NVc7YC0RNAh1RaNtFC2GGcYSwm5ytHD/VqLqwYUPFqIHOdXvbMIQEoHli97Cia90sx6XWxe/ceAFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e22ce63690b5f2e1a474ffc13587fc87557fb78fd376ff7e05f3ec1e8bfb6f2","last_reissued_at":"2026-05-18T01:09:51.625300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:51.625300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03563","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-18T01:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zz/Mt7Ivllxjj2bK+fqrjio9NGN1DHWfu9FRde+5weyP7XLrHPykO/iCrlajucFCGFPAHI34kpZHeYMjj5FlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:31:27.623663Z"},"content_sha256":"d6d83b986fe8fbaae0289ac86504137db7eebf3d7e484f4a037d71a704dc1c41","schema_version":"1.0","event_id":"sha256:d6d83b986fe8fbaae0289ac86504137db7eebf3d7e484f4a037d71a704dc1c41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NYRM4Y3JBNPS4GSHJ76BGWD7ZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov chains on graded posets: Compatibility of up-directed and down-directed transition probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jonas Sj\\\"ostrand, Kimmo Eriksson, Markus Jonsson","submitted_at":"2015-12-11T09:34:36Z","abstract_excerpt":"We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an \\emph{up chain} or \\emph{down chain}). The second type toggles between two adjacent rank levels (an \\emph{up-and-down chain}).\n  We introduce two compatibility concepts between the up-directed transition probabilities (an \\emph{up rule}) and the down-directed (a \\emph{down rule}), and we relate these to compatibility between up-and-down c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03563","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-18T01:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWFL42uq68t+wg+6DVzhhv7KKxwQ6B1x1HYKiZwhW813VyJcISEwHk//RONZFp/rfrUVzqCNge3AmBEK7A3IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:31:27.624010Z"},"content_sha256":"42755a07a9540f5bd308757c754df94e0a5c242294818adef1ef279b433b2842","schema_version":"1.0","event_id":"sha256:42755a07a9540f5bd308757c754df94e0a5c242294818adef1ef279b433b2842"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/bundle.json","state_url":"https://pith.science/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/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-23T04:31:27Z","links":{"resolver":"https://pith.science/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB","bundle":"https://pith.science/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/bundle.json","state":"https://pith.science/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYRM4Y3JBNPS4GSHJ76BGWD7ZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NYRM4Y3JBNPS4GSHJ76BGWD7ZB","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":"0bf115125fa1b1af568fd342d770d5eefa16f1943881b631b2a2e1b2b88711a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-11T09:34:36Z","title_canon_sha256":"b72ac7bfa64f67d853a8b96a8bfb5e0d5f34803f1960335c4a6402d54e664daa"},"schema_version":"1.0","source":{"id":"1512.03563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03563","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03563v1","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03563","created_at":"2026-05-18T01:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"NYRM4Y3JBNPS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYRM4Y3JBNPS4GSH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYRM4Y3J","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:42755a07a9540f5bd308757c754df94e0a5c242294818adef1ef279b433b2842","target":"graph","created_at":"2026-05-18T01:09:51Z","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 consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an \\emph{up chain} or \\emph{down chain}). The second type toggles between two adjacent rank levels (an \\emph{up-and-down chain}).\n  We introduce two compatibility concepts between the up-directed transition probabilities (an \\emph{up rule}) and the down-directed (a \\emph{down rule}), and we relate these to compatibility between up-and-down c","authors_text":"Jonas Sj\\\"ostrand, Kimmo Eriksson, Markus Jonsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-11T09:34:36Z","title":"Markov chains on graded posets: Compatibility of up-directed and down-directed transition probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03563","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:d6d83b986fe8fbaae0289ac86504137db7eebf3d7e484f4a037d71a704dc1c41","target":"record","created_at":"2026-05-18T01:09:51Z","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":"0bf115125fa1b1af568fd342d770d5eefa16f1943881b631b2a2e1b2b88711a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-11T09:34:36Z","title_canon_sha256":"b72ac7bfa64f67d853a8b96a8bfb5e0d5f34803f1960335c4a6402d54e664daa"},"schema_version":"1.0","source":{"id":"1512.03563","kind":"arxiv","version":1}},"canonical_sha256":"6e22ce63690b5f2e1a474ffc13587fc87557fb78fd376ff7e05f3ec1e8bfb6f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e22ce63690b5f2e1a474ffc13587fc87557fb78fd376ff7e05f3ec1e8bfb6f2","first_computed_at":"2026-05-18T01:09:51.625300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:51.625300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXtU5qm7NVc7YC0RNAh1RaNtFC2GGcYSwm5ytHD/VqLqwYUPFqIHOdXvbMIQEoHli97Cia90sx6XWxe/ceAFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:51.626066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d83b986fe8fbaae0289ac86504137db7eebf3d7e484f4a037d71a704dc1c41","sha256:42755a07a9540f5bd308757c754df94e0a5c242294818adef1ef279b433b2842"],"state_sha256":"c5b22e969638c1e381b5674a1ae7838e6329b22b7e8f52bb497da34b22423fa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQk8aShkfL2QBg9xIUPgASLdH+5ccH33fRyLdhruk/gR1/PUYqNbN/mSHkjUR2nfdJqJBSahhHgTfxT98WfPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:31:27.625914Z","bundle_sha256":"e31621eec3ff93e1c10bf3b2469c1f68b12a3be1e3ed5f95bfa581246831c95e"}}