{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3JIUIBICMBV3RT4APKFCDKSHRD","short_pith_number":"pith:3JIUIBIC","canonical_record":{"source":{"id":"1302.5348","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-21T17:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"3de0641d52147d18b267ed67e5b8b810ae52be592fe1a38ae3341b02d0030f7c","abstract_canon_sha256":"85acc01683b0c4b4a9e2265ba6dd1bdb12f33227b12ecd3d0ee25b431fb51fbc"},"schema_version":"1.0"},"canonical_sha256":"da51440502606bb8cf807a8a21aa4788faaa2e011e407a6a283c7ffaa1b13e5d","source":{"kind":"arxiv","id":"1302.5348","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5348","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5348v3","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5348","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"3JIUIBICMBV3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3JIUIBICMBV3RT4A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3JIUIBIC","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3JIUIBICMBV3RT4APKFCDKSHRD","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5348","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-21T17:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"3de0641d52147d18b267ed67e5b8b810ae52be592fe1a38ae3341b02d0030f7c","abstract_canon_sha256":"85acc01683b0c4b4a9e2265ba6dd1bdb12f33227b12ecd3d0ee25b431fb51fbc"},"schema_version":"1.0"},"canonical_sha256":"da51440502606bb8cf807a8a21aa4788faaa2e011e407a6a283c7ffaa1b13e5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:05.455272Z","signature_b64":"wAr/4IXhaKjgZazVaYKz+CuXgnFFHOaiLxsdPoZSlx4ey37ZelzW0NLnCJ7LQPW2Y3ZgHYg8WxvVfB+qYOUrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da51440502606bb8cf807a8a21aa4788faaa2e011e407a6a283c7ffaa1b13e5d","last_reissued_at":"2026-05-18T03:22:05.454511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:05.454511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5348","source_version":3,"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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m61V0DrGyJsvVCnnt/PqWuusqVxN0mdrqQIfpx88U6n5J6abdlUjvksDDwARacNg0VUIVPm9N9vu5VI/z9z6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:11:31.871010Z"},"content_sha256":"e1461763a3941907c19a3bba185c98458d063ee16aa36bfbf23cdb8c2b19c524","schema_version":"1.0","event_id":"sha256:e1461763a3941907c19a3bba185c98458d063ee16aa36bfbf23cdb8c2b19c524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3JIUIBICMBV3RT4APKFCDKSHRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Generalization Bounds for Learning Binary Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ben London, Bert Huang, Lise Getoor","submitted_at":"2013-02-21T17:30:42Z","abstract_excerpt":"We investigate the generalizability of learned binary relations: functions that map pairs of instances to a logical indicator. This problem has application in numerous areas of machine learning, such as ranking, entity resolution and link prediction. Our learning framework incorporates an example labeler that, given a sequence $X$ of $n$ instances and a desired training size $m$, subsamples $m$ pairs from $X \\times X$ without replacement. The challenge in analyzing this learning scenario is that pairwise combinations of random variables are inherently dependent, which prevents us from using tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5348","kind":"arxiv","version":3},"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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPQ83EuIt4DNvh9ELafsr+YYE6bZpYPo76v6vaf+0f/lfBlbVcLcZDKlJTpih0uOop9wcL/MrveQmfauBs6kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:11:31.871624Z"},"content_sha256":"a1bee4be673461804102caf098839b1c55f10e89ea2dbcbdb761cd9083744b7f","schema_version":"1.0","event_id":"sha256:a1bee4be673461804102caf098839b1c55f10e89ea2dbcbdb761cd9083744b7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JIUIBICMBV3RT4APKFCDKSHRD/bundle.json","state_url":"https://pith.science/pith/3JIUIBICMBV3RT4APKFCDKSHRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JIUIBICMBV3RT4APKFCDKSHRD/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-01T04:11:31Z","links":{"resolver":"https://pith.science/pith/3JIUIBICMBV3RT4APKFCDKSHRD","bundle":"https://pith.science/pith/3JIUIBICMBV3RT4APKFCDKSHRD/bundle.json","state":"https://pith.science/pith/3JIUIBICMBV3RT4APKFCDKSHRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JIUIBICMBV3RT4APKFCDKSHRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3JIUIBICMBV3RT4APKFCDKSHRD","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":"85acc01683b0c4b4a9e2265ba6dd1bdb12f33227b12ecd3d0ee25b431fb51fbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-21T17:30:42Z","title_canon_sha256":"3de0641d52147d18b267ed67e5b8b810ae52be592fe1a38ae3341b02d0030f7c"},"schema_version":"1.0","source":{"id":"1302.5348","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5348","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5348v3","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5348","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"3JIUIBICMBV3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3JIUIBICMBV3RT4A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3JIUIBIC","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:a1bee4be673461804102caf098839b1c55f10e89ea2dbcbdb761cd9083744b7f","target":"graph","created_at":"2026-05-18T03:22:05Z","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 investigate the generalizability of learned binary relations: functions that map pairs of instances to a logical indicator. This problem has application in numerous areas of machine learning, such as ranking, entity resolution and link prediction. Our learning framework incorporates an example labeler that, given a sequence $X$ of $n$ instances and a desired training size $m$, subsamples $m$ pairs from $X \\times X$ without replacement. The challenge in analyzing this learning scenario is that pairwise combinations of random variables are inherently dependent, which prevents us from using tr","authors_text":"Ben London, Bert Huang, Lise Getoor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-21T17:30:42Z","title":"Graph-based Generalization Bounds for Learning Binary Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5348","kind":"arxiv","version":3},"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:e1461763a3941907c19a3bba185c98458d063ee16aa36bfbf23cdb8c2b19c524","target":"record","created_at":"2026-05-18T03:22:05Z","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":"85acc01683b0c4b4a9e2265ba6dd1bdb12f33227b12ecd3d0ee25b431fb51fbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-21T17:30:42Z","title_canon_sha256":"3de0641d52147d18b267ed67e5b8b810ae52be592fe1a38ae3341b02d0030f7c"},"schema_version":"1.0","source":{"id":"1302.5348","kind":"arxiv","version":3}},"canonical_sha256":"da51440502606bb8cf807a8a21aa4788faaa2e011e407a6a283c7ffaa1b13e5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da51440502606bb8cf807a8a21aa4788faaa2e011e407a6a283c7ffaa1b13e5d","first_computed_at":"2026-05-18T03:22:05.454511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:05.454511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wAr/4IXhaKjgZazVaYKz+CuXgnFFHOaiLxsdPoZSlx4ey37ZelzW0NLnCJ7LQPW2Y3ZgHYg8WxvVfB+qYOUrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:05.455272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5348","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1461763a3941907c19a3bba185c98458d063ee16aa36bfbf23cdb8c2b19c524","sha256:a1bee4be673461804102caf098839b1c55f10e89ea2dbcbdb761cd9083744b7f"],"state_sha256":"a49747359395e57574af466a8546d7cd519cfddbeab301bd52cc60b530739622"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUGcTv1quIgguL1YwgxDUkV81x1mw78Kl27J4HRoAHJshHOaMlAZPBdp7N1+hiNoQO7e7xah/tWJdEKlsUh3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:11:31.874882Z","bundle_sha256":"88912933b47948e76446fa701a72609bc4d7a7eec3fcab6f39b0d02286805539"}}