{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FRC3SDC3MZXMHNPKOGIUB3UTVT","short_pith_number":"pith:FRC3SDC3","schema_version":"1.0","canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","source":{"kind":"arxiv","id":"2511.12039","version":2},"attestation_state":"computed","paper":{"title":"Positive Characteristic Sets for Relational Pattern Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sandra Zilles, S. Mahmoud Mousawi","submitted_at":"2025-11-15T05:16:32Z","abstract_excerpt":"In the context of learning formal languages, data about an unknown target language L is given in terms of a set of (word,label) pairs, where a binary label indicates whether or not the given word belongs to L. A (polynomial-size) characteristic set for L, with respect to a reference class L of languages, is a set of such pairs that satisfies certain conditions allowing a learning algorithm to (efficiently) identify L within L. In this paper, we introduce the notion of positive characteristic set, referring to characteristic sets of only positive examples. These are of importance in the context"},"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":"2511.12039","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-11-15T05:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"a4fd789eb4162069928add2f082e6ceb69153663f5b41b6ecb6534771771deae","abstract_canon_sha256":"b9a88fa92a8e231f5501761841353791d0491be1d88dbe9d8a6a0838dda4e047"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:17.230725Z","signature_b64":"KpuTo/SXl6uJQh5RRsd+NJ1OGs3wqjDcIAFwzNDLD/I+Yu5FR63MvzHUaGtP81tciZxjqbFxFY0pIrcqdMPACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","last_reissued_at":"2026-05-20T00:04:17.229861Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:17.229861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive Characteristic Sets for Relational Pattern Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sandra Zilles, S. Mahmoud Mousawi","submitted_at":"2025-11-15T05:16:32Z","abstract_excerpt":"In the context of learning formal languages, data about an unknown target language L is given in terms of a set of (word,label) pairs, where a binary label indicates whether or not the given word belongs to L. A (polynomial-size) characteristic set for L, with respect to a reference class L of languages, is a set of such pairs that satisfies certain conditions allowing a learning algorithm to (efficiently) identify L within L. In this paper, we introduce the notion of positive characteristic set, referring to characteristic sets of only positive examples. These are of importance in the context"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.12039","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.12039/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2511.12039","created_at":"2026-05-20T00:04:17.230008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.12039v2","created_at":"2026-05-20T00:04:17.230008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.12039","created_at":"2026-05-20T00:04:17.230008+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRC3SDC3MZXM","created_at":"2026-05-20T00:04:17.230008+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRC3SDC3MZXMHNPK","created_at":"2026-05-20T00:04:17.230008+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRC3SDC3","created_at":"2026-05-20T00:04:17.230008+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/FRC3SDC3MZXMHNPKOGIUB3UTVT","json":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT.json","graph_json":"https://pith.science/api/pith-number/FRC3SDC3MZXMHNPKOGIUB3UTVT/graph.json","events_json":"https://pith.science/api/pith-number/FRC3SDC3MZXMHNPKOGIUB3UTVT/events.json","paper":"https://pith.science/paper/FRC3SDC3"},"agent_actions":{"view_html":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT","download_json":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT.json","view_paper":"https://pith.science/paper/FRC3SDC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.12039&json=true","fetch_graph":"https://pith.science/api/pith-number/FRC3SDC3MZXMHNPKOGIUB3UTVT/graph.json","fetch_events":"https://pith.science/api/pith-number/FRC3SDC3MZXMHNPKOGIUB3UTVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/action/storage_attestation","attest_author":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/action/author_attestation","sign_citation":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/action/citation_signature","submit_replication":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/action/replication_record"}},"created_at":"2026-05-20T00:04:17.230008+00:00","updated_at":"2026-05-20T00:04:17.230008+00:00"}