{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AJDEJMK5PNCFYHJENHCMHVOHYA","short_pith_number":"pith:AJDEJMK5","canonical_record":{"source":{"id":"1212.3480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-14T14:31:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"495f1f54aaee959c8f0897f9b255e4e3b8b32e56f150d47fea6d7593e0a1377c","abstract_canon_sha256":"fcff9da1ba824201a2f4e2b17098972469047d328b18e9679f4c4d18f5282d27"},"schema_version":"1.0"},"canonical_sha256":"024644b15d7b445c1d2469c4c3d5c7c00fb448412820e5da1117c2bf899564ef","source":{"kind":"arxiv","id":"1212.3480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3480","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3480v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3480","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AJDEJMK5PNCF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJDEJMK5PNCFYHJE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJDEJMK5","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AJDEJMK5PNCFYHJENHCMHVOHYA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-14T14:31:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"495f1f54aaee959c8f0897f9b255e4e3b8b32e56f150d47fea6d7593e0a1377c","abstract_canon_sha256":"fcff9da1ba824201a2f4e2b17098972469047d328b18e9679f4c4d18f5282d27"},"schema_version":"1.0"},"canonical_sha256":"024644b15d7b445c1d2469c4c3d5c7c00fb448412820e5da1117c2bf899564ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:24.508276Z","signature_b64":"mDZTMvJBH0nCOtBbMmsS5khUgVjkPMR5Ton6FPGYRafKsXt4hQ8QJdzWSehoMOoxrm3Dk2hVbnBWVzNVaNlRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"024644b15d7b445c1d2469c4c3d5c7c00fb448412820e5da1117c2bf899564ef","last_reissued_at":"2026-05-18T03:38:24.507754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:24.507754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3480","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:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+VV/wFUQT38eMvFfQ4k2WldIX2JzSx/GkNHBcXWMBll4IAL2iG7C7GeXML6j/h6/OqdqwClgy1CRqu1b86FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:32:47.590794Z"},"content_sha256":"e8a1bfbf8452f63a81f1dfe66b6079875291b6883b2ecf824f05b6f13613f4ca","schema_version":"1.0","event_id":"sha256:e8a1bfbf8452f63a81f1dfe66b6079875291b6883b2ecf824f05b6f13613f4ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AJDEJMK5PNCFYHJENHCMHVOHYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Zero-Overhead Adaptive Indexing in Hadoop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Jens Dittrich, Jorge-Arnulfo Quian\\'e-Ruiz, Stefan Richter, Stefan Schuh","submitted_at":"2012-12-14T14:31:24Z","abstract_excerpt":"Several research works have focused on supporting index access in MapReduce systems. These works have allowed users to significantly speed up selective MapReduce jobs by orders of magnitude. However, all these proposals require users to create indexes upfront, which might be a difficult task in certain applications (such as in scientific and social applications) where workloads are evolving or hard to predict. To overcome this problem, we propose LIAH (Lazy Indexing and Adaptivity in Hadoop), a parallel, adaptive approach for indexing at minimal costs for MapReduce systems. The main idea of LI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3480","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:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CE25vnrnYtjMdHDw0BbsQOm8cQ2WcNA6hhWL8bV8V3GHwZXKFY1xgnVod8IlQpEx557955Oz+w8rDkVxNjLtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:32:47.591439Z"},"content_sha256":"9bb80de054d779126ef0f20ded2a77e806306814efd03e568ef78ff35575e26f","schema_version":"1.0","event_id":"sha256:9bb80de054d779126ef0f20ded2a77e806306814efd03e568ef78ff35575e26f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/bundle.json","state_url":"https://pith.science/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/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-02T12:32:47Z","links":{"resolver":"https://pith.science/pith/AJDEJMK5PNCFYHJENHCMHVOHYA","bundle":"https://pith.science/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/bundle.json","state":"https://pith.science/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJDEJMK5PNCFYHJENHCMHVOHYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AJDEJMK5PNCFYHJENHCMHVOHYA","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":"fcff9da1ba824201a2f4e2b17098972469047d328b18e9679f4c4d18f5282d27","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-14T14:31:24Z","title_canon_sha256":"495f1f54aaee959c8f0897f9b255e4e3b8b32e56f150d47fea6d7593e0a1377c"},"schema_version":"1.0","source":{"id":"1212.3480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3480","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3480v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3480","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AJDEJMK5PNCF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJDEJMK5PNCFYHJE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJDEJMK5","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:9bb80de054d779126ef0f20ded2a77e806306814efd03e568ef78ff35575e26f","target":"graph","created_at":"2026-05-18T03:38:24Z","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":"Several research works have focused on supporting index access in MapReduce systems. These works have allowed users to significantly speed up selective MapReduce jobs by orders of magnitude. However, all these proposals require users to create indexes upfront, which might be a difficult task in certain applications (such as in scientific and social applications) where workloads are evolving or hard to predict. To overcome this problem, we propose LIAH (Lazy Indexing and Adaptivity in Hadoop), a parallel, adaptive approach for indexing at minimal costs for MapReduce systems. The main idea of LI","authors_text":"Jens Dittrich, Jorge-Arnulfo Quian\\'e-Ruiz, Stefan Richter, Stefan Schuh","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-14T14:31:24Z","title":"Towards Zero-Overhead Adaptive Indexing in Hadoop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3480","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:e8a1bfbf8452f63a81f1dfe66b6079875291b6883b2ecf824f05b6f13613f4ca","target":"record","created_at":"2026-05-18T03:38:24Z","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":"fcff9da1ba824201a2f4e2b17098972469047d328b18e9679f4c4d18f5282d27","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-14T14:31:24Z","title_canon_sha256":"495f1f54aaee959c8f0897f9b255e4e3b8b32e56f150d47fea6d7593e0a1377c"},"schema_version":"1.0","source":{"id":"1212.3480","kind":"arxiv","version":1}},"canonical_sha256":"024644b15d7b445c1d2469c4c3d5c7c00fb448412820e5da1117c2bf899564ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"024644b15d7b445c1d2469c4c3d5c7c00fb448412820e5da1117c2bf899564ef","first_computed_at":"2026-05-18T03:38:24.507754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:24.507754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDZTMvJBH0nCOtBbMmsS5khUgVjkPMR5Ton6FPGYRafKsXt4hQ8QJdzWSehoMOoxrm3Dk2hVbnBWVzNVaNlRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:24.508276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8a1bfbf8452f63a81f1dfe66b6079875291b6883b2ecf824f05b6f13613f4ca","sha256:9bb80de054d779126ef0f20ded2a77e806306814efd03e568ef78ff35575e26f"],"state_sha256":"767c81dceeb1cd224215ebd081aeebac0642ab5eef3662054d600c330fcd682e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+iuvczoF+a62ATDbgRINCumQaBpRJ8ArOkkEhJ+kv72DNvuribTvi3rKdFgVB2RCVKIpDKAZuz9zGMj5UxVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:32:47.595110Z","bundle_sha256":"ed9052c47295946dbba6ededbcee3792d0d75e36e4acdf492d8600f1dd93d3b7"}}