{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YYWTQ3BMUPPPSIPNWZFVC7J6X4","short_pith_number":"pith:YYWTQ3BM","schema_version":"1.0","canonical_sha256":"c62d386c2ca3def921edb64b517d3ebf1e980f23c14862cff65dfb765c63acef","source":{"kind":"arxiv","id":"1509.04699","version":1},"attestation_state":"computed","paper":{"title":"Confluence of Layered Rewrite Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jean-Pierre Jouannaud (UP11, Jiaxiang Liu (LIX), LIX), Mizuhito Ogawa (JAIST)","submitted_at":"2015-09-15T19:48:43Z","abstract_excerpt":"We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal number of non-overlapping redexes along a path from the root to a leaf. Overlappings are allowed in finite or infinite trees. Rules may be non-terminating, non-left-linear, or non-right-linear. Using a novel unification technique, cyclic unification, and the so-alled subrewriting relation, we show that rank non-increasing layered systems are confluent provided t"},"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":"1509.04699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-15T19:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"f9e1aed81480cb9cb9b2bf97b2108fbca2aa57c5a1f45603515844865a42a33b","abstract_canon_sha256":"500ba2a373644810b134d579259740ae433791a148737a02d61da6f44829842b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.225531Z","signature_b64":"5npaXzaEMvoOYdiB0GTPlcH8OpZ21Adgb4fgObiXVljSRTyecdOOVuKvW9NNYe+Kcv/98epyn445H4se2RlkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62d386c2ca3def921edb64b517d3ebf1e980f23c14862cff65dfb765c63acef","last_reissued_at":"2026-05-18T01:32:58.224836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.224836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Confluence of Layered Rewrite Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jean-Pierre Jouannaud (UP11, Jiaxiang Liu (LIX), LIX), Mizuhito Ogawa (JAIST)","submitted_at":"2015-09-15T19:48:43Z","abstract_excerpt":"We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal number of non-overlapping redexes along a path from the root to a leaf. Overlappings are allowed in finite or infinite trees. Rules may be non-terminating, non-left-linear, or non-right-linear. Using a novel unification technique, cyclic unification, and the so-alled subrewriting relation, we show that rank non-increasing layered systems are confluent provided t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04699","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.04699","created_at":"2026-05-18T01:32:58.224943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04699v1","created_at":"2026-05-18T01:32:58.224943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04699","created_at":"2026-05-18T01:32:58.224943+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYWTQ3BMUPPP","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYWTQ3BMUPPPSIPN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYWTQ3BM","created_at":"2026-05-18T12:29:52.810259+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/YYWTQ3BMUPPPSIPNWZFVC7J6X4","json":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4.json","graph_json":"https://pith.science/api/pith-number/YYWTQ3BMUPPPSIPNWZFVC7J6X4/graph.json","events_json":"https://pith.science/api/pith-number/YYWTQ3BMUPPPSIPNWZFVC7J6X4/events.json","paper":"https://pith.science/paper/YYWTQ3BM"},"agent_actions":{"view_html":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4","download_json":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4.json","view_paper":"https://pith.science/paper/YYWTQ3BM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04699&json=true","fetch_graph":"https://pith.science/api/pith-number/YYWTQ3BMUPPPSIPNWZFVC7J6X4/graph.json","fetch_events":"https://pith.science/api/pith-number/YYWTQ3BMUPPPSIPNWZFVC7J6X4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4/action/storage_attestation","attest_author":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4/action/author_attestation","sign_citation":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4/action/citation_signature","submit_replication":"https://pith.science/pith/YYWTQ3BMUPPPSIPNWZFVC7J6X4/action/replication_record"}},"created_at":"2026-05-18T01:32:58.224943+00:00","updated_at":"2026-05-18T01:32:58.224943+00:00"}