{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJRAO54JSLRNI4XFH64F6J4GMG","short_pith_number":"pith:RJRAO54J","canonical_record":{"source":{"id":"1707.08879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-27T14:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"0e62ba690de55eda1ad59d51ae3192c24798f40335daa0f88554e76654ec047a","abstract_canon_sha256":"b8fb1ff8e2caa6b9182746296e8acec895c416e156d926694e18c9e1898992e4"},"schema_version":"1.0"},"canonical_sha256":"8a6207778992e2d472e53fb85f278661b2f39bd0882fbdde149058144accfec8","source":{"kind":"arxiv","id":"1707.08879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08879","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08879v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08879","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"RJRAO54JSLRN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJRAO54JSLRNI4XF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJRAO54J","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJRAO54JSLRNI4XFH64F6J4GMG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-27T14:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"0e62ba690de55eda1ad59d51ae3192c24798f40335daa0f88554e76654ec047a","abstract_canon_sha256":"b8fb1ff8e2caa6b9182746296e8acec895c416e156d926694e18c9e1898992e4"},"schema_version":"1.0"},"canonical_sha256":"8a6207778992e2d472e53fb85f278661b2f39bd0882fbdde149058144accfec8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.221379Z","signature_b64":"0AzJQeUKRun5z4IJG+jrjCeoC04IG0ZQsJkRmxyTTAMe2rFyayrDfXMCaYc6RFZfaYlMfIT50a6jxnMJNYKXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6207778992e2d472e53fb85f278661b2f39bd0882fbdde149058144accfec8","last_reissued_at":"2026-05-18T00:39:19.220543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.220543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08879","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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4aWz2SvrlIYwgW5oJjFf2xQCrHilfNyeJ6H19EcsSaGPsWDXbGuDHg1tyiCi56rwr3rTHsEHxXRDnPpBW0YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:04:20.873688Z"},"content_sha256":"0f834ee794a8bbc7d0d800d625037b604a414f31dba813736559c3fbff39e360","schema_version":"1.0","event_id":"sha256:0f834ee794a8bbc7d0d800d625037b604a414f31dba813736559c3fbff39e360"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJRAO54JSLRNI4XFH64F6J4GMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ankit Anand, Mausam, Parag Singla, Ritesh Noothigattu","submitted_at":"2017-07-27T14:28:04Z","abstract_excerpt":"Lifted inference algorithms commonly exploit symmetries in a probabilistic graphical model (PGM) for efficient inference. However, existing algorithms for Boolean-valued domains can identify only those pairs of states as symmetric, in which the number of ones and zeros match exactly (count symmetries). Moreover, algorithms for lifted inference in multi-valued domains also compute a multi-valued extension of count symmetries only. These algorithms miss many symmetries in a domain. In this paper, we present first algorithms to compute non-count symmetries in both Boolean-valued and multi-valued "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08879","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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B72wbsQ1nlOmn8vLMXQS18qUZy7Low1IfoRUwDVw1+kxsw31ZcnvHEJKycz5TTWc/2B7CNTh0zaghJDt1kSJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:04:20.874444Z"},"content_sha256":"b4f061e57d8c4b4d0f394be9fcf39145008356e8427f97ce61e0b01d17db72fc","schema_version":"1.0","event_id":"sha256:b4f061e57d8c4b4d0f394be9fcf39145008356e8427f97ce61e0b01d17db72fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJRAO54JSLRNI4XFH64F6J4GMG/bundle.json","state_url":"https://pith.science/pith/RJRAO54JSLRNI4XFH64F6J4GMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJRAO54JSLRNI4XFH64F6J4GMG/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-11T03:04:20Z","links":{"resolver":"https://pith.science/pith/RJRAO54JSLRNI4XFH64F6J4GMG","bundle":"https://pith.science/pith/RJRAO54JSLRNI4XFH64F6J4GMG/bundle.json","state":"https://pith.science/pith/RJRAO54JSLRNI4XFH64F6J4GMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJRAO54JSLRNI4XFH64F6J4GMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJRAO54JSLRNI4XFH64F6J4GMG","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":"b8fb1ff8e2caa6b9182746296e8acec895c416e156d926694e18c9e1898992e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-27T14:28:04Z","title_canon_sha256":"0e62ba690de55eda1ad59d51ae3192c24798f40335daa0f88554e76654ec047a"},"schema_version":"1.0","source":{"id":"1707.08879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08879","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08879v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08879","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"RJRAO54JSLRN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJRAO54JSLRNI4XF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJRAO54J","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b4f061e57d8c4b4d0f394be9fcf39145008356e8427f97ce61e0b01d17db72fc","target":"graph","created_at":"2026-05-18T00:39:19Z","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":"Lifted inference algorithms commonly exploit symmetries in a probabilistic graphical model (PGM) for efficient inference. However, existing algorithms for Boolean-valued domains can identify only those pairs of states as symmetric, in which the number of ones and zeros match exactly (count symmetries). Moreover, algorithms for lifted inference in multi-valued domains also compute a multi-valued extension of count symmetries only. These algorithms miss many symmetries in a domain. In this paper, we present first algorithms to compute non-count symmetries in both Boolean-valued and multi-valued ","authors_text":"Ankit Anand, Mausam, Parag Singla, Ritesh Noothigattu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-27T14:28:04Z","title":"Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08879","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:0f834ee794a8bbc7d0d800d625037b604a414f31dba813736559c3fbff39e360","target":"record","created_at":"2026-05-18T00:39:19Z","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":"b8fb1ff8e2caa6b9182746296e8acec895c416e156d926694e18c9e1898992e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-27T14:28:04Z","title_canon_sha256":"0e62ba690de55eda1ad59d51ae3192c24798f40335daa0f88554e76654ec047a"},"schema_version":"1.0","source":{"id":"1707.08879","kind":"arxiv","version":1}},"canonical_sha256":"8a6207778992e2d472e53fb85f278661b2f39bd0882fbdde149058144accfec8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a6207778992e2d472e53fb85f278661b2f39bd0882fbdde149058144accfec8","first_computed_at":"2026-05-18T00:39:19.220543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:19.220543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AzJQeUKRun5z4IJG+jrjCeoC04IG0ZQsJkRmxyTTAMe2rFyayrDfXMCaYc6RFZfaYlMfIT50a6jxnMJNYKXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:19.221379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f834ee794a8bbc7d0d800d625037b604a414f31dba813736559c3fbff39e360","sha256:b4f061e57d8c4b4d0f394be9fcf39145008356e8427f97ce61e0b01d17db72fc"],"state_sha256":"0de13a5f0d61e876124df2d995acaaaa7887566da04f5fb1e1960cd56916080b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/SH9+zTbSLop3iXUGXAkzyFaevWxEECgUThHM1rACQvO34804wkzQF2hqZS7KMiwPMWs2JN/k7G2kqqPrpbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:04:20.878356Z","bundle_sha256":"5dd1eede6756570a4e26d3929ce6d70d38315decb95084ad00b584bff3c964c7"}}