{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XLZDHYB5YKE7MX5F4K5X52KAFC","short_pith_number":"pith:XLZDHYB5","canonical_record":{"source":{"id":"1409.7472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-09-26T06:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"9374a38052fbe38452644a89ed51780bce03d10b45e3500d17bc0a03a71bf23b","abstract_canon_sha256":"5195dca3c2dfa9fabcbba61a3a1c72f6f97e30dbea91f16786d85c22e50fd6c8"},"schema_version":"1.0"},"canonical_sha256":"baf233e03dc289f65fa5e2bb7ee94028a4a369eed07430ca8823a36d095dc497","source":{"kind":"arxiv","id":"1409.7472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7472","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7472v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7472","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"XLZDHYB5YKE7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XLZDHYB5YKE7MX5F","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XLZDHYB5","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XLZDHYB5YKE7MX5F4K5X52KAFC","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-09-26T06:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"9374a38052fbe38452644a89ed51780bce03d10b45e3500d17bc0a03a71bf23b","abstract_canon_sha256":"5195dca3c2dfa9fabcbba61a3a1c72f6f97e30dbea91f16786d85c22e50fd6c8"},"schema_version":"1.0"},"canonical_sha256":"baf233e03dc289f65fa5e2bb7ee94028a4a369eed07430ca8823a36d095dc497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.605384Z","signature_b64":"aTDoGLmkfBvudAt211nXCgBJ86vI4k/jiBg/npdMG1IxjmT2S4I9TF/son8dylGTDws4K4mO68ONO9K9F+NbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf233e03dc289f65fa5e2bb7ee94028a4a369eed07430ca8823a36d095dc497","last_reissued_at":"2026-05-18T02:41:52.604707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.604707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7472","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfD7A1VJXOBHGRhHWI6KSuxOvq/Tu/6odA7UZihon03METkQFa1kHMsjf0viH5jnc8B0cr7UuH4BftPFSTWvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:35.691981Z"},"content_sha256":"3db20799847840365a61005588b5f090fba95b8010e0b25ee293465b316adb27","schema_version":"1.0","event_id":"sha256:3db20799847840365a61005588b5f090fba95b8010e0b25ee293465b316adb27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XLZDHYB5YKE7MX5F4K5X52KAFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Expected Optimal Labeling Order Problem for Crowdsourced Joins and Entity Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guoliang Li, Jianhua Feng, Jiannan Wang, Michael J. Franklin, Tim Kraska","submitted_at":"2014-09-26T06:01:00Z","abstract_excerpt":"In the SIGMOD 2013 conference, we published a paper extending our earlier work on crowdsourced entity resolution to improve crowdsourced join processing by exploiting transitive relationships [Wang et al. 2013]. The VLDB 2014 conference has a paper that follows up on our previous work [Vesdapunt et al., 2014], which points out and corrects a mistake we made in our SIGMOD paper. Specifically, in Section 4.2 of our SIGMOD paper, we defined the \"Expected Optimal Labeling Order\" (EOLO) problem, and proposed an algorithm for solving it. We incorrectly claimed that our algorithm is optimal. In their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7472","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGgsHe6NLQ6JovZeMGT3dgNzmfjGPOgbHRq5vVa6Raj12qE2i8TG4ga050sGtQZ+rH9cxqb0ZlLl01Ge3em2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:35.692342Z"},"content_sha256":"6d6650baaab9770fd87b6bd73fc79091c0053301649df24cd64237d3ce7fdd0d","schema_version":"1.0","event_id":"sha256:6d6650baaab9770fd87b6bd73fc79091c0053301649df24cd64237d3ce7fdd0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/bundle.json","state_url":"https://pith.science/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/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-03T22:10:35Z","links":{"resolver":"https://pith.science/pith/XLZDHYB5YKE7MX5F4K5X52KAFC","bundle":"https://pith.science/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/bundle.json","state":"https://pith.science/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLZDHYB5YKE7MX5F4K5X52KAFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XLZDHYB5YKE7MX5F4K5X52KAFC","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":"5195dca3c2dfa9fabcbba61a3a1c72f6f97e30dbea91f16786d85c22e50fd6c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-09-26T06:01:00Z","title_canon_sha256":"9374a38052fbe38452644a89ed51780bce03d10b45e3500d17bc0a03a71bf23b"},"schema_version":"1.0","source":{"id":"1409.7472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7472","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7472v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7472","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"XLZDHYB5YKE7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XLZDHYB5YKE7MX5F","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XLZDHYB5","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:6d6650baaab9770fd87b6bd73fc79091c0053301649df24cd64237d3ce7fdd0d","target":"graph","created_at":"2026-05-18T02:41:52Z","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 the SIGMOD 2013 conference, we published a paper extending our earlier work on crowdsourced entity resolution to improve crowdsourced join processing by exploiting transitive relationships [Wang et al. 2013]. The VLDB 2014 conference has a paper that follows up on our previous work [Vesdapunt et al., 2014], which points out and corrects a mistake we made in our SIGMOD paper. Specifically, in Section 4.2 of our SIGMOD paper, we defined the \"Expected Optimal Labeling Order\" (EOLO) problem, and proposed an algorithm for solving it. We incorrectly claimed that our algorithm is optimal. In their","authors_text":"Guoliang Li, Jianhua Feng, Jiannan Wang, Michael J. Franklin, Tim Kraska","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-09-26T06:01:00Z","title":"The Expected Optimal Labeling Order Problem for Crowdsourced Joins and Entity Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7472","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:3db20799847840365a61005588b5f090fba95b8010e0b25ee293465b316adb27","target":"record","created_at":"2026-05-18T02:41:52Z","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":"5195dca3c2dfa9fabcbba61a3a1c72f6f97e30dbea91f16786d85c22e50fd6c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-09-26T06:01:00Z","title_canon_sha256":"9374a38052fbe38452644a89ed51780bce03d10b45e3500d17bc0a03a71bf23b"},"schema_version":"1.0","source":{"id":"1409.7472","kind":"arxiv","version":1}},"canonical_sha256":"baf233e03dc289f65fa5e2bb7ee94028a4a369eed07430ca8823a36d095dc497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baf233e03dc289f65fa5e2bb7ee94028a4a369eed07430ca8823a36d095dc497","first_computed_at":"2026-05-18T02:41:52.604707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:52.604707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTDoGLmkfBvudAt211nXCgBJ86vI4k/jiBg/npdMG1IxjmT2S4I9TF/son8dylGTDws4K4mO68ONO9K9F+NbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:52.605384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3db20799847840365a61005588b5f090fba95b8010e0b25ee293465b316adb27","sha256:6d6650baaab9770fd87b6bd73fc79091c0053301649df24cd64237d3ce7fdd0d"],"state_sha256":"409186006ba5db25edafdb49b84acdcd73d4ec6360df45a9ef4f36f4266c0f46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6eCoemEMdT8vmIbU7XVF7ed/mPQJnkWSWE9+I8hydbbzycFLxhvYgfniUpyrpgo+qHOeSTZd6mv5nRyzvt6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:10:35.694298Z","bundle_sha256":"85064c365891e909be7d50934ec6ff9b3e3b1cdaaeb92a50cc0d2aeee9ac0623"}}