{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XX3LJWBX5OGSBPGKYQZ57CMXGA","short_pith_number":"pith:XX3LJWBX","canonical_record":{"source":{"id":"1711.04297","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T14:00:44Z","cross_cats_sorted":["cs.DS","cs.SI","stat.ML"],"title_canon_sha256":"cda06f3e414adb7faf30c82c32d7b8f63285600be745d8fe72af4a4e387a2a06","abstract_canon_sha256":"e6d74f1334054b1a1ec9e3f8b14d1b71fb736c7878e4ad176439e3292543317a"},"schema_version":"1.0"},"canonical_sha256":"bdf6b4d837eb8d20bccac433df89973037e710799cb0e4a7ed7cec598d236820","source":{"kind":"arxiv","id":"1711.04297","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04297","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04297v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04297","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"XX3LJWBX5OGS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XX3LJWBX5OGSBPGK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XX3LJWBX","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XX3LJWBX5OGSBPGKYQZ57CMXGA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04297","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T14:00:44Z","cross_cats_sorted":["cs.DS","cs.SI","stat.ML"],"title_canon_sha256":"cda06f3e414adb7faf30c82c32d7b8f63285600be745d8fe72af4a4e387a2a06","abstract_canon_sha256":"e6d74f1334054b1a1ec9e3f8b14d1b71fb736c7878e4ad176439e3292543317a"},"schema_version":"1.0"},"canonical_sha256":"bdf6b4d837eb8d20bccac433df89973037e710799cb0e4a7ed7cec598d236820","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.074918Z","signature_b64":"Wq/Zkkd4kugix/4HlL1l5LiQlSwRP9qLnD9hCNMUGvxDbE0Kkze5uB0Fhdy67CPP6Pw+f9ca2+IeF4z0QyuOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf6b4d837eb8d20bccac433df89973037e710799cb0e4a7ed7cec598d236820","last_reissued_at":"2026-05-18T00:29:51.074309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.074309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04297","source_version":2,"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BsPvvNLIrStx9duBGArqvHfB9J28Q8ZcKZxQnQEC1eIE0WppaskkWB1MqUJMlu/O7dRcclHqbBypM/4328GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:54:57.478583Z"},"content_sha256":"856a467ec8c633d1bdc6c0a4edd5b1e999dc360e961d0efb0fdf96db712f04d2","schema_version":"1.0","event_id":"sha256:856a467ec8c633d1bdc6c0a4edd5b1e999dc360e961d0efb0fdf96db712f04d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XX3LJWBX5OGSBPGKYQZ57CMXGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the ERM Principle with Networked Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Juhua Pu, Xingwu Liu, Yuanhong Wang, Yuyi Wang","submitted_at":"2017-11-12T14:00:44Z","abstract_excerpt":"Networked data, in which every training example involves two objects and may share some common objects with others, is used in many machine learning tasks such as learning to rank and link prediction. A challenge of learning from networked examples is that target values are not known for some pairs of objects. In this case, neither the classical i.i.d.\\ assumption nor techniques based on complete U-statistics can be used. Most existing theoretical results of this problem only deal with the classical empirical risk minimization (ERM) principle that always weights every example equally, but this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04297","kind":"arxiv","version":2},"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4XBsin6XqiAqDFQU5iG6Fu2JC8XWZ9V9+GDIAXNvK4y7MnJOYQoD3jw/j4Abtci3+AN1z4Mjb29RQWobqk2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:54:57.478928Z"},"content_sha256":"0f89bb284e2c4e0f04f22c693aa90de3a002563cdec0e88bb9955bfceca038dc","schema_version":"1.0","event_id":"sha256:0f89bb284e2c4e0f04f22c693aa90de3a002563cdec0e88bb9955bfceca038dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/bundle.json","state_url":"https://pith.science/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/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-02T18:54:57Z","links":{"resolver":"https://pith.science/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA","bundle":"https://pith.science/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/bundle.json","state":"https://pith.science/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX3LJWBX5OGSBPGKYQZ57CMXGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XX3LJWBX5OGSBPGKYQZ57CMXGA","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":"e6d74f1334054b1a1ec9e3f8b14d1b71fb736c7878e4ad176439e3292543317a","cross_cats_sorted":["cs.DS","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T14:00:44Z","title_canon_sha256":"cda06f3e414adb7faf30c82c32d7b8f63285600be745d8fe72af4a4e387a2a06"},"schema_version":"1.0","source":{"id":"1711.04297","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04297","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04297v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04297","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"XX3LJWBX5OGS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XX3LJWBX5OGSBPGK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XX3LJWBX","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:0f89bb284e2c4e0f04f22c693aa90de3a002563cdec0e88bb9955bfceca038dc","target":"graph","created_at":"2026-05-18T00:29:51Z","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":"Networked data, in which every training example involves two objects and may share some common objects with others, is used in many machine learning tasks such as learning to rank and link prediction. A challenge of learning from networked examples is that target values are not known for some pairs of objects. In this case, neither the classical i.i.d.\\ assumption nor techniques based on complete U-statistics can be used. Most existing theoretical results of this problem only deal with the classical empirical risk minimization (ERM) principle that always weights every example equally, but this","authors_text":"Juhua Pu, Xingwu Liu, Yuanhong Wang, Yuyi Wang","cross_cats":["cs.DS","cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T14:00:44Z","title":"On the ERM Principle with Networked Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04297","kind":"arxiv","version":2},"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:856a467ec8c633d1bdc6c0a4edd5b1e999dc360e961d0efb0fdf96db712f04d2","target":"record","created_at":"2026-05-18T00:29:51Z","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":"e6d74f1334054b1a1ec9e3f8b14d1b71fb736c7878e4ad176439e3292543317a","cross_cats_sorted":["cs.DS","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T14:00:44Z","title_canon_sha256":"cda06f3e414adb7faf30c82c32d7b8f63285600be745d8fe72af4a4e387a2a06"},"schema_version":"1.0","source":{"id":"1711.04297","kind":"arxiv","version":2}},"canonical_sha256":"bdf6b4d837eb8d20bccac433df89973037e710799cb0e4a7ed7cec598d236820","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdf6b4d837eb8d20bccac433df89973037e710799cb0e4a7ed7cec598d236820","first_computed_at":"2026-05-18T00:29:51.074309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.074309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wq/Zkkd4kugix/4HlL1l5LiQlSwRP9qLnD9hCNMUGvxDbE0Kkze5uB0Fhdy67CPP6Pw+f9ca2+IeF4z0QyuOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.074918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04297","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:856a467ec8c633d1bdc6c0a4edd5b1e999dc360e961d0efb0fdf96db712f04d2","sha256:0f89bb284e2c4e0f04f22c693aa90de3a002563cdec0e88bb9955bfceca038dc"],"state_sha256":"487a2759aac91fb422a13649fabb6f7994e74059c5224e54fa7aad014500eecb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbwercXRs7nb3Tz0+g8EaMg5aTqzfak4s8EBrs4ICt/WY9M0Btj6jUYOD0nlwluSDZ+boj8N7oeG96ub0vsiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:54:57.480983Z","bundle_sha256":"8c3d28c5bf10c5c4c347dcabe16dc9ab85150a8891ad85f39597e13824c9d3e2"}}