{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PKSUIBCGMBQV4HUYOYOHN5UB54","short_pith_number":"pith:PKSUIBCG","canonical_record":{"source":{"id":"1602.00503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-01T12:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"20bdf55476c3779f84d9a3025cb25f92a7be91ea28f97573a085217f1e95f7ee","abstract_canon_sha256":"016b145de9ef2905ab6172873b9713f221cd3fa10f4962474ca08d24c8344811"},"schema_version":"1.0"},"canonical_sha256":"7aa544044660615e1e98761c76f681ef1c1bfdee75699c1f2a28c32d941a182c","source":{"kind":"arxiv","id":"1602.00503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00503","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00503v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00503","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"PKSUIBCGMBQV","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKSUIBCGMBQV4HUY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKSUIBCG","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PKSUIBCGMBQV4HUYOYOHN5UB54","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-01T12:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"20bdf55476c3779f84d9a3025cb25f92a7be91ea28f97573a085217f1e95f7ee","abstract_canon_sha256":"016b145de9ef2905ab6172873b9713f221cd3fa10f4962474ca08d24c8344811"},"schema_version":"1.0"},"canonical_sha256":"7aa544044660615e1e98761c76f681ef1c1bfdee75699c1f2a28c32d941a182c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.214089Z","signature_b64":"sSagj9ZLL1yGOAC+eJ+rRyQXNLSHJDiIT0yY+VTqy4IKQU8d3UNzN8caLJA9KzSJMTJ+jzOVnjr1TQIcttbsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa544044660615e1e98761c76f681ef1c1bfdee75699c1f2a28c32d941a182c","last_reissued_at":"2026-05-18T01:21:35.213552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.213552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00503","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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFlOt8d1KOzLOut8UIQeD1qBdpxMqQ8C4sFcOpRvEOcNZ34kkbtSZq+JxX8Dw4BAbAP1cjDyuHQR/Hi59s1zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:12:03.134763Z"},"content_sha256":"426bd271191c3eda02305a5bcf2d4a216a7bd0d510ef473f02143cc781c58acf","schema_version":"1.0","event_id":"sha256:426bd271191c3eda02305a5bcf2d4a216a7bd0d510ef473f02143cc781c58acf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PKSUIBCGMBQV4HUYOYOHN5UB54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GRAD: On Graph Database Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alejandro Vaisman, Amine Ghrab, Esteban Zim\\'anyi, Oscar Romero, Sabri Skhiri","submitted_at":"2016-02-01T12:49:25Z","abstract_excerpt":"Graph databases have emerged as the fundamental technology underpinning trendy application domains where traditional databases are not well-equipped to handle complex graph data. However, current graph databases support basic graph structures and integrity constraints with no standard algebra. In this paper, we introduce GRAD, a native and generic graph database model. GRAD goes beyond traditional graph database models, which support simple graph structures and constraints. Instead, GRAD presents a complete graph database model supporting advanced graph structures, a set of well-defined constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00503","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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiTi8hgdz111tvUwIem1nwSefIveXroPgn2f1PW2HbQpTlwH+0paRvV3Jn1tR4j8bVhtCJ3/bTf9k6+Ss2dYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:12:03.135118Z"},"content_sha256":"93a048f2f7bb0edc01b274d5ff884fd9f527e9037718826df038d4c5df336409","schema_version":"1.0","event_id":"sha256:93a048f2f7bb0edc01b274d5ff884fd9f527e9037718826df038d4c5df336409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/bundle.json","state_url":"https://pith.science/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/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-03T15:12:03Z","links":{"resolver":"https://pith.science/pith/PKSUIBCGMBQV4HUYOYOHN5UB54","bundle":"https://pith.science/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/bundle.json","state":"https://pith.science/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKSUIBCGMBQV4HUYOYOHN5UB54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PKSUIBCGMBQV4HUYOYOHN5UB54","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":"016b145de9ef2905ab6172873b9713f221cd3fa10f4962474ca08d24c8344811","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-01T12:49:25Z","title_canon_sha256":"20bdf55476c3779f84d9a3025cb25f92a7be91ea28f97573a085217f1e95f7ee"},"schema_version":"1.0","source":{"id":"1602.00503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00503","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00503v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00503","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"PKSUIBCGMBQV","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKSUIBCGMBQV4HUY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKSUIBCG","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:93a048f2f7bb0edc01b274d5ff884fd9f527e9037718826df038d4c5df336409","target":"graph","created_at":"2026-05-18T01:21:35Z","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":"Graph databases have emerged as the fundamental technology underpinning trendy application domains where traditional databases are not well-equipped to handle complex graph data. However, current graph databases support basic graph structures and integrity constraints with no standard algebra. In this paper, we introduce GRAD, a native and generic graph database model. GRAD goes beyond traditional graph database models, which support simple graph structures and constraints. Instead, GRAD presents a complete graph database model supporting advanced graph structures, a set of well-defined constr","authors_text":"Alejandro Vaisman, Amine Ghrab, Esteban Zim\\'anyi, Oscar Romero, Sabri Skhiri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-01T12:49:25Z","title":"GRAD: On Graph Database Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00503","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:426bd271191c3eda02305a5bcf2d4a216a7bd0d510ef473f02143cc781c58acf","target":"record","created_at":"2026-05-18T01:21:35Z","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":"016b145de9ef2905ab6172873b9713f221cd3fa10f4962474ca08d24c8344811","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-01T12:49:25Z","title_canon_sha256":"20bdf55476c3779f84d9a3025cb25f92a7be91ea28f97573a085217f1e95f7ee"},"schema_version":"1.0","source":{"id":"1602.00503","kind":"arxiv","version":1}},"canonical_sha256":"7aa544044660615e1e98761c76f681ef1c1bfdee75699c1f2a28c32d941a182c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7aa544044660615e1e98761c76f681ef1c1bfdee75699c1f2a28c32d941a182c","first_computed_at":"2026-05-18T01:21:35.213552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.213552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sSagj9ZLL1yGOAC+eJ+rRyQXNLSHJDiIT0yY+VTqy4IKQU8d3UNzN8caLJA9KzSJMTJ+jzOVnjr1TQIcttbsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.214089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:426bd271191c3eda02305a5bcf2d4a216a7bd0d510ef473f02143cc781c58acf","sha256:93a048f2f7bb0edc01b274d5ff884fd9f527e9037718826df038d4c5df336409"],"state_sha256":"dc0c74916362ff7e16937cdaa9c3d95043fda7d86133cb1e32b231e6142b9389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozLn6AlOfEKnYrvGET5YuB4NaMX2eyJjF/du3LBE5h65hH3DzQCxLwdo9fKX5dR5eksRaPbDyAzcC/TnWr6bBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:12:03.137059Z","bundle_sha256":"a87923030e530602471cd1a2fd12d4bc947e6514a58c65243a5d61595dfaf329"}}