{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7G6GK7MP4W4US4TFVP3LOM5CKA","short_pith_number":"pith:7G6GK7MP","schema_version":"1.0","canonical_sha256":"f9bc657d8fe5b9497265abf6b733a250276cc7e97aeebf2f55e08c251444d7c9","source":{"kind":"arxiv","id":"2501.06570","version":1},"attestation_state":"computed","paper":{"title":"Aster: Enhancing LSM-structures for Scalable Graph Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dingheng Mo, Fan Wang, Junfeng Liu, Siqiang Luo","submitted_at":"2025-01-11T15:39:17Z","abstract_excerpt":"There is a proliferation of applications requiring the management of large-scale, evolving graphs under workloads with intensive graph updates and lookups. Driven by this challenge, we introduce Poly-LSM, a high-performance key-value storage engine for graphs with the following novel techniques: (1) Poly-LSM is embedded with a new design of graph-oriented LSM-tree structure that features a hybrid storage model for concisely and effectively storing graph data. (2) Poly-LSM utilizes an adaptive mechanism to handle edge insertions and deletions on graphs with optimized I/O efficiency. (3) Poly-LS"},"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":"2501.06570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-01-11T15:39:17Z","cross_cats_sorted":[],"title_canon_sha256":"efa771299e6bfe0f9745101a045d037afc22fffa73eab4f12b35936237c384a9","abstract_canon_sha256":"d4214a97003d2edaa854863ec35eb36fd9adb9862d365d2d1733ff192b361381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:05.467648Z","signature_b64":"UIlKQ+pZ8ggPP/Tj/MXlUC8MJalz7vfIwa2aVhWdWiViN1kksQ5xE4KkjPGmdTUA7Y0bP/VBFoSGYr2GXBVRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9bc657d8fe5b9497265abf6b733a250276cc7e97aeebf2f55e08c251444d7c9","last_reissued_at":"2026-07-05T10:00:05.467216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:05.467216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aster: Enhancing LSM-structures for Scalable Graph Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dingheng Mo, Fan Wang, Junfeng Liu, Siqiang Luo","submitted_at":"2025-01-11T15:39:17Z","abstract_excerpt":"There is a proliferation of applications requiring the management of large-scale, evolving graphs under workloads with intensive graph updates and lookups. Driven by this challenge, we introduce Poly-LSM, a high-performance key-value storage engine for graphs with the following novel techniques: (1) Poly-LSM is embedded with a new design of graph-oriented LSM-tree structure that features a hybrid storage model for concisely and effectively storing graph data. (2) Poly-LSM utilizes an adaptive mechanism to handle edge insertions and deletions on graphs with optimized I/O efficiency. (3) Poly-LS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.06570","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/2501.06570/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":"2501.06570","created_at":"2026-07-05T10:00:05.467280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.06570v1","created_at":"2026-07-05T10:00:05.467280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.06570","created_at":"2026-07-05T10:00:05.467280+00:00"},{"alias_kind":"pith_short_12","alias_value":"7G6GK7MP4W4U","created_at":"2026-07-05T10:00:05.467280+00:00"},{"alias_kind":"pith_short_16","alias_value":"7G6GK7MP4W4US4TF","created_at":"2026-07-05T10:00:05.467280+00:00"},{"alias_kind":"pith_short_8","alias_value":"7G6GK7MP","created_at":"2026-07-05T10:00:05.467280+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/7G6GK7MP4W4US4TFVP3LOM5CKA","json":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA.json","graph_json":"https://pith.science/api/pith-number/7G6GK7MP4W4US4TFVP3LOM5CKA/graph.json","events_json":"https://pith.science/api/pith-number/7G6GK7MP4W4US4TFVP3LOM5CKA/events.json","paper":"https://pith.science/paper/7G6GK7MP"},"agent_actions":{"view_html":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA","download_json":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA.json","view_paper":"https://pith.science/paper/7G6GK7MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.06570&json=true","fetch_graph":"https://pith.science/api/pith-number/7G6GK7MP4W4US4TFVP3LOM5CKA/graph.json","fetch_events":"https://pith.science/api/pith-number/7G6GK7MP4W4US4TFVP3LOM5CKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA/action/storage_attestation","attest_author":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA/action/author_attestation","sign_citation":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA/action/citation_signature","submit_replication":"https://pith.science/pith/7G6GK7MP4W4US4TFVP3LOM5CKA/action/replication_record"}},"created_at":"2026-07-05T10:00:05.467280+00:00","updated_at":"2026-07-05T10:00:05.467280+00:00"}