{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:PSRNV7UKTH5JHJWAWSCSVDKHMI","short_pith_number":"pith:PSRNV7UK","schema_version":"1.0","canonical_sha256":"7ca2dafe8a99fa93a6c0b4852a8d476203fb3fc3d0a113396b11a957141b58cd","source":{"kind":"arxiv","id":"0811.4713","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0811.4713","created_at":"2026-05-18T02:48:10.297913+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.4713v2","created_at":"2026-05-18T02:48:10.297913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4713","created_at":"2026-05-18T02:48:10.297913+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSRNV7UKTH5J","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSRNV7UKTH5JHJWA","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSRNV7UK","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI","json":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI.json","graph_json":"https://pith.science/api/pith-number/PSRNV7UKTH5JHJWAWSCSVDKHMI/graph.json","events_json":"https://pith.science/api/pith-number/PSRNV7UKTH5JHJWAWSCSVDKHMI/events.json","paper":"https://pith.science/paper/PSRNV7UK"},"agent_actions":{"view_html":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI","download_json":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI.json","view_paper":"https://pith.science/paper/PSRNV7UK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.4713&json=true","fetch_graph":"https://pith.science/api/pith-number/PSRNV7UKTH5JHJWAWSCSVDKHMI/graph.json","fetch_events":"https://pith.science/api/pith-number/PSRNV7UKTH5JHJWAWSCSVDKHMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/action/storage_attestation","attest_author":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/action/author_attestation","sign_citation":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/action/citation_signature","submit_replication":"https://pith.science/pith/PSRNV7UKTH5JHJWAWSCSVDKHMI/action/replication_record"}},"created_at":"2026-05-18T02:48:10.297913+00:00","updated_at":"2026-05-18T02:48:10.297913+00:00"}