{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y4572YZ36QBHNSN5ZEEBOHUJXP","short_pith_number":"pith:Y4572YZ3","canonical_record":{"source":{"id":"1208.0291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"abcbfb322b6397b1f226491c9463d3f8b01d2581fbe9f5b889576700c7fa7905","abstract_canon_sha256":"b0174fb374f5ffd50ca7563e689cbb889682016dd0dfeb8e21e78701964395c1"},"schema_version":"1.0"},"canonical_sha256":"c73bfd633bf40276c9bdc908171e89bbd0818f2daba87028fa09034f853a9999","source":{"kind":"arxiv","id":"1208.0291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0291","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0291v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0291","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y4572YZ36QBH","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y4572YZ36QBHNSN5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y4572YZ3","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y4572YZ36QBHNSN5ZEEBOHUJXP","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"abcbfb322b6397b1f226491c9463d3f8b01d2581fbe9f5b889576700c7fa7905","abstract_canon_sha256":"b0174fb374f5ffd50ca7563e689cbb889682016dd0dfeb8e21e78701964395c1"},"schema_version":"1.0"},"canonical_sha256":"c73bfd633bf40276c9bdc908171e89bbd0818f2daba87028fa09034f853a9999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:35.443515Z","signature_b64":"t8poyKC5l6aYw3zeb4XA1Vt92Xg7jipjELiCGcyaRqwI+6Iy8/t5fA5NR3K5kQ8W9olpJMQHCewzdcgkuW24Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c73bfd633bf40276c9bdc908171e89bbd0818f2daba87028fa09034f853a9999","last_reissued_at":"2026-05-18T03:49:35.442982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:35.442982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0291","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEDk6oJ1K4aDJ7gaEI8/tpSlPNcnJy+dtUWMjTvjV1V08ZKNLIWZJFlS191WrEge+2h5f5ZTVwuxG9lebp20Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:21.747731Z"},"content_sha256":"9ae4938d6adc3a6febb2eaed88a3d68a119c053c8f1f650ce15dd8aeac08c06e","schema_version":"1.0","event_id":"sha256:9ae4938d6adc3a6febb2eaed88a3d68a119c053c8f1f650ce15dd8aeac08c06e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y4572YZ36QBHNSN5ZEEBOHUJXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Expressive Linkage Rules using Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christian Bizer, Robert Isele","submitted_at":"2012-08-01T17:21:32Z","abstract_excerpt":"A central problem in data integration and data cleansing is to find entities in different data sources that describe the same real-world object. Many existing methods for identifying such entities rely on explicit linkage rules which specify the conditions that entities must fulfill in order to be considered to describe the same real-world object. In this paper, we present the GenLink algorithm for learning expressive linkage rules from a set of existing reference links using genetic programming. The algorithm is capable of generating linkage rules which select discriminative properties for co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0291","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYqvukFvp3qt5vWyZxOBJvW5Jj0MXWv3pIfnjHDpulrBfam4FYlz2Hjwo/CE17a/YCXNBGMKt7e81jFLOGMjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:21.748081Z"},"content_sha256":"f870f72f3468c3f94e9c0db67873e7a68d9efad7790d74f31346aedca29895ed","schema_version":"1.0","event_id":"sha256:f870f72f3468c3f94e9c0db67873e7a68d9efad7790d74f31346aedca29895ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/bundle.json","state_url":"https://pith.science/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/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-02T22:23:21Z","links":{"resolver":"https://pith.science/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP","bundle":"https://pith.science/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/bundle.json","state":"https://pith.science/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4572YZ36QBHNSN5ZEEBOHUJXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y4572YZ36QBHNSN5ZEEBOHUJXP","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":"b0174fb374f5ffd50ca7563e689cbb889682016dd0dfeb8e21e78701964395c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:32Z","title_canon_sha256":"abcbfb322b6397b1f226491c9463d3f8b01d2581fbe9f5b889576700c7fa7905"},"schema_version":"1.0","source":{"id":"1208.0291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0291","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0291v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0291","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y4572YZ36QBH","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y4572YZ36QBHNSN5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y4572YZ3","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:f870f72f3468c3f94e9c0db67873e7a68d9efad7790d74f31346aedca29895ed","target":"graph","created_at":"2026-05-18T03:49:35Z","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":"A central problem in data integration and data cleansing is to find entities in different data sources that describe the same real-world object. Many existing methods for identifying such entities rely on explicit linkage rules which specify the conditions that entities must fulfill in order to be considered to describe the same real-world object. In this paper, we present the GenLink algorithm for learning expressive linkage rules from a set of existing reference links using genetic programming. The algorithm is capable of generating linkage rules which select discriminative properties for co","authors_text":"Christian Bizer, Robert Isele","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:32Z","title":"Learning Expressive Linkage Rules using Genetic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0291","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:9ae4938d6adc3a6febb2eaed88a3d68a119c053c8f1f650ce15dd8aeac08c06e","target":"record","created_at":"2026-05-18T03:49:35Z","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":"b0174fb374f5ffd50ca7563e689cbb889682016dd0dfeb8e21e78701964395c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:32Z","title_canon_sha256":"abcbfb322b6397b1f226491c9463d3f8b01d2581fbe9f5b889576700c7fa7905"},"schema_version":"1.0","source":{"id":"1208.0291","kind":"arxiv","version":1}},"canonical_sha256":"c73bfd633bf40276c9bdc908171e89bbd0818f2daba87028fa09034f853a9999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c73bfd633bf40276c9bdc908171e89bbd0818f2daba87028fa09034f853a9999","first_computed_at":"2026-05-18T03:49:35.442982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:35.442982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t8poyKC5l6aYw3zeb4XA1Vt92Xg7jipjELiCGcyaRqwI+6Iy8/t5fA5NR3K5kQ8W9olpJMQHCewzdcgkuW24Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:35.443515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae4938d6adc3a6febb2eaed88a3d68a119c053c8f1f650ce15dd8aeac08c06e","sha256:f870f72f3468c3f94e9c0db67873e7a68d9efad7790d74f31346aedca29895ed"],"state_sha256":"130d0eec9edd01a03d1c1d8a32472002ad702b44bace77fdce873eefbf134ccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcJzaVYZVSJHqIs/VppmI99wuRftKTrjHa0ZGhwaoIUKrxssS8YpDSOb5biX5ocPaVzMQgYxPFBD5YqfK5NACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:23:21.750023Z","bundle_sha256":"d46dac64ef621232f6621fabe9f750ba785ef9d0acdc887686fbe32f8e3a31ff"}}