{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MWSAYRPJIEJ2LCB3PBFRO63BKW","short_pith_number":"pith:MWSAYRPJ","schema_version":"1.0","canonical_sha256":"65a40c45e94113a5883b784b177b6155b090b5c799436f2c0ae845f372c0ce81","source":{"kind":"arxiv","id":"1307.6348","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6348","created_at":"2026-05-18T03:17:35.866324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6348v2","created_at":"2026-05-18T03:17:35.866324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6348","created_at":"2026-05-18T03:17:35.866324+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWSAYRPJIEJ2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWSAYRPJIEJ2LCB3","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWSAYRPJ","created_at":"2026-05-18T12:27:52.871228+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/MWSAYRPJIEJ2LCB3PBFRO63BKW","json":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW.json","graph_json":"https://pith.science/api/pith-number/MWSAYRPJIEJ2LCB3PBFRO63BKW/graph.json","events_json":"https://pith.science/api/pith-number/MWSAYRPJIEJ2LCB3PBFRO63BKW/events.json","paper":"https://pith.science/paper/MWSAYRPJ"},"agent_actions":{"view_html":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW","download_json":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW.json","view_paper":"https://pith.science/paper/MWSAYRPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6348&json=true","fetch_graph":"https://pith.science/api/pith-number/MWSAYRPJIEJ2LCB3PBFRO63BKW/graph.json","fetch_events":"https://pith.science/api/pith-number/MWSAYRPJIEJ2LCB3PBFRO63BKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/action/storage_attestation","attest_author":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/action/author_attestation","sign_citation":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/action/citation_signature","submit_replication":"https://pith.science/pith/MWSAYRPJIEJ2LCB3PBFRO63BKW/action/replication_record"}},"created_at":"2026-05-18T03:17:35.866324+00:00","updated_at":"2026-05-18T03:17:35.866324+00:00"}