{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EJT3GHJZA74GB733ONCCDVQ4ZO","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":"99e71d10483066709f8e3eaedb50c14b5283d6f3dc52580f6e392e18be77c0cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-01-27T17:09:53Z","title_canon_sha256":"797e9097ed806376b4dae80d9856cfcb24a1cd18c5e870175030ac47377b1864"},"schema_version":"1.0","source":{"id":"2601.19809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.19809","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"2601.19809v2","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19809","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"EJT3GHJZA74G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EJT3GHJZA74GB733","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EJT3GHJZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d9bcf16f52eb9b9a381955dbff60630e62591b5de8b0a98824c713d510cff782","target":"graph","created_at":"2026-05-18T02:45:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The first main result is a complete and decidable characterisation of all product rules P giving rise to P-products which are bilinear, associative, and commutative. The equivalence problem for P-automata is decidable for P-products satisfying our characterisation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The P-product is defined coinductively by a polynomial product rule P on formal power series in noncommuting indeterminates, with the characterisation relying on this recursive structure."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A complete decidable characterization of polynomial rules P yielding bilinear associative commutative P-products on series is given, together with decidability of equivalence for the associated P-automata."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Polynomial product rules completely characterise all bilinear associative commutative products on noncommuting series and make P-automaton equivalence decidable."}],"snapshot_sha256":"54b7bb9fdc1ccaf937a1035638cc37e0b420dd10d90b1e5f971dd55cdd7fad5e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a large family of product operations of formal power series in noncommuting indeterminates, the classes of automata they define, and the respective equivalence problems. A $P$-product of series is defined coinductively by a polynomial product rule $P$, which gives a recursive recipe to build the product of two series as a function of the series themselves and their derivatives.\n  The first main result of the paper is a complete and decidable characterisation of all product rules $P$ giving rise to $P$-products which are bilinear, associative, and commutative. The characterisation s","authors_text":"Lorenzo Clemente","cross_cats":[],"headline":"Polynomial product rules completely characterise all bilinear associative commutative products on noncommuting series and make P-automaton equivalence decidable.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-01-27T17:09:53Z","title":"Commutative algebras of series"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Henning Basold, Helle Hvid Hansen, Jean-Éric Pin, and Jan Rutten","work_id":"645b54f6-b8eb-4569-a7e3-1ba73229e16d","year":null},{"cited_arxiv_id":"","doi":"10.1017/s0960129517000159","is_internal_anchor":false,"ref_index":2,"title":"doi:10.1017/s0960129517000159","work_id":"02bf3322-dbcf-437c-8a99-78331d39f6bc","year":2017},{"cited_arxiv_id":"","doi":"10.1109/lics.2017.8005101","is_internal_anchor":false,"ref_index":3,"title":"12 Jean-Baptiste Courtois and Sylvain Schmitz","work_id":"07ef88bb-2cea-4f60-92bc-0d5a9907e221","year":2017},{"cited_arxiv_id":"","doi":"10.1016/s0195-6698(13)80035-2","is_internal_anchor":false,"ref_index":4,"title":"François Bergeron and Christophe Reutenauer. 1990. Combinatorial resolution of systems of differential equations iii: a special class of differentially algebraic series.European Journal of Combinatori","work_id":"4a740a72-77bb-401b-ac85-6038857ea710","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"J. Berstel and C. Reutenauer. 2010.Noncommutative rational series with applications. CUP.isbn: 0521190223","work_id":"aab71db5-4e06-4001-8ad2-2e0b49349355","year":2010}],"snapshot_sha256":"dce6930db99197ce66998cd0fccc0c09e68487ab872333af57ace0afaf427f88"},"source":{"id":"2601.19809","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T10:37:17.695037Z","id":"d558589e-34ab-4024-8d5c-aaef1a645b3c","model_set":{"reader":"grok-4.3"},"one_line_summary":"A complete decidable characterization of polynomial rules P yielding bilinear associative commutative P-products on series is given, together with decidability of equivalence for the associated P-automata.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Polynomial product rules completely characterise all bilinear associative commutative products on noncommuting series and make P-automaton equivalence decidable.","strongest_claim":"The first main result is a complete and decidable characterisation of all product rules P giving rise to P-products which are bilinear, associative, and commutative. The equivalence problem for P-automata is decidable for P-products satisfying our characterisation.","weakest_assumption":"The P-product is defined coinductively by a polynomial product rule P on formal power series in noncommuting indeterminates, with the characterisation relying on this recursive structure."}},"verdict_id":"d558589e-34ab-4024-8d5c-aaef1a645b3c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06a279b36d61951da62f9ffb86b271a4cdc7421c201eb51a273a2b7962880019","target":"record","created_at":"2026-05-18T02:45:05Z","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":"99e71d10483066709f8e3eaedb50c14b5283d6f3dc52580f6e392e18be77c0cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-01-27T17:09:53Z","title_canon_sha256":"797e9097ed806376b4dae80d9856cfcb24a1cd18c5e870175030ac47377b1864"},"schema_version":"1.0","source":{"id":"2601.19809","kind":"arxiv","version":2}},"canonical_sha256":"2267b31d3907f860ff7b734421d61ccb8195630e722805b6dd03795f72fe6dcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2267b31d3907f860ff7b734421d61ccb8195630e722805b6dd03795f72fe6dcb","first_computed_at":"2026-05-18T02:45:05.802305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:05.802305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NRNLnYJ5eJGn4g+JKTz10K6ZtAvJikPg1MltsZcNHSztYktwmd86TMcwVqhi8ko3/Hd1LzXJSM2NCjs2Un9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:05.802774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.19809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06a279b36d61951da62f9ffb86b271a4cdc7421c201eb51a273a2b7962880019","sha256:d9bcf16f52eb9b9a381955dbff60630e62591b5de8b0a98824c713d510cff782"],"state_sha256":"47f764a479165df255f931ac3e776a5fa02ee48128e2f8bed8799f309796f219"}