{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LDOTNTZ3MCITII75UGLGTAKDPP","short_pith_number":"pith:LDOTNTZ3","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"},"canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","source":{"kind":"arxiv","id":"1105.3583","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3583","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3583v4","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3583","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"LDOTNTZ3MCIT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LDOTNTZ3MCITII75","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LDOTNTZ3","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LDOTNTZ3MCITII75UGLGTAKDPP","target":"record","payload":{"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"},"canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","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"},"source_kind":"arxiv","source_id":"1105.3583","source_version":4,"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTfF+Eb8PyQj9TbAa627F9zoeu3PenwUCLoS0IRiO5JFCOlxE9KjYP0vG8xHIkEzjjaOFw7n3CkO2MJ9cMMKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:53:03.904645Z"},"content_sha256":"bf2ae9551b7c7d2544bead25b723b728852057091c5ead9fda30b04585d29dde","schema_version":"1.0","event_id":"sha256:bf2ae9551b7c7d2544bead25b723b728852057091c5ead9fda30b04585d29dde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LDOTNTZ3MCITII75UGLGTAKDPP","target":"graph","payload":{"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"},"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6dtaEXkp1Q7UrMoLmED7GzQgqpiiqVtOYgWyGxKMechFJwciUs8MvLRbdQrw1RtH+5rcTBRo8P+IpqEt7kOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:53:03.904993Z"},"content_sha256":"e42502d1be1d1216753529b8a1e03844e2146f998e69fb4300ffc19e0dc32790","schema_version":"1.0","event_id":"sha256:e42502d1be1d1216753529b8a1e03844e2146f998e69fb4300ffc19e0dc32790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/bundle.json","state_url":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDOTNTZ3MCITII75UGLGTAKDPP/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-24T08:53:03Z","links":{"resolver":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP","bundle":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/bundle.json","state":"https://pith.science/pith/LDOTNTZ3MCITII75UGLGTAKDPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDOTNTZ3MCITII75UGLGTAKDPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LDOTNTZ3MCITII75UGLGTAKDPP","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":"9097c63792d7e2f78e3c2af1465556badb59ce72202d0286182be8a4155c75ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-18T10:17:11Z","title_canon_sha256":"59b89caccf5fb03aeb869023f1bd3d1f5ca9c3d4df40b0b7ba94f18ac924d7fa"},"schema_version":"1.0","source":{"id":"1105.3583","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3583","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3583v4","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3583","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"LDOTNTZ3MCIT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LDOTNTZ3MCITII75","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LDOTNTZ3","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:e42502d1be1d1216753529b8a1e03844e2146f998e69fb4300ffc19e0dc32790","target":"graph","created_at":"2026-05-18T01:37:39Z","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 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","authors_text":"Luc Segoufin (INRIA), Wojciech Kazana (INRIA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-18T10:17:11Z","title":"First-order query evaluation on structures of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3583","kind":"arxiv","version":4},"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:bf2ae9551b7c7d2544bead25b723b728852057091c5ead9fda30b04585d29dde","target":"record","created_at":"2026-05-18T01:37:39Z","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":"9097c63792d7e2f78e3c2af1465556badb59ce72202d0286182be8a4155c75ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-18T10:17:11Z","title_canon_sha256":"59b89caccf5fb03aeb869023f1bd3d1f5ca9c3d4df40b0b7ba94f18ac924d7fa"},"schema_version":"1.0","source":{"id":"1105.3583","kind":"arxiv","version":4}},"canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58dd36cf3b60913423fda1966981437be3395593c6f70e624bba978b5216c7f0","first_computed_at":"2026-05-18T01:37:39.479997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.479997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CCr9f8JVIRi5+eIGkNfdQqEdKPxvuyQ788Rk48EzRQ/3QbvDOOKhre3p1vl3bXgCsHhiQSFOveTcI90GllrqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.480726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3583","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf2ae9551b7c7d2544bead25b723b728852057091c5ead9fda30b04585d29dde","sha256:e42502d1be1d1216753529b8a1e03844e2146f998e69fb4300ffc19e0dc32790"],"state_sha256":"5a44841075956b6813c394bc304978343ffac3b50b9bd3cd5962796183fbcf29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1uXxQjXs6bpQUC3YH9PIkTtpIRnGrhQP/5oGS0tR214LMbwwvMPjAFRJWUy5WfSFG7gztepXzXRhNxYdu6DAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:53:03.906966Z","bundle_sha256":"65728084469158f79e3f6e945c5da1f7e948049f057c5da10e07ef6b7953b94c"}}