{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GWVPQDL7YTEYQJAWTIONXIDL4H","short_pith_number":"pith:GWVPQDL7","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"},"canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","source":{"kind":"arxiv","id":"1906.11104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11104","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11104v1","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11104","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"GWVPQDL7YTEY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWVPQDL7YTEYQJAW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWVPQDL7","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GWVPQDL7YTEYQJAWTIONXIDL4H","target":"record","payload":{"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"},"canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","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"},"source_kind":"arxiv","source_id":"1906.11104","source_version":1,"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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+ChxJdTQPIbUDcdMqrKPVlMB4J2c+YfhdHJA6RFDN9xAyRvJ7oaPqfY4Mjl97do4FXQm7n0+yj4nD1utJJKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:36:00.037667Z"},"content_sha256":"8b0e46f0467816940def7c16db96e5c2f0a1721bc0387fb002b07058a7f5fe7d","schema_version":"1.0","event_id":"sha256:8b0e46f0467816940def7c16db96e5c2f0a1721bc0387fb002b07058a7f5fe7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GWVPQDL7YTEYQJAWTIONXIDL4H","target":"graph","payload":{"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"},"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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7dXf2/NCSkf7CuSAvVLuvw5WfiCaOZdRYC/Ixdr9jiePPqv5Pz7GhDsZlIfu0EOCKmM+bbBbsKW2fDcHcLSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:36:00.038009Z"},"content_sha256":"ac279b224326ef3bb5ffa1bb417e1be5d7903ecce1209c3bea0c580197649cf5","schema_version":"1.0","event_id":"sha256:ac279b224326ef3bb5ffa1bb417e1be5d7903ecce1209c3bea0c580197649cf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/bundle.json","state_url":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/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-06-23T15:36:00Z","links":{"resolver":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H","bundle":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/bundle.json","state":"https://pith.science/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWVPQDL7YTEYQJAWTIONXIDL4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GWVPQDL7YTEYQJAWTIONXIDL4H","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":"0be383e6f3a38988fe00ef317b6f387c62833238879d1d3bbd2ff18a068d0474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-26T13:53:33Z","title_canon_sha256":"b7f574fa97a38fa9cfd780ba98f643dd36d0319ce8f95f95e2eaaf162a21289a"},"schema_version":"1.0","source":{"id":"1906.11104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11104","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11104v1","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11104","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"GWVPQDL7YTEY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWVPQDL7YTEYQJAW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWVPQDL7","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ac279b224326ef3bb5ffa1bb417e1be5d7903ecce1209c3bea0c580197649cf5","target":"graph","created_at":"2026-05-17T23:42:09Z","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":"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","authors_text":"Jakub Michaliszyn, Jan Otop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-26T13:53:33Z","title":"Approximate Learning of Limit-Average Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11104","kind":"arxiv","version":1},"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:8b0e46f0467816940def7c16db96e5c2f0a1721bc0387fb002b07058a7f5fe7d","target":"record","created_at":"2026-05-17T23:42:09Z","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":"0be383e6f3a38988fe00ef317b6f387c62833238879d1d3bbd2ff18a068d0474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-26T13:53:33Z","title_canon_sha256":"b7f574fa97a38fa9cfd780ba98f643dd36d0319ce8f95f95e2eaaf162a21289a"},"schema_version":"1.0","source":{"id":"1906.11104","kind":"arxiv","version":1}},"canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35aaf80d7fc4c98824169a1cdba06be1e361a24e1541d875d0859d0f148ca448","first_computed_at":"2026-05-17T23:42:09.817859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:09.817859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wgIqddO2c0sbSRdTc7ku+aSO235BL03fi8SdiBjoeeDS/7S+9bVIwYPZNgtZCHhjP0cwC71eKRTyqt00tVUSDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:09.818471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b0e46f0467816940def7c16db96e5c2f0a1721bc0387fb002b07058a7f5fe7d","sha256:ac279b224326ef3bb5ffa1bb417e1be5d7903ecce1209c3bea0c580197649cf5"],"state_sha256":"8707884b658adb98849df690a40966bde5397c7ad5080b162b856655d724368d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toJpr9P4smQaJJTncvXujPdzqCQjqKYUPbjXL5y5Tfp2MVmTe6rzJfcCffmQVKchhncrWq20kzkeEWhqRTGsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:36:00.039929Z","bundle_sha256":"2a687cc91ed8ae0972c83a3fefee1e04888b4678e4106160cf3e9a85da5e8ba2"}}