{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FRC3SDC3MZXMHNPKOGIUB3UTVT","short_pith_number":"pith:FRC3SDC3","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"},"canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","source":{"kind":"arxiv","id":"2511.12039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.12039","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"2511.12039v2","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.12039","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"FRC3SDC3MZXM","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_16","alias_value":"FRC3SDC3MZXMHNPK","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_8","alias_value":"FRC3SDC3","created_at":"2026-05-20T00:04:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FRC3SDC3MZXMHNPKOGIUB3UTVT","target":"record","payload":{"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"},"canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","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"},"source_kind":"arxiv","source_id":"2511.12039","source_version":2,"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-20T00:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIKvIZjnlno33+kImIneuEAXmI8LmRotL24GxZHRPe0ILO917C1WvQvJxzcgoHuXAnYoxzelo/HIsfcC9jUdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:12:14.441080Z"},"content_sha256":"0bd863b2ea410a71df2706d7b6aabb3cc566560676bdcf7427ff0ffa830e8857","schema_version":"1.0","event_id":"sha256:0bd863b2ea410a71df2706d7b6aabb3cc566560676bdcf7427ff0ffa830e8857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FRC3SDC3MZXMHNPKOGIUB3UTVT","target":"graph","payload":{"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"},"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-20T00:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J28aJ+DB7+rjNZFS1Qd2gmyHBrkBR6njOpj1EnkoHZEeq2VhBtRIPHREVxvhHZCKUMHE583y1cgpmET2ESxKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:12:14.441487Z"},"content_sha256":"5ed46040a10c488b576adeab0f858bd1ce3f17dae57314719dc94fd8bc3c9db0","schema_version":"1.0","event_id":"sha256:5ed46040a10c488b576adeab0f858bd1ce3f17dae57314719dc94fd8bc3c9db0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/bundle.json","state_url":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/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-05-28T11:12:14Z","links":{"resolver":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT","bundle":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/bundle.json","state":"https://pith.science/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRC3SDC3MZXMHNPKOGIUB3UTVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FRC3SDC3MZXMHNPKOGIUB3UTVT","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":"b9a88fa92a8e231f5501761841353791d0491be1d88dbe9d8a6a0838dda4e047","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-11-15T05:16:32Z","title_canon_sha256":"a4fd789eb4162069928add2f082e6ceb69153663f5b41b6ecb6534771771deae"},"schema_version":"1.0","source":{"id":"2511.12039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.12039","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"2511.12039v2","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.12039","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"FRC3SDC3MZXM","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_16","alias_value":"FRC3SDC3MZXMHNPK","created_at":"2026-05-20T00:04:17Z"},{"alias_kind":"pith_short_8","alias_value":"FRC3SDC3","created_at":"2026-05-20T00:04:17Z"}],"graph_snapshots":[{"event_id":"sha256:5ed46040a10c488b576adeab0f858bd1ce3f17dae57314719dc94fd8bc3c9db0","target":"graph","created_at":"2026-05-20T00:04:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.12039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sandra Zilles, S. Mahmoud Mousawi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-11-15T05:16:32Z","title":"Positive Characteristic Sets for Relational Pattern Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.12039","kind":"arxiv","version":2},"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:0bd863b2ea410a71df2706d7b6aabb3cc566560676bdcf7427ff0ffa830e8857","target":"record","created_at":"2026-05-20T00:04:17Z","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":"b9a88fa92a8e231f5501761841353791d0491be1d88dbe9d8a6a0838dda4e047","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-11-15T05:16:32Z","title_canon_sha256":"a4fd789eb4162069928add2f082e6ceb69153663f5b41b6ecb6534771771deae"},"schema_version":"1.0","source":{"id":"2511.12039","kind":"arxiv","version":2}},"canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c45b90c5b666ec3b5ea719140ee93acfc6790c8941927256ac651ba315bc95d","first_computed_at":"2026-05-20T00:04:17.229861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:17.229861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KpuTo/SXl6uJQh5RRsd+NJ1OGs3wqjDcIAFwzNDLD/I+Yu5FR63MvzHUaGtP81tciZxjqbFxFY0pIrcqdMPACA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:17.230725Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.12039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bd863b2ea410a71df2706d7b6aabb3cc566560676bdcf7427ff0ffa830e8857","sha256:5ed46040a10c488b576adeab0f858bd1ce3f17dae57314719dc94fd8bc3c9db0"],"state_sha256":"31ff961499f3f1819a62520ddba4e4fd55f02605fef15c15cc9d22bf599bd3cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91LNLq3mBVNkS1pgEWxxTWQU4FeJRFMXTMBUwrXD7Yeqv+CQx1pbw5QY9WQnaO/TQ+YtXFOUzQ4ni1N6Uk3sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:12:14.443628Z","bundle_sha256":"7ee6fdd8307040b76dc1b53c1c77fd4714bb71a0e0aae966b886bed6d949c1af"}}