{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PKRBMRBIB4T3AC5BKG5HUUBMDJ","short_pith_number":"pith:PKRBMRBI","canonical_record":{"source":{"id":"1402.0282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-03T04:56:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fd1bd6dd6289c407dc9a2e0dc5b57da59556d71eb91dd301bd224f8077013550","abstract_canon_sha256":"410ef330433671da7511a8f290c19a40e51c076af4dafb66b10af165c813fe0c"},"schema_version":"1.0"},"canonical_sha256":"7aa21644280f27b00ba151ba7a502c1a499c86b4677a6084a13d3532228875ce","source":{"kind":"arxiv","id":"1402.0282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0282","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0282v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0282","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"PKRBMRBIB4T3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKRBMRBIB4T3AC5B","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKRBMRBI","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PKRBMRBIB4T3AC5BKG5HUUBMDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-03T04:56:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fd1bd6dd6289c407dc9a2e0dc5b57da59556d71eb91dd301bd224f8077013550","abstract_canon_sha256":"410ef330433671da7511a8f290c19a40e51c076af4dafb66b10af165c813fe0c"},"schema_version":"1.0"},"canonical_sha256":"7aa21644280f27b00ba151ba7a502c1a499c86b4677a6084a13d3532228875ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:24.032556Z","signature_b64":"3ESr9fA/NsXfcaJ+352T3+Z84eFc6nnZ5DlN+jjopY2uYqHQoVw1E3pnBGWb0XthDesAP8enbSsJxo4fqPSdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa21644280f27b00ba151ba7a502c1a499c86b4677a6084a13d3532228875ce","last_reissued_at":"2026-05-18T03:00:24.031743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:24.031743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0282","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:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iofodO2UG3Oh7OOieikvgwkclMSvhi2gjYwianco+FiJdZ/NoZTUiNUqBvoaer010ATF9miQw0Uf/zpQ/uoLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:27:45.920262Z"},"content_sha256":"bbdc1089adda8423fe661812318c09bc4e72e1435fada72ff16cda10c5a4c44f","schema_version":"1.0","event_id":"sha256:bbdc1089adda8423fe661812318c09bc4e72e1435fada72ff16cda10c5a4c44f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PKRBMRBIB4T3AC5BKG5HUUBMDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Principled Graph Matching Algorithms for Integrating Multiple Data Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DB","authors_text":"Benjamin I. P. Rubinstein, Duo Zhang, Jim Gemmell","submitted_at":"2014-02-03T04:56:58Z","abstract_excerpt":"This paper explores combinatorial optimization for problems of max-weight graph matching on multi-partite graphs, which arise in integrating multiple data sources. Entity resolution-the data integration problem of performing noisy joins on structured data-typically proceeds by first hashing each record into zero or more blocks, scoring pairs of records that are co-blocked for similarity, and then matching pairs of sufficient similarity. In the most common case of matching two sources, it is often desirable for the final matching to be one-to-one (a record may be matched with at most one other)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0282","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:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9Pr+MKpHGFur+WNQy2Fth+2i0q1Jj2OYJmeeVSCmnio/zrcHyr9wfffycd2krS+5JaUlZvKH1g8fYhWByKUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:27:45.920641Z"},"content_sha256":"3e8eb7a5dc0d3a7ce79a9b323517f27689214662f06399537938a7fbbaafb084","schema_version":"1.0","event_id":"sha256:3e8eb7a5dc0d3a7ce79a9b323517f27689214662f06399537938a7fbbaafb084"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/bundle.json","state_url":"https://pith.science/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/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-28T06:27:45Z","links":{"resolver":"https://pith.science/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ","bundle":"https://pith.science/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/bundle.json","state":"https://pith.science/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKRBMRBIB4T3AC5BKG5HUUBMDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PKRBMRBIB4T3AC5BKG5HUUBMDJ","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":"410ef330433671da7511a8f290c19a40e51c076af4dafb66b10af165c813fe0c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-03T04:56:58Z","title_canon_sha256":"fd1bd6dd6289c407dc9a2e0dc5b57da59556d71eb91dd301bd224f8077013550"},"schema_version":"1.0","source":{"id":"1402.0282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0282","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0282v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0282","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"PKRBMRBIB4T3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKRBMRBIB4T3AC5B","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKRBMRBI","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:3e8eb7a5dc0d3a7ce79a9b323517f27689214662f06399537938a7fbbaafb084","target":"graph","created_at":"2026-05-18T03:00: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":"This paper explores combinatorial optimization for problems of max-weight graph matching on multi-partite graphs, which arise in integrating multiple data sources. Entity resolution-the data integration problem of performing noisy joins on structured data-typically proceeds by first hashing each record into zero or more blocks, scoring pairs of records that are co-blocked for similarity, and then matching pairs of sufficient similarity. In the most common case of matching two sources, it is often desirable for the final matching to be one-to-one (a record may be matched with at most one other)","authors_text":"Benjamin I. P. Rubinstein, Duo Zhang, Jim Gemmell","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-03T04:56:58Z","title":"Principled Graph Matching Algorithms for Integrating Multiple Data Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0282","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:bbdc1089adda8423fe661812318c09bc4e72e1435fada72ff16cda10c5a4c44f","target":"record","created_at":"2026-05-18T03:00: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":"410ef330433671da7511a8f290c19a40e51c076af4dafb66b10af165c813fe0c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-03T04:56:58Z","title_canon_sha256":"fd1bd6dd6289c407dc9a2e0dc5b57da59556d71eb91dd301bd224f8077013550"},"schema_version":"1.0","source":{"id":"1402.0282","kind":"arxiv","version":1}},"canonical_sha256":"7aa21644280f27b00ba151ba7a502c1a499c86b4677a6084a13d3532228875ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7aa21644280f27b00ba151ba7a502c1a499c86b4677a6084a13d3532228875ce","first_computed_at":"2026-05-18T03:00:24.031743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:24.031743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ESr9fA/NsXfcaJ+352T3+Z84eFc6nnZ5DlN+jjopY2uYqHQoVw1E3pnBGWb0XthDesAP8enbSsJxo4fqPSdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:24.032556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbdc1089adda8423fe661812318c09bc4e72e1435fada72ff16cda10c5a4c44f","sha256:3e8eb7a5dc0d3a7ce79a9b323517f27689214662f06399537938a7fbbaafb084"],"state_sha256":"85c1540df0694e69c26e8aeffa688e5cbe8cdb036649cf20551bbf52b758224a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rs915t7K0uFFM+nrKBPElSHSQUB/1hGwTD+A4yq7+cLFk8yxK6VQ9KFumwXb4N5/55L/iWNoJHq9ZpcCOzVpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:27:45.922740Z","bundle_sha256":"e1b7903a8c25310222001b841eea726cf2950f44d0aa533fcefa68446b598e05"}}