{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QMS5JRHZMSH7KDWNXCNF5TFXFH","short_pith_number":"pith:QMS5JRHZ","canonical_record":{"source":{"id":"1408.2052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"156a00b7f5cc49ec631e8b091458c358db7a1cd6f2f7adb8f3d41cf06e9c3a13","abstract_canon_sha256":"3d65d581ccd75712961f9294dae6280008f107cd9e39e4f4db120bdd8dbed241"},"schema_version":"1.0"},"canonical_sha256":"8325d4c4f9648ff50ecdb89a5eccb729ff3ae2e8ab9d2996460b2a7fbe5570b7","source":{"kind":"arxiv","id":"1408.2052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2052","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2052v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2052","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"QMS5JRHZMSH7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMS5JRHZMSH7KDWN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMS5JRHZ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QMS5JRHZMSH7KDWNXCNF5TFXFH","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"156a00b7f5cc49ec631e8b091458c358db7a1cd6f2f7adb8f3d41cf06e9c3a13","abstract_canon_sha256":"3d65d581ccd75712961f9294dae6280008f107cd9e39e4f4db120bdd8dbed241"},"schema_version":"1.0"},"canonical_sha256":"8325d4c4f9648ff50ecdb89a5eccb729ff3ae2e8ab9d2996460b2a7fbe5570b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.530703Z","signature_b64":"rwo8pJxKrRXOvdyIbqkl+YXTY2nikxWkGWUt88JbxsQBNuPXG7GuS4YorF11uE1M9IQf2MUqjWFqJovocVnaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8325d4c4f9648ff50ecdb89a5eccb729ff3ae2e8ab9d2996460b2a7fbe5570b7","last_reissued_at":"2026-05-18T02:45:30.530009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.530009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2052","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BtoLreTnI/FiIAcgK3wN+2ARiQaMuFOKR2QBlp0F0JgXZ4nbuQQ8VMESohdgJnTNsu2FcA6UR/RreW95PYKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:16:18.729986Z"},"content_sha256":"6da3bd53bf26bf7489b62bbdb4646a4c5f8e38ebe395bd049ec68d639a1256c4","schema_version":"1.0","event_id":"sha256:6da3bd53bf26bf7489b62bbdb4646a4c5f8e38ebe395bd049ec68d639a1256c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QMS5JRHZMSH7KDWNXCNF5TFXFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chains on Orbits of Permutation Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mathias Niepert","submitted_at":"2014-08-09T05:49:27Z","abstract_excerpt":"We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2052","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXzczEmcqRSsqdk3/Vth3iy58amesf2/kUTXPJ9TGmiHsLVU8dsUzR5eA7NsMV7Gza8iBoCC39TW6pFTz7I7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:16:18.730486Z"},"content_sha256":"6e2de8be9e70ff4f5005cd3a0fcbe82ca4ec73a2fd2ba78555cb27f65d57523f","schema_version":"1.0","event_id":"sha256:6e2de8be9e70ff4f5005cd3a0fcbe82ca4ec73a2fd2ba78555cb27f65d57523f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/bundle.json","state_url":"https://pith.science/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/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-08-18T13:16:18Z","links":{"resolver":"https://pith.science/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH","bundle":"https://pith.science/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/bundle.json","state":"https://pith.science/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMS5JRHZMSH7KDWNXCNF5TFXFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QMS5JRHZMSH7KDWNXCNF5TFXFH","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":"3d65d581ccd75712961f9294dae6280008f107cd9e39e4f4db120bdd8dbed241","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:49:27Z","title_canon_sha256":"156a00b7f5cc49ec631e8b091458c358db7a1cd6f2f7adb8f3d41cf06e9c3a13"},"schema_version":"1.0","source":{"id":"1408.2052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2052","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2052v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2052","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"QMS5JRHZMSH7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMS5JRHZMSH7KDWN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMS5JRHZ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:6e2de8be9e70ff4f5005cd3a0fcbe82ca4ec73a2fd2ba78555cb27f65d57523f","target":"graph","created_at":"2026-05-18T02:45:30Z","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 present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytica","authors_text":"Mathias Niepert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:49:27Z","title":"Markov Chains on Orbits of Permutation Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2052","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:6da3bd53bf26bf7489b62bbdb4646a4c5f8e38ebe395bd049ec68d639a1256c4","target":"record","created_at":"2026-05-18T02:45:30Z","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":"3d65d581ccd75712961f9294dae6280008f107cd9e39e4f4db120bdd8dbed241","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:49:27Z","title_canon_sha256":"156a00b7f5cc49ec631e8b091458c358db7a1cd6f2f7adb8f3d41cf06e9c3a13"},"schema_version":"1.0","source":{"id":"1408.2052","kind":"arxiv","version":1}},"canonical_sha256":"8325d4c4f9648ff50ecdb89a5eccb729ff3ae2e8ab9d2996460b2a7fbe5570b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8325d4c4f9648ff50ecdb89a5eccb729ff3ae2e8ab9d2996460b2a7fbe5570b7","first_computed_at":"2026-05-18T02:45:30.530009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.530009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rwo8pJxKrRXOvdyIbqkl+YXTY2nikxWkGWUt88JbxsQBNuPXG7GuS4YorF11uE1M9IQf2MUqjWFqJovocVnaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.530703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da3bd53bf26bf7489b62bbdb4646a4c5f8e38ebe395bd049ec68d639a1256c4","sha256:6e2de8be9e70ff4f5005cd3a0fcbe82ca4ec73a2fd2ba78555cb27f65d57523f"],"state_sha256":"faa7354f0690221b07b787066fe9e7a36625527afa50c2f3e2896715ea9ad982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OX5ZW+1n3cAU1J/er/Rb3gilg82piCBl4RvfjWGG2anZ/VniuUuMAyCHZxwy1QoX05G5Vco6bvMYTH9JWJ2aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T13:16:18.735411Z","bundle_sha256":"dcf21ad2ead5b79bf2383e671f4189f5c1d38dfc44fc3051b62c4105e1027b9b"}}