{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4O3IZZANDE2Q4GO44H4IMYQEYH","short_pith_number":"pith:4O3IZZAN","canonical_record":{"source":{"id":"1302.0914","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-05T01:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"13e10b4ddd0ee6463d8f3b7832fe3ce24f85e1c60690b6072ae27b300c96e184","abstract_canon_sha256":"5b132924bb340c0c5b52f6de6a024ffdbe7b97701d97df34d9368ff41d7a9888"},"schema_version":"1.0"},"canonical_sha256":"e3b68ce40d19350e19dce1f8866204c1fee99f1fa91d67b07b1f6f71d8a07226","source":{"kind":"arxiv","id":"1302.0914","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0914","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0914v5","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0914","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"4O3IZZANDE2Q","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4O3IZZANDE2Q4GO4","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4O3IZZAN","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4O3IZZANDE2Q4GO44H4IMYQEYH","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0914","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-05T01:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"13e10b4ddd0ee6463d8f3b7832fe3ce24f85e1c60690b6072ae27b300c96e184","abstract_canon_sha256":"5b132924bb340c0c5b52f6de6a024ffdbe7b97701d97df34d9368ff41d7a9888"},"schema_version":"1.0"},"canonical_sha256":"e3b68ce40d19350e19dce1f8866204c1fee99f1fa91d67b07b1f6f71d8a07226","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:19.403098Z","signature_b64":"YttocJeFUodzcb+EZtHWk5kuCAyRK/DLs/fHXxab6olRkp1L2Ym4YPuqMiBZvykNTn4v7ViU/hMB6bFHwF50BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b68ce40d19350e19dce1f8866204c1fee99f1fa91d67b07b1f6f71d8a07226","last_reissued_at":"2026-05-18T02:55:19.402674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:19.402674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0914","source_version":5,"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-18T02:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fA3i3meQ2fRFep2hhgWMiSRxOvx8GggnrTXGXyp8pSwIGpFbRLa5DYtjG0V32hKGuqW1PKxFveU4cLqKYUFgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:46.486713Z"},"content_sha256":"7f2136c2c8344c83ee15858cdf8940a998abd85263c5a46f6b39110479390fba","schema_version":"1.0","event_id":"sha256:7f2136c2c8344c83ee15858cdf8940a998abd85263c5a46f6b39110479390fba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4O3IZZANDE2Q4GO44H4IMYQEYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Worst-Case Analysis for Joins with Minesweeper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Dung T. Nguyen, Hung Q. Ngo","submitted_at":"2013-02-05T01:24:12Z","abstract_excerpt":"We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, `beyond worst-case guarantees') for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity, which we call {\\it certificate complexity}, that extends notions of Barbay et al. and Demaine et al.; a certificate is a set of propositional formulae that certifies that the output is correct. This notion captures a natural class of join algorithms. In addition, the certificate allows us to define"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0914","kind":"arxiv","version":5},"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-18T02:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMNNfwOTVYoQQBugcz673yCsneQtBr2wzPA01uo9y9FRqK1B3En/810DYDA/4SpJLyW/H2V0Ip+yG8XlYCcHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:46.487365Z"},"content_sha256":"7e8bc4c4aca2b4ef25574b1067befaabb9a18efb1eab003c53a0d1714ad2670b","schema_version":"1.0","event_id":"sha256:7e8bc4c4aca2b4ef25574b1067befaabb9a18efb1eab003c53a0d1714ad2670b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/bundle.json","state_url":"https://pith.science/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/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-31T03:36:46Z","links":{"resolver":"https://pith.science/pith/4O3IZZANDE2Q4GO44H4IMYQEYH","bundle":"https://pith.science/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/bundle.json","state":"https://pith.science/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O3IZZANDE2Q4GO44H4IMYQEYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4O3IZZANDE2Q4GO44H4IMYQEYH","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":"5b132924bb340c0c5b52f6de6a024ffdbe7b97701d97df34d9368ff41d7a9888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-05T01:24:12Z","title_canon_sha256":"13e10b4ddd0ee6463d8f3b7832fe3ce24f85e1c60690b6072ae27b300c96e184"},"schema_version":"1.0","source":{"id":"1302.0914","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0914","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0914v5","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0914","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"4O3IZZANDE2Q","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4O3IZZANDE2Q4GO4","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4O3IZZAN","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:7e8bc4c4aca2b4ef25574b1067befaabb9a18efb1eab003c53a0d1714ad2670b","target":"graph","created_at":"2026-05-18T02:55:19Z","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 describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, `beyond worst-case guarantees') for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity, which we call {\\it certificate complexity}, that extends notions of Barbay et al. and Demaine et al.; a certificate is a set of propositional formulae that certifies that the output is correct. This notion captures a natural class of join algorithms. In addition, the certificate allows us to define","authors_text":"Atri Rudra, Christopher R\\'e, Dung T. Nguyen, Hung Q. Ngo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-05T01:24:12Z","title":"Beyond Worst-Case Analysis for Joins with Minesweeper"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0914","kind":"arxiv","version":5},"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:7f2136c2c8344c83ee15858cdf8940a998abd85263c5a46f6b39110479390fba","target":"record","created_at":"2026-05-18T02:55:19Z","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":"5b132924bb340c0c5b52f6de6a024ffdbe7b97701d97df34d9368ff41d7a9888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-05T01:24:12Z","title_canon_sha256":"13e10b4ddd0ee6463d8f3b7832fe3ce24f85e1c60690b6072ae27b300c96e184"},"schema_version":"1.0","source":{"id":"1302.0914","kind":"arxiv","version":5}},"canonical_sha256":"e3b68ce40d19350e19dce1f8866204c1fee99f1fa91d67b07b1f6f71d8a07226","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3b68ce40d19350e19dce1f8866204c1fee99f1fa91d67b07b1f6f71d8a07226","first_computed_at":"2026-05-18T02:55:19.402674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:19.402674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YttocJeFUodzcb+EZtHWk5kuCAyRK/DLs/fHXxab6olRkp1L2Ym4YPuqMiBZvykNTn4v7ViU/hMB6bFHwF50BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:19.403098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0914","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f2136c2c8344c83ee15858cdf8940a998abd85263c5a46f6b39110479390fba","sha256:7e8bc4c4aca2b4ef25574b1067befaabb9a18efb1eab003c53a0d1714ad2670b"],"state_sha256":"96c146de3f5895a7679e35a0fff88c8c5ef91733c473c4a199244df255c9732a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf8Dxh3g3QPQu2HkkwmAhf8yhN1fgZo9sxkffhueLCIF6gsNaZXuJSroy54r2PZv0lZsaeRkIKNYRyVDzul/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:36:46.490763Z","bundle_sha256":"123760f730857d6c6fbcc721f2284fc5ea43e4d11c111b6db4965185c6a11d43"}}