{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ES5QZGA2VAAOJL7GZMFRTM6XPO","short_pith_number":"pith:ES5QZGA2","schema_version":"1.0","canonical_sha256":"24bb0c981aa800e4afe6cb0b19b3d77ba07d1c553172244f445b0fdb2b2b113d","source":{"kind":"arxiv","id":"2111.01540","version":1},"attestation_state":"computed","paper":{"title":"MillenniumDB: A Persistent, Open-Source, Graph Database","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aidan Hogan, Carlos Buil Aranda, Carlos Rojas, Cristian Riveros, Diego Arroyuelo, Domagoj Vrgoc, Gonzalo Navarro, Juan Romero, Marcelo Arenas, Renzo Angles","submitted_at":"2021-11-02T12:21:05Z","abstract_excerpt":"In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a variety of popular graph models can be supported. The engine itself is founded on a combination of tried and tested techniques from relational data management, state-of-the-art algorithms for worst-case-optimal joins, as well as graph-specific algorithms for evaluating path queries. In this paper, we present the main design principles underlying Millen"},"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":"2111.01540","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2021-11-02T12:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"88d19def1d950afc6db6858ebe3813e8c037d641161935a8e75d8d263c002e67","abstract_canon_sha256":"415d6dd14de1b9733b258c447ee2c500ef66dabbccec52eda4592df6f91f85bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:29.662130Z","signature_b64":"tbPEs6UTIju7UPyF2sRhtJP95vI8kSysalvcogN4aNN7uy9Q74wGBUmkdafZS+LxvwfXAupno3J5NHzC0eRIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24bb0c981aa800e4afe6cb0b19b3d77ba07d1c553172244f445b0fdb2b2b113d","last_reissued_at":"2026-07-05T03:28:29.661660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:29.661660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MillenniumDB: A Persistent, Open-Source, Graph Database","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aidan Hogan, Carlos Buil Aranda, Carlos Rojas, Cristian Riveros, Diego Arroyuelo, Domagoj Vrgoc, Gonzalo Navarro, Juan Romero, Marcelo Arenas, Renzo Angles","submitted_at":"2021-11-02T12:21:05Z","abstract_excerpt":"In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a variety of popular graph models can be supported. The engine itself is founded on a combination of tried and tested techniques from relational data management, state-of-the-art algorithms for worst-case-optimal joins, as well as graph-specific algorithms for evaluating path queries. In this paper, we present the main design principles underlying Millen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01540","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/2111.01540/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":"2111.01540","created_at":"2026-07-05T03:28:29.661720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01540v1","created_at":"2026-07-05T03:28:29.661720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01540","created_at":"2026-07-05T03:28:29.661720+00:00"},{"alias_kind":"pith_short_12","alias_value":"ES5QZGA2VAAO","created_at":"2026-07-05T03:28:29.661720+00:00"},{"alias_kind":"pith_short_16","alias_value":"ES5QZGA2VAAOJL7G","created_at":"2026-07-05T03:28:29.661720+00:00"},{"alias_kind":"pith_short_8","alias_value":"ES5QZGA2","created_at":"2026-07-05T03:28:29.661720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10287","citing_title":"Single-Source Regular Path Querying in Terms of Linear Algebra","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO","json":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO.json","graph_json":"https://pith.science/api/pith-number/ES5QZGA2VAAOJL7GZMFRTM6XPO/graph.json","events_json":"https://pith.science/api/pith-number/ES5QZGA2VAAOJL7GZMFRTM6XPO/events.json","paper":"https://pith.science/paper/ES5QZGA2"},"agent_actions":{"view_html":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO","download_json":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO.json","view_paper":"https://pith.science/paper/ES5QZGA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01540&json=true","fetch_graph":"https://pith.science/api/pith-number/ES5QZGA2VAAOJL7GZMFRTM6XPO/graph.json","fetch_events":"https://pith.science/api/pith-number/ES5QZGA2VAAOJL7GZMFRTM6XPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO/action/storage_attestation","attest_author":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO/action/author_attestation","sign_citation":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO/action/citation_signature","submit_replication":"https://pith.science/pith/ES5QZGA2VAAOJL7GZMFRTM6XPO/action/replication_record"}},"created_at":"2026-07-05T03:28:29.661720+00:00","updated_at":"2026-07-05T03:28:29.661720+00:00"}