{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U3PWBIHOHRVYVUZKFTNISHZGMT","short_pith_number":"pith:U3PWBIHO","schema_version":"1.0","canonical_sha256":"a6df60a0ee3c6b8ad32a2cda891f2664f4101dc3ce073e7137b3da8e8ad580bc","source":{"kind":"arxiv","id":"1810.08755","version":4},"attestation_state":"computed","paper":{"title":"Property Graph Type System and Data Definition Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mingxi Wu","submitted_at":"2018-10-20T05:58:48Z","abstract_excerpt":"Property graph manages data by vertices and edges. Each vertex and edge can have a property map, storing ad hoc attribute and its value. Label can be attached to vertices and edges to group them. While this schema-less methodology is very flexible for data evolvement and for managing explosive graph element, it has two shortcomings-- 1) data dependency 2) less compression. Both problems can be solved by a schema based approach. In this paper, a type system used to model property graph is defined. Based on the type system, the associated data definition language (DDL) is proposed and multiple g"},"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":"1810.08755","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-20T05:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"b9f77a857e74e0364dfe58912f20772c6a4e79071962a0049acef3131130423d","abstract_canon_sha256":"8280a3506816f8fa83687923b0d8cd6da190cb8ae74edf00d5eb99c749c58c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.364120Z","signature_b64":"AJTRF6z/HSk4T4iJmiGHc1gE6B3iaiEsn6iDpcXinR6cKbBCjjt+vIDp1PowHVbo/gU+eQ/sQYwJVJ9lmKYTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6df60a0ee3c6b8ad32a2cda891f2664f4101dc3ce073e7137b3da8e8ad580bc","last_reissued_at":"2026-05-17T23:48:11.363598Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.363598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Property Graph Type System and Data Definition Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mingxi Wu","submitted_at":"2018-10-20T05:58:48Z","abstract_excerpt":"Property graph manages data by vertices and edges. Each vertex and edge can have a property map, storing ad hoc attribute and its value. Label can be attached to vertices and edges to group them. While this schema-less methodology is very flexible for data evolvement and for managing explosive graph element, it has two shortcomings-- 1) data dependency 2) less compression. Both problems can be solved by a schema based approach. In this paper, a type system used to model property graph is defined. Based on the type system, the associated data definition language (DDL) is proposed and multiple g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08755","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":"1810.08755","created_at":"2026-05-17T23:48:11.363682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08755v4","created_at":"2026-05-17T23:48:11.363682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08755","created_at":"2026-05-17T23:48:11.363682+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3PWBIHOHRVY","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3PWBIHOHRVYVUZK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3PWBIHO","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07405","citing_title":"In-Depth Benchmarking of Graph Database Systems with the Linked Data Benchmark Council (LDBC) Social Network Benchmark (SNB)","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT","json":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT.json","graph_json":"https://pith.science/api/pith-number/U3PWBIHOHRVYVUZKFTNISHZGMT/graph.json","events_json":"https://pith.science/api/pith-number/U3PWBIHOHRVYVUZKFTNISHZGMT/events.json","paper":"https://pith.science/paper/U3PWBIHO"},"agent_actions":{"view_html":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT","download_json":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT.json","view_paper":"https://pith.science/paper/U3PWBIHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08755&json=true","fetch_graph":"https://pith.science/api/pith-number/U3PWBIHOHRVYVUZKFTNISHZGMT/graph.json","fetch_events":"https://pith.science/api/pith-number/U3PWBIHOHRVYVUZKFTNISHZGMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT/action/storage_attestation","attest_author":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT/action/author_attestation","sign_citation":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT/action/citation_signature","submit_replication":"https://pith.science/pith/U3PWBIHOHRVYVUZKFTNISHZGMT/action/replication_record"}},"created_at":"2026-05-17T23:48:11.363682+00:00","updated_at":"2026-05-17T23:48:11.363682+00:00"}