{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:42HRGNTNNMHGSXSXOTEPOQGV6O","short_pith_number":"pith:42HRGNTN","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"},"canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","source":{"kind":"arxiv","id":"1506.02863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02863","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02863v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02863","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"42HRGNTNNMHG","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"42HRGNTNNMHGSXSX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"42HRGNTN","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:42HRGNTNNMHGSXSXOTEPOQGV6O","target":"record","payload":{"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"},"canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","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"},"source_kind":"arxiv","source_id":"1506.02863","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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HhT7WWk8BboJ7gjfdXVa6DtsNGTBA27mdzk28NdecIAOwLob+cToG38+M72SpjSPqHzGflOjBPsXQ916/8SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:14:38.169566Z"},"content_sha256":"2851dc6e9cb159799f7144fddd7fe402d3444a405b75fbee2a78b771f4af5ecf","schema_version":"1.0","event_id":"sha256:2851dc6e9cb159799f7144fddd7fe402d3444a405b75fbee2a78b771f4af5ecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:42HRGNTNNMHGSXSXOTEPOQGV6O","target":"graph","payload":{"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"},"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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2SLvJbOfb8L6sRpC01eNy4yc+QO9FplF6U1rziYQuSlpd57OSladESQf7Oq1L4U7l9sZ9e4d4BMuG/R6PBUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:14:38.170234Z"},"content_sha256":"22ad59da37830184e7145624786c9e09fbfb1d95abceefd72b2817538609c700","schema_version":"1.0","event_id":"sha256:22ad59da37830184e7145624786c9e09fbfb1d95abceefd72b2817538609c700"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/bundle.json","state_url":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/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-27T10:14:38Z","links":{"resolver":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O","bundle":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/bundle.json","state":"https://pith.science/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42HRGNTNNMHGSXSXOTEPOQGV6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:42HRGNTNNMHGSXSXOTEPOQGV6O","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":"3d70d7cc6421fb12ed40210815d06186d873ae3965ae56c2a540bd62967dd56e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-09T11:17:07Z","title_canon_sha256":"61a6e69e04b82554a361ff454c80ff956224be435081af745fc3d624343357dc"},"schema_version":"1.0","source":{"id":"1506.02863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02863","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02863v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02863","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"42HRGNTNNMHG","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"42HRGNTNNMHGSXSX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"42HRGNTN","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:22ad59da37830184e7145624786c9e09fbfb1d95abceefd72b2817538609c700","target":"graph","created_at":"2026-05-18T01:55:40Z","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 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 ","authors_text":"Djelloul Ziadi, Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali-Sebti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-09T11:17:07Z","title":"Bottom Up Quotients and Residuals for Tree Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02863","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:2851dc6e9cb159799f7144fddd7fe402d3444a405b75fbee2a78b771f4af5ecf","target":"record","created_at":"2026-05-18T01:55:40Z","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":"3d70d7cc6421fb12ed40210815d06186d873ae3965ae56c2a540bd62967dd56e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-09T11:17:07Z","title_canon_sha256":"61a6e69e04b82554a361ff454c80ff956224be435081af745fc3d624343357dc"},"schema_version":"1.0","source":{"id":"1506.02863","kind":"arxiv","version":1}},"canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68f13366d6b0e695e5774c8f740d5f3bdab999e592709ad786af7c23139211b","first_computed_at":"2026-05-18T01:55:40.692794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.692794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r9ry3Pjo7k/Ntgy5s+HitEFiWo1QYukyUJGaIIehX24jGIKhsmk1ZI/a6e1PuD0Gu86/0VVOrfcY1FwA+PY+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.693473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2851dc6e9cb159799f7144fddd7fe402d3444a405b75fbee2a78b771f4af5ecf","sha256:22ad59da37830184e7145624786c9e09fbfb1d95abceefd72b2817538609c700"],"state_sha256":"9365b27ae72c694de24df6f7a474cb3db9818b255288ad735c85b2c897628a75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnQv7SxpTH1RbfeMj0+MKpEtsvDc6artVHBO2zS5UttEXT3jsPzg8FD7NMDE9cumQoCIv3LqSXDqIPaMHV46DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:14:38.173744Z","bundle_sha256":"44648fd32c005c03f509ebf67aa47b4410e8331de0faed47592c3cec130612cd"}}