{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L3DTRW5MGLKUOQ2ID4DUM2XWGN","short_pith_number":"pith:L3DTRW5M","canonical_record":{"source":{"id":"1208.0089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"664f279d61fc532cb253ebd7f32f6df07f56a5fe127c17ee620cc906c616eceb","abstract_canon_sha256":"f3852bf6b7b0ae24d270ebe4bea494d2d82122a7bc26fd150b7a974be547be0c"},"schema_version":"1.0"},"canonical_sha256":"5ec738dbac32d54743481f07466af63358eefe9da2bd920ddd3aa54977ebc6e4","source":{"kind":"arxiv","id":"1208.0089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0089","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0089v1","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0089","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"L3DTRW5MGLKU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3DTRW5MGLKUOQ2I","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3DTRW5M","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L3DTRW5MGLKUOQ2ID4DUM2XWGN","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"664f279d61fc532cb253ebd7f32f6df07f56a5fe127c17ee620cc906c616eceb","abstract_canon_sha256":"f3852bf6b7b0ae24d270ebe4bea494d2d82122a7bc26fd150b7a974be547be0c"},"schema_version":"1.0"},"canonical_sha256":"5ec738dbac32d54743481f07466af63358eefe9da2bd920ddd3aa54977ebc6e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:44.966723Z","signature_b64":"WGVK93n8OAu/EmcJSa93oSEgOtfMkcNIZnKH8TfAESTaFWbLbto2zsfL/tlfmq7YdJSr0zMaHcdFA4I09G7QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec738dbac32d54743481f07466af63358eefe9da2bd920ddd3aa54977ebc6e4","last_reissued_at":"2026-05-18T03:49:44.965956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:44.965956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0089","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-18T03:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpfhTIw+67xLQd7knMLcS026LzUGqNfIRyOGhpmFS8tEMHO3bV8UBinGZcRtYsGssCyCopnIwN3QBI5G2AwHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:29:25.891524Z"},"content_sha256":"2749715669bdcf0715b161571d06db185a205837a4882ff22e438df350fd734d","schema_version":"1.0","event_id":"sha256:2749715669bdcf0715b161571d06db185a205837a4882ff22e438df350fd734d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L3DTRW5MGLKUOQ2ID4DUM2XWGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"REX: Recursive, Delta-Based Data-Centric Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Sudipto Guha, Svilen R. Mihaylov, Zachary G. Ives","submitted_at":"2012-08-01T03:54:58Z","abstract_excerpt":"In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning). Modern DBMSs support ad hoc and OLAP queries, but most are not robust enough to scale to large clusters. Conversely, \"cloud\" platforms like MapReduce execute chains of batch tasks across clusters in a fault tolerant way, but have too much overhead to support ad hoc queries.\n  Moreover, both classes of platform incur significant overhead in executing iterative data analysis algorithms. Most s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0089","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-18T03:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeVjwP9Mc8dVv5e+OLZT0gtkACOz654+ukbB9tP9PQMifSzdXs0akYhHTmkw4JOJjOk+nM5+VNzYPh8jf30oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:29:25.891881Z"},"content_sha256":"63b4720b165f75d88f19d988e5361b4ce22c3a4019ae29aec60437e95e7946b7","schema_version":"1.0","event_id":"sha256:63b4720b165f75d88f19d988e5361b4ce22c3a4019ae29aec60437e95e7946b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/bundle.json","state_url":"https://pith.science/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/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-28T06:29:25Z","links":{"resolver":"https://pith.science/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN","bundle":"https://pith.science/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/bundle.json","state":"https://pith.science/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3DTRW5MGLKUOQ2ID4DUM2XWGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L3DTRW5MGLKUOQ2ID4DUM2XWGN","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":"f3852bf6b7b0ae24d270ebe4bea494d2d82122a7bc26fd150b7a974be547be0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:54:58Z","title_canon_sha256":"664f279d61fc532cb253ebd7f32f6df07f56a5fe127c17ee620cc906c616eceb"},"schema_version":"1.0","source":{"id":"1208.0089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0089","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0089v1","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0089","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"L3DTRW5MGLKU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3DTRW5MGLKUOQ2I","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3DTRW5M","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:63b4720b165f75d88f19d988e5361b4ce22c3a4019ae29aec60437e95e7946b7","target":"graph","created_at":"2026-05-18T03:49:44Z","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":"In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning). Modern DBMSs support ad hoc and OLAP queries, but most are not robust enough to scale to large clusters. Conversely, \"cloud\" platforms like MapReduce execute chains of batch tasks across clusters in a fault tolerant way, but have too much overhead to support ad hoc queries.\n  Moreover, both classes of platform incur significant overhead in executing iterative data analysis algorithms. Most s","authors_text":"Sudipto Guha, Svilen R. Mihaylov, Zachary G. Ives","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:54:58Z","title":"REX: Recursive, Delta-Based Data-Centric Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0089","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:2749715669bdcf0715b161571d06db185a205837a4882ff22e438df350fd734d","target":"record","created_at":"2026-05-18T03:49:44Z","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":"f3852bf6b7b0ae24d270ebe4bea494d2d82122a7bc26fd150b7a974be547be0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:54:58Z","title_canon_sha256":"664f279d61fc532cb253ebd7f32f6df07f56a5fe127c17ee620cc906c616eceb"},"schema_version":"1.0","source":{"id":"1208.0089","kind":"arxiv","version":1}},"canonical_sha256":"5ec738dbac32d54743481f07466af63358eefe9da2bd920ddd3aa54977ebc6e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec738dbac32d54743481f07466af63358eefe9da2bd920ddd3aa54977ebc6e4","first_computed_at":"2026-05-18T03:49:44.965956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:44.965956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WGVK93n8OAu/EmcJSa93oSEgOtfMkcNIZnKH8TfAESTaFWbLbto2zsfL/tlfmq7YdJSr0zMaHcdFA4I09G7QAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:44.966723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2749715669bdcf0715b161571d06db185a205837a4882ff22e438df350fd734d","sha256:63b4720b165f75d88f19d988e5361b4ce22c3a4019ae29aec60437e95e7946b7"],"state_sha256":"044fe0399ed944970dd8fd32fe93f5afa5c64ca117857359d060e2e74500923a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEXrlAUyxU/ZnLfVg47FIriAiRN+6S6twYNMp+IQjubeRLle+tgJYbbxJETiGiAIiZjV4aUQX8EeGTGWwLGSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:29:25.894199Z","bundle_sha256":"c3a21781bc6586924f1cd122da258d84efc77253f9f25c9a450d830aaf25daa0"}}