{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KITRHJE64WHKPB5H3HZAZI2JM5","short_pith_number":"pith:KITRHJE6","schema_version":"1.0","canonical_sha256":"522713a49ee58ea787a7d9f20ca349675789a4b201dfaba3183faf740485099c","source":{"kind":"arxiv","id":"1207.5091","version":1},"attestation_state":"computed","paper":{"title":"Learning Probabilistic Systems from Tree Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke","submitted_at":"2012-07-21T02:34:25Z","abstract_excerpt":"We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning algorithms that use traditional and a new \"stochastic\" state-space partitioning, the latter resulting in the minimum number of states. We then use them to solve the problem of \"active learning\", that uses a knowledgeable teacher to generate samples as counterexamples to simulation equivalence queries. We show that the problem is undecidable in general, but "},"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":"1207.5091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-21T02:34:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"680dee039c2b79559ff5c8061c5ddc2cc2b9e79e36a11cbe83088fe8bf2264bb","abstract_canon_sha256":"28480c6786865b7d46c7bde58ec2c49e1c6fd63699174454eccda5418480397b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:24.624664Z","signature_b64":"gPWZdmJQR7l/4ePA25E+tAaCPI7gXBLpArX6LRnNH4vNpgCDLTMSE62ChF/EPd8QhKfNOO/eGY7qIUCjUTnhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"522713a49ee58ea787a7d9f20ca349675789a4b201dfaba3183faf740485099c","last_reissued_at":"2026-05-18T03:50:24.623828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:24.623828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Probabilistic Systems from Tree Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke","submitted_at":"2012-07-21T02:34:25Z","abstract_excerpt":"We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning algorithms that use traditional and a new \"stochastic\" state-space partitioning, the latter resulting in the minimum number of states. We then use them to solve the problem of \"active learning\", that uses a knowledgeable teacher to generate samples as counterexamples to simulation equivalence queries. We show that the problem is undecidable in general, but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5091","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":"1207.5091","created_at":"2026-05-18T03:50:24.623930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5091v1","created_at":"2026-05-18T03:50:24.623930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5091","created_at":"2026-05-18T03:50:24.623930+00:00"},{"alias_kind":"pith_short_12","alias_value":"KITRHJE64WHK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KITRHJE64WHKPB5H","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KITRHJE6","created_at":"2026-05-18T12:27:11.947152+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/KITRHJE64WHKPB5H3HZAZI2JM5","json":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5.json","graph_json":"https://pith.science/api/pith-number/KITRHJE64WHKPB5H3HZAZI2JM5/graph.json","events_json":"https://pith.science/api/pith-number/KITRHJE64WHKPB5H3HZAZI2JM5/events.json","paper":"https://pith.science/paper/KITRHJE6"},"agent_actions":{"view_html":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5","download_json":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5.json","view_paper":"https://pith.science/paper/KITRHJE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5091&json=true","fetch_graph":"https://pith.science/api/pith-number/KITRHJE64WHKPB5H3HZAZI2JM5/graph.json","fetch_events":"https://pith.science/api/pith-number/KITRHJE64WHKPB5H3HZAZI2JM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5/action/storage_attestation","attest_author":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5/action/author_attestation","sign_citation":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5/action/citation_signature","submit_replication":"https://pith.science/pith/KITRHJE64WHKPB5H3HZAZI2JM5/action/replication_record"}},"created_at":"2026-05-18T03:50:24.623930+00:00","updated_at":"2026-05-18T03:50:24.623930+00:00"}