{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LDOTNTZ3MCITII75UGLGTAKDPP","short_pith_number":"pith:LDOTNTZ3","schema_version":"1.0","canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","source":{"kind":"arxiv","id":"1105.3583","version":4},"attestation_state":"computed","paper":{"title":"First-order query evaluation on structures of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Luc Segoufin (INRIA), Wojciech Kazana (INRIA)","submitted_at":"2011-05-18T10:17:11Z","abstract_excerpt":"We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved by: - an O(n) precomputation phase building an index structure, - followed by a phase enumerating the answers with no repetition and a constant delay between two consecutive outputs. In this article we give a different proof of this result based on Gaifman's locality theorem for first-order logic. Moreover, the constants we obtain yield a tota"},"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":"1105.3583","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-18T10:17:11Z","cross_cats_sorted":[],"title_canon_sha256":"59b89caccf5fb03aeb869023f1bd3d1f5ca9c3d4df40b0b7ba94f18ac924d7fa","abstract_canon_sha256":"9097c63792d7e2f78e3c2af1465556badb59ce72202d0286182be8a4155c75ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.480726Z","signature_b64":"CCr9f8JVIRi5+eIGkNfdQqEdKPxvuyQ788Rk48EzRQ/3QbvDOOKhre3p1vl3bXgCsHhiQSFOveTcI90GllrqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","last_reissued_at":"2026-05-18T01:37:39.479997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.479997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-order query evaluation on structures of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Luc Segoufin (INRIA), Wojciech Kazana (INRIA)","submitted_at":"2011-05-18T10:17:11Z","abstract_excerpt":"We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved by: - an O(n) precomputation phase building an index structure, - followed by a phase enumerating the answers with no repetition and a constant delay between two consecutive outputs. In this article we give a different proof of this result based on Gaifman's locality theorem for first-order logic. Moreover, the constants we obtain yield a tota"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3583","kind":"arxiv","version":4},"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":"1105.3583","created_at":"2026-05-18T01:37:39.480116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3583v4","created_at":"2026-05-18T01:37:39.480116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3583","created_at":"2026-05-18T01:37:39.480116+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDOTNTZ3MCIT","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDOTNTZ3MCITII75","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDOTNTZ3","created_at":"2026-05-18T12:26:34.985390+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/LDOTNTZ3MCITII75UGLGTAKDPP","json":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP.json","graph_json":"https://pith.science/api/pith-number/LDOTNTZ3MCITII75UGLGTAKDPP/graph.json","events_json":"https://pith.science/api/pith-number/LDOTNTZ3MCITII75UGLGTAKDPP/events.json","paper":"https://pith.science/paper/LDOTNTZ3"},"agent_actions":{"view_html":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP","download_json":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP.json","view_paper":"https://pith.science/paper/LDOTNTZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3583&json=true","fetch_graph":"https://pith.science/api/pith-number/LDOTNTZ3MCITII75UGLGTAKDPP/graph.json","fetch_events":"https://pith.science/api/pith-number/LDOTNTZ3MCITII75UGLGTAKDPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/action/storage_attestation","attest_author":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/action/author_attestation","sign_citation":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/action/citation_signature","submit_replication":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/action/replication_record"}},"created_at":"2026-05-18T01:37:39.480116+00:00","updated_at":"2026-05-18T01:37:39.480116+00:00"}