{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:Z7RVSM2S6C7U4337N7MSJ3KVAY","short_pith_number":"pith:Z7RVSM2S","canonical_record":{"source":{"id":"2112.01108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-12-02T10:33:18Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"ea2eee1ea363acf4b974a82e8837ea0eb80e02c66781dd4029b03d3bf1181298","abstract_canon_sha256":"7e1960795c50fe54b5b231f333f3378ccc03181333df4a416f4ecd636d1cf921"},"schema_version":"1.0"},"canonical_sha256":"cfe3593352f0bf4e6f7f6fd924ed55063d2f81d34c8b25e9edc6c447ce5fd0f9","source":{"kind":"arxiv","id":"2112.01108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01108","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01108v1","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01108","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z7RVSM2S6C7U","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_16","alias_value":"Z7RVSM2S6C7U4337","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_8","alias_value":"Z7RVSM2S","created_at":"2026-07-05T03:37:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:Z7RVSM2S6C7U4337N7MSJ3KVAY","target":"record","payload":{"canonical_record":{"source":{"id":"2112.01108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-12-02T10:33:18Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"ea2eee1ea363acf4b974a82e8837ea0eb80e02c66781dd4029b03d3bf1181298","abstract_canon_sha256":"7e1960795c50fe54b5b231f333f3378ccc03181333df4a416f4ecd636d1cf921"},"schema_version":"1.0"},"canonical_sha256":"cfe3593352f0bf4e6f7f6fd924ed55063d2f81d34c8b25e9edc6c447ce5fd0f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:03.812386Z","signature_b64":"+avD31b03nWI63RsEu3cYGBAK2LAMv9CjnFckFG6zhoQWqdbLT2OcjqzpxQD9oOj67YFSW9/L5Qdj5roUzjDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfe3593352f0bf4e6f7f6fd924ed55063d2f81d34c8b25e9edc6c447ce5fd0f9","last_reissued_at":"2026-07-05T03:37:03.811976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:03.811976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.01108","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-07-05T03:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7HQZ3LauyPaXazxYC3qHaiaeduFOTQDnWuX4My00WLwpJiy7CLJ3qwMwzsWjqNC9FvuYQrISMlz/XBWbI37DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:00:04.811239Z"},"content_sha256":"5dad0ce4e1723ae55c28baec9426f9bbd81de64537606ad4a6827386a87012f6","schema_version":"1.0","event_id":"sha256:5dad0ce4e1723ae55c28baec9426f9bbd81de64537606ad4a6827386a87012f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:Z7RVSM2S6C7U4337N7MSJ3KVAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A short note on the counting complexity of conjunctive queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.LO","authors_text":"Stefan Mengel","submitted_at":"2021-12-02T10:33:18Z","abstract_excerpt":"This note closes a minor gap in the literature on the counting complexity of conjunctive queries by showing that queries that are not free-connex do not have a linear time counting algorithm under standard complexity assumptions. More generally, it is shown that the so-called quantified star size is a lower bound for the exponent in the runtime of any counting algorithm for conjunctive queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01108","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/2112.01108/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-05T03:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqcQ7lZWytbg2yvXEMtAcS8IRB6W+VIXapGf8G7D43TH8jqvoEDwxxGi51jGosg62alW97yEILshYNMG4WoaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:00:04.811983Z"},"content_sha256":"b83886fb3d0c0ac3bc12c688a10194da54aee90dd286eb8e82b25914a07bf985","schema_version":"1.0","event_id":"sha256:b83886fb3d0c0ac3bc12c688a10194da54aee90dd286eb8e82b25914a07bf985"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/bundle.json","state_url":"https://pith.science/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/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-08-22T04:00:04Z","links":{"resolver":"https://pith.science/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY","bundle":"https://pith.science/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/bundle.json","state":"https://pith.science/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7RVSM2S6C7U4337N7MSJ3KVAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Z7RVSM2S6C7U4337N7MSJ3KVAY","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":"7e1960795c50fe54b5b231f333f3378ccc03181333df4a416f4ecd636d1cf921","cross_cats_sorted":["cs.CC","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-12-02T10:33:18Z","title_canon_sha256":"ea2eee1ea363acf4b974a82e8837ea0eb80e02c66781dd4029b03d3bf1181298"},"schema_version":"1.0","source":{"id":"2112.01108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01108","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01108v1","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01108","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z7RVSM2S6C7U","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_16","alias_value":"Z7RVSM2S6C7U4337","created_at":"2026-07-05T03:37:03Z"},{"alias_kind":"pith_short_8","alias_value":"Z7RVSM2S","created_at":"2026-07-05T03:37:03Z"}],"graph_snapshots":[{"event_id":"sha256:b83886fb3d0c0ac3bc12c688a10194da54aee90dd286eb8e82b25914a07bf985","target":"graph","created_at":"2026-07-05T03:37:03Z","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/2112.01108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This note closes a minor gap in the literature on the counting complexity of conjunctive queries by showing that queries that are not free-connex do not have a linear time counting algorithm under standard complexity assumptions. More generally, it is shown that the so-called quantified star size is a lower bound for the exponent in the runtime of any counting algorithm for conjunctive queries.","authors_text":"Stefan Mengel","cross_cats":["cs.CC","cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-12-02T10:33:18Z","title":"A short note on the counting complexity of conjunctive queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01108","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:5dad0ce4e1723ae55c28baec9426f9bbd81de64537606ad4a6827386a87012f6","target":"record","created_at":"2026-07-05T03:37:03Z","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":"7e1960795c50fe54b5b231f333f3378ccc03181333df4a416f4ecd636d1cf921","cross_cats_sorted":["cs.CC","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-12-02T10:33:18Z","title_canon_sha256":"ea2eee1ea363acf4b974a82e8837ea0eb80e02c66781dd4029b03d3bf1181298"},"schema_version":"1.0","source":{"id":"2112.01108","kind":"arxiv","version":1}},"canonical_sha256":"cfe3593352f0bf4e6f7f6fd924ed55063d2f81d34c8b25e9edc6c447ce5fd0f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfe3593352f0bf4e6f7f6fd924ed55063d2f81d34c8b25e9edc6c447ce5fd0f9","first_computed_at":"2026-07-05T03:37:03.811976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:03.811976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+avD31b03nWI63RsEu3cYGBAK2LAMv9CjnFckFG6zhoQWqdbLT2OcjqzpxQD9oOj67YFSW9/L5Qdj5roUzjDBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:03.812386Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.01108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dad0ce4e1723ae55c28baec9426f9bbd81de64537606ad4a6827386a87012f6","sha256:b83886fb3d0c0ac3bc12c688a10194da54aee90dd286eb8e82b25914a07bf985"],"state_sha256":"3649fc201c8779ba5e3ef6a11a4c35cbca34e4be0f821857f43251223c7a4dc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xU3a/F4EGnoxhO70aI1e/8ZfO3nXfaU+zinEZ4cHVVnHY+4fpdAx+ZO8E8yZm6a5v9YkorJRtUfQYbzsU7emAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:00:04.818394Z","bundle_sha256":"5097bf3277776938da8b5511d16cb7d9d230f4cab6fd62baaf204b988b43040d"}}