{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LZ5MMLG7G6PODYRFZHJMBOJOB5","short_pith_number":"pith:LZ5MMLG7","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"},"canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","source":{"kind":"arxiv","id":"1303.4277","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4277","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4277v4","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4277","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"LZ5MMLG7G6PO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LZ5MMLG7G6PODYRF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LZ5MMLG7","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LZ5MMLG7G6PODYRFZHJMBOJOB5","target":"record","payload":{"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"},"canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","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"},"source_kind":"arxiv","source_id":"1303.4277","source_version":4,"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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8MtA9m31MISQ1urKxQBoFRxSdcNZruZVPQnD6BpjI+bnr+CLFtLSiBURW5MJsqMlAogRmeu+BPVfGwwHojWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:58:25.789285Z"},"content_sha256":"9541d79b061a6005343c4fa9f62a7629455245ccabc325bc11fa43d5e329d7f1","schema_version":"1.0","event_id":"sha256:9541d79b061a6005343c4fa9f62a7629455245ccabc325bc11fa43d5e329d7f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LZ5MMLG7G6PODYRFZHJMBOJOB5","target":"graph","payload":{"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"},"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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxucQTw2yA/VK8Qsn+1WNk9uUzBqjcSvADlQIfRf1dg5KDkS/AGezUDF3kfI9zO5Qq3iqAQ7p/cQ0Raac+wmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:58:25.789921Z"},"content_sha256":"53ea3e64522caf47803b34745992b548b0512a359eec4b791b91c5a90f63a6a0","schema_version":"1.0","event_id":"sha256:53ea3e64522caf47803b34745992b548b0512a359eec4b791b91c5a90f63a6a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/bundle.json","state_url":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/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-01T18:58:25Z","links":{"resolver":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5","bundle":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/bundle.json","state":"https://pith.science/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ5MMLG7G6PODYRFZHJMBOJOB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LZ5MMLG7G6PODYRFZHJMBOJOB5","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":"5128f22bfc3ef04cec85bce5c275937e2bd9e27d33ea0c6be221d2208d59c982","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-03-18T15:03:43Z","title_canon_sha256":"c8f20f3864aa50d54899b63ef8885bbfea6d20455bf06d291f169ecc8567eea8"},"schema_version":"1.0","source":{"id":"1303.4277","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4277","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4277v4","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4277","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"LZ5MMLG7G6PO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LZ5MMLG7G6PODYRF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LZ5MMLG7","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:53ea3e64522caf47803b34745992b548b0512a359eec4b791b91c5a90f63a6a0","target":"graph","created_at":"2026-05-18T03:20:22Z","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 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","authors_text":"Iovka Boneva, Radu Ciucanu, Slawek Staworko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-03-18T15:03:43Z","title":"Simple Schemas for Unordered XML"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4277","kind":"arxiv","version":4},"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:9541d79b061a6005343c4fa9f62a7629455245ccabc325bc11fa43d5e329d7f1","target":"record","created_at":"2026-05-18T03:20:22Z","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":"5128f22bfc3ef04cec85bce5c275937e2bd9e27d33ea0c6be221d2208d59c982","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-03-18T15:03:43Z","title_canon_sha256":"c8f20f3864aa50d54899b63ef8885bbfea6d20455bf06d291f169ecc8567eea8"},"schema_version":"1.0","source":{"id":"1303.4277","kind":"arxiv","version":4}},"canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e7ac62cdf379ee1e225c9d2c0b92e0f62da39cf297752b430074bd08ceb0ce9","first_computed_at":"2026-05-18T03:20:22.402560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:22.402560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w1pPM72KTDWizcwsExw3bISIyUj86mvIl2Vno7YH28d4Bqo5t3KjagVYkzMvokyJIMr1HeUe2+VnO60GZD+sBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:22.403296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4277","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9541d79b061a6005343c4fa9f62a7629455245ccabc325bc11fa43d5e329d7f1","sha256:53ea3e64522caf47803b34745992b548b0512a359eec4b791b91c5a90f63a6a0"],"state_sha256":"fc76969f1763f1f539c956f18fe0c826ace12beb0a7e21fc66a7e699f2c2e5eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7HEw0RL9cRE0YaOAzoeyWbRdBT+kKBjoxNQdzzoG6sMIv93D+CbcIxOdK9IDXVL77z/f2juW0E4QZ8paVIQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:58:25.792832Z","bundle_sha256":"f2528bafb526e9ab3de90ff307a52c9e1292b5b9ef1fbadf5475c43bc74289dc"}}