{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:4V2JLAACMW2VE4U4PLRIYUOD7Q","short_pith_number":"pith:4V2JLAAC","schema_version":"1.0","canonical_sha256":"e57495800265b552729c7ae28c51c3fc1134a526587d3f3a5d2bd70bd94519a8","source":{"kind":"arxiv","id":"0903.2554","version":2},"attestation_state":"computed","paper":{"title":"Bottom-up rewriting for words and terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Geraud Senizergues, Irene Durand","submitted_at":"2009-03-14T16:14:18Z","abstract_excerpt":"For the whole class of linear term rewriting systems, we define \\emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complexity of the underlying construction. The Bottom-Up class (BU) is, by definition, the set of linear systems for which every derivation can be replaced by a bottom-up derivation. Membership to BU turns out to be undecidable, we are thus lead to define more restricted classes: the classes SBU(k), k in N of Strongly Bottom-Up(k) systems for which we sho"},"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":"0903.2554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-03-14T16:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"f2e2732a23c79d5bfd33c0616494ed4b289e159abf18de7002911aeff0bcd149","abstract_canon_sha256":"3ceaf51a307a34d7b9498e8787bdaf1ee10d7dd1e4a66a23cfa89affd6e68a3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:12.355438Z","signature_b64":"WQX6NL3Ihj8tHaRFjwYrZWrc6aYI7hnCZWRwgcKBNkQWlb4x9ZywGVdQAUG9pA5N724Xf1grZ0m1+IUYgn59DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57495800265b552729c7ae28c51c3fc1134a526587d3f3a5d2bd70bd94519a8","last_reissued_at":"2026-05-18T03:17:12.354627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:12.354627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottom-up rewriting for words and terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Geraud Senizergues, Irene Durand","submitted_at":"2009-03-14T16:14:18Z","abstract_excerpt":"For the whole class of linear term rewriting systems, we define \\emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complexity of the underlying construction. The Bottom-Up class (BU) is, by definition, the set of linear systems for which every derivation can be replaced by a bottom-up derivation. Membership to BU turns out to be undecidable, we are thus lead to define more restricted classes: the classes SBU(k), k in N of Strongly Bottom-Up(k) systems for which we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2554","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":"0903.2554","created_at":"2026-05-18T03:17:12.354748+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2554v2","created_at":"2026-05-18T03:17:12.354748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2554","created_at":"2026-05-18T03:17:12.354748+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V2JLAACMW2V","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V2JLAACMW2VE4U4","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V2JLAAC","created_at":"2026-05-18T12:25:58.837520+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/4V2JLAACMW2VE4U4PLRIYUOD7Q","json":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q.json","graph_json":"https://pith.science/api/pith-number/4V2JLAACMW2VE4U4PLRIYUOD7Q/graph.json","events_json":"https://pith.science/api/pith-number/4V2JLAACMW2VE4U4PLRIYUOD7Q/events.json","paper":"https://pith.science/paper/4V2JLAAC"},"agent_actions":{"view_html":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q","download_json":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q.json","view_paper":"https://pith.science/paper/4V2JLAAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2554&json=true","fetch_graph":"https://pith.science/api/pith-number/4V2JLAACMW2VE4U4PLRIYUOD7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/4V2JLAACMW2VE4U4PLRIYUOD7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q/action/storage_attestation","attest_author":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q/action/author_attestation","sign_citation":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q/action/citation_signature","submit_replication":"https://pith.science/pith/4V2JLAACMW2VE4U4PLRIYUOD7Q/action/replication_record"}},"created_at":"2026-05-18T03:17:12.354748+00:00","updated_at":"2026-05-18T03:17:12.354748+00:00"}