{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:CMO66OMLU3ESSLGL2MQNZKGYGJ","short_pith_number":"pith:CMO66OML","schema_version":"1.0","canonical_sha256":"131def398ba6c9292ccbd320dca8d83253f290f4d9aefbd9029af6a67bcef67e","source":{"kind":"arxiv","id":"cs/0703079","version":2},"attestation_state":"computed","paper":{"title":"Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hendrik Jan Hoogeboom, Joost Engelfriet","submitted_at":"2007-03-15T10:27:05Z","abstract_excerpt":"String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this result, and match the number of heads to the arity of the transitive closure. More precisely, first-order logic with k-ary deterministic transitive closure has the same power as deterministic automata walking on their input with k heads, additionally using a finite set of nested pebbles. This result is valid for strings, ordered trees, and in general for fam"},"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":"cs/0703079","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-03-15T10:27:05Z","cross_cats_sorted":[],"title_canon_sha256":"efa6f0c6f7d94d5015fce0a080c1816675bccef3dbae138b07abc9665e104efe","abstract_canon_sha256":"d05fd0569110462ea357b0e4dccd5ccb5e74377e42aa5f4c53e8af2833ca0c2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.203904Z","signature_b64":"dzFw7Rxu31myXX4qx8FCUxfmJwZwp/WJws9cy3MmC7889Swy52voUC1V3yxIybRFqfPb+0E5y13S9mijkr+PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131def398ba6c9292ccbd320dca8d83253f290f4d9aefbd9029af6a67bcef67e","last_reissued_at":"2026-05-18T00:53:03.203362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.203362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hendrik Jan Hoogeboom, Joost Engelfriet","submitted_at":"2007-03-15T10:27:05Z","abstract_excerpt":"String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this result, and match the number of heads to the arity of the transitive closure. More precisely, first-order logic with k-ary deterministic transitive closure has the same power as deterministic automata walking on their input with k heads, additionally using a finite set of nested pebbles. This result is valid for strings, ordered trees, and in general for fam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0703079","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":"cs/0703079","created_at":"2026-05-18T00:53:03.203452+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0703079v2","created_at":"2026-05-18T00:53:03.203452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703079","created_at":"2026-05-18T00:53:03.203452+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMO66OMLU3ES","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMO66OMLU3ESSLGL","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMO66OML","created_at":"2026-05-18T12:25:55.427421+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/CMO66OMLU3ESSLGL2MQNZKGYGJ","json":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ.json","graph_json":"https://pith.science/api/pith-number/CMO66OMLU3ESSLGL2MQNZKGYGJ/graph.json","events_json":"https://pith.science/api/pith-number/CMO66OMLU3ESSLGL2MQNZKGYGJ/events.json","paper":"https://pith.science/paper/CMO66OML"},"agent_actions":{"view_html":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ","download_json":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ.json","view_paper":"https://pith.science/paper/CMO66OML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0703079&json=true","fetch_graph":"https://pith.science/api/pith-number/CMO66OMLU3ESSLGL2MQNZKGYGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CMO66OMLU3ESSLGL2MQNZKGYGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ/action/storage_attestation","attest_author":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ/action/author_attestation","sign_citation":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ/action/citation_signature","submit_replication":"https://pith.science/pith/CMO66OMLU3ESSLGL2MQNZKGYGJ/action/replication_record"}},"created_at":"2026-05-18T00:53:03.203452+00:00","updated_at":"2026-05-18T00:53:03.203452+00:00"}