{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:M6XO26O7G3VQJCCZ2S5NTFIHQK","short_pith_number":"pith:M6XO26O7","canonical_record":{"source":{"id":"2405.01448","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-02T16:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"2595de6942e8ea9abf783140d7745a63eff84dd7d21bf4143656ea2094dbc0b4","abstract_canon_sha256":"49f981b29cf603f28bd1570f907dbabb4dff4f5321fa823535264b7c398a4b30"},"schema_version":"1.0"},"canonical_sha256":"67aeed79df36eb048859d4bad9950782a101237f7140fc71145267051ecdd6bb","source":{"kind":"arxiv","id":"2405.01448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.01448","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"2405.01448v1","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01448","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"M6XO26O7G3VQ","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_16","alias_value":"M6XO26O7G3VQJCCZ","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_8","alias_value":"M6XO26O7","created_at":"2026-07-05T08:14:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:M6XO26O7G3VQJCCZ2S5NTFIHQK","target":"record","payload":{"canonical_record":{"source":{"id":"2405.01448","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-02T16:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"2595de6942e8ea9abf783140d7745a63eff84dd7d21bf4143656ea2094dbc0b4","abstract_canon_sha256":"49f981b29cf603f28bd1570f907dbabb4dff4f5321fa823535264b7c398a4b30"},"schema_version":"1.0"},"canonical_sha256":"67aeed79df36eb048859d4bad9950782a101237f7140fc71145267051ecdd6bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:45.371307Z","signature_b64":"AcqYIHhUa1PZMsB/VwEWfCam26RojIcMKR+d8dzPNOBT8N4o8EOopGvRgr0RvJDo68kl2+mEbaBmyZls9agJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67aeed79df36eb048859d4bad9950782a101237f7140fc71145267051ecdd6bb","last_reissued_at":"2026-07-05T08:14:45.370870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:45.370870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.01448","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-05T08:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/f7Uv33xCbFYgLDgAxS0PeASIn5yI/irpaPEmBKVCpAbq8x4f+G1TpbQRCeYX6kQes+x4/ab3BPBRwK74XAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:52:18.197983Z"},"content_sha256":"32a9051f7b84711ca5e5f46f079edeee2c306dfb926b5de500cf0576e5bb922e","schema_version":"1.0","event_id":"sha256:32a9051f7b84711ca5e5f46f079edeee2c306dfb926b5de500cf0576e5bb922e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:M6XO26O7G3VQJCCZ2S5NTFIHQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GTX: A Transactional Graph Data System For HTAP Workloads","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Libin Zhou, Walid Aref","submitted_at":"2024-05-02T16:32:37Z","abstract_excerpt":"Processing, managing, and analyzing dynamic graphs are the cornerstone in multiple application domains including fraud detection, recommendation system, graph neural network training, etc. This demo presents GTX, a latch-free write-optimized transactional graph data system that supports high throughput read-write transactions while maintaining competitive graph analytics. GTX has a unique latch-free graph storage and a transaction and concurrency control protocol for dynamic power-law graphs. GTX leverages atomic operations to eliminate latches, proposes a delta-based multi-version storage, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01448","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/2405.01448/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-05T08:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57lXJjB32VBuzXGwO0q7WWSR+OZ6zt8SIfUqtAJ6vf7BONpUgjaG2wSzvx0umwqCA95ii9l6VPWyeHxltZsZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:52:18.198538Z"},"content_sha256":"476bb058a3ad5ac05784bd39b7824abf12955a408fd5923d5054124cfa7c55a0","schema_version":"1.0","event_id":"sha256:476bb058a3ad5ac05784bd39b7824abf12955a408fd5923d5054124cfa7c55a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/bundle.json","state_url":"https://pith.science/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/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-11T17:52:18Z","links":{"resolver":"https://pith.science/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK","bundle":"https://pith.science/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/bundle.json","state":"https://pith.science/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6XO26O7G3VQJCCZ2S5NTFIHQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:M6XO26O7G3VQJCCZ2S5NTFIHQK","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":"49f981b29cf603f28bd1570f907dbabb4dff4f5321fa823535264b7c398a4b30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-02T16:32:37Z","title_canon_sha256":"2595de6942e8ea9abf783140d7745a63eff84dd7d21bf4143656ea2094dbc0b4"},"schema_version":"1.0","source":{"id":"2405.01448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.01448","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"2405.01448v1","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01448","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"M6XO26O7G3VQ","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_16","alias_value":"M6XO26O7G3VQJCCZ","created_at":"2026-07-05T08:14:45Z"},{"alias_kind":"pith_short_8","alias_value":"M6XO26O7","created_at":"2026-07-05T08:14:45Z"}],"graph_snapshots":[{"event_id":"sha256:476bb058a3ad5ac05784bd39b7824abf12955a408fd5923d5054124cfa7c55a0","target":"graph","created_at":"2026-07-05T08:14:45Z","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/2405.01448/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Processing, managing, and analyzing dynamic graphs are the cornerstone in multiple application domains including fraud detection, recommendation system, graph neural network training, etc. This demo presents GTX, a latch-free write-optimized transactional graph data system that supports high throughput read-write transactions while maintaining competitive graph analytics. GTX has a unique latch-free graph storage and a transaction and concurrency control protocol for dynamic power-law graphs. GTX leverages atomic operations to eliminate latches, proposes a delta-based multi-version storage, an","authors_text":"Libin Zhou, Walid Aref","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-02T16:32:37Z","title":"GTX: A Transactional Graph Data System For HTAP Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01448","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:32a9051f7b84711ca5e5f46f079edeee2c306dfb926b5de500cf0576e5bb922e","target":"record","created_at":"2026-07-05T08:14:45Z","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":"49f981b29cf603f28bd1570f907dbabb4dff4f5321fa823535264b7c398a4b30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-02T16:32:37Z","title_canon_sha256":"2595de6942e8ea9abf783140d7745a63eff84dd7d21bf4143656ea2094dbc0b4"},"schema_version":"1.0","source":{"id":"2405.01448","kind":"arxiv","version":1}},"canonical_sha256":"67aeed79df36eb048859d4bad9950782a101237f7140fc71145267051ecdd6bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67aeed79df36eb048859d4bad9950782a101237f7140fc71145267051ecdd6bb","first_computed_at":"2026-07-05T08:14:45.370870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:14:45.370870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AcqYIHhUa1PZMsB/VwEWfCam26RojIcMKR+d8dzPNOBT8N4o8EOopGvRgr0RvJDo68kl2+mEbaBmyZls9agJBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:14:45.371307Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.01448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32a9051f7b84711ca5e5f46f079edeee2c306dfb926b5de500cf0576e5bb922e","sha256:476bb058a3ad5ac05784bd39b7824abf12955a408fd5923d5054124cfa7c55a0"],"state_sha256":"1124d7d1a8961250b9a519a5deb78675bbc7142a8e2ae3e5f45bdb69b029ad68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qq4MFwQLdhPtq2hHqsqJ08WFWZew6D/Dmx0x8+UCXLwIKoDo6o2+4KdLq/gL0Pqpj0ciUBiJp2ry1xtG3xmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:52:18.206900Z","bundle_sha256":"8b16c9806b947ee788dcfc31eef3f6b4a00e994b34bd8caa96c55a2d33fd1be8"}}