{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MWSAYRPJIEJ2LCB3PBFRO63BKW","short_pith_number":"pith:MWSAYRPJ","canonical_record":{"source":{"id":"1307.6348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-24T09:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"808e28cd52c4d9f6ddc9891d81538b573a462a561eaacb8fae127f5e55a9cbaf","abstract_canon_sha256":"6713237d2766c4fd7dc5b280c685f55a9888a59a2d9db950b5b098df9fb1299c"},"schema_version":"1.0"},"canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","source":{"kind":"arxiv","id":"1307.6348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6348","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6348v2","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6348","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"MWSAYRPJIEJ2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWSAYRPJIEJ2LCB3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWSAYRPJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MWSAYRPJIEJ2LCB3PBFRO63BKW","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-24T09:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"808e28cd52c4d9f6ddc9891d81538b573a462a561eaacb8fae127f5e55a9cbaf","abstract_canon_sha256":"6713237d2766c4fd7dc5b280c685f55a9888a59a2d9db950b5b098df9fb1299c"},"schema_version":"1.0"},"canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:35.866719Z","signature_b64":"e5I1u5SB8wNKdi8z9JPa1xMhcc1MGEeTtlGjYZrVIWHO1Io1vAgpjUu+ejfMxgbZueWzYQ7BMSuFyZbPAHPrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","last_reissued_at":"2026-05-18T03:17:35.866230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:35.866230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6348","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-18T03:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JpUoOz6kWQGybox4vlcRuQ/+27AWM0dPFsL/FSHJNnvgRUybIbHVkzryS7m5IuKg3CZvunZfVuRv5z/8If8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:28.760813Z"},"content_sha256":"4af101af97cdfeb2fbaa87598a0f2d45f0fd73e2e17113f1578888c5f3a5d581","schema_version":"1.0","event_id":"sha256:4af101af97cdfeb2fbaa87598a0f2d45f0fd73e2e17113f1578888c5f3a5d581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MWSAYRPJIEJ2LCB3PBFRO63BKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Schemas for Unordered XML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Radu Ciucanu, Slawek Staworko","submitted_at":"2013-07-24T09:33:41Z","abstract_excerpt":"We consider unordered XML, where the relative order among siblings is ignored, and we investigate the problem of learning schemas from examples given by the user. We focus on the schema formalisms proposed in [10]: disjunctive multiplicity schemas (DMS) and its restriction, disjunction-free multiplicity schemas (MS). A learning algorithm takes as input a set of XML documents which must satisfy the schema (i.e., positive examples) and a set of XML documents which must not satisfy the schema (i.e., negative examples), and returns a schema consistent with the examples. We investigate a learning f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6348","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":""},"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-18T03:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETdh14wq2f3ULxVrPb8C7k6c7wcCnEhfH/YbF44syaZuLCBBjsT0sXbEhqx16jlnFpBf59prLaVxC/zrCp2iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:28.761152Z"},"content_sha256":"3bc9a1764525eff2270af6b8eedf1c9bbede044699b880493847d018c44e87a8","schema_version":"1.0","event_id":"sha256:3bc9a1764525eff2270af6b8eedf1c9bbede044699b880493847d018c44e87a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/bundle.json","state_url":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/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-01T16:56:28Z","links":{"resolver":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW","bundle":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/bundle.json","state":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MWSAYRPJIEJ2LCB3PBFRO63BKW","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":"6713237d2766c4fd7dc5b280c685f55a9888a59a2d9db950b5b098df9fb1299c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-24T09:33:41Z","title_canon_sha256":"808e28cd52c4d9f6ddc9891d81538b573a462a561eaacb8fae127f5e55a9cbaf"},"schema_version":"1.0","source":{"id":"1307.6348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6348","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6348v2","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6348","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"MWSAYRPJIEJ2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWSAYRPJIEJ2LCB3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWSAYRPJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:3bc9a1764525eff2270af6b8eedf1c9bbede044699b880493847d018c44e87a8","target":"graph","created_at":"2026-05-18T03:17:35Z","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":"We consider unordered XML, where the relative order among siblings is ignored, and we investigate the problem of learning schemas from examples given by the user. We focus on the schema formalisms proposed in [10]: disjunctive multiplicity schemas (DMS) and its restriction, disjunction-free multiplicity schemas (MS). A learning algorithm takes as input a set of XML documents which must satisfy the schema (i.e., positive examples) and a set of XML documents which must not satisfy the schema (i.e., negative examples), and returns a schema consistent with the examples. We investigate a learning f","authors_text":"Radu Ciucanu, Slawek Staworko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-24T09:33:41Z","title":"Learning Schemas for Unordered XML"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6348","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:4af101af97cdfeb2fbaa87598a0f2d45f0fd73e2e17113f1578888c5f3a5d581","target":"record","created_at":"2026-05-18T03:17:35Z","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":"6713237d2766c4fd7dc5b280c685f55a9888a59a2d9db950b5b098df9fb1299c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-24T09:33:41Z","title_canon_sha256":"808e28cd52c4d9f6ddc9891d81538b573a462a561eaacb8fae127f5e55a9cbaf"},"schema_version":"1.0","source":{"id":"1307.6348","kind":"arxiv","version":2}},"canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","first_computed_at":"2026-05-18T03:17:35.866230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:35.866230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e5I1u5SB8wNKdi8z9JPa1xMhcc1MGEeTtlGjYZrVIWHO1Io1vAgpjUu+ejfMxgbZueWzYQ7BMSuFyZbPAHPrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:35.866719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af101af97cdfeb2fbaa87598a0f2d45f0fd73e2e17113f1578888c5f3a5d581","sha256:3bc9a1764525eff2270af6b8eedf1c9bbede044699b880493847d018c44e87a8"],"state_sha256":"aae832473bdf76f4c7bca9438d7d1f991f3a8e0aa145bf6db07a2831e4bd4ad4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwDHyC8hA8/luisaAl5JZdL61pkYWw/5xiNt+Q1XDw+UhRuZL+SC1zV0nYkeOu1tLV6+iqu2CGqxJjIA+Ls0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:56:28.763261Z","bundle_sha256":"4e4ab927158c3d1a91037376cf335af652f79d0b020bb7089a66b3ad29d4cdd3"}}