{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VIUJJEZA76TE7BTT3GUU3L6AC6","short_pith_number":"pith:VIUJJEZA","canonical_record":{"source":{"id":"1701.08924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T05:51:09Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"94b3c41ebda282176955cadecabe585fdd752ad11f6ffbea4eaa04b8e76f6885","abstract_canon_sha256":"4a38882d7c5ac362eb252c782046bb0d90a65e48dd945642999482a8a6c86754"},"schema_version":"1.0"},"canonical_sha256":"aa28949320ffa64f8673d9a94dafc017ada41426571a410d73b676a5215dd07f","source":{"kind":"arxiv","id":"1701.08924","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08924","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08924v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08924","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VIUJJEZA76TE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VIUJJEZA76TE7BTT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VIUJJEZA","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VIUJJEZA76TE7BTT3GUU3L6AC6","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T05:51:09Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"94b3c41ebda282176955cadecabe585fdd752ad11f6ffbea4eaa04b8e76f6885","abstract_canon_sha256":"4a38882d7c5ac362eb252c782046bb0d90a65e48dd945642999482a8a6c86754"},"schema_version":"1.0"},"canonical_sha256":"aa28949320ffa64f8673d9a94dafc017ada41426571a410d73b676a5215dd07f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:38.883101Z","signature_b64":"UxGuDM8Bw/EvMmQlkxYlv0r13WCMRrY8nWs8cdLLRvMgu/MazlgtqB/kNWLHOTzKdmJjqi/1NisULzAs1CNcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa28949320ffa64f8673d9a94dafc017ada41426571a410d73b676a5215dd07f","last_reissued_at":"2026-05-18T00:51:38.882753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:38.882753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08924","source_version":1,"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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nohV4zbIrrFgPEt+0gpBgT7DcHTBT4VckIb7B7RgoF4W0VGZ1T09mXwniqRitopfG40VUfKxLWV8OZce4H7VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:46:46.829751Z"},"content_sha256":"140a9827c56ff0b6476f6cc60b7dea1a19afa8a78e858018095327a0f2244428","schema_version":"1.0","event_id":"sha256:140a9827c56ff0b6476f6cc60b7dea1a19afa8a78e858018095327a0f2244428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VIUJJEZA76TE7BTT3GUU3L6AC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Validating and describing linked data portals using shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DB","authors_text":"Eric Prud'hommeaux, Harold Solbrig, Iovka Boneva, Jose-Emilio Labra-Gayo","submitted_at":"2017-01-31T05:51:09Z","abstract_excerpt":"Linked data portals need to be able to advertise and describe the structure of their content. A sufficiently expressive and intuitive schema language will allow portals to communicate these structures. Validation tools will aid in the publication and maintenance of linked data and increase their quality.\n  Two schema language proposals have recently emerged for describing the structures of RDF graphs: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL). In this paper we describe how these formalisms can be used in the development of a linked data portal to describe and validate its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08924","kind":"arxiv","version":1},"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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm6eNvbsGGUjpZtuPrVH64gauLH/KMDjetqHEeBK8T+usQWj2MUH8SR2yjFxahmJXCkbjQNxBt8jeMVcWAX9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:46:46.830102Z"},"content_sha256":"00e065f83d6791ca4029766bc218038748b6569873a63521c2af822919faefec","schema_version":"1.0","event_id":"sha256:00e065f83d6791ca4029766bc218038748b6569873a63521c2af822919faefec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/bundle.json","state_url":"https://pith.science/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/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-07-03T10:46:46Z","links":{"resolver":"https://pith.science/pith/VIUJJEZA76TE7BTT3GUU3L6AC6","bundle":"https://pith.science/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/bundle.json","state":"https://pith.science/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIUJJEZA76TE7BTT3GUU3L6AC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VIUJJEZA76TE7BTT3GUU3L6AC6","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":"4a38882d7c5ac362eb252c782046bb0d90a65e48dd945642999482a8a6c86754","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T05:51:09Z","title_canon_sha256":"94b3c41ebda282176955cadecabe585fdd752ad11f6ffbea4eaa04b8e76f6885"},"schema_version":"1.0","source":{"id":"1701.08924","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08924","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08924v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08924","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VIUJJEZA76TE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VIUJJEZA76TE7BTT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VIUJJEZA","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:00e065f83d6791ca4029766bc218038748b6569873a63521c2af822919faefec","target":"graph","created_at":"2026-05-18T00:51:38Z","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":"Linked data portals need to be able to advertise and describe the structure of their content. A sufficiently expressive and intuitive schema language will allow portals to communicate these structures. Validation tools will aid in the publication and maintenance of linked data and increase their quality.\n  Two schema language proposals have recently emerged for describing the structures of RDF graphs: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL). In this paper we describe how these formalisms can be used in the development of a linked data portal to describe and validate its","authors_text":"Eric Prud'hommeaux, Harold Solbrig, Iovka Boneva, Jose-Emilio Labra-Gayo","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T05:51:09Z","title":"Validating and describing linked data portals using shapes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08924","kind":"arxiv","version":1},"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:140a9827c56ff0b6476f6cc60b7dea1a19afa8a78e858018095327a0f2244428","target":"record","created_at":"2026-05-18T00:51:38Z","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":"4a38882d7c5ac362eb252c782046bb0d90a65e48dd945642999482a8a6c86754","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T05:51:09Z","title_canon_sha256":"94b3c41ebda282176955cadecabe585fdd752ad11f6ffbea4eaa04b8e76f6885"},"schema_version":"1.0","source":{"id":"1701.08924","kind":"arxiv","version":1}},"canonical_sha256":"aa28949320ffa64f8673d9a94dafc017ada41426571a410d73b676a5215dd07f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa28949320ffa64f8673d9a94dafc017ada41426571a410d73b676a5215dd07f","first_computed_at":"2026-05-18T00:51:38.882753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:38.882753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UxGuDM8Bw/EvMmQlkxYlv0r13WCMRrY8nWs8cdLLRvMgu/MazlgtqB/kNWLHOTzKdmJjqi/1NisULzAs1CNcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:38.883101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08924","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:140a9827c56ff0b6476f6cc60b7dea1a19afa8a78e858018095327a0f2244428","sha256:00e065f83d6791ca4029766bc218038748b6569873a63521c2af822919faefec"],"state_sha256":"a2b168fc546a042dfd6cc721b78cec371e42e20a5d3db3fa785df2886674d68a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9c2FyHWTOeC5KcUfTxMxjVfpftFlcYm1g48WSxEEWg0ZunkVnINh2aI1x34kVkbVJCucYWHZHEc1GmFZUVwECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T10:46:46.832105Z","bundle_sha256":"d3a0fa2715e5c6943130c92b14faff0f0cf6ce0192f0b325f6e20da478d12d45"}}