{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LR7XY3NIKH226I4ERVO5KPZONR","short_pith_number":"pith:LR7XY3NI","canonical_record":{"source":{"id":"1509.08855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-29T17:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"88a6eb1b81c9ef707b9cace64f1a76c0b7330979f0aff45cbc9ef95fbf58d11b","abstract_canon_sha256":"a797b36c59e344424be3b739cefa9da67b3440fc3a1e9e9bf1b9e626c4d7626d"},"schema_version":"1.0"},"canonical_sha256":"5c7f7c6da851f5af23848d5dd53f2e6c5c2ccaaa1cb7af9ff078f073be31b7cd","source":{"kind":"arxiv","id":"1509.08855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08855","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08855v1","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08855","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"LR7XY3NIKH22","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LR7XY3NIKH226I4E","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LR7XY3NI","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LR7XY3NIKH226I4ERVO5KPZONR","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-29T17:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"88a6eb1b81c9ef707b9cace64f1a76c0b7330979f0aff45cbc9ef95fbf58d11b","abstract_canon_sha256":"a797b36c59e344424be3b739cefa9da67b3440fc3a1e9e9bf1b9e626c4d7626d"},"schema_version":"1.0"},"canonical_sha256":"5c7f7c6da851f5af23848d5dd53f2e6c5c2ccaaa1cb7af9ff078f073be31b7cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:46.956327Z","signature_b64":"oy6z0zy1kkkArfnT4br4k6a/v5A/HXl7ebmvofmXUQzJwdT85TBy05V8jEmQTlb35TAJ9YPe94FsCEtvu2ZzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7f7c6da851f5af23848d5dd53f2e6c5c2ccaaa1cb7af9ff078f073be31b7cd","last_reissued_at":"2026-05-18T01:31:46.955940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:46.955940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08855","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-18T01:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tCBISmy6hpGEWlWBwv9sWUF9M2YhhxUBhNOuZ/rACsGlcTh8PHprLBOzEAR+bBJaoiRdnnIRINvEf/ryVGrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:08:02.137224Z"},"content_sha256":"05bf717a992d95386deccf5cc5583841aef34e9fb87ae8708213301839fca428","schema_version":"1.0","event_id":"sha256:05bf717a992d95386deccf5cc5583841aef34e9fb87ae8708213301839fca428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LR7XY3NIKH226I4ERVO5KPZONR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Marginals Using MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Foto Afrati, Jeffrey D. Ullman, Jonathan R. Ullman, Shantanu Sharma","submitted_at":"2015-09-29T17:11:30Z","abstract_excerpt":"We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number of inputs allowed at a single reducer) and the replication rate (number of reducers to which an input is sent). We show that the replication rate is minimized when the reducers receive all the inputs necessary to compute one marginal of higher order. That observation lets us view the problem as one of covering sets of $k$ dimensions with sets of a larger si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08855","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-18T01:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"510Ft+GE+oSFetrbsvQP1yXp/Yk9aU83WLmuhc2BlFkYWNIhAlHfh+1OqH6eZSAeIQS6hBgrlHENSPZqqI22CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:08:02.137577Z"},"content_sha256":"2847f05bed4a82b95505c2007f5341f4bb7e10be0835d7bac746b5d77cf86f04","schema_version":"1.0","event_id":"sha256:2847f05bed4a82b95505c2007f5341f4bb7e10be0835d7bac746b5d77cf86f04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR7XY3NIKH226I4ERVO5KPZONR/bundle.json","state_url":"https://pith.science/pith/LR7XY3NIKH226I4ERVO5KPZONR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR7XY3NIKH226I4ERVO5KPZONR/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-06-22T16:08:02Z","links":{"resolver":"https://pith.science/pith/LR7XY3NIKH226I4ERVO5KPZONR","bundle":"https://pith.science/pith/LR7XY3NIKH226I4ERVO5KPZONR/bundle.json","state":"https://pith.science/pith/LR7XY3NIKH226I4ERVO5KPZONR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR7XY3NIKH226I4ERVO5KPZONR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LR7XY3NIKH226I4ERVO5KPZONR","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":"a797b36c59e344424be3b739cefa9da67b3440fc3a1e9e9bf1b9e626c4d7626d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-29T17:11:30Z","title_canon_sha256":"88a6eb1b81c9ef707b9cace64f1a76c0b7330979f0aff45cbc9ef95fbf58d11b"},"schema_version":"1.0","source":{"id":"1509.08855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08855","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08855v1","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08855","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"LR7XY3NIKH22","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LR7XY3NIKH226I4E","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LR7XY3NI","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:2847f05bed4a82b95505c2007f5341f4bb7e10be0835d7bac746b5d77cf86f04","target":"graph","created_at":"2026-05-18T01:31:46Z","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":"We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number of inputs allowed at a single reducer) and the replication rate (number of reducers to which an input is sent). We show that the replication rate is minimized when the reducers receive all the inputs necessary to compute one marginal of higher order. That observation lets us view the problem as one of covering sets of $k$ dimensions with sets of a larger si","authors_text":"Foto Afrati, Jeffrey D. Ullman, Jonathan R. Ullman, Shantanu Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-29T17:11:30Z","title":"Computing Marginals Using MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08855","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:05bf717a992d95386deccf5cc5583841aef34e9fb87ae8708213301839fca428","target":"record","created_at":"2026-05-18T01:31:46Z","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":"a797b36c59e344424be3b739cefa9da67b3440fc3a1e9e9bf1b9e626c4d7626d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-29T17:11:30Z","title_canon_sha256":"88a6eb1b81c9ef707b9cace64f1a76c0b7330979f0aff45cbc9ef95fbf58d11b"},"schema_version":"1.0","source":{"id":"1509.08855","kind":"arxiv","version":1}},"canonical_sha256":"5c7f7c6da851f5af23848d5dd53f2e6c5c2ccaaa1cb7af9ff078f073be31b7cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7f7c6da851f5af23848d5dd53f2e6c5c2ccaaa1cb7af9ff078f073be31b7cd","first_computed_at":"2026-05-18T01:31:46.955940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:46.955940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oy6z0zy1kkkArfnT4br4k6a/v5A/HXl7ebmvofmXUQzJwdT85TBy05V8jEmQTlb35TAJ9YPe94FsCEtvu2ZzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:46.956327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05bf717a992d95386deccf5cc5583841aef34e9fb87ae8708213301839fca428","sha256:2847f05bed4a82b95505c2007f5341f4bb7e10be0835d7bac746b5d77cf86f04"],"state_sha256":"c50d16ca8bc8e3bdb0c21b2c8a2d81125e2526462951c3c63e14c59b363bf966"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVHqv2MYD9L3AkIRejddy5bFWWdv8lNPagHuK6yn5+rqEOjU+EcbAWD0OgBH2ANdDpwukNIf7d+834fs/Lc9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:08:02.139526Z","bundle_sha256":"aab4386a8189a2ad783622db7be7de9a9119902149205f0ae0cc96daae77ffe9"}}