{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GWVPQDL7YTEYQJAWTIONXIDL4H","short_pith_number":"pith:GWVPQDL7","schema_version":"1.0","canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","source":{"kind":"arxiv","id":"1906.11104","version":1},"attestation_state":"computed","paper":{"title":"Approximate Learning of Limit-Average Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jakub Michaliszyn, Jan Otop","submitted_at":"2019-06-26T13:53:33Z","abstract_excerpt":"Limit-average automata are weighted automata on infinite words that use average to aggregate the weights seen in infinite runs. We study approximate learning problems for limit-average automata in two settings: passive and active. In the passive learning case, we show that limit-average automata are not PAC-learnable as samples must be of exponential-size to provide (with good probability) enough details to learn an automaton. We also show that the problem of finding an automaton that fits a given sample is NP-complete. In the active learning case, we show that limit-average automata can be le"},"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":"1906.11104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-26T13:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"b7f574fa97a38fa9cfd780ba98f643dd36d0319ce8f95f95e2eaaf162a21289a","abstract_canon_sha256":"0be383e6f3a38988fe00ef317b6f387c62833238879d1d3bbd2ff18a068d0474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:09.818471Z","signature_b64":"wgIqddO2c0sbSRdTc7ku+aSO235BL03fi8SdiBjoeeDS/7S+9bVIwYPZNgtZCHhjP0cwC71eKRTyqt00tVUSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","last_reissued_at":"2026-05-17T23:42:09.817859Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:09.817859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Learning of Limit-Average Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jakub Michaliszyn, Jan Otop","submitted_at":"2019-06-26T13:53:33Z","abstract_excerpt":"Limit-average automata are weighted automata on infinite words that use average to aggregate the weights seen in infinite runs. We study approximate learning problems for limit-average automata in two settings: passive and active. In the passive learning case, we show that limit-average automata are not PAC-learnable as samples must be of exponential-size to provide (with good probability) enough details to learn an automaton. We also show that the problem of finding an automaton that fits a given sample is NP-complete. In the active learning case, we show that limit-average automata can be le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11104","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":"1906.11104","created_at":"2026-05-17T23:42:09.817957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11104v1","created_at":"2026-05-17T23:42:09.817957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11104","created_at":"2026-05-17T23:42:09.817957+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWVPQDL7YTEY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWVPQDL7YTEYQJAW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWVPQDL7","created_at":"2026-05-18T12:33:18.533446+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/GWVPQDL7YTEYQJAWTIONXIDL4H","json":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H.json","graph_json":"https://pith.science/api/pith-number/GWVPQDL7YTEYQJAWTIONXIDL4H/graph.json","events_json":"https://pith.science/api/pith-number/GWVPQDL7YTEYQJAWTIONXIDL4H/events.json","paper":"https://pith.science/paper/GWVPQDL7"},"agent_actions":{"view_html":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H","download_json":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H.json","view_paper":"https://pith.science/paper/GWVPQDL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11104&json=true","fetch_graph":"https://pith.science/api/pith-number/GWVPQDL7YTEYQJAWTIONXIDL4H/graph.json","fetch_events":"https://pith.science/api/pith-number/GWVPQDL7YTEYQJAWTIONXIDL4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/action/storage_attestation","attest_author":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/action/author_attestation","sign_citation":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/action/citation_signature","submit_replication":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/action/replication_record"}},"created_at":"2026-05-17T23:42:09.817957+00:00","updated_at":"2026-05-17T23:42:09.817957+00:00"}