{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AFCTMPFGSNQDLUO54BZK3JKUAC","short_pith_number":"pith:AFCTMPFG","canonical_record":{"source":{"id":"1906.02074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-05T15:32:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"780a7f772cb3c8af2b5b4a21423f84bb6e469899ed144a959a30996756350b80","abstract_canon_sha256":"f4061feead5f4e3187da0229491ac96f95f6b2ec1dd41395b7cca743a5e09784"},"schema_version":"1.0"},"canonical_sha256":"0145363ca6936035d1dde072ada554008ff9041afa072d07811b1d6f92a8545c","source":{"kind":"arxiv","id":"1906.02074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02074","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02074v1","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02074","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"AFCTMPFGSNQD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AFCTMPFGSNQDLUO5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AFCTMPFG","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AFCTMPFGSNQDLUO54BZK3JKUAC","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-05T15:32:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"780a7f772cb3c8af2b5b4a21423f84bb6e469899ed144a959a30996756350b80","abstract_canon_sha256":"f4061feead5f4e3187da0229491ac96f95f6b2ec1dd41395b7cca743a5e09784"},"schema_version":"1.0"},"canonical_sha256":"0145363ca6936035d1dde072ada554008ff9041afa072d07811b1d6f92a8545c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.314158Z","signature_b64":"ojYa6m/STHffD1zs2nhVWKFnH89y1CUCarHQS9B2QHnLIe/m6OYqIvqtlvpM3FY+OUeb/y3bQvIAR5aMrG4zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0145363ca6936035d1dde072ada554008ff9041afa072d07811b1d6f92a8545c","last_reissued_at":"2026-05-17T23:44:05.313571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.313571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02074","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIiE5AQFczkHQFjhpnQxl99PPTeQB7Judb+gPD2QwBNGOsRmjDFtBGOOHUAasWRSWNE0Y3XG0rJnbuaninxEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:05.807754Z"},"content_sha256":"1c72c2ca608980405075f294670308273a8ad8d59bf3cf8d80c6b075c86e0b53","schema_version":"1.0","event_id":"sha256:1c72c2ca608980405075f294670308273a8ad8d59bf3cf8d80c6b075c86e0b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AFCTMPFGSNQDLUO54BZK3JKUAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Algorithm for Learning Single Occurrence Regular Expressions with Interleaving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Haiming Chen, Lingqi Zhang, Xiaolan Zhang, Yeting Li","submitted_at":"2019-06-05T15:32:22Z","abstract_excerpt":"The advantages offered by the presence of a schema are numerous. However, many XML documents in practice are not accompanied by a (valid) schema, making schema inference an attractive research problem. The fundamental task in XML schema learning is inferring restricted subclasses of regular expressions. Most previous work either lacks support for interleaving or only has limited support for interleaving. In this paper, we first propose a new subclass Single Occurrence Regular Expressions with Interleaving (SOIRE), which has unrestricted support for interleaving. Then, based on single occurrenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02074","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EimXVTB2qdZJMyKyO1SiNd8RNKNMXZhA8gNlHqN+Xt+WZdrGab7uOvgCLTatbeMhvRnkAGpyAO2LEY6HJfZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:05.808389Z"},"content_sha256":"845de2acc4b3565adfc39c1edadec64da0290ed3d70d3d57ff43e819b004beec","schema_version":"1.0","event_id":"sha256:845de2acc4b3565adfc39c1edadec64da0290ed3d70d3d57ff43e819b004beec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/bundle.json","state_url":"https://pith.science/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/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-07T16:14:05Z","links":{"resolver":"https://pith.science/pith/AFCTMPFGSNQDLUO54BZK3JKUAC","bundle":"https://pith.science/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/bundle.json","state":"https://pith.science/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFCTMPFGSNQDLUO54BZK3JKUAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AFCTMPFGSNQDLUO54BZK3JKUAC","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":"f4061feead5f4e3187da0229491ac96f95f6b2ec1dd41395b7cca743a5e09784","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-05T15:32:22Z","title_canon_sha256":"780a7f772cb3c8af2b5b4a21423f84bb6e469899ed144a959a30996756350b80"},"schema_version":"1.0","source":{"id":"1906.02074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02074","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02074v1","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02074","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"AFCTMPFGSNQD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AFCTMPFGSNQDLUO5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AFCTMPFG","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:845de2acc4b3565adfc39c1edadec64da0290ed3d70d3d57ff43e819b004beec","target":"graph","created_at":"2026-05-17T23:44:05Z","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":"The advantages offered by the presence of a schema are numerous. However, many XML documents in practice are not accompanied by a (valid) schema, making schema inference an attractive research problem. The fundamental task in XML schema learning is inferring restricted subclasses of regular expressions. Most previous work either lacks support for interleaving or only has limited support for interleaving. In this paper, we first propose a new subclass Single Occurrence Regular Expressions with Interleaving (SOIRE), which has unrestricted support for interleaving. Then, based on single occurrenc","authors_text":"Haiming Chen, Lingqi Zhang, Xiaolan Zhang, Yeting Li","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-05T15:32:22Z","title":"An Effective Algorithm for Learning Single Occurrence Regular Expressions with Interleaving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02074","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:1c72c2ca608980405075f294670308273a8ad8d59bf3cf8d80c6b075c86e0b53","target":"record","created_at":"2026-05-17T23:44:05Z","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":"f4061feead5f4e3187da0229491ac96f95f6b2ec1dd41395b7cca743a5e09784","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-05T15:32:22Z","title_canon_sha256":"780a7f772cb3c8af2b5b4a21423f84bb6e469899ed144a959a30996756350b80"},"schema_version":"1.0","source":{"id":"1906.02074","kind":"arxiv","version":1}},"canonical_sha256":"0145363ca6936035d1dde072ada554008ff9041afa072d07811b1d6f92a8545c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0145363ca6936035d1dde072ada554008ff9041afa072d07811b1d6f92a8545c","first_computed_at":"2026-05-17T23:44:05.313571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:05.313571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ojYa6m/STHffD1zs2nhVWKFnH89y1CUCarHQS9B2QHnLIe/m6OYqIvqtlvpM3FY+OUeb/y3bQvIAR5aMrG4zDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:05.314158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c72c2ca608980405075f294670308273a8ad8d59bf3cf8d80c6b075c86e0b53","sha256:845de2acc4b3565adfc39c1edadec64da0290ed3d70d3d57ff43e819b004beec"],"state_sha256":"78b8401030da6b59c9826b85fc9c1d8452105f78da8f404f0047f24589dc5e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmCIKtijqFi0pBKeiCtf5kajjinZr8PH4ljnM/T59rMnynhNqaLa0jNovgLuXtfXKV7bANBFDbsUQT1UkvonCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:14:05.812571Z","bundle_sha256":"073283e9ceddd233d61bab3b07f46c433b2fe31a2a265a72f554610554fd832a"}}