{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2KBKGWJR56ULA42XXDK5S7FUAD","short_pith_number":"pith:2KBKGWJR","canonical_record":{"source":{"id":"1405.0514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-02T20:58:39Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0b5422ee98642036e6388cb08793d480e2cb18acb108d09a30b8186dfa393124","abstract_canon_sha256":"fab8190bdb2335fe23c0c917df6203bbb722092782f95d28ee086b260c3851d8"},"schema_version":"1.0"},"canonical_sha256":"d282a35931efa8b07357b8d5d97cb400eca9b18e9d3d07686888f892b9492a5a","source":{"kind":"arxiv","id":"1405.0514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0514","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0514v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0514","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"2KBKGWJR56UL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2KBKGWJR56ULA42X","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2KBKGWJR","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2KBKGWJR56ULA42XXDK5S7FUAD","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-02T20:58:39Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0b5422ee98642036e6388cb08793d480e2cb18acb108d09a30b8186dfa393124","abstract_canon_sha256":"fab8190bdb2335fe23c0c917df6203bbb722092782f95d28ee086b260c3851d8"},"schema_version":"1.0"},"canonical_sha256":"d282a35931efa8b07357b8d5d97cb400eca9b18e9d3d07686888f892b9492a5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.776439Z","signature_b64":"waujX14iKvg6J3Eq6mUwrwMF9Vg4JYJhdFyBnDiBKLP/zLo4ACJQRId+zmbmJr+fBUyaBO9FeFB053pyreEvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d282a35931efa8b07357b8d5d97cb400eca9b18e9d3d07686888f892b9492a5a","last_reissued_at":"2026-05-18T02:32:38.775853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.775853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0514","source_version":2,"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:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmxVuOO1M/vMFZ+L4aLmPou+WzsaCa7xtwSC421BjobNSU1hl1kNCUJACS0UvrLQOJDTU+xnSH6L2Ix8lKSGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:47:03.422121Z"},"content_sha256":"376c0e52bb961a920acf694ae93fde51666ffb4f5471c970066c5f896f09dcab","schema_version":"1.0","event_id":"sha256:376c0e52bb961a920acf694ae93fde51666ffb4f5471c970066c5f896f09dcab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2KBKGWJR56ULA42XXDK5S7FUAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Equivalence and Learning for Multiplicity Tree Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LG","authors_text":"Ines Marusic, James Worrell","submitted_at":"2014-05-02T20:58:39Z","abstract_excerpt":"We consider the complexity of equivalence and learning for multiplicity tree automata, i.e., weighted tree automata over a field. We first show that the equivalence problem is logspace equivalent to polynomial identity testing, the complexity of which is a longstanding open problem. Secondly, we derive lower bounds on the number of queries needed to learn multiplicity tree automata in Angluin's exact learning model, over both arbitrary and fixed fields.\n  Habrard and Oncina (2006) give an exact learning algorithm for multiplicity tree automata, in which the number of queries is proportional to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0514","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"},"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:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpkdgIgjhdi4QlwP4CfNodUW+mSleLZU7NQnl7u7S+wVCdogeMCO2Nx76cOa+Oo0zDg2E5TA2pzfrSUZ0wbmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:47:03.422551Z"},"content_sha256":"e0ea4049704164fae197ef566a26030f8bef467b1e11a63ea721f414a037fa3e","schema_version":"1.0","event_id":"sha256:e0ea4049704164fae197ef566a26030f8bef467b1e11a63ea721f414a037fa3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KBKGWJR56ULA42XXDK5S7FUAD/bundle.json","state_url":"https://pith.science/pith/2KBKGWJR56ULA42XXDK5S7FUAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KBKGWJR56ULA42XXDK5S7FUAD/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-28T17:47:03Z","links":{"resolver":"https://pith.science/pith/2KBKGWJR56ULA42XXDK5S7FUAD","bundle":"https://pith.science/pith/2KBKGWJR56ULA42XXDK5S7FUAD/bundle.json","state":"https://pith.science/pith/2KBKGWJR56ULA42XXDK5S7FUAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KBKGWJR56ULA42XXDK5S7FUAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2KBKGWJR56ULA42XXDK5S7FUAD","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":"fab8190bdb2335fe23c0c917df6203bbb722092782f95d28ee086b260c3851d8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-02T20:58:39Z","title_canon_sha256":"0b5422ee98642036e6388cb08793d480e2cb18acb108d09a30b8186dfa393124"},"schema_version":"1.0","source":{"id":"1405.0514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0514","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0514v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0514","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"2KBKGWJR56UL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2KBKGWJR56ULA42X","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2KBKGWJR","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:e0ea4049704164fae197ef566a26030f8bef467b1e11a63ea721f414a037fa3e","target":"graph","created_at":"2026-05-18T02:32:38Z","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":"We consider the complexity of equivalence and learning for multiplicity tree automata, i.e., weighted tree automata over a field. We first show that the equivalence problem is logspace equivalent to polynomial identity testing, the complexity of which is a longstanding open problem. Secondly, we derive lower bounds on the number of queries needed to learn multiplicity tree automata in Angluin's exact learning model, over both arbitrary and fixed fields.\n  Habrard and Oncina (2006) give an exact learning algorithm for multiplicity tree automata, in which the number of queries is proportional to","authors_text":"Ines Marusic, James Worrell","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-02T20:58:39Z","title":"Complexity of Equivalence and Learning for Multiplicity Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0514","kind":"arxiv","version":2},"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:376c0e52bb961a920acf694ae93fde51666ffb4f5471c970066c5f896f09dcab","target":"record","created_at":"2026-05-18T02:32:38Z","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":"fab8190bdb2335fe23c0c917df6203bbb722092782f95d28ee086b260c3851d8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-02T20:58:39Z","title_canon_sha256":"0b5422ee98642036e6388cb08793d480e2cb18acb108d09a30b8186dfa393124"},"schema_version":"1.0","source":{"id":"1405.0514","kind":"arxiv","version":2}},"canonical_sha256":"d282a35931efa8b07357b8d5d97cb400eca9b18e9d3d07686888f892b9492a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d282a35931efa8b07357b8d5d97cb400eca9b18e9d3d07686888f892b9492a5a","first_computed_at":"2026-05-18T02:32:38.775853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:38.775853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"waujX14iKvg6J3Eq6mUwrwMF9Vg4JYJhdFyBnDiBKLP/zLo4ACJQRId+zmbmJr+fBUyaBO9FeFB053pyreEvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:38.776439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:376c0e52bb961a920acf694ae93fde51666ffb4f5471c970066c5f896f09dcab","sha256:e0ea4049704164fae197ef566a26030f8bef467b1e11a63ea721f414a037fa3e"],"state_sha256":"cd964fd8afe7e30d2d838ec4d4900b809d5af12af1135f5e3a041e853375f530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixTT47mbvqWKwm6nYo30VB9ARalo4tL76xsc6T17pFjejJ6apvl58kXlIR5D9mkGiK3WDKWpnJ7uPZIsuUNABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:47:03.426038Z","bundle_sha256":"d5e5fd17f92d4c4ab8876c478838f0a355dc9f36ff5deb44a1813a385ed2e732"}}