{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CKS57LP7U7QEJZSENTSQDALQO3","short_pith_number":"pith:CKS57LP7","schema_version":"1.0","canonical_sha256":"12a5dfadffa7e044e6446ce501817076fefcddf26f10cf9694561307e92710cc","source":{"kind":"arxiv","id":"1904.08380","version":1},"attestation_state":"computed","paper":{"title":"Low-Latency Graph Streaming Using Compressed Purely-Functional Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"cs.DC","authors_text":"Guy Blelloch, Julian Shun, Laxman Dhulipala","submitted_at":"2019-04-17T17:28:18Z","abstract_excerpt":"Due to the dynamic nature of real-world graphs, there has been a growing interest in the graph-streaming setting where a continuous stream of graph updates is mixed with arbitrary graph queries. In principle, purely-functional trees are an ideal choice for this setting due as they enable safe parallelism, lightweight snapshots, and strict serializability for queries. However, directly using them for graph processing would lead to significant space overhead and poor cache locality.\n  This paper presents C-trees, a compressed purely-functional search tree data structure that significantly improv"},"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":"1904.08380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-17T17:28:18Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"d1e7a056b7c04003fa106d93c350c346a20d1496859d27a8110ef55a02ad0c9e","abstract_canon_sha256":"68e455c9a99cddedf6c883de9edea8fffe681c5f4d1ac1fc6c2d9d3a9ea68701"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:17.859082Z","signature_b64":"7jtEcthjRZeqjK1TpEmNErlZak2PGY/lQztUvHKP8xVClYLS3AMoQ3RyV3KwZ73xerJGHFMXA2E116UuLuBbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a5dfadffa7e044e6446ce501817076fefcddf26f10cf9694561307e92710cc","last_reissued_at":"2026-05-17T23:48:17.858481Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:17.858481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Latency Graph Streaming Using Compressed Purely-Functional Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"cs.DC","authors_text":"Guy Blelloch, Julian Shun, Laxman Dhulipala","submitted_at":"2019-04-17T17:28:18Z","abstract_excerpt":"Due to the dynamic nature of real-world graphs, there has been a growing interest in the graph-streaming setting where a continuous stream of graph updates is mixed with arbitrary graph queries. In principle, purely-functional trees are an ideal choice for this setting due as they enable safe parallelism, lightweight snapshots, and strict serializability for queries. However, directly using them for graph processing would lead to significant space overhead and poor cache locality.\n  This paper presents C-trees, a compressed purely-functional search tree data structure that significantly improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08380","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.08380","created_at":"2026-05-17T23:48:17.858568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08380v1","created_at":"2026-05-17T23:48:17.858568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08380","created_at":"2026-05-17T23:48:17.858568+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKS57LP7U7QE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKS57LP7U7QEJZSE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKS57LP7","created_at":"2026-05-18T12:33:15.570797+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/CKS57LP7U7QEJZSENTSQDALQO3","json":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3.json","graph_json":"https://pith.science/api/pith-number/CKS57LP7U7QEJZSENTSQDALQO3/graph.json","events_json":"https://pith.science/api/pith-number/CKS57LP7U7QEJZSENTSQDALQO3/events.json","paper":"https://pith.science/paper/CKS57LP7"},"agent_actions":{"view_html":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3","download_json":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3.json","view_paper":"https://pith.science/paper/CKS57LP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08380&json=true","fetch_graph":"https://pith.science/api/pith-number/CKS57LP7U7QEJZSENTSQDALQO3/graph.json","fetch_events":"https://pith.science/api/pith-number/CKS57LP7U7QEJZSENTSQDALQO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3/action/storage_attestation","attest_author":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3/action/author_attestation","sign_citation":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3/action/citation_signature","submit_replication":"https://pith.science/pith/CKS57LP7U7QEJZSENTSQDALQO3/action/replication_record"}},"created_at":"2026-05-17T23:48:17.858568+00:00","updated_at":"2026-05-17T23:48:17.858568+00:00"}