{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LZ5MMLG7G6PODYRFZHJMBOJOB5","short_pith_number":"pith:LZ5MMLG7","schema_version":"1.0","canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","source":{"kind":"arxiv","id":"1303.4277","version":4},"attestation_state":"computed","paper":{"title":"Simple Schemas for Unordered XML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Iovka Boneva, Radu Ciucanu, Slawek Staworko","submitted_at":"2013-03-18T15:03:43Z","abstract_excerpt":"We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and its restriction, disjunction-free multiplicity schemas (MS). We investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership of a tree to the language of a schema, schema containment, twig query satisfiability, implication, and containment in the presence of schema. Our research indicates that the proposed formalisms retain much"},"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":"1303.4277","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-03-18T15:03:43Z","cross_cats_sorted":[],"title_canon_sha256":"c8f20f3864aa50d54899b63ef8885bbfea6d20455bf06d291f169ecc8567eea8","abstract_canon_sha256":"5128f22bfc3ef04cec85bce5c275937e2bd9e27d33ea0c6be221d2208d59c982"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:22.403296Z","signature_b64":"w1pPM72KTDWizcwsExw3bISIyUj86mvIl2Vno7YH28d4Bqo5t3KjagVYkzMvokyJIMr1HeUe2+VnO60GZD+sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","last_reissued_at":"2026-05-18T03:20:22.402560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:22.402560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Schemas for Unordered XML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Iovka Boneva, Radu Ciucanu, Slawek Staworko","submitted_at":"2013-03-18T15:03:43Z","abstract_excerpt":"We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and its restriction, disjunction-free multiplicity schemas (MS). We investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership of a tree to the language of a schema, schema containment, twig query satisfiability, implication, and containment in the presence of schema. Our research indicates that the proposed formalisms retain much"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4277","kind":"arxiv","version":4},"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":"1303.4277","created_at":"2026-05-18T03:20:22.402703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4277v4","created_at":"2026-05-18T03:20:22.402703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4277","created_at":"2026-05-18T03:20:22.402703+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ5MMLG7G6PO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ5MMLG7G6PODYRF","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ5MMLG7","created_at":"2026-05-18T12:27:51.066281+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/LZ5MMLG7G6PODYRFZHJMBOJOB5","json":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5.json","graph_json":"https://pith.science/api/pith-number/LZ5MMLG7G6PODYRFZHJMBOJOB5/graph.json","events_json":"https://pith.science/api/pith-number/LZ5MMLG7G6PODYRFZHJMBOJOB5/events.json","paper":"https://pith.science/paper/LZ5MMLG7"},"agent_actions":{"view_html":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5","download_json":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5.json","view_paper":"https://pith.science/paper/LZ5MMLG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4277&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ5MMLG7G6PODYRFZHJMBOJOB5/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ5MMLG7G6PODYRFZHJMBOJOB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/action/storage_attestation","attest_author":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/action/author_attestation","sign_citation":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/action/citation_signature","submit_replication":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/action/replication_record"}},"created_at":"2026-05-18T03:20:22.402703+00:00","updated_at":"2026-05-18T03:20:22.402703+00:00"}