{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y5KN3IRPIFZH5WBYWZIDRA5KTS","short_pith_number":"pith:Y5KN3IRP","schema_version":"1.0","canonical_sha256":"c754dda22f41727ed838b6503883aa9c83aa1bd49c1b76689bb2fb925e630fb4","source":{"kind":"arxiv","id":"1701.04632","version":1},"attestation_state":"computed","paper":{"title":"Degree of sequentiality of weighted automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Didier Villevalois, Ismael Jecker, Laure Daviaud, Pierre-Alain Reynier","submitted_at":"2017-01-17T11:56:50Z","abstract_excerpt":"Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs. We focus on multi-sequential WA that are defined as finite unions of sequential WA. The problem we address is to minimize the size of this union. We call this minimum the degree of sequentiality of (the relation realized by) the WA. For a given positive integer k, we provide multiple characterizations of"},"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":"1701.04632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-17T11:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"a20e42e4e4fb35f866a7b0e6dca0168132ed478ba09484fb87ae4b1b9209bc63","abstract_canon_sha256":"28efa1c8540d3ca64c3e8d7070dcdadd43731c8363620f8cc0f84b8431b10897"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:43.067560Z","signature_b64":"Y3mSCiAO/z+Zd0GW4gh1HFu1EuPAk84GG1mwWOAvK9KboFbvweHq9/WqkVy40CHUnN/hhNBED2qTypy6N0CtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c754dda22f41727ed838b6503883aa9c83aa1bd49c1b76689bb2fb925e630fb4","last_reissued_at":"2026-05-18T00:52:43.066958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:43.066958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree of sequentiality of weighted automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Didier Villevalois, Ismael Jecker, Laure Daviaud, Pierre-Alain Reynier","submitted_at":"2017-01-17T11:56:50Z","abstract_excerpt":"Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs. We focus on multi-sequential WA that are defined as finite unions of sequential WA. The problem we address is to minimize the size of this union. We call this minimum the degree of sequentiality of (the relation realized by) the WA. For a given positive integer k, we provide multiple characterizations of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04632","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":"1701.04632","created_at":"2026-05-18T00:52:43.067076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04632v1","created_at":"2026-05-18T00:52:43.067076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04632","created_at":"2026-05-18T00:52:43.067076+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5KN3IRPIFZH","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5KN3IRPIFZH5WBY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5KN3IRP","created_at":"2026-05-18T12:31:56.362134+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/Y5KN3IRPIFZH5WBYWZIDRA5KTS","json":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS.json","graph_json":"https://pith.science/api/pith-number/Y5KN3IRPIFZH5WBYWZIDRA5KTS/graph.json","events_json":"https://pith.science/api/pith-number/Y5KN3IRPIFZH5WBYWZIDRA5KTS/events.json","paper":"https://pith.science/paper/Y5KN3IRP"},"agent_actions":{"view_html":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS","download_json":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS.json","view_paper":"https://pith.science/paper/Y5KN3IRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04632&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5KN3IRPIFZH5WBYWZIDRA5KTS/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5KN3IRPIFZH5WBYWZIDRA5KTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS/action/storage_attestation","attest_author":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS/action/author_attestation","sign_citation":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS/action/citation_signature","submit_replication":"https://pith.science/pith/Y5KN3IRPIFZH5WBYWZIDRA5KTS/action/replication_record"}},"created_at":"2026-05-18T00:52:43.067076+00:00","updated_at":"2026-05-18T00:52:43.067076+00:00"}