{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IGVQM6EUPHGI5QVKOWQ26F4E2C","short_pith_number":"pith:IGVQM6EU","schema_version":"1.0","canonical_sha256":"41ab06789479cc8ec2aa75a1af1784d0b26c45a3109dc4e0978ead3039a4b2cf","source":{"kind":"arxiv","id":"2508.11515","version":1},"attestation_state":"computed","paper":{"title":"Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Ond\\v{r}ej Ku\\v{z}elka, Qipeng Kuang, V\\'aclav K\\r{u}la, Yuanhong Wang, Yuyi Wang","submitted_at":"2025-08-15T14:54:17Z","abstract_excerpt":"The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. The boundary between fragments for which WFOMC can be computed in polynomial time relative to the domain size lies between the two-variable fragment ($\\text{FO}^2$) and the three-variable fragment ($\\text{FO}^3$). It is known that WFOMC for \\FOthree{} is $\\mathsf{\\#P_1}$-hard while polynomial-time algorithms exist for computing WFOMC for $\\text{FO}^2$ and $\\text{C}^2$, possibly extended by certain axioms such as the linear order axiom, th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.11515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-08-15T14:54:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6ed2b1528eba70f0df3fd4367a97f4753e6e7263430588ae62b11f0a841482a2","abstract_canon_sha256":"ecdd9269efe25b7f538a2b766981ce6eadbd39f2d5300974edac666127f0a62e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:34.634807Z","signature_b64":"HsI3Fc0Rh0HTBi9jWVsHf0lCf/rNS1DwLeMeUE5+NBjK1MaXYIrcJdHAlT0VJue5npLnT9HgHlQQmsIU9ZwSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41ab06789479cc8ec2aa75a1af1784d0b26c45a3109dc4e0978ead3039a4b2cf","last_reissued_at":"2026-07-05T11:54:34.634394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:34.634394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Ond\\v{r}ej Ku\\v{z}elka, Qipeng Kuang, V\\'aclav K\\r{u}la, Yuanhong Wang, Yuyi Wang","submitted_at":"2025-08-15T14:54:17Z","abstract_excerpt":"The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. The boundary between fragments for which WFOMC can be computed in polynomial time relative to the domain size lies between the two-variable fragment ($\\text{FO}^2$) and the three-variable fragment ($\\text{FO}^3$). It is known that WFOMC for \\FOthree{} is $\\mathsf{\\#P_1}$-hard while polynomial-time algorithms exist for computing WFOMC for $\\text{FO}^2$ and $\\text{C}^2$, possibly extended by certain axioms such as the linear order axiom, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11515","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.11515/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.11515","created_at":"2026-07-05T11:54:34.634450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11515v1","created_at":"2026-07-05T11:54:34.634450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11515","created_at":"2026-07-05T11:54:34.634450+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGVQM6EUPHGI","created_at":"2026-07-05T11:54:34.634450+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGVQM6EUPHGI5QVK","created_at":"2026-07-05T11:54:34.634450+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGVQM6EU","created_at":"2026-07-05T11:54:34.634450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24845","citing_title":"Solving Combinatorial Counting Problems with Weighted First-Order Model Counting","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C","json":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C.json","graph_json":"https://pith.science/api/pith-number/IGVQM6EUPHGI5QVKOWQ26F4E2C/graph.json","events_json":"https://pith.science/api/pith-number/IGVQM6EUPHGI5QVKOWQ26F4E2C/events.json","paper":"https://pith.science/paper/IGVQM6EU"},"agent_actions":{"view_html":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C","download_json":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C.json","view_paper":"https://pith.science/paper/IGVQM6EU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11515&json=true","fetch_graph":"https://pith.science/api/pith-number/IGVQM6EUPHGI5QVKOWQ26F4E2C/graph.json","fetch_events":"https://pith.science/api/pith-number/IGVQM6EUPHGI5QVKOWQ26F4E2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C/action/storage_attestation","attest_author":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C/action/author_attestation","sign_citation":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C/action/citation_signature","submit_replication":"https://pith.science/pith/IGVQM6EUPHGI5QVKOWQ26F4E2C/action/replication_record"}},"created_at":"2026-07-05T11:54:34.634450+00:00","updated_at":"2026-07-05T11:54:34.634450+00:00"}