{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FD5RLG7RGZBKZCCDH6B6W3Q3LO","short_pith_number":"pith:FD5RLG7R","canonical_record":{"source":{"id":"1607.02646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-09T18:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"6289adc7412c722d5297bc7b40c1db6cac66af776b93daf492b9f2b967e9807c","abstract_canon_sha256":"f6a415346b268cb1b70402eaac608d4b099b51ed65fc6d39ae1efae4d3871882"},"schema_version":"1.0"},"canonical_sha256":"28fb159bf13642ac88433f83eb6e1b5bab616e8950a9af0c14ed0ba4dac97e35","source":{"kind":"arxiv","id":"1607.02646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02646","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02646v1","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02646","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"FD5RLG7RGZBK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FD5RLG7RGZBKZCCD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FD5RLG7R","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FD5RLG7RGZBKZCCDH6B6W3Q3LO","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-09T18:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"6289adc7412c722d5297bc7b40c1db6cac66af776b93daf492b9f2b967e9807c","abstract_canon_sha256":"f6a415346b268cb1b70402eaac608d4b099b51ed65fc6d39ae1efae4d3871882"},"schema_version":"1.0"},"canonical_sha256":"28fb159bf13642ac88433f83eb6e1b5bab616e8950a9af0c14ed0ba4dac97e35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.965571Z","signature_b64":"za5zJaImCNQ732u3H6OElmm5UIWwoPkZ0F+iVXOwLB92C7YNWdh/DB45CRCSor5XINB4srsGQq3mZs36myTxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28fb159bf13642ac88433f83eb6e1b5bab616e8950a9af0c14ed0ba4dac97e35","last_reissued_at":"2026-05-18T00:25:11.965201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.965201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02646","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65+BXtHdMo/5P11X52lOyY5kOjV1dfc10Gm1SGcqpuz++kqD5Cpi5a2C0+X+m+59zsz62reMgBDMWYKRDWsiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:37:51.620055Z"},"content_sha256":"3aff9ed19f3c7034676291110dc8938f4a18dd58e818c5e04c2e58c0109b7199","schema_version":"1.0","event_id":"sha256:3aff9ed19f3c7034676291110dc8938f4a18dd58e818c5e04c2e58c0109b7199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FD5RLG7RGZBKZCCDH6B6W3Q3LO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Level Programming Abstractions for Distributed Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Seif Haridi, Vasiliki Kalavri, Vladimir Vlassov","submitted_at":"2016-07-09T18:54:46Z","abstract_excerpt":"Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs arise in application domains such as machine learning, recommendation, web search, and social network analysis. Writing distributed graph applications is inherently hard and requires programming models that can cover a diverse set of problem domains, including iterative refinement algorithms, graph transformations, graph aggregations, pattern matching, ego-network analysis, and graph traversals. Several hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02646","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJ7B0MiDJX5zzlO5Rv7wgdA8pvNfyM8MnqN/6Em1kEcYZNNyCKSn4Nuv25VMHyVOwQVwrfFEM7r0Qwef3ONRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:37:51.620721Z"},"content_sha256":"ae224fc4e30e7c7b81dc4d3af42ca18f3961e211d70a10cbe43e6e737b564a85","schema_version":"1.0","event_id":"sha256:ae224fc4e30e7c7b81dc4d3af42ca18f3961e211d70a10cbe43e6e737b564a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/bundle.json","state_url":"https://pith.science/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/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-27T12:37:51Z","links":{"resolver":"https://pith.science/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO","bundle":"https://pith.science/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/bundle.json","state":"https://pith.science/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FD5RLG7RGZBKZCCDH6B6W3Q3LO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FD5RLG7RGZBKZCCDH6B6W3Q3LO","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":"f6a415346b268cb1b70402eaac608d4b099b51ed65fc6d39ae1efae4d3871882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-09T18:54:46Z","title_canon_sha256":"6289adc7412c722d5297bc7b40c1db6cac66af776b93daf492b9f2b967e9807c"},"schema_version":"1.0","source":{"id":"1607.02646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02646","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02646v1","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02646","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"FD5RLG7RGZBK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FD5RLG7RGZBKZCCD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FD5RLG7R","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:ae224fc4e30e7c7b81dc4d3af42ca18f3961e211d70a10cbe43e6e737b564a85","target":"graph","created_at":"2026-05-18T00:25:11Z","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":"Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs arise in application domains such as machine learning, recommendation, web search, and social network analysis. Writing distributed graph applications is inherently hard and requires programming models that can cover a diverse set of problem domains, including iterative refinement algorithms, graph transformations, graph aggregations, pattern matching, ego-network analysis, and graph traversals. Several hig","authors_text":"Seif Haridi, Vasiliki Kalavri, Vladimir Vlassov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-09T18:54:46Z","title":"High-Level Programming Abstractions for Distributed Graph Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02646","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:3aff9ed19f3c7034676291110dc8938f4a18dd58e818c5e04c2e58c0109b7199","target":"record","created_at":"2026-05-18T00:25:11Z","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":"f6a415346b268cb1b70402eaac608d4b099b51ed65fc6d39ae1efae4d3871882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-09T18:54:46Z","title_canon_sha256":"6289adc7412c722d5297bc7b40c1db6cac66af776b93daf492b9f2b967e9807c"},"schema_version":"1.0","source":{"id":"1607.02646","kind":"arxiv","version":1}},"canonical_sha256":"28fb159bf13642ac88433f83eb6e1b5bab616e8950a9af0c14ed0ba4dac97e35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28fb159bf13642ac88433f83eb6e1b5bab616e8950a9af0c14ed0ba4dac97e35","first_computed_at":"2026-05-18T00:25:11.965201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.965201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"za5zJaImCNQ732u3H6OElmm5UIWwoPkZ0F+iVXOwLB92C7YNWdh/DB45CRCSor5XINB4srsGQq3mZs36myTxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.965571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aff9ed19f3c7034676291110dc8938f4a18dd58e818c5e04c2e58c0109b7199","sha256:ae224fc4e30e7c7b81dc4d3af42ca18f3961e211d70a10cbe43e6e737b564a85"],"state_sha256":"ac7fccda1511e06daffe4fc530f84f39dcb37e1f89f2e7a3b7365124e5106ace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzODQzKMC+gzNkIOj+SsIds43qUq9hBRH/E0rDaON+sdzV2UoW+7YqXI5KKQHKGyQ34Xzoz9IYHOvIT437K8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:37:51.624338Z","bundle_sha256":"6f8309dabcf3d77adea36651f3e2d529c66992439861acf12cef12ec0efc15e2"}}