{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LKJEGUJCFQTIY7FDCP6LY3FDSZ","short_pith_number":"pith:LKJEGUJC","canonical_record":{"source":{"id":"2606.24848","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-23T17:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"fd16831f0287010dca359ebaf2acefbc90576135049d1b0c2fbdc60e088e3ec7","abstract_canon_sha256":"62c16e886141001591f0c383bc6f349a08af4901bccc0bfae46de80f1a7cb9e6"},"schema_version":"1.0"},"canonical_sha256":"5a924351222c268c7ca313fcbc6ca39651c9d7886ef257a887f9f14ab5877afb","source":{"kind":"arxiv","id":"2606.24848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24848","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24848v1","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24848","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"LKJEGUJCFQTI","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"LKJEGUJCFQTIY7FD","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"LKJEGUJC","created_at":"2026-06-24T01:15:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LKJEGUJCFQTIY7FDCP6LY3FDSZ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.24848","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-23T17:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"fd16831f0287010dca359ebaf2acefbc90576135049d1b0c2fbdc60e088e3ec7","abstract_canon_sha256":"62c16e886141001591f0c383bc6f349a08af4901bccc0bfae46de80f1a7cb9e6"},"schema_version":"1.0"},"canonical_sha256":"5a924351222c268c7ca313fcbc6ca39651c9d7886ef257a887f9f14ab5877afb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:43.810685Z","signature_b64":"7rlsOU+eITAUM/y4eblwyMlRlzXxpNSOgdSs0f77Mn65fB/vhUyBXLpgXc/MYuHTqj4DaYrMCZs789gXPL4XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a924351222c268c7ca313fcbc6ca39651c9d7886ef257a887f9f14ab5877afb","last_reissued_at":"2026-06-24T01:15:43.810331Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:43.810331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.24848","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-06-24T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQECP+xl1Jg1ugOl0H0mN+5zooQ6pF3rSmZDrFBGqbFqDoCX3OGewWwc33fAI0/zhNhdZwC7/UqyHyYyc7fEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:45:25.549417Z"},"content_sha256":"4fe7530b703989e9b167ae2af8800e923f4504c8b58d845fc815910eb4fc6b88","schema_version":"1.0","event_id":"sha256:4fe7530b703989e9b167ae2af8800e923f4504c8b58d845fc815910eb4fc6b88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LKJEGUJCFQTIY7FDCP6LY3FDSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Clique-Guarded First-Order Logic with Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Johannes Friedrich Lange, Nicole Schweikardt, Steffen van Bergerem","submitted_at":"2026-06-23T17:27:16Z","abstract_excerpt":"We introduce clique-guarded first-order logic with counting (cgFOC), a fragment of the first-order logic with counting FOC [Kuske and Schweikardt, LICS 2017], and we study the complexity of this fragment. In particular, we prove computable upper bounds on the Vapnik-Chervonenkis (VC) dimension of cgFOC formulas and on the graph dimension of cgFOC counting terms on nowhere dense classes of relational structures. Furthermore, we show algorithmic metatheorems for cgFOC for query answering, enumeration, and probably approximately correct (PAC) learning for Boolean and multiclass classification pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24848","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/2606.24848/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-06-24T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sG7eeSkbiYBj9k44cLmgAsukR3zMlK5QXZdba3kkLEw5UXlgHLEQ0RFopfo+wv0ObvwvUe1jDhV/ATaBPQrZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:45:25.549805Z"},"content_sha256":"d21500902c5706612fe9de7839c3f3e42cba2a341b3080821b435358f2df6965","schema_version":"1.0","event_id":"sha256:d21500902c5706612fe9de7839c3f3e42cba2a341b3080821b435358f2df6965"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/bundle.json","state_url":"https://pith.science/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/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-06-26T12:45:25Z","links":{"resolver":"https://pith.science/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ","bundle":"https://pith.science/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/bundle.json","state":"https://pith.science/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKJEGUJCFQTIY7FDCP6LY3FDSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LKJEGUJCFQTIY7FDCP6LY3FDSZ","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":"62c16e886141001591f0c383bc6f349a08af4901bccc0bfae46de80f1a7cb9e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-23T17:27:16Z","title_canon_sha256":"fd16831f0287010dca359ebaf2acefbc90576135049d1b0c2fbdc60e088e3ec7"},"schema_version":"1.0","source":{"id":"2606.24848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24848","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24848v1","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24848","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"LKJEGUJCFQTI","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"LKJEGUJCFQTIY7FD","created_at":"2026-06-24T01:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"LKJEGUJC","created_at":"2026-06-24T01:15:43Z"}],"graph_snapshots":[{"event_id":"sha256:d21500902c5706612fe9de7839c3f3e42cba2a341b3080821b435358f2df6965","target":"graph","created_at":"2026-06-24T01:15:43Z","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/2606.24848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce clique-guarded first-order logic with counting (cgFOC), a fragment of the first-order logic with counting FOC [Kuske and Schweikardt, LICS 2017], and we study the complexity of this fragment. In particular, we prove computable upper bounds on the Vapnik-Chervonenkis (VC) dimension of cgFOC formulas and on the graph dimension of cgFOC counting terms on nowhere dense classes of relational structures. Furthermore, we show algorithmic metatheorems for cgFOC for query answering, enumeration, and probably approximately correct (PAC) learning for Boolean and multiclass classification pro","authors_text":"Johannes Friedrich Lange, Nicole Schweikardt, Steffen van Bergerem","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-23T17:27:16Z","title":"Complexity of Clique-Guarded First-Order Logic with Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24848","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:4fe7530b703989e9b167ae2af8800e923f4504c8b58d845fc815910eb4fc6b88","target":"record","created_at":"2026-06-24T01:15:43Z","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":"62c16e886141001591f0c383bc6f349a08af4901bccc0bfae46de80f1a7cb9e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-23T17:27:16Z","title_canon_sha256":"fd16831f0287010dca359ebaf2acefbc90576135049d1b0c2fbdc60e088e3ec7"},"schema_version":"1.0","source":{"id":"2606.24848","kind":"arxiv","version":1}},"canonical_sha256":"5a924351222c268c7ca313fcbc6ca39651c9d7886ef257a887f9f14ab5877afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a924351222c268c7ca313fcbc6ca39651c9d7886ef257a887f9f14ab5877afb","first_computed_at":"2026-06-24T01:15:43.810331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:43.810331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7rlsOU+eITAUM/y4eblwyMlRlzXxpNSOgdSs0f77Mn65fB/vhUyBXLpgXc/MYuHTqj4DaYrMCZs789gXPL4XDw==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:43.810685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fe7530b703989e9b167ae2af8800e923f4504c8b58d845fc815910eb4fc6b88","sha256:d21500902c5706612fe9de7839c3f3e42cba2a341b3080821b435358f2df6965"],"state_sha256":"790d424bb83b7b607c31c8831e7ae012a70a917d77ca36b524e8b22e5ab4db25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HlQ5JpJi3MutiWakni+0+l0CzGzc8S3ZnpC7UjRXu2KxX7py/7IZiMmBwq+uG3AZG8ATpVSJi5qdRQJHUOeIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:45:25.551958Z","bundle_sha256":"2bb6cf261405808439d4a764bf36cd1964a24e2d95c50915fdf44ea6603bbbbe"}}