{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5JFCMIGWLVEBGRRRLSZZLMADFO","short_pith_number":"pith:5JFCMIGW","canonical_record":{"source":{"id":"2507.00839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-01T15:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"2e507671614010b693aab4f47694cfd4fe289ee22c43b4471c7aaeac740fa1b1","abstract_canon_sha256":"872872a6a46be4512f008f60fc8eda60dbcfd8d14af3fc324333532f343f6c50"},"schema_version":"1.0"},"canonical_sha256":"ea4a2620d65d481346315cb395b0032b84d4e1e1718b68b12f4e9289b2ce2815","source":{"kind":"arxiv","id":"2507.00839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00839","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00839v1","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00839","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"5JFCMIGWLVEB","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"5JFCMIGWLVEBGRRR","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"5JFCMIGW","created_at":"2026-07-05T11:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5JFCMIGWLVEBGRRRLSZZLMADFO","target":"record","payload":{"canonical_record":{"source":{"id":"2507.00839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-01T15:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"2e507671614010b693aab4f47694cfd4fe289ee22c43b4471c7aaeac740fa1b1","abstract_canon_sha256":"872872a6a46be4512f008f60fc8eda60dbcfd8d14af3fc324333532f343f6c50"},"schema_version":"1.0"},"canonical_sha256":"ea4a2620d65d481346315cb395b0032b84d4e1e1718b68b12f4e9289b2ce2815","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:15.856680Z","signature_b64":"q4iKQE+fZF9zvvXqw25bk6XJcrBZ8lyveWYHs/RMuwDNh2kl7LoeqheXeIfCdkDSquI23cZCUIRMc5L2mPOhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4a2620d65d481346315cb395b0032b84d4e1e1718b68b12f4e9289b2ce2815","last_reissued_at":"2026-07-05T11:30:15.856096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:15.856096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.00839","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-07-05T11:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYbvsS68kIIdKK/Dvl6NlseUI6GpeOTDqKI3W1daqiZkMxxx1dhcSwGHuL1F9JWjo0tUrGo3QzUdYkVVUc/FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:48:01.633930Z"},"content_sha256":"73fe7f3f4a31d4d2529aeb55e1299f3a3f6101e85a88a1f19843feba50d0f8bc","schema_version":"1.0","event_id":"sha256:73fe7f3f4a31d4d2529aeb55e1299f3a3f6101e85a88a1f19843feba50d0f8bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5JFCMIGWLVEBGRRRLSZZLMADFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Chen, Chenyi Zhang, Chiyu Hao, Hao Zhang, Jianwen Zhao, Jieru Zhao, Jixian Su, Minyi Guo, Sen Gao, Shixuan Sun","submitted_at":"2025-07-01T15:09:19Z","abstract_excerpt":"Dynamic graph storage systems are essential for real-time applications such as social networks and recommendation, where graph data continuously evolves. However, they face significant challenges in efficiently handling concurrent read and write operations. We find that existing methods suffer from write queries interfering with read efficiency, substantial time and space overhead due to per-edge versioning, and an inability to balance performance, such as slow searches under concurrent workloads. To address these issues, we propose RapidStore, a holistic approach for efficient in-memory dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00839","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/2507.00839/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"},"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-07-05T11:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4he93FqMPDohMQkn1MvdaUvhjDc/s6dYpM0U1ICIIFU/Gpz7hctVyx6g8ddb7xSTN89/YIBdiJ8yeVgvCwmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:48:01.634424Z"},"content_sha256":"956dea3a6fabddf6ed68511b56a45e60b0ef08ddcecb8e5f52cef70caf1b21d6","schema_version":"1.0","event_id":"sha256:956dea3a6fabddf6ed68511b56a45e60b0ef08ddcecb8e5f52cef70caf1b21d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/bundle.json","state_url":"https://pith.science/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/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-08-23T22:48:01Z","links":{"resolver":"https://pith.science/pith/5JFCMIGWLVEBGRRRLSZZLMADFO","bundle":"https://pith.science/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/bundle.json","state":"https://pith.science/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JFCMIGWLVEBGRRRLSZZLMADFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5JFCMIGWLVEBGRRRLSZZLMADFO","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":"872872a6a46be4512f008f60fc8eda60dbcfd8d14af3fc324333532f343f6c50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-01T15:09:19Z","title_canon_sha256":"2e507671614010b693aab4f47694cfd4fe289ee22c43b4471c7aaeac740fa1b1"},"schema_version":"1.0","source":{"id":"2507.00839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00839","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00839v1","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00839","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"5JFCMIGWLVEB","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"5JFCMIGWLVEBGRRR","created_at":"2026-07-05T11:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"5JFCMIGW","created_at":"2026-07-05T11:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:956dea3a6fabddf6ed68511b56a45e60b0ef08ddcecb8e5f52cef70caf1b21d6","target":"graph","created_at":"2026-07-05T11:30:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.00839/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic graph storage systems are essential for real-time applications such as social networks and recommendation, where graph data continuously evolves. However, they face significant challenges in efficiently handling concurrent read and write operations. We find that existing methods suffer from write queries interfering with read efficiency, substantial time and space overhead due to per-edge versioning, and an inability to balance performance, such as slow searches under concurrent workloads. To address these issues, we propose RapidStore, a holistic approach for efficient in-memory dynam","authors_text":"Chen Chen, Chenyi Zhang, Chiyu Hao, Hao Zhang, Jianwen Zhao, Jieru Zhao, Jixian Su, Minyi Guo, Sen Gao, Shixuan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00839","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:73fe7f3f4a31d4d2529aeb55e1299f3a3f6101e85a88a1f19843feba50d0f8bc","target":"record","created_at":"2026-07-05T11:30:15Z","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":"872872a6a46be4512f008f60fc8eda60dbcfd8d14af3fc324333532f343f6c50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-01T15:09:19Z","title_canon_sha256":"2e507671614010b693aab4f47694cfd4fe289ee22c43b4471c7aaeac740fa1b1"},"schema_version":"1.0","source":{"id":"2507.00839","kind":"arxiv","version":1}},"canonical_sha256":"ea4a2620d65d481346315cb395b0032b84d4e1e1718b68b12f4e9289b2ce2815","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea4a2620d65d481346315cb395b0032b84d4e1e1718b68b12f4e9289b2ce2815","first_computed_at":"2026-07-05T11:30:15.856096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:15.856096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4iKQE+fZF9zvvXqw25bk6XJcrBZ8lyveWYHs/RMuwDNh2kl7LoeqheXeIfCdkDSquI23cZCUIRMc5L2mPOhBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:15.856680Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.00839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73fe7f3f4a31d4d2529aeb55e1299f3a3f6101e85a88a1f19843feba50d0f8bc","sha256:956dea3a6fabddf6ed68511b56a45e60b0ef08ddcecb8e5f52cef70caf1b21d6"],"state_sha256":"21b92cc360348c68cf02e12b2a062def3b1b2912a977ba3e2ff7b2e52f18ce7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDrbbrN+P92U1+UvOjckWRRinefWQH7avegsPW0gIUusb5tUeqJh2wpVxdaKTm7p2tjup7tmG0/PoyV3wQL1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:48:01.639192Z","bundle_sha256":"fc72e79d490b5cae25b4a5a1fa90aeb91271b2241aff91386fa196528719a701"}}