{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7P35QKREXK4QWODK7DIWQDN5Q2","short_pith_number":"pith:7P35QKRE","canonical_record":{"source":{"id":"1812.10977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T12:46:15Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"14e9a6d822bdc31604276fb13837216e98d8ecaf795a31d2a7a6d9af657a8a42","abstract_canon_sha256":"f6b6614ae2b1391612a8482adaf1f1dcecde62b2dd02dd52b234ec6fff174e99"},"schema_version":"1.0"},"canonical_sha256":"fbf7d82a24bab90b386af8d1680dbd86b97b867c685335c964fc6a7d324ff36e","source":{"kind":"arxiv","id":"1812.10977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10977","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10977v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10977","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"7P35QKREXK4Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7P35QKREXK4QWODK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7P35QKRE","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7P35QKREXK4QWODK7DIWQDN5Q2","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T12:46:15Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"14e9a6d822bdc31604276fb13837216e98d8ecaf795a31d2a7a6d9af657a8a42","abstract_canon_sha256":"f6b6614ae2b1391612a8482adaf1f1dcecde62b2dd02dd52b234ec6fff174e99"},"schema_version":"1.0"},"canonical_sha256":"fbf7d82a24bab90b386af8d1680dbd86b97b867c685335c964fc6a7d324ff36e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.647793Z","signature_b64":"LuZRHx+ug+wm7SgIyvyHQzsSplXEDRAz5vWPzzCJ4qlt3E1iD/NX+Nne9pF2FYygZcxN733CIc5t0zJO0CkUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf7d82a24bab90b386af8d1680dbd86b97b867c685335c964fc6a7d324ff36e","last_reissued_at":"2026-05-17T23:57:16.647303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.647303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10977","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-17T23:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gcx8KkfAwaPFoubP3d5M3rLscIg7gpS2YqhUDDDDCZLoMjl0P4JoL8X6mNwNzrXmWeaHx9RmP8MG6xP6y9V4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:42.764401Z"},"content_sha256":"5de9bd19c30f2169293f5504864e8a8521073407dc811d4b4e44a1eddd080004","schema_version":"1.0","event_id":"sha256:5de9bd19c30f2169293f5504864e8a8521073407dc811d4b4e44a1eddd080004"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7P35QKREXK4QWODK7DIWQDN5Q2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact and Efficient Representation of General Graph Databases","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Borja Freire, \\'Oscar Pedreira, Sandra \\'Alvarez-Garc\\'ia, Susana Ladra","submitted_at":"2018-12-28T12:46:15Z","abstract_excerpt":"In this paper, we propose a compact data structure to store labeled attributed graphs based on the k2-tree, which is a very compact data structure designed to represent a simple directed graph. The idea we propose can be seen as an extension of the k2-tree to support property graphs. In addition to the static approach, we also propose a dynamic version of the storage representation, which allows exible schemas and insertion or deletion of data. We provide an implementation of a basic set of operations, which can be combined to form complex queries over these graphs with attributes. We evaluate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10977","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-17T23:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xeJZUUsl+B/1J/qpAOjwijYhHw0UkbylfWOheQ+zYomHYFsUVsiD9rFCt4aLuw3uhizzKpeT7E1brf2y0V4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:42.765130Z"},"content_sha256":"da118c2631f46cb65c76d44a7bc9476b60a5686804b5f93b962b0e8e6e611cc2","schema_version":"1.0","event_id":"sha256:da118c2631f46cb65c76d44a7bc9476b60a5686804b5f93b962b0e8e6e611cc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7P35QKREXK4QWODK7DIWQDN5Q2/bundle.json","state_url":"https://pith.science/pith/7P35QKREXK4QWODK7DIWQDN5Q2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7P35QKREXK4QWODK7DIWQDN5Q2/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-05-26T11:54:42Z","links":{"resolver":"https://pith.science/pith/7P35QKREXK4QWODK7DIWQDN5Q2","bundle":"https://pith.science/pith/7P35QKREXK4QWODK7DIWQDN5Q2/bundle.json","state":"https://pith.science/pith/7P35QKREXK4QWODK7DIWQDN5Q2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7P35QKREXK4QWODK7DIWQDN5Q2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7P35QKREXK4QWODK7DIWQDN5Q2","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":"f6b6614ae2b1391612a8482adaf1f1dcecde62b2dd02dd52b234ec6fff174e99","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T12:46:15Z","title_canon_sha256":"14e9a6d822bdc31604276fb13837216e98d8ecaf795a31d2a7a6d9af657a8a42"},"schema_version":"1.0","source":{"id":"1812.10977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10977","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10977v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10977","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"7P35QKREXK4Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7P35QKREXK4QWODK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7P35QKRE","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:da118c2631f46cb65c76d44a7bc9476b60a5686804b5f93b962b0e8e6e611cc2","target":"graph","created_at":"2026-05-17T23:57:16Z","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":"In this paper, we propose a compact data structure to store labeled attributed graphs based on the k2-tree, which is a very compact data structure designed to represent a simple directed graph. The idea we propose can be seen as an extension of the k2-tree to support property graphs. In addition to the static approach, we also propose a dynamic version of the storage representation, which allows exible schemas and insertion or deletion of data. We provide an implementation of a basic set of operations, which can be combined to form complex queries over these graphs with attributes. We evaluate","authors_text":"Borja Freire, \\'Oscar Pedreira, Sandra \\'Alvarez-Garc\\'ia, Susana Ladra","cross_cats":["cs.DB"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T12:46:15Z","title":"Compact and Efficient Representation of General Graph Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10977","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:5de9bd19c30f2169293f5504864e8a8521073407dc811d4b4e44a1eddd080004","target":"record","created_at":"2026-05-17T23:57:16Z","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":"f6b6614ae2b1391612a8482adaf1f1dcecde62b2dd02dd52b234ec6fff174e99","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T12:46:15Z","title_canon_sha256":"14e9a6d822bdc31604276fb13837216e98d8ecaf795a31d2a7a6d9af657a8a42"},"schema_version":"1.0","source":{"id":"1812.10977","kind":"arxiv","version":1}},"canonical_sha256":"fbf7d82a24bab90b386af8d1680dbd86b97b867c685335c964fc6a7d324ff36e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbf7d82a24bab90b386af8d1680dbd86b97b867c685335c964fc6a7d324ff36e","first_computed_at":"2026-05-17T23:57:16.647303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:16.647303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LuZRHx+ug+wm7SgIyvyHQzsSplXEDRAz5vWPzzCJ4qlt3E1iD/NX+Nne9pF2FYygZcxN733CIc5t0zJO0CkUAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:16.647793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de9bd19c30f2169293f5504864e8a8521073407dc811d4b4e44a1eddd080004","sha256:da118c2631f46cb65c76d44a7bc9476b60a5686804b5f93b962b0e8e6e611cc2"],"state_sha256":"3e14dd18bb3866df2db58e9530e4c846e008ab7dcaecbb79c5ff0b3f6e6b66a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMFX9fWn0P/p1cv40/mZtHuZFdAAPtCiPZS8AJLXIyY75mEcMx186BlbuZurNCXSWBuazWojekqggK1VxfimAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:54:42.768935Z","bundle_sha256":"a7f4de03d6c24e551b1c737e9d203bce60d380bb44d34e5dc3211c2347940c9e"}}