{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A56TGV7PW5FE3WJJPISFW42K2S","short_pith_number":"pith:A56TGV7P","schema_version":"1.0","canonical_sha256":"077d3357efb74a4dd9297a245b734ad4943e38c8dfbcd235799a3f1572e7dd92","source":{"kind":"arxiv","id":"2411.09999","version":1},"attestation_state":"computed","paper":{"title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Oluwatosin Agbaakin, Sydney Anuyah, Victor Bolade","submitted_at":"2024-11-15T07:12:46Z","abstract_excerpt":"This tutorial serves as a comprehensive guide for understanding graph databases, focusing on the fundamentals of graph theory while showcasing practical applications across various fields. It starts by introducing foundational concepts and delves into the structure of graphs through nodes and edges, covering different types such as undirected, directed, weighted, and unweighted graphs. Key graph properties, terminologies, and essential algorithms for network analysis are outlined, including Dijkstras shortest path algorithm and methods for calculating node centrality and graph connectivity.\n  "},"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":"2411.09999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-11-15T07:12:46Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0dc4fb40eb5e81e785ecf53e31526759c1d34b0beff45ec353a6e0a4cfca667a","abstract_canon_sha256":"2ca0a6eb586d3e845e2c83414e45c3a687ab02f0ec40e42f472c02bab650564b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:56.956422Z","signature_b64":"NGG+kLx7xW+8J6T7i/uhs+Popqvsj6V7OdAMASLOi/dS5b8bY4ls0LMiGuu34SlMNUkcMR7rWvxoqr3oq8AcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077d3357efb74a4dd9297a245b734ad4943e38c8dfbcd235799a3f1572e7dd92","last_reissued_at":"2026-07-05T09:35:56.955919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:56.955919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Oluwatosin Agbaakin, Sydney Anuyah, Victor Bolade","submitted_at":"2024-11-15T07:12:46Z","abstract_excerpt":"This tutorial serves as a comprehensive guide for understanding graph databases, focusing on the fundamentals of graph theory while showcasing practical applications across various fields. It starts by introducing foundational concepts and delves into the structure of graphs through nodes and edges, covering different types such as undirected, directed, weighted, and unweighted graphs. Key graph properties, terminologies, and essential algorithms for network analysis are outlined, including Dijkstras shortest path algorithm and methods for calculating node centrality and graph connectivity.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09999","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.09999/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.09999","created_at":"2026-07-05T09:35:56.955981+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09999v1","created_at":"2026-07-05T09:35:56.955981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09999","created_at":"2026-07-05T09:35:56.955981+00:00"},{"alias_kind":"pith_short_12","alias_value":"A56TGV7PW5FE","created_at":"2026-07-05T09:35:56.955981+00:00"},{"alias_kind":"pith_short_16","alias_value":"A56TGV7PW5FE3WJJ","created_at":"2026-07-05T09:35:56.955981+00:00"},{"alias_kind":"pith_short_8","alias_value":"A56TGV7P","created_at":"2026-07-05T09:35:56.955981+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07050","citing_title":"Advancing clinical trial outcomes using deep learning and predictive modelling: bridging precision medicine and patient-centered care","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S","json":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S.json","graph_json":"https://pith.science/api/pith-number/A56TGV7PW5FE3WJJPISFW42K2S/graph.json","events_json":"https://pith.science/api/pith-number/A56TGV7PW5FE3WJJPISFW42K2S/events.json","paper":"https://pith.science/paper/A56TGV7P"},"agent_actions":{"view_html":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S","download_json":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S.json","view_paper":"https://pith.science/paper/A56TGV7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09999&json=true","fetch_graph":"https://pith.science/api/pith-number/A56TGV7PW5FE3WJJPISFW42K2S/graph.json","fetch_events":"https://pith.science/api/pith-number/A56TGV7PW5FE3WJJPISFW42K2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S/action/storage_attestation","attest_author":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S/action/author_attestation","sign_citation":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S/action/citation_signature","submit_replication":"https://pith.science/pith/A56TGV7PW5FE3WJJPISFW42K2S/action/replication_record"}},"created_at":"2026-07-05T09:35:56.955981+00:00","updated_at":"2026-07-05T09:35:56.955981+00:00"}