{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C2WSY4KYSO6SDHNSXS3UZSBLKJ","short_pith_number":"pith:C2WSY4KY","schema_version":"1.0","canonical_sha256":"16ad2c715893bd219db2bcb74cc82b5273fa098d09836b28578793584d90badd","source":{"kind":"arxiv","id":"2506.19661","version":1},"attestation_state":"computed","paper":{"title":"Higher-Order Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"Jakub Cudak, J\\\"urgen M\\\"uller, Maciej Besta, Marcin Copik, Patrick Iff, Robert Gerstenberger, Shriram Chandran, Tomasz Szydlo, Torsten Hoefler","submitted_at":"2025-06-24T14:24:20Z","abstract_excerpt":"Recent advances in graph databases (GDBs) have been driving interest in large-scale analytics, yet current systems fail to support higher-order (HO) interactions beyond first-order (one-hop) relations, which are crucial for tasks such as subgraph counting, polyadic modeling, and HO graph learning. We address this by introducing a new class of systems, higher-order graph databases (HO-GDBs) that use lifting and lowering paradigms to seamlessly extend traditional GDBs with HO. We provide a theoretical analysis of OLTP and OLAP queries, ensuring correctness, scalability, and ACID compliance. We i"},"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":"2506.19661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-06-24T14:24:20Z","cross_cats_sorted":["cs.IR","cs.LG","cs.SI"],"title_canon_sha256":"1951e5c0b7ce883fb5f93fcbaa2446155924f2901ba4cebf4477fed8e858defb","abstract_canon_sha256":"514f636e9d03f7d72540ca877f85e8a81ea442dd328baf45a62da9799592f64d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:36.360645Z","signature_b64":"aDY5bo6+lq31GE2whmQirq8sLdi0ag48aN2LJbnG++QoBc/8VUjlZhLGeDTq333EbcmzvvyxzwREXgL/kePPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16ad2c715893bd219db2bcb74cc82b5273fa098d09836b28578793584d90badd","last_reissued_at":"2026-07-05T11:26:36.360153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:36.360153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"Jakub Cudak, J\\\"urgen M\\\"uller, Maciej Besta, Marcin Copik, Patrick Iff, Robert Gerstenberger, Shriram Chandran, Tomasz Szydlo, Torsten Hoefler","submitted_at":"2025-06-24T14:24:20Z","abstract_excerpt":"Recent advances in graph databases (GDBs) have been driving interest in large-scale analytics, yet current systems fail to support higher-order (HO) interactions beyond first-order (one-hop) relations, which are crucial for tasks such as subgraph counting, polyadic modeling, and HO graph learning. We address this by introducing a new class of systems, higher-order graph databases (HO-GDBs) that use lifting and lowering paradigms to seamlessly extend traditional GDBs with HO. We provide a theoretical analysis of OLTP and OLAP queries, ensuring correctness, scalability, and ACID compliance. We i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19661","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/2506.19661/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":"2506.19661","created_at":"2026-07-05T11:26:36.360215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19661v1","created_at":"2026-07-05T11:26:36.360215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19661","created_at":"2026-07-05T11:26:36.360215+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2WSY4KYSO6S","created_at":"2026-07-05T11:26:36.360215+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2WSY4KYSO6SDHNS","created_at":"2026-07-05T11:26:36.360215+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2WSY4KY","created_at":"2026-07-05T11:26:36.360215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ","json":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ.json","graph_json":"https://pith.science/api/pith-number/C2WSY4KYSO6SDHNSXS3UZSBLKJ/graph.json","events_json":"https://pith.science/api/pith-number/C2WSY4KYSO6SDHNSXS3UZSBLKJ/events.json","paper":"https://pith.science/paper/C2WSY4KY"},"agent_actions":{"view_html":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ","download_json":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ.json","view_paper":"https://pith.science/paper/C2WSY4KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19661&json=true","fetch_graph":"https://pith.science/api/pith-number/C2WSY4KYSO6SDHNSXS3UZSBLKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/C2WSY4KYSO6SDHNSXS3UZSBLKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ/action/storage_attestation","attest_author":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ/action/author_attestation","sign_citation":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ/action/citation_signature","submit_replication":"https://pith.science/pith/C2WSY4KYSO6SDHNSXS3UZSBLKJ/action/replication_record"}},"created_at":"2026-07-05T11:26:36.360215+00:00","updated_at":"2026-07-05T11:26:36.360215+00:00"}