{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U6SRDAZPMNYPMVKYUAOWQ7ABYR","short_pith_number":"pith:U6SRDAZP","canonical_record":{"source":{"id":"1902.00633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-02T03:07:13Z","cross_cats_sorted":[],"title_canon_sha256":"75b5050ef5553f0d86880d4d4e38dfaa4183bede51327972a98be34d0eba8359","abstract_canon_sha256":"6d1aff0a3c610a60bded5ccc79f79c09798fad9d3bc4c6fc214d22647b93c20a"},"schema_version":"1.0"},"canonical_sha256":"a7a511832f6370f65558a01d687c01c4779d6768aebab0ebb94d4f8185436d64","source":{"kind":"arxiv","id":"1902.00633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00633","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00633v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00633","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"U6SRDAZPMNYP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U6SRDAZPMNYPMVKY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U6SRDAZP","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U6SRDAZPMNYPMVKYUAOWQ7ABYR","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-02T03:07:13Z","cross_cats_sorted":[],"title_canon_sha256":"75b5050ef5553f0d86880d4d4e38dfaa4183bede51327972a98be34d0eba8359","abstract_canon_sha256":"6d1aff0a3c610a60bded5ccc79f79c09798fad9d3bc4c6fc214d22647b93c20a"},"schema_version":"1.0"},"canonical_sha256":"a7a511832f6370f65558a01d687c01c4779d6768aebab0ebb94d4f8185436d64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.606510Z","signature_b64":"soFqUJ7gX+mutiQXmdBH6h3t6j0lElchDMywS5KFZTsRspWdlKxz9dFrNO6sdOHJT5z2RSk1uMkD81E8kVRcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a511832f6370f65558a01d687c01c4779d6768aebab0ebb94d4f8185436d64","last_reissued_at":"2026-05-17T23:54:52.606029Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.606029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00633","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IK+M+6JlLKf/w29zjKGBs9JHPpL2TkTr4nLq4Z+2+0qWoIYMpYYm8eES7zqzUEq4uNhADMWvUhWuOftAuVa1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:34:56.781738Z"},"content_sha256":"02376936d2d0d6006a3f9b2ba3c9cc77cf5b9b45449a74f80ed6b474776480d4","schema_version":"1.0","event_id":"sha256:02376936d2d0d6006a3f9b2ba3c9cc77cf5b9b45449a74f80ed6b474776480d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U6SRDAZPMNYPMVKYUAOWQ7ABYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Queries Based on Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-02T03:07:13Z","abstract_excerpt":"We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00633","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psliZPR1i8PVxHo7qOpwOoYODKoHZMzTQd30AmITuOT0y1ewWCols83ZeGMoW500162s9kgNQlKi+BC2UEEvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:34:56.782414Z"},"content_sha256":"184906d5f6c021e265a7d5bb4960311c14f185672c9d295fe5248605a0ac92a5","schema_version":"1.0","event_id":"sha256:184906d5f6c021e265a7d5bb4960311c14f185672c9d295fe5248605a0ac92a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/bundle.json","state_url":"https://pith.science/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/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-26T08:34:56Z","links":{"resolver":"https://pith.science/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR","bundle":"https://pith.science/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/bundle.json","state":"https://pith.science/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6SRDAZPMNYPMVKYUAOWQ7ABYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U6SRDAZPMNYPMVKYUAOWQ7ABYR","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":"6d1aff0a3c610a60bded5ccc79f79c09798fad9d3bc4c6fc214d22647b93c20a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-02T03:07:13Z","title_canon_sha256":"75b5050ef5553f0d86880d4d4e38dfaa4183bede51327972a98be34d0eba8359"},"schema_version":"1.0","source":{"id":"1902.00633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00633","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00633v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00633","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"U6SRDAZPMNYP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U6SRDAZPMNYPMVKY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U6SRDAZP","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:184906d5f6c021e265a7d5bb4960311c14f185672c9d295fe5248605a0ac92a5","target":"graph","created_at":"2026-05-17T23:54:52Z","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 investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.","authors_text":"Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-02T03:07:13Z","title":"Computational Complexity of Queries Based on Itemsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00633","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:02376936d2d0d6006a3f9b2ba3c9cc77cf5b9b45449a74f80ed6b474776480d4","target":"record","created_at":"2026-05-17T23:54:52Z","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":"6d1aff0a3c610a60bded5ccc79f79c09798fad9d3bc4c6fc214d22647b93c20a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-02T03:07:13Z","title_canon_sha256":"75b5050ef5553f0d86880d4d4e38dfaa4183bede51327972a98be34d0eba8359"},"schema_version":"1.0","source":{"id":"1902.00633","kind":"arxiv","version":1}},"canonical_sha256":"a7a511832f6370f65558a01d687c01c4779d6768aebab0ebb94d4f8185436d64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7a511832f6370f65558a01d687c01c4779d6768aebab0ebb94d4f8185436d64","first_computed_at":"2026-05-17T23:54:52.606029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.606029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"soFqUJ7gX+mutiQXmdBH6h3t6j0lElchDMywS5KFZTsRspWdlKxz9dFrNO6sdOHJT5z2RSk1uMkD81E8kVRcCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.606510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02376936d2d0d6006a3f9b2ba3c9cc77cf5b9b45449a74f80ed6b474776480d4","sha256:184906d5f6c021e265a7d5bb4960311c14f185672c9d295fe5248605a0ac92a5"],"state_sha256":"1e727d89a557c0498bd4ad4549d64bcc1c12db4c4f303b71e6bb7120bedd1ae9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8erVGFfHE4Kvz6K4MNghVMsT/SJDhtLWxLg1kAfMO0TLNT4ZRB1Ag2d7r12LeDsGCvKaw16TKhcjfJc9rKi7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:34:56.785897Z","bundle_sha256":"cdf7813d9ca9029f49f0a21e5d4778eb59da7ed932fae17b4fd6dabb2f111147"}}