{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W5VMVQVE2D5UAOWQS76FFZYKCU","short_pith_number":"pith:W5VMVQVE","canonical_record":{"source":{"id":"1710.05785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-16T15:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"61b039c6021c746c24d5839516ce768ac5d9639b17bb16d6eb84f70dd4a2bb01","abstract_canon_sha256":"50af8dab75dd4e1afb93dcc1d24a7ffe96869479b7227236ab5a2e896a2b7bdb"},"schema_version":"1.0"},"canonical_sha256":"b76acac2a4d0fb403ad097fc52e70a15001f9d95f8a1a0bf60ab97ef87419db7","source":{"kind":"arxiv","id":"1710.05785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05785","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05785v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05785","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"W5VMVQVE2D5U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5VMVQVE2D5UAOWQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5VMVQVE","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W5VMVQVE2D5UAOWQS76FFZYKCU","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-16T15:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"61b039c6021c746c24d5839516ce768ac5d9639b17bb16d6eb84f70dd4a2bb01","abstract_canon_sha256":"50af8dab75dd4e1afb93dcc1d24a7ffe96869479b7227236ab5a2e896a2b7bdb"},"schema_version":"1.0"},"canonical_sha256":"b76acac2a4d0fb403ad097fc52e70a15001f9d95f8a1a0bf60ab97ef87419db7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:48.183581Z","signature_b64":"/MFzAABgWGuhrwTCBL9PfTCN7aXG2tSWqCkUo697Pb1qo+F9vlBaoll9FS6xUfs25M1/ASoAvsGRBI9UdwRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76acac2a4d0fb403ad097fc52e70a15001f9d95f8a1a0bf60ab97ef87419db7","last_reissued_at":"2026-05-18T00:32:48.182891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:48.182891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05785","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-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/+2VJr6gAEaHakVU9VBPvolTqg5j1pXs6Om3Oufqzx5VT3FjMbSwwBjHbCS5GRrOQCrgGV+2i2wMwSgrcRDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:19.548986Z"},"content_sha256":"15ddcfdc8528e5f256e3d91ef7ff0035973fb26691fc71233839787a9664fe32","schema_version":"1.0","event_id":"sha256:15ddcfdc8528e5f256e3d91ef7ff0035973fb26691fc71233839787a9664fe32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W5VMVQVE2D5UAOWQS76FFZYKCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maiter: An Asynchronous Graph Processing Framework for Delta-based Accumulative Iterative Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cuirong Wang, Lixin Gao, Qixin Gao, Yanfeng Zhang","submitted_at":"2017-10-16T15:42:21Z","abstract_excerpt":"Myriad of graph-based algorithms in machine learning and data mining require parsing relational data iteratively. These algorithms are implemented in a large-scale distributed environment in order to scale to massive data sets. To accelerate these large-scale graph-based iterative computations, we propose delta-based accumulative iterative computation (DAIC). Different from traditional iterative computations, which iteratively update the result based on the result from the previous iteration, DAIC updates the result by accumulating the \"changes\" between iterations. By DAIC, we can process only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05785","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-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBBJtttacCEZ5mFmhcjK2Mn1LQe+PqNh+i6Ad1Ju15e7OZdkZ7Vajp1xCzfoxUEeEgwPsu9kz2Ga7rCun93bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:19.549646Z"},"content_sha256":"7ce0c1625c12c33ba5fe1234bbbe2ff55fc7a26cd379836f8dba6286e219ca8f","schema_version":"1.0","event_id":"sha256:7ce0c1625c12c33ba5fe1234bbbe2ff55fc7a26cd379836f8dba6286e219ca8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/bundle.json","state_url":"https://pith.science/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/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-27T21:38:19Z","links":{"resolver":"https://pith.science/pith/W5VMVQVE2D5UAOWQS76FFZYKCU","bundle":"https://pith.science/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/bundle.json","state":"https://pith.science/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5VMVQVE2D5UAOWQS76FFZYKCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W5VMVQVE2D5UAOWQS76FFZYKCU","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":"50af8dab75dd4e1afb93dcc1d24a7ffe96869479b7227236ab5a2e896a2b7bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-16T15:42:21Z","title_canon_sha256":"61b039c6021c746c24d5839516ce768ac5d9639b17bb16d6eb84f70dd4a2bb01"},"schema_version":"1.0","source":{"id":"1710.05785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05785","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05785v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05785","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"W5VMVQVE2D5U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5VMVQVE2D5UAOWQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5VMVQVE","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:7ce0c1625c12c33ba5fe1234bbbe2ff55fc7a26cd379836f8dba6286e219ca8f","target":"graph","created_at":"2026-05-18T00:32:48Z","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":"Myriad of graph-based algorithms in machine learning and data mining require parsing relational data iteratively. These algorithms are implemented in a large-scale distributed environment in order to scale to massive data sets. To accelerate these large-scale graph-based iterative computations, we propose delta-based accumulative iterative computation (DAIC). Different from traditional iterative computations, which iteratively update the result based on the result from the previous iteration, DAIC updates the result by accumulating the \"changes\" between iterations. By DAIC, we can process only","authors_text":"Cuirong Wang, Lixin Gao, Qixin Gao, Yanfeng Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-16T15:42:21Z","title":"Maiter: An Asynchronous Graph Processing Framework for Delta-based Accumulative Iterative Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05785","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:15ddcfdc8528e5f256e3d91ef7ff0035973fb26691fc71233839787a9664fe32","target":"record","created_at":"2026-05-18T00:32:48Z","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":"50af8dab75dd4e1afb93dcc1d24a7ffe96869479b7227236ab5a2e896a2b7bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-16T15:42:21Z","title_canon_sha256":"61b039c6021c746c24d5839516ce768ac5d9639b17bb16d6eb84f70dd4a2bb01"},"schema_version":"1.0","source":{"id":"1710.05785","kind":"arxiv","version":1}},"canonical_sha256":"b76acac2a4d0fb403ad097fc52e70a15001f9d95f8a1a0bf60ab97ef87419db7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76acac2a4d0fb403ad097fc52e70a15001f9d95f8a1a0bf60ab97ef87419db7","first_computed_at":"2026-05-18T00:32:48.182891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:48.182891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/MFzAABgWGuhrwTCBL9PfTCN7aXG2tSWqCkUo697Pb1qo+F9vlBaoll9FS6xUfs25M1/ASoAvsGRBI9UdwRmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:48.183581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ddcfdc8528e5f256e3d91ef7ff0035973fb26691fc71233839787a9664fe32","sha256:7ce0c1625c12c33ba5fe1234bbbe2ff55fc7a26cd379836f8dba6286e219ca8f"],"state_sha256":"a400898b754a5a699551ccf19c39e2e5724ab879f81e3174eb25c7c523371183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3VFEjZHiAKMVNGp+yEdWjLZXAjC0MRD+HeSAcsWJOb89qGm7HkpHsRss5I8ddji4DtN1Nf76QWkzp2BsISnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:38:19.553307Z","bundle_sha256":"9d788bf45a54dc8c5b72be6c1f557dd573476f991e103729f1da825c5accd163"}}