{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ESBIKSHB6R6TYDWM3BJ2R4LVJJ","short_pith_number":"pith:ESBIKSHB","schema_version":"1.0","canonical_sha256":"24828548e1f47d3c0eccd853a8f1754a43002db31ad73e8ff25dd7a236100026","source":{"kind":"arxiv","id":"1810.02953","version":2},"attestation_state":"computed","paper":{"title":"On shuffle products, acyclic automata and piecewise-testable languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Philippe Schnoebelen, Simon Halfon","submitted_at":"2018-10-06T07:55:43Z","abstract_excerpt":"We show that the shuffle $L \\unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages. We also discuss some mild generalizations of the main result, and provide bounds on the piecewise complexity of $L \\unicode{x29E2} F$."},"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":"1810.02953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-06T07:55:43Z","cross_cats_sorted":[],"title_canon_sha256":"225463009a35215ec44b399d8d66f37eba4133e3e4874ce525bc107591efd677","abstract_canon_sha256":"9600a2cb92d6bcba4479d8ea17463e61f73a746c6dc1222e85b2e54175b144fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:53.641332Z","signature_b64":"pdCVoqw11JyYI6x1a6ji16vRzpp3HvCU4Vv3SN1jt0S6GS39moaiQ5oVuYesq0BB7dYh1CKvfeP9sPoXNnx3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24828548e1f47d3c0eccd853a8f1754a43002db31ad73e8ff25dd7a236100026","last_reissued_at":"2026-05-17T23:54:53.640794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:53.640794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On shuffle products, acyclic automata and piecewise-testable languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Philippe Schnoebelen, Simon Halfon","submitted_at":"2018-10-06T07:55:43Z","abstract_excerpt":"We show that the shuffle $L \\unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages. We also discuss some mild generalizations of the main result, and provide bounds on the piecewise complexity of $L \\unicode{x29E2} F$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02953","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02953","created_at":"2026-05-17T23:54:53.640862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02953v2","created_at":"2026-05-17T23:54:53.640862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02953","created_at":"2026-05-17T23:54:53.640862+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESBIKSHB6R6T","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESBIKSHB6R6TYDWM","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESBIKSHB","created_at":"2026-05-18T12:32:22.470017+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/ESBIKSHB6R6TYDWM3BJ2R4LVJJ","json":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ.json","graph_json":"https://pith.science/api/pith-number/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/graph.json","events_json":"https://pith.science/api/pith-number/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/events.json","paper":"https://pith.science/paper/ESBIKSHB"},"agent_actions":{"view_html":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ","download_json":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ.json","view_paper":"https://pith.science/paper/ESBIKSHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02953&json=true","fetch_graph":"https://pith.science/api/pith-number/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/action/storage_attestation","attest_author":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/action/author_attestation","sign_citation":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/action/citation_signature","submit_replication":"https://pith.science/pith/ESBIKSHB6R6TYDWM3BJ2R4LVJJ/action/replication_record"}},"created_at":"2026-05-17T23:54:53.640862+00:00","updated_at":"2026-05-17T23:54:53.640862+00:00"}