{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:PSRNV7UKTH5JHJWAWSCSVDKHMI","short_pith_number":"pith:PSRNV7UK","canonical_record":{"source":{"id":"0811.4713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-28T13:29:15Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"583fae5d42b9d5bb8b0aac6126298f5033c9dd91b2e1c0d66e69629fe450ca9d","abstract_canon_sha256":"62707e936041f910dbdffdefa3d7b0eba8bb803a4d0c5427065c31e0bacb585a"},"schema_version":"1.0"},"canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","source":{"kind":"arxiv","id":"0811.4713","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4713","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4713v2","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4713","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"PSRNV7UKTH5J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PSRNV7UKTH5JHJWA","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PSRNV7UK","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:PSRNV7UKTH5JHJWAWSCSVDKHMI","target":"record","payload":{"canonical_record":{"source":{"id":"0811.4713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-28T13:29:15Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"583fae5d42b9d5bb8b0aac6126298f5033c9dd91b2e1c0d66e69629fe450ca9d","abstract_canon_sha256":"62707e936041f910dbdffdefa3d7b0eba8bb803a4d0c5427065c31e0bacb585a"},"schema_version":"1.0"},"canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.298455Z","signature_b64":"mLyKp4G6+KSQ7HwP/REL9xtMO1LLJ+iNHi/aNUB4+QFS+ctyq8T+Rei5+CT7/Zx7lh+s6OjS8Vog/CBaizSsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","last_reissued_at":"2026-05-18T02:48:10.297829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.297829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.4713","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-05-18T02:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUpIL9oRDWHfIwDjey9wGssU/5A8NKBwUyUViX/+YY240Y7YYCNQnwOfkcgj6+aoD2TkLdsxAOC/2VN12vBNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:35:01.816262Z"},"content_sha256":"1caa9c72b0d85f2fd94f202e112bc45b3218144eb574ebcea15388f980f3ee91","schema_version":"1.0","event_id":"sha256:1caa9c72b0d85f2fd94f202e112bc45b3218144eb574ebcea15388f980f3ee91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:PSRNV7UKTH5JHJWAWSCSVDKHMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Labelings For Efficient First-Order Model-Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Bruno Courcelle (LaBRI, Cyril Gavoille (LaBRI, INRIA Futurs), IUF), Mamadou Moustapha Kant\\'e (LaBRI)","submitted_at":"2008-11-28T13:29:15Z","abstract_excerpt":"We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \\emph{nicely locally cwd-decomposable}. This notion generalizes that of a \\emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \\emph{clique-width} with limited overlaps. We also consider such labelings for \\emph{bounded} first-order formulas on graph classes of \\emph{bounded e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4713","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":""},"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-18T02:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/FymMNroqtE4tpNImaqUmgYISPMh+coKUbHul8CLTgyFGV4mzsIASicbl0nqpcDgko8HlHYHRUg2MVXyasFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:35:01.816631Z"},"content_sha256":"34bc28e6ef53e2dbc7cdf63b4757cda3311b5a1b459faf371358f4cb0c0afe4e","schema_version":"1.0","event_id":"sha256:34bc28e6ef53e2dbc7cdf63b4757cda3311b5a1b459faf371358f4cb0c0afe4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/bundle.json","state_url":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/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-24T11:35:01Z","links":{"resolver":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI","bundle":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/bundle.json","state":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:PSRNV7UKTH5JHJWAWSCSVDKHMI","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":"62707e936041f910dbdffdefa3d7b0eba8bb803a4d0c5427065c31e0bacb585a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-28T13:29:15Z","title_canon_sha256":"583fae5d42b9d5bb8b0aac6126298f5033c9dd91b2e1c0d66e69629fe450ca9d"},"schema_version":"1.0","source":{"id":"0811.4713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4713","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4713v2","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4713","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"PSRNV7UKTH5J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PSRNV7UKTH5JHJWA","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PSRNV7UK","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:34bc28e6ef53e2dbc7cdf63b4757cda3311b5a1b459faf371358f4cb0c0afe4e","target":"graph","created_at":"2026-05-18T02:48:10Z","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 consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \\emph{nicely locally cwd-decomposable}. This notion generalizes that of a \\emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \\emph{clique-width} with limited overlaps. We also consider such labelings for \\emph{bounded} first-order formulas on graph classes of \\emph{bounded e","authors_text":"Bruno Courcelle (LaBRI, Cyril Gavoille (LaBRI, INRIA Futurs), IUF), Mamadou Moustapha Kant\\'e (LaBRI)","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-28T13:29:15Z","title":"Compact Labelings For Efficient First-Order Model-Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4713","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:1caa9c72b0d85f2fd94f202e112bc45b3218144eb574ebcea15388f980f3ee91","target":"record","created_at":"2026-05-18T02:48:10Z","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":"62707e936041f910dbdffdefa3d7b0eba8bb803a4d0c5427065c31e0bacb585a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-28T13:29:15Z","title_canon_sha256":"583fae5d42b9d5bb8b0aac6126298f5033c9dd91b2e1c0d66e69629fe450ca9d"},"schema_version":"1.0","source":{"id":"0811.4713","kind":"arxiv","version":2}},"canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","first_computed_at":"2026-05-18T02:48:10.297829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:10.297829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLyKp4G6+KSQ7HwP/REL9xtMO1LLJ+iNHi/aNUB4+QFS+ctyq8T+Rei5+CT7/Zx7lh+s6OjS8Vog/CBaizSsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:10.298455Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.4713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1caa9c72b0d85f2fd94f202e112bc45b3218144eb574ebcea15388f980f3ee91","sha256:34bc28e6ef53e2dbc7cdf63b4757cda3311b5a1b459faf371358f4cb0c0afe4e"],"state_sha256":"d5971db7709cd8c3deb911af7731da215ba30070963454bac6433d8ee52b1532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDzNE4nM0qJS8oDwAsFqCVlANwUgWox197LSIb3XJFKRYFVNcWZjEDOkR9srYZhoPanNkbtbJbVarxK6uoGDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:35:01.818866Z","bundle_sha256":"b364340efeed1fb70037aa2c0fe56d9ed806288d2e8d0b7a1acf2b7ef050d977"}}