{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5G66XHMWMS2HPDM4NBU3UBIZ35","short_pith_number":"pith:5G66XHMW","canonical_record":{"source":{"id":"1211.0176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-01T13:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"457d09b7f15f5d1bad49ccf63b5f8195e775a90bd63c8f42289c9e740701c825","abstract_canon_sha256":"ee98dcd6042ae6a8f61c60db4862e7c03b55b2e53455c42ad35b94b946e549c2"},"schema_version":"1.0"},"canonical_sha256":"e9bdeb9d9664b4778d9c6869ba0519df6637c62c338a5dfdebd5d298c0087576","source":{"kind":"arxiv","id":"1211.0176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0176","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0176v1","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0176","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"5G66XHMWMS2H","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5G66XHMWMS2HPDM4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5G66XHMW","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5G66XHMWMS2HPDM4NBU3UBIZ35","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-01T13:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"457d09b7f15f5d1bad49ccf63b5f8195e775a90bd63c8f42289c9e740701c825","abstract_canon_sha256":"ee98dcd6042ae6a8f61c60db4862e7c03b55b2e53455c42ad35b94b946e549c2"},"schema_version":"1.0"},"canonical_sha256":"e9bdeb9d9664b4778d9c6869ba0519df6637c62c338a5dfdebd5d298c0087576","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:42.859448Z","signature_b64":"XTfTIqCDgSlrydGwg5B//vEXbCHwHYtZzfSYI1ZK1Aw0x+ZO1bHFPOArgMAC7Rsqkzn9s7qG99JosJVRySO/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9bdeb9d9664b4778d9c6869ba0519df6637c62c338a5dfdebd5d298c0087576","last_reissued_at":"2026-05-18T03:41:42.858516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:42.858516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0176","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:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2ej9CmS1hVZpCQDullMuhjEcHie4g0nBMKXGw08F9SZc7W+fFvWtICzjrn67Y2kkxiwzHDtPqSO3elUovr/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:48.407832Z"},"content_sha256":"f272c9a36fb4f8bc529d0ebb4cd5f5ddb20cad1c166dc1f59f667bf5db90f6ce","schema_version":"1.0","event_id":"sha256:f272c9a36fb4f8bc529d0ebb4cd5f5ddb20cad1c166dc1f59f667bf5db90f6ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5G66XHMWMS2HPDM4NBU3UBIZ35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joining relations under discrete uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Danilo Montesi, Matteo Magnani","submitted_at":"2012-11-01T13:45:04Z","abstract_excerpt":"In this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply traditional approaches. As a consequence their performance is affected by different features of the input data, and each algorithm is shown to be more efficient than the others in specific cases. In this way statistics explicitly representing the amount and kind of uncertainty in the input uncertain relations can be used to choose the most efficient algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0176","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:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7Nz3p28rqzLcRwg9fSxrMwRhDqO1iXGp6ukWbTDCb90lVDPm7herZsbH/dewzitez4CN9SUthgrQJb+XLldCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:48.408203Z"},"content_sha256":"d51d4c468056b3be8da684ee4b3f07ead04d783f29ea81a29801101cef94c703","schema_version":"1.0","event_id":"sha256:d51d4c468056b3be8da684ee4b3f07ead04d783f29ea81a29801101cef94c703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/bundle.json","state_url":"https://pith.science/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/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-26T14:12:48Z","links":{"resolver":"https://pith.science/pith/5G66XHMWMS2HPDM4NBU3UBIZ35","bundle":"https://pith.science/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/bundle.json","state":"https://pith.science/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5G66XHMWMS2HPDM4NBU3UBIZ35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5G66XHMWMS2HPDM4NBU3UBIZ35","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":"ee98dcd6042ae6a8f61c60db4862e7c03b55b2e53455c42ad35b94b946e549c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-01T13:45:04Z","title_canon_sha256":"457d09b7f15f5d1bad49ccf63b5f8195e775a90bd63c8f42289c9e740701c825"},"schema_version":"1.0","source":{"id":"1211.0176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0176","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0176v1","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0176","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"5G66XHMWMS2H","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5G66XHMWMS2HPDM4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5G66XHMW","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:d51d4c468056b3be8da684ee4b3f07ead04d783f29ea81a29801101cef94c703","target":"graph","created_at":"2026-05-18T03:41:42Z","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 this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply traditional approaches. As a consequence their performance is affected by different features of the input data, and each algorithm is shown to be more efficient than the others in specific cases. In this way statistics explicitly representing the amount and kind of uncertainty in the input uncertain relations can be used to choose the most efficient algorithm.","authors_text":"Danilo Montesi, Matteo Magnani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-01T13:45:04Z","title":"Joining relations under discrete uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0176","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:f272c9a36fb4f8bc529d0ebb4cd5f5ddb20cad1c166dc1f59f667bf5db90f6ce","target":"record","created_at":"2026-05-18T03:41:42Z","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":"ee98dcd6042ae6a8f61c60db4862e7c03b55b2e53455c42ad35b94b946e549c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-01T13:45:04Z","title_canon_sha256":"457d09b7f15f5d1bad49ccf63b5f8195e775a90bd63c8f42289c9e740701c825"},"schema_version":"1.0","source":{"id":"1211.0176","kind":"arxiv","version":1}},"canonical_sha256":"e9bdeb9d9664b4778d9c6869ba0519df6637c62c338a5dfdebd5d298c0087576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9bdeb9d9664b4778d9c6869ba0519df6637c62c338a5dfdebd5d298c0087576","first_computed_at":"2026-05-18T03:41:42.858516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:42.858516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XTfTIqCDgSlrydGwg5B//vEXbCHwHYtZzfSYI1ZK1Aw0x+ZO1bHFPOArgMAC7Rsqkzn9s7qG99JosJVRySO/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:42.859448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f272c9a36fb4f8bc529d0ebb4cd5f5ddb20cad1c166dc1f59f667bf5db90f6ce","sha256:d51d4c468056b3be8da684ee4b3f07ead04d783f29ea81a29801101cef94c703"],"state_sha256":"c8150ca878c2b6e6708022034bdfb9af6e89dd9f9dcab7e510fbdc8be45bb64a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpcoHPX6VgrPehW17PDm0cufVHXyPPCw/DMdSqLC6AQoeMoSHqtRKJXNg6+u8eM8yK2RsJdQF1FlBEIAqZN2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:12:48.411690Z","bundle_sha256":"efeb7274f5a61e7bade23ae245b4ccc5f598b6f887f10cac228df7445d7fbd10"}}