{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ITG3OJ5CYG4JL35WUXFJGBOF7B","short_pith_number":"pith:ITG3OJ5C","canonical_record":{"source":{"id":"1410.5352","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-20T16:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"1f6266deb8eb8f499f1ab77d567c36dbb155f6892cf6ce10745c1439746e5005","abstract_canon_sha256":"23abddaa4d6b27c695b5c295f15755302a07356d50de2ac2bec8b2a4f9d1897b"},"schema_version":"1.0"},"canonical_sha256":"44cdb727a2c1b895efb6a5ca9305c5f86b490818b01e595140c6cc462c27fba2","source":{"kind":"arxiv","id":"1410.5352","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5352","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5352v4","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5352","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"ITG3OJ5CYG4J","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITG3OJ5CYG4JL35W","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITG3OJ5C","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ITG3OJ5CYG4JL35WUXFJGBOF7B","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5352","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-20T16:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"1f6266deb8eb8f499f1ab77d567c36dbb155f6892cf6ce10745c1439746e5005","abstract_canon_sha256":"23abddaa4d6b27c695b5c295f15755302a07356d50de2ac2bec8b2a4f9d1897b"},"schema_version":"1.0"},"canonical_sha256":"44cdb727a2c1b895efb6a5ca9305c5f86b490818b01e595140c6cc462c27fba2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.973411Z","signature_b64":"0va2Ngq+aj5GTw4WH0eIbFDtde20w588c9xXyolQQxPhlb2sFBhvSBNMbaYrpWi5+8zpE0GdAxgDfxAertu1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44cdb727a2c1b895efb6a5ca9305c5f86b490818b01e595140c6cc462c27fba2","last_reissued_at":"2026-05-17T23:51:23.972809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.972809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5352","source_version":4,"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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2NaoQFPxLc9nAjPdHvYXD3TFCx0OOeOuldTOi3lErgzLx+5+k6t356ooLqqPH1cA1jYTy6+3ijIzzwtChX0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:59:50.542457Z"},"content_sha256":"394546d8f1913d9ecf74c1ef7e4d71702d35b857714b954b40eb6f0f7270a1e6","schema_version":"1.0","event_id":"sha256:394546d8f1913d9ecf74c1ef7e4d71702d35b857714b954b40eb6f0f7270a1e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ITG3OJ5CYG4JL35WUXFJGBOF7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimisation of Multiplicity Tree Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Ines Marusic, James Worrell, Stefan Kiefer","submitted_at":"2014-10-20T16:56:35Z","abstract_excerpt":"We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic. We also show that a polynomial bound in the standard Turing model would require a breakthrough in the complexity of polynomial identity testing by proving that the latter problem is logspace equivalent to the decision version of minimisation. The developed techniques also improve the state of the art in multiplicity word automata: we give an NC algorithm for minimising multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5352","kind":"arxiv","version":4},"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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UiXbLZaxcm8xQRifxRSmArdeHEhskLT6ntvKnTVqsy2yxgY3rmC2ouQGhggql5K/9VAqXah5NaOMGfLb+TRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:59:50.542822Z"},"content_sha256":"613c0218dc75c342e2e487ad0e9741413dc772ddb44108ed91b17ea6d513fe43","schema_version":"1.0","event_id":"sha256:613c0218dc75c342e2e487ad0e9741413dc772ddb44108ed91b17ea6d513fe43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/bundle.json","state_url":"https://pith.science/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/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-28T13:59:50Z","links":{"resolver":"https://pith.science/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B","bundle":"https://pith.science/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/bundle.json","state":"https://pith.science/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITG3OJ5CYG4JL35WUXFJGBOF7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ITG3OJ5CYG4JL35WUXFJGBOF7B","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":"23abddaa4d6b27c695b5c295f15755302a07356d50de2ac2bec8b2a4f9d1897b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-20T16:56:35Z","title_canon_sha256":"1f6266deb8eb8f499f1ab77d567c36dbb155f6892cf6ce10745c1439746e5005"},"schema_version":"1.0","source":{"id":"1410.5352","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5352","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5352v4","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5352","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"ITG3OJ5CYG4J","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITG3OJ5CYG4JL35W","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITG3OJ5C","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:613c0218dc75c342e2e487ad0e9741413dc772ddb44108ed91b17ea6d513fe43","target":"graph","created_at":"2026-05-17T23:51:23Z","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 problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic. We also show that a polynomial bound in the standard Turing model would require a breakthrough in the complexity of polynomial identity testing by proving that the latter problem is logspace equivalent to the decision version of minimisation. The developed techniques also improve the state of the art in multiplicity word automata: we give an NC algorithm for minimising multipl","authors_text":"Ines Marusic, James Worrell, Stefan Kiefer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-20T16:56:35Z","title":"Minimisation of Multiplicity Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5352","kind":"arxiv","version":4},"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:394546d8f1913d9ecf74c1ef7e4d71702d35b857714b954b40eb6f0f7270a1e6","target":"record","created_at":"2026-05-17T23:51:23Z","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":"23abddaa4d6b27c695b5c295f15755302a07356d50de2ac2bec8b2a4f9d1897b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-20T16:56:35Z","title_canon_sha256":"1f6266deb8eb8f499f1ab77d567c36dbb155f6892cf6ce10745c1439746e5005"},"schema_version":"1.0","source":{"id":"1410.5352","kind":"arxiv","version":4}},"canonical_sha256":"44cdb727a2c1b895efb6a5ca9305c5f86b490818b01e595140c6cc462c27fba2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44cdb727a2c1b895efb6a5ca9305c5f86b490818b01e595140c6cc462c27fba2","first_computed_at":"2026-05-17T23:51:23.972809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:23.972809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0va2Ngq+aj5GTw4WH0eIbFDtde20w588c9xXyolQQxPhlb2sFBhvSBNMbaYrpWi5+8zpE0GdAxgDfxAertu1Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:23.973411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5352","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:394546d8f1913d9ecf74c1ef7e4d71702d35b857714b954b40eb6f0f7270a1e6","sha256:613c0218dc75c342e2e487ad0e9741413dc772ddb44108ed91b17ea6d513fe43"],"state_sha256":"1a7e5abad8ed0c4f1fccadac7291e96ccc85b949e110ffee29d74882c9702219"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3mbkVufVGLhJtlkV1IFtU5+SBDONT8htk1kwcmLsIY/Y0TLEFeFYz4xonldQW4IhmHPenQmNjW+IV/pBMghAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:59:50.544750Z","bundle_sha256":"8228e3ab31e8ed7a788859efa16a467a8af040fff21db6a06ab60cad43ac955a"}}