{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SWB7JNVYZLKW3XFC6WK32Y3ULA","short_pith_number":"pith:SWB7JNVY","canonical_record":{"source":{"id":"1107.0349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"ede364c6a7949f3b8f0ce8893647abee51d7c9edf693c5f8aa5ba1bea4163908","abstract_canon_sha256":"ddcdae43227d5d95bd684dcf82504b50b1bbb1058407d6abf4d41d11b3b63c48"},"schema_version":"1.0"},"canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","source":{"kind":"arxiv","id":"1107.0349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0349","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0349v1","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0349","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"pith_short_12","alias_value":"SWB7JNVYZLKW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SWB7JNVYZLKW3XFC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SWB7JNVY","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SWB7JNVYZLKW3XFC6WK32Y3ULA","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"ede364c6a7949f3b8f0ce8893647abee51d7c9edf693c5f8aa5ba1bea4163908","abstract_canon_sha256":"ddcdae43227d5d95bd684dcf82504b50b1bbb1058407d6abf4d41d11b3b63c48"},"schema_version":"1.0"},"canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:54.134166Z","signature_b64":"IptxQVUDNkAhUn8wY9BraEwb595ugZeKSB6gryWQOZKymkM0YbUo7fkKPFDS47EQuVaHAB+FQea3wnb33GrHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","last_reissued_at":"2026-05-18T04:18:54.133731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:54.133731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0349","source_version":1,"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-18T04:18:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjGtf5i2MGdnLQ2OAc8hVhgt+dLsRjgYkRIrsgDEXGUwjwY2yedDNze/HJrnMoJVFxa0dd+yPWf1DCztOOn+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:27:30.725524Z"},"content_sha256":"32eceeb7ed7854d651ede3ec7ccba33b58a55624595c7f379e23640b3a8ed5a2","schema_version":"1.0","event_id":"sha256:32eceeb7ed7854d651ede3ec7ccba33b58a55624595c7f379e23640b3a8ed5a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SWB7JNVYZLKW3XFC6WK32Y3ULA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-order finite satisfiability vs tree automata in safety verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexei Lisitsa","submitted_at":"2011-07-02T00:45:24Z","abstract_excerpt":"In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.\n  We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0349","kind":"arxiv","version":1},"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-18T04:18:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJBY0OqsanDZ7Rba8yYOPoDvUrUjjZX9vPkbJIqNXES1U3vF9XmN3hD5BDwYnrVVnR2wSstU1hlISacCTWwzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:27:30.725867Z"},"content_sha256":"da79a93e6789c321aac6bf5d81b5aa74699f6606c8e79391361508abe8e3a0a9","schema_version":"1.0","event_id":"sha256:da79a93e6789c321aac6bf5d81b5aa74699f6606c8e79391361508abe8e3a0a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/bundle.json","state_url":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/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-07T10:27:30Z","links":{"resolver":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA","bundle":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/bundle.json","state":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SWB7JNVYZLKW3XFC6WK32Y3ULA","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":"ddcdae43227d5d95bd684dcf82504b50b1bbb1058407d6abf4d41d11b3b63c48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","title_canon_sha256":"ede364c6a7949f3b8f0ce8893647abee51d7c9edf693c5f8aa5ba1bea4163908"},"schema_version":"1.0","source":{"id":"1107.0349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0349","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0349v1","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0349","created_at":"2026-05-18T04:18:54Z"},{"alias_kind":"pith_short_12","alias_value":"SWB7JNVYZLKW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SWB7JNVYZLKW3XFC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SWB7JNVY","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:da79a93e6789c321aac6bf5d81b5aa74699f6606c8e79391361508abe8e3a0a9","target":"graph","created_at":"2026-05-18T04:18:54Z","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":"In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.\n  We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from ","authors_text":"Alexei Lisitsa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","title":"First-order finite satisfiability vs tree automata in safety verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0349","kind":"arxiv","version":1},"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:32eceeb7ed7854d651ede3ec7ccba33b58a55624595c7f379e23640b3a8ed5a2","target":"record","created_at":"2026-05-18T04:18:54Z","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":"ddcdae43227d5d95bd684dcf82504b50b1bbb1058407d6abf4d41d11b3b63c48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","title_canon_sha256":"ede364c6a7949f3b8f0ce8893647abee51d7c9edf693c5f8aa5ba1bea4163908"},"schema_version":"1.0","source":{"id":"1107.0349","kind":"arxiv","version":1}},"canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","first_computed_at":"2026-05-18T04:18:54.133731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:54.133731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IptxQVUDNkAhUn8wY9BraEwb595ugZeKSB6gryWQOZKymkM0YbUo7fkKPFDS47EQuVaHAB+FQea3wnb33GrHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:54.134166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32eceeb7ed7854d651ede3ec7ccba33b58a55624595c7f379e23640b3a8ed5a2","sha256:da79a93e6789c321aac6bf5d81b5aa74699f6606c8e79391361508abe8e3a0a9"],"state_sha256":"d36c9b1b5c036706601b6899381bd249175296207108c1e2a5769745be8ea327"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyNbvA1L2tCGulg97Vaa26hWqLJMr3xDGjMDvLcZhR9b4mXt1bSHdy1BJevDUo7EvSjDO9lpuuXhzfaDoUzmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:27:30.727828Z","bundle_sha256":"94bf63b25c3d369ff2a25977b5b45db1be2936cdb4f7e1293dd4b89e64dd2e32"}}