{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ICOJ2NC24JZIBCMCAJR7KEPLU5","short_pith_number":"pith:ICOJ2NC2","canonical_record":{"source":{"id":"1311.7307","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T13:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"3d2947f2411d52892f97751e85932b3297bd7ae1c80341a2090543729ee2f9bd","abstract_canon_sha256":"a9c13eb3408e004ee27cf4efd3667d79b236f00681293e61a232f248fab91624"},"schema_version":"1.0"},"canonical_sha256":"409c9d345ae2728089820263f511eba74b392ffca1e5c6de49a4d4539fac1d8f","source":{"kind":"arxiv","id":"1311.7307","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7307","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7307v4","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7307","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ICOJ2NC24JZI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICOJ2NC24JZIBCMC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICOJ2NC2","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ICOJ2NC24JZIBCMCAJR7KEPLU5","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7307","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T13:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"3d2947f2411d52892f97751e85932b3297bd7ae1c80341a2090543729ee2f9bd","abstract_canon_sha256":"a9c13eb3408e004ee27cf4efd3667d79b236f00681293e61a232f248fab91624"},"schema_version":"1.0"},"canonical_sha256":"409c9d345ae2728089820263f511eba74b392ffca1e5c6de49a4d4539fac1d8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:16.680559Z","signature_b64":"h8lc+99fachKagboigVeFiyCBO12Qw6QAzzBEPK1jIVEuB+kOg5yMCJ+84jACttAbdS0uuJ7OCDL6nNpD3EoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409c9d345ae2728089820263f511eba74b392ffca1e5c6de49a4d4539fac1d8f","last_reissued_at":"2026-05-18T02:39:16.679817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:16.679817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7307","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-18T02:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFw4irPtold3eIuzeNcrYOgTsc2riImgQQHQEC17yxYxaQk+6h0XV4cCiX/KrVfFpDLjMOKel0xBFiUCeBIBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:31:35.315227Z"},"content_sha256":"a0ff10f0af7f56eb37bde6c8c06f225fa858b5732ce5cd4bfff964d7f88f36cd","schema_version":"1.0","event_id":"sha256:a0ff10f0af7f56eb37bde6c8c06f225fa858b5732ce5cd4bfff964d7f88f36cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ICOJ2NC24JZIBCMCAJR7KEPLU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Schemas for Unordered XML on a DIME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Iovka Boneva, Radu Ciucanu, S{\\l}awek Staworko","submitted_at":"2013-11-28T13:03:12Z","abstract_excerpt":"We investigate schema languages for unordered XML having no relative order among siblings. First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children). However, unrestricted UREs are computationally too expensive as we show the intractability of two fundamental decision problems for UREs: membership of an unordered word to the language of a URE and containment of two UREs. Conseq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7307","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-18T02:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKQuHPOz2MHa8nFBwQ/fzzb5lNop4vfTuqrKxh7bQfr18jYCsXjHUo7rPhrFjsoEz9OiLfvP7UZ7Xtcu5ShcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:31:35.315916Z"},"content_sha256":"09d3a2491ccdd070445c364b612b86fec9b02892711c7a0b021f662bf898b90e","schema_version":"1.0","event_id":"sha256:09d3a2491ccdd070445c364b612b86fec9b02892711c7a0b021f662bf898b90e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/bundle.json","state_url":"https://pith.science/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/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-04T23:31:35Z","links":{"resolver":"https://pith.science/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5","bundle":"https://pith.science/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/bundle.json","state":"https://pith.science/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICOJ2NC24JZIBCMCAJR7KEPLU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ICOJ2NC24JZIBCMCAJR7KEPLU5","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":"a9c13eb3408e004ee27cf4efd3667d79b236f00681293e61a232f248fab91624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T13:03:12Z","title_canon_sha256":"3d2947f2411d52892f97751e85932b3297bd7ae1c80341a2090543729ee2f9bd"},"schema_version":"1.0","source":{"id":"1311.7307","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7307","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7307v4","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7307","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ICOJ2NC24JZI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICOJ2NC24JZIBCMC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICOJ2NC2","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:09d3a2491ccdd070445c364b612b86fec9b02892711c7a0b021f662bf898b90e","target":"graph","created_at":"2026-05-18T02:39:16Z","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 investigate schema languages for unordered XML having no relative order among siblings. First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children). However, unrestricted UREs are computationally too expensive as we show the intractability of two fundamental decision problems for UREs: membership of an unordered word to the language of a URE and containment of two UREs. Conseq","authors_text":"Iovka Boneva, Radu Ciucanu, S{\\l}awek Staworko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T13:03:12Z","title":"Schemas for Unordered XML on a DIME"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7307","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:a0ff10f0af7f56eb37bde6c8c06f225fa858b5732ce5cd4bfff964d7f88f36cd","target":"record","created_at":"2026-05-18T02:39:16Z","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":"a9c13eb3408e004ee27cf4efd3667d79b236f00681293e61a232f248fab91624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T13:03:12Z","title_canon_sha256":"3d2947f2411d52892f97751e85932b3297bd7ae1c80341a2090543729ee2f9bd"},"schema_version":"1.0","source":{"id":"1311.7307","kind":"arxiv","version":4}},"canonical_sha256":"409c9d345ae2728089820263f511eba74b392ffca1e5c6de49a4d4539fac1d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"409c9d345ae2728089820263f511eba74b392ffca1e5c6de49a4d4539fac1d8f","first_computed_at":"2026-05-18T02:39:16.679817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:16.679817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8lc+99fachKagboigVeFiyCBO12Qw6QAzzBEPK1jIVEuB+kOg5yMCJ+84jACttAbdS0uuJ7OCDL6nNpD3EoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:16.680559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7307","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ff10f0af7f56eb37bde6c8c06f225fa858b5732ce5cd4bfff964d7f88f36cd","sha256:09d3a2491ccdd070445c364b612b86fec9b02892711c7a0b021f662bf898b90e"],"state_sha256":"b4a6aa3a7bb1d5a7353183cd418240e99a435ca3bc6e0c9f699cd55ec12631ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuxsEEJmqMSvPqCWexNWLUV0Mmz4OKH2t6xMl1Nvz4UMMMpHMaRcILWadEINl0h8pR1RKucHgmJCmXsKWiOoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:31:35.320413Z","bundle_sha256":"869b3691c00bde50b91b9191dbb18cf4f0823c932e4f349f342de69772f7abf0"}}