{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6H2ED5GTVSTKMB2OKX4W3ISPZO","short_pith_number":"pith:6H2ED5GT","canonical_record":{"source":{"id":"1505.00478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-03T21:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"b60e53fb752d89eb5ecafa4b912149589b57fa69f9526f0a6e20da90fa3d7158","abstract_canon_sha256":"a600b41fdef5ba6cd210e44ce2db860b4ed98961d4af5abcdd9c3851103b1c9a"},"schema_version":"1.0"},"canonical_sha256":"f1f441f4d3aca6a6074e55f96da24fcb88f43a357d10b1b0eee4e1e070e26a84","source":{"kind":"arxiv","id":"1505.00478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00478","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00478v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00478","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"6H2ED5GTVSTK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6H2ED5GTVSTKMB2O","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6H2ED5GT","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6H2ED5GTVSTKMB2OKX4W3ISPZO","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-03T21:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"b60e53fb752d89eb5ecafa4b912149589b57fa69f9526f0a6e20da90fa3d7158","abstract_canon_sha256":"a600b41fdef5ba6cd210e44ce2db860b4ed98961d4af5abcdd9c3851103b1c9a"},"schema_version":"1.0"},"canonical_sha256":"f1f441f4d3aca6a6074e55f96da24fcb88f43a357d10b1b0eee4e1e070e26a84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.844656Z","signature_b64":"HmncM/n+WRhWDSveUJtqeHoSsdySNuPr2EaZfaKURoG8/fkG8EAmyHevV7etVj5+GSdy2UPnlV0+tTkO0I8wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f441f4d3aca6a6074e55f96da24fcb88f43a357d10b1b0eee4e1e070e26a84","last_reissued_at":"2026-05-18T02:17:02.844013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.844013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00478","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRdu2CGJb8Qwki6yyjkUIWVzyjy1bp22YIaDay0BzCsejxdJmoZCpm3q0NN4A7Tc2rPQd++F6eDh+IfZ2+KyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:19:07.979100Z"},"content_sha256":"b13168f7b8b73512ed38f8785d42bcb1ff7ee0e1a5b6d9a377a8159500a86803","schema_version":"1.0","event_id":"sha256:b13168f7b8b73512ed38f8785d42bcb1ff7ee0e1a5b6d9a377a8159500a86803"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6H2ED5GTVSTKMB2OKX4W3ISPZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Looping and Non-Looping Non-Termination by Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hans Zantema, J\\\"org Endrullis","submitted_at":"2015-05-03T21:24:19Z","abstract_excerpt":"A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the language by a tree automaton with a fixed number of states, and expressing the mentioned requirements in a SAT formula. Satisfiability of this formula implies non-termination. Our approach succeeds for many examples where all earlier techniques fail, for instance for the S-rule from combinatory logic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00478","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mYY3qye+vwKG3OS9VHJv8kJO1Fuo+tkgfKjwd/8bXomHTOcE79awb7psD/89GALgJOzZc9UtMoBO4oG9gU3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:19:07.979484Z"},"content_sha256":"24d36f831d56ba32b72ab89f8a99b9f63f9717d0f3f9fdc95d8929cea8b55b36","schema_version":"1.0","event_id":"sha256:24d36f831d56ba32b72ab89f8a99b9f63f9717d0f3f9fdc95d8929cea8b55b36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/bundle.json","state_url":"https://pith.science/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/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-05-31T04:19:07Z","links":{"resolver":"https://pith.science/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO","bundle":"https://pith.science/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/bundle.json","state":"https://pith.science/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6H2ED5GTVSTKMB2OKX4W3ISPZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6H2ED5GTVSTKMB2OKX4W3ISPZO","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":"a600b41fdef5ba6cd210e44ce2db860b4ed98961d4af5abcdd9c3851103b1c9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-03T21:24:19Z","title_canon_sha256":"b60e53fb752d89eb5ecafa4b912149589b57fa69f9526f0a6e20da90fa3d7158"},"schema_version":"1.0","source":{"id":"1505.00478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00478","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00478v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00478","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"6H2ED5GTVSTK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6H2ED5GTVSTKMB2O","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6H2ED5GT","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:24d36f831d56ba32b72ab89f8a99b9f63f9717d0f3f9fdc95d8929cea8b55b36","target":"graph","created_at":"2026-05-18T02:17:02Z","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":"A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the language by a tree automaton with a fixed number of states, and expressing the mentioned requirements in a SAT formula. Satisfiability of this formula implies non-termination. Our approach succeeds for many examples where all earlier techniques fail, for instance for the S-rule from combinatory logic.","authors_text":"Hans Zantema, J\\\"org Endrullis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-03T21:24:19Z","title":"Proving Looping and Non-Looping Non-Termination by Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00478","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:b13168f7b8b73512ed38f8785d42bcb1ff7ee0e1a5b6d9a377a8159500a86803","target":"record","created_at":"2026-05-18T02:17:02Z","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":"a600b41fdef5ba6cd210e44ce2db860b4ed98961d4af5abcdd9c3851103b1c9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-03T21:24:19Z","title_canon_sha256":"b60e53fb752d89eb5ecafa4b912149589b57fa69f9526f0a6e20da90fa3d7158"},"schema_version":"1.0","source":{"id":"1505.00478","kind":"arxiv","version":1}},"canonical_sha256":"f1f441f4d3aca6a6074e55f96da24fcb88f43a357d10b1b0eee4e1e070e26a84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f441f4d3aca6a6074e55f96da24fcb88f43a357d10b1b0eee4e1e070e26a84","first_computed_at":"2026-05-18T02:17:02.844013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:02.844013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmncM/n+WRhWDSveUJtqeHoSsdySNuPr2EaZfaKURoG8/fkG8EAmyHevV7etVj5+GSdy2UPnlV0+tTkO0I8wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:02.844656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b13168f7b8b73512ed38f8785d42bcb1ff7ee0e1a5b6d9a377a8159500a86803","sha256:24d36f831d56ba32b72ab89f8a99b9f63f9717d0f3f9fdc95d8929cea8b55b36"],"state_sha256":"e7e8a0ba56daea2b527fad1ea20ccca2ac5e08b6d7eb4aaef1f5e45613788255"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZID2rrNTbF0pne/Qa5FDyBPsezs0NmvWc41vMUfCANCE4rnzGZr/GE3yEjbjfy8FE3Er0L8Kmx+C4KKzndsICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:19:07.982359Z","bundle_sha256":"eaa8f3c29f06d6b589cde3c79a5bb11bd2b2f4da59a95b0feccb1637360d336f"}}