{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AMUF6MEVOUWAYCG6TB7ITDPIIP","short_pith_number":"pith:AMUF6MEV","canonical_record":{"source":{"id":"2404.12905","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-04-19T14:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"4f4057847a1fe7956431b34c913e13058882cb866e26f3e57e5cd100d873f4d9","abstract_canon_sha256":"bad3f63e41c835d4f9f394f9a53a26d070fdb6af8ac2537646a965164b3b652e"},"schema_version":"1.0"},"canonical_sha256":"03285f3095752c0c08de987e898de843e9de93e98a55f9e087c4bc4068b3aae6","source":{"kind":"arxiv","id":"2404.12905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.12905","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.12905v2","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12905","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"AMUF6MEVOUWA","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"AMUF6MEVOUWAYCG6","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"AMUF6MEV","created_at":"2026-07-05T08:58:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AMUF6MEVOUWAYCG6TB7ITDPIIP","target":"record","payload":{"canonical_record":{"source":{"id":"2404.12905","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-04-19T14:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"4f4057847a1fe7956431b34c913e13058882cb866e26f3e57e5cd100d873f4d9","abstract_canon_sha256":"bad3f63e41c835d4f9f394f9a53a26d070fdb6af8ac2537646a965164b3b652e"},"schema_version":"1.0"},"canonical_sha256":"03285f3095752c0c08de987e898de843e9de93e98a55f9e087c4bc4068b3aae6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:23.787889Z","signature_b64":"nTcai65ca+biACTUea6Y62dkA9uvELiP8DneWlfVJD6opkaL9Al0/sILEDZdI17bYKDKVaKEKyIHgcgZ1AfkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03285f3095752c0c08de987e898de843e9de93e98a55f9e087c4bc4068b3aae6","last_reissued_at":"2026-07-05T08:58:23.787393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:23.787393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.12905","source_version":2,"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-07-05T08:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ca0B8LtAKalCfSlnkYhQHEudVjP1D2K/SMvCbJdWir1/ABiZ9bd4Cr9JePmvP+06ncCsy8RDlHZwYYdHtcuWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:10:50.295119Z"},"content_sha256":"da3628eafd32213dc4697566cb388c72aefe1b67aa1da4f05d9fccfc84d7968b","schema_version":"1.0","event_id":"sha256:da3628eafd32213dc4697566cb388c72aefe1b67aa1da4f05d9fccfc84d7968b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AMUF6MEVOUWAYCG6TB7ITDPIIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jan T\\'oth, Ond\\v{r}ej Ku\\v{z}elka","submitted_at":"2024-04-19T14:27:30Z","abstract_excerpt":"We study the time complexity of the weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be solvable in time polynomial in the domain size. However, the degree of the polynomial, which turns out to be relatively high for most practical applications, has never been properly addressed. First, we formulate a time complexity bound for the existing techniques for solving WFOMC with counting quantifiers. The bound is already known to be a polynomial with its degree depending on the number of cells of the input form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12905","kind":"arxiv","version":2},"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/2404.12905/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"},"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-07-05T08:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aRWOZ7DB1YMHNRkkiLSbw3ZxDCP8bgNwkR5FdAJOIW6jtFyvASt4Z3saQ9Msn158FUYejN8sd1Uyl6mctyUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:10:50.295527Z"},"content_sha256":"e70169afc4f9b197aaa1fb6702d7a437b7d84578ac4769cc763a2d82678ecad6","schema_version":"1.0","event_id":"sha256:e70169afc4f9b197aaa1fb6702d7a437b7d84578ac4769cc763a2d82678ecad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/bundle.json","state_url":"https://pith.science/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/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-07-08T22:10:50Z","links":{"resolver":"https://pith.science/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP","bundle":"https://pith.science/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/bundle.json","state":"https://pith.science/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMUF6MEVOUWAYCG6TB7ITDPIIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AMUF6MEVOUWAYCG6TB7ITDPIIP","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":"bad3f63e41c835d4f9f394f9a53a26d070fdb6af8ac2537646a965164b3b652e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-04-19T14:27:30Z","title_canon_sha256":"4f4057847a1fe7956431b34c913e13058882cb866e26f3e57e5cd100d873f4d9"},"schema_version":"1.0","source":{"id":"2404.12905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.12905","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.12905v2","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12905","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"AMUF6MEVOUWA","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"AMUF6MEVOUWAYCG6","created_at":"2026-07-05T08:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"AMUF6MEV","created_at":"2026-07-05T08:58:23Z"}],"graph_snapshots":[{"event_id":"sha256:e70169afc4f9b197aaa1fb6702d7a437b7d84578ac4769cc763a2d82678ecad6","target":"graph","created_at":"2026-07-05T08:58:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.12905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the time complexity of the weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be solvable in time polynomial in the domain size. However, the degree of the polynomial, which turns out to be relatively high for most practical applications, has never been properly addressed. First, we formulate a time complexity bound for the existing techniques for solving WFOMC with counting quantifiers. The bound is already known to be a polynomial with its degree depending on the number of cells of the input form","authors_text":"Jan T\\'oth, Ond\\v{r}ej Ku\\v{z}elka","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-04-19T14:27:30Z","title":"Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12905","kind":"arxiv","version":2},"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:da3628eafd32213dc4697566cb388c72aefe1b67aa1da4f05d9fccfc84d7968b","target":"record","created_at":"2026-07-05T08:58:23Z","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":"bad3f63e41c835d4f9f394f9a53a26d070fdb6af8ac2537646a965164b3b652e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-04-19T14:27:30Z","title_canon_sha256":"4f4057847a1fe7956431b34c913e13058882cb866e26f3e57e5cd100d873f4d9"},"schema_version":"1.0","source":{"id":"2404.12905","kind":"arxiv","version":2}},"canonical_sha256":"03285f3095752c0c08de987e898de843e9de93e98a55f9e087c4bc4068b3aae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03285f3095752c0c08de987e898de843e9de93e98a55f9e087c4bc4068b3aae6","first_computed_at":"2026-07-05T08:58:23.787393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:23.787393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTcai65ca+biACTUea6Y62dkA9uvELiP8DneWlfVJD6opkaL9Al0/sILEDZdI17bYKDKVaKEKyIHgcgZ1AfkCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:23.787889Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.12905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da3628eafd32213dc4697566cb388c72aefe1b67aa1da4f05d9fccfc84d7968b","sha256:e70169afc4f9b197aaa1fb6702d7a437b7d84578ac4769cc763a2d82678ecad6"],"state_sha256":"0ebb9b16477d7f8469e78f141fef062f6c6a17c759fd46c44d1870732b85ff4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuqsWlXLXbD7Ncq+gB+SWYAat3DUVfMZDztbv4HBhosN9QSZ4Gd4ccPDg4JttBtubAax4OmMjJl7SYcn/aOBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:10:50.297533Z","bundle_sha256":"6c6744b59f1ef4e2cb2642c160c7c149bd5c97cdeade8befd9c22fb05b77444a"}}