{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QXGX6KV562DZGID2IFGY5ZWGDC","short_pith_number":"pith:QXGX6KV5","canonical_record":{"source":{"id":"1412.1505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-03T22:03:52Z","cross_cats_sorted":["cs.AI","cs.CC","cs.LO"],"title_canon_sha256":"3930b993edbdd30714b2e1dd1fd7aa07d9bcf065d63c047a1b3b7c394919b874","abstract_canon_sha256":"a364712a34dc5b08cf4788e0c1891fdcd06ed93ed092f2b1239f55ca12424e16"},"schema_version":"1.0"},"canonical_sha256":"85cd7f2abdf68793207a414d8ee6c6189ae2792b151595a114980a134491f463","source":{"kind":"arxiv","id":"1412.1505","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1505","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1505v3","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1505","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"QXGX6KV562DZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXGX6KV562DZGID2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXGX6KV5","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QXGX6KV562DZGID2IFGY5ZWGDC","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-03T22:03:52Z","cross_cats_sorted":["cs.AI","cs.CC","cs.LO"],"title_canon_sha256":"3930b993edbdd30714b2e1dd1fd7aa07d9bcf065d63c047a1b3b7c394919b874","abstract_canon_sha256":"a364712a34dc5b08cf4788e0c1891fdcd06ed93ed092f2b1239f55ca12424e16"},"schema_version":"1.0"},"canonical_sha256":"85cd7f2abdf68793207a414d8ee6c6189ae2792b151595a114980a134491f463","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:58.082254Z","signature_b64":"182rktUKEfp2LWwklTRO+NHQiuOyX1/D0gt+RumL8DbK6kv/fqmFhc19k7snDP1llsDf1GkJLt2YGu7UuKrPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85cd7f2abdf68793207a414d8ee6c6189ae2792b151595a114980a134491f463","last_reissued_at":"2026-05-18T01:59:58.081742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:58.081742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1505","source_version":3,"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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELGERKJ5HLoy2/rovn6PpXjzOhotZXgGtJlLXcWojg55uZim8EgOfiCBeiIoO7Yw1O8eKuRz9uKc5KsZWmigDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:24.528106Z"},"content_sha256":"e5cb6abd09b9691ebc323991415d8404ae9d128785a14b60cfc42f5279dbdee6","schema_version":"1.0","event_id":"sha256:e5cb6abd09b9691ebc323991415d8404ae9d128785a14b60cfc42f5279dbdee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QXGX6KV562DZGID2IFGY5ZWGDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric Weighted First-Order Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.LO"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Eric Gribkoff, Guy Van den Broeck, Paul Beame","submitted_at":"2014-12-03T22:03:52Z","abstract_excerpt":"The FO Model Counting problem (FOMC) is the following: given a sentence $\\Phi$ in FO and a number $n$, compute the number of models of $\\Phi$ over a domain of size $n$; the Weighted variant (WFOMC) generalizes the problem by associating a weight to each tuple and defining the weight of a model to be the product of weights of its tuples. In this paper we study the complexity of the symmetric WFOMC, where all tuples of a given relation have the same weight. Our motivation comes from an important application, inference in Knowledge Bases with soft constraints, like Markov Logic Networks, but the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1505","kind":"arxiv","version":3},"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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5heKtMqDpV2hnEwEwaLRhFKUq4+IvuJRE40BrSp7PjH0lY/Mg0h3Rq3qRXzAV7BWPD/QetN1wG4hy+jn3cYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:24.528780Z"},"content_sha256":"23039ccd97a8e0189a75ec8f0b42d88dccc586cccef1e22ce0da6441404f88d4","schema_version":"1.0","event_id":"sha256:23039ccd97a8e0189a75ec8f0b42d88dccc586cccef1e22ce0da6441404f88d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXGX6KV562DZGID2IFGY5ZWGDC/bundle.json","state_url":"https://pith.science/pith/QXGX6KV562DZGID2IFGY5ZWGDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXGX6KV562DZGID2IFGY5ZWGDC/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-05-25T18:28:24Z","links":{"resolver":"https://pith.science/pith/QXGX6KV562DZGID2IFGY5ZWGDC","bundle":"https://pith.science/pith/QXGX6KV562DZGID2IFGY5ZWGDC/bundle.json","state":"https://pith.science/pith/QXGX6KV562DZGID2IFGY5ZWGDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXGX6KV562DZGID2IFGY5ZWGDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QXGX6KV562DZGID2IFGY5ZWGDC","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":"a364712a34dc5b08cf4788e0c1891fdcd06ed93ed092f2b1239f55ca12424e16","cross_cats_sorted":["cs.AI","cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-03T22:03:52Z","title_canon_sha256":"3930b993edbdd30714b2e1dd1fd7aa07d9bcf065d63c047a1b3b7c394919b874"},"schema_version":"1.0","source":{"id":"1412.1505","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1505","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1505v3","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1505","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"QXGX6KV562DZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXGX6KV562DZGID2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXGX6KV5","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:23039ccd97a8e0189a75ec8f0b42d88dccc586cccef1e22ce0da6441404f88d4","target":"graph","created_at":"2026-05-18T01:59:58Z","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":"The FO Model Counting problem (FOMC) is the following: given a sentence $\\Phi$ in FO and a number $n$, compute the number of models of $\\Phi$ over a domain of size $n$; the Weighted variant (WFOMC) generalizes the problem by associating a weight to each tuple and defining the weight of a model to be the product of weights of its tuples. In this paper we study the complexity of the symmetric WFOMC, where all tuples of a given relation have the same weight. Our motivation comes from an important application, inference in Knowledge Bases with soft constraints, like Markov Logic Networks, but the ","authors_text":"Dan Suciu, Eric Gribkoff, Guy Van den Broeck, Paul Beame","cross_cats":["cs.AI","cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-03T22:03:52Z","title":"Symmetric Weighted First-Order Model Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1505","kind":"arxiv","version":3},"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:e5cb6abd09b9691ebc323991415d8404ae9d128785a14b60cfc42f5279dbdee6","target":"record","created_at":"2026-05-18T01:59:58Z","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":"a364712a34dc5b08cf4788e0c1891fdcd06ed93ed092f2b1239f55ca12424e16","cross_cats_sorted":["cs.AI","cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-03T22:03:52Z","title_canon_sha256":"3930b993edbdd30714b2e1dd1fd7aa07d9bcf065d63c047a1b3b7c394919b874"},"schema_version":"1.0","source":{"id":"1412.1505","kind":"arxiv","version":3}},"canonical_sha256":"85cd7f2abdf68793207a414d8ee6c6189ae2792b151595a114980a134491f463","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85cd7f2abdf68793207a414d8ee6c6189ae2792b151595a114980a134491f463","first_computed_at":"2026-05-18T01:59:58.081742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:58.081742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"182rktUKEfp2LWwklTRO+NHQiuOyX1/D0gt+RumL8DbK6kv/fqmFhc19k7snDP1llsDf1GkJLt2YGu7UuKrPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:58.082254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1505","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5cb6abd09b9691ebc323991415d8404ae9d128785a14b60cfc42f5279dbdee6","sha256:23039ccd97a8e0189a75ec8f0b42d88dccc586cccef1e22ce0da6441404f88d4"],"state_sha256":"8c3c02689152568ee6aa6fc0c71b4317c9bc2000dc67d1dd4a46430c7b469e45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EPAgq2wYGUlqjFt7XbTxQzHdq7xK+/Hp/bon9c+/RLb3zx4ALendcGrTNhJ16PimxS48gX/NyK3zwhkYzqXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:28:24.532513Z","bundle_sha256":"42d1036091ccb1bbd359abd348dc685e65fe55a7efc5856a0d4ff7ae59caeed2"}}