{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:42HRGNTNNMHGSXSXOTEPOQGV6O","short_pith_number":"pith:42HRGNTN","schema_version":"1.0","canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","source":{"kind":"arxiv","id":"1506.02863","version":1},"attestation_state":"computed","paper":{"title":"Bottom Up Quotients and Residuals for Tree Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali-Sebti","submitted_at":"2015-06-09T11:17:07Z","abstract_excerpt":"In this paper, we extend the notion of tree language quotients to bottom-up quotients. Instead of computing the residual of a tree language from top to bottom and producing a list of tree languages, we show how to compute a set of k-ary trees, where k is an arbitrary integer. We define the quotient formula for different combinations of tree languages: union, symbol products, compositions, iterated symbol products and iterated composition. These computations lead to the definition of the bottom-up quotient tree automaton, that turns out to be the minimal deterministic tree automaton associated "},"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":"1506.02863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-09T11:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"61a6e69e04b82554a361ff454c80ff956224be435081af745fc3d624343357dc","abstract_canon_sha256":"3d70d7cc6421fb12ed40210815d06186d873ae3965ae56c2a540bd62967dd56e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.693473Z","signature_b64":"r9ry3Pjo7k/Ntgy5s+HitEFiWo1QYukyUJGaIIehX24jGIKhsmk1ZI/a6e1PuD0Gu86/0VVOrfcY1FwA+PY+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","last_reissued_at":"2026-05-18T01:55:40.692794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.692794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottom Up Quotients and Residuals for Tree Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali-Sebti","submitted_at":"2015-06-09T11:17:07Z","abstract_excerpt":"In this paper, we extend the notion of tree language quotients to bottom-up quotients. Instead of computing the residual of a tree language from top to bottom and producing a list of tree languages, we show how to compute a set of k-ary trees, where k is an arbitrary integer. We define the quotient formula for different combinations of tree languages: union, symbol products, compositions, iterated symbol products and iterated composition. These computations lead to the definition of the bottom-up quotient tree automaton, that turns out to be the minimal deterministic tree automaton associated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02863","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":"1506.02863","created_at":"2026-05-18T01:55:40.692882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02863v1","created_at":"2026-05-18T01:55:40.692882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02863","created_at":"2026-05-18T01:55:40.692882+00:00"},{"alias_kind":"pith_short_12","alias_value":"42HRGNTNNMHG","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"42HRGNTNNMHGSXSX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"42HRGNTN","created_at":"2026-05-18T12:29:02.477457+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/42HRGNTNNMHGSXSXOTEPOQGV6O","json":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O.json","graph_json":"https://pith.science/api/pith-number/42HRGNTNNMHGSXSXOTEPOQGV6O/graph.json","events_json":"https://pith.science/api/pith-number/42HRGNTNNMHGSXSXOTEPOQGV6O/events.json","paper":"https://pith.science/paper/42HRGNTN"},"agent_actions":{"view_html":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O","download_json":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O.json","view_paper":"https://pith.science/paper/42HRGNTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02863&json=true","fetch_graph":"https://pith.science/api/pith-number/42HRGNTNNMHGSXSXOTEPOQGV6O/graph.json","fetch_events":"https://pith.science/api/pith-number/42HRGNTNNMHGSXSXOTEPOQGV6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/action/storage_attestation","attest_author":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/action/author_attestation","sign_citation":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/action/citation_signature","submit_replication":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/action/replication_record"}},"created_at":"2026-05-18T01:55:40.692882+00:00","updated_at":"2026-05-18T01:55:40.692882+00:00"}