{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y6BIOAJW46A3LDIGCV7SSYT2AI","short_pith_number":"pith:Y6BIOAJW","canonical_record":{"source":{"id":"1810.00717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:21:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b1e6ed73a238bd53a0db4302cebbe833dd5972b156c3ed7b54d05d89f7200e7","abstract_canon_sha256":"f61becd4eab8d9906a0e08028745e3a5686be28d0b6bed9757b2aaad46c4e8ca"},"schema_version":"1.0"},"canonical_sha256":"c782870136e781b58d06157f29627a022208834e7bb7100a0dab349a3d6302b6","source":{"kind":"arxiv","id":"1810.00717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00717","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00717v1","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00717","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"Y6BIOAJW46A3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6BIOAJW46A3LDIG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6BIOAJW","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y6BIOAJW46A3LDIGCV7SSYT2AI","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:21:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b1e6ed73a238bd53a0db4302cebbe833dd5972b156c3ed7b54d05d89f7200e7","abstract_canon_sha256":"f61becd4eab8d9906a0e08028745e3a5686be28d0b6bed9757b2aaad46c4e8ca"},"schema_version":"1.0"},"canonical_sha256":"c782870136e781b58d06157f29627a022208834e7bb7100a0dab349a3d6302b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:25.024852Z","signature_b64":"wZKtOmkCDxr9Ybz4RWAffWuqNGYk7oo09QBJWQ30xrdDGNhgyhZNlv5zkrMM2l/HQj8LdSn1pVMUdkUz+vSoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c782870136e781b58d06157f29627a022208834e7bb7100a0dab349a3d6302b6","last_reissued_at":"2026-05-18T00:04:25.024297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:25.024297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00717","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-18T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LcdVgBPmwjavp1GJFcBSJNoJvQTR4UnA/DvcHCFoDbk4zNgrdPkPsCS+KrLhlddzDGbsCyPD7FeVKL2J2ysBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:51:01.079966Z"},"content_sha256":"37f1825891f964e6592c39eaf55da561ff62b87e1eacaba0049f1657677f6d1a","schema_version":"1.0","event_id":"sha256:37f1825891f964e6592c39eaf55da561ff62b87e1eacaba0049f1657677f6d1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y6BIOAJW46A3LDIGCV7SSYT2AI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification Using Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Maryam Amir Haeri, Seyed Amin Fadaee","submitted_at":"2018-10-01T14:21:33Z","abstract_excerpt":"Link prediction in a graph is the problem of detecting the missing links that would be formed in the near future. Using a graph representation of the data, we can convert the problem of classification to the problem of link prediction which aims at finding the missing links between the unlabeled data (unlabeled nodes) and their classes. To our knowledge, despite the fact that numerous algorithms use the graph representation of the data for classification, none are using link prediction as the heart of their classifying procedure. In this work, we propose a novel algorithm called CULP (Classifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00717","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-18T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCFQMYHfN4PAbVVJI3+/khjvBZ6sVXfyCEWV9kp/QQI/f9Sr/qO1kku4ejXJ4FRVxtzR8a2XE/beQslHJqy1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:51:01.080288Z"},"content_sha256":"6b00b43f5b8383171d6b34c2be6a0bf647fe79e36d083730bca8d634cd40d0eb","schema_version":"1.0","event_id":"sha256:6b00b43f5b8383171d6b34c2be6a0bf647fe79e36d083730bca8d634cd40d0eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/bundle.json","state_url":"https://pith.science/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/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-28T21:51:01Z","links":{"resolver":"https://pith.science/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI","bundle":"https://pith.science/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/bundle.json","state":"https://pith.science/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6BIOAJW46A3LDIGCV7SSYT2AI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y6BIOAJW46A3LDIGCV7SSYT2AI","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":"f61becd4eab8d9906a0e08028745e3a5686be28d0b6bed9757b2aaad46c4e8ca","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:21:33Z","title_canon_sha256":"8b1e6ed73a238bd53a0db4302cebbe833dd5972b156c3ed7b54d05d89f7200e7"},"schema_version":"1.0","source":{"id":"1810.00717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00717","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00717v1","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00717","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"Y6BIOAJW46A3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6BIOAJW46A3LDIG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6BIOAJW","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6b00b43f5b8383171d6b34c2be6a0bf647fe79e36d083730bca8d634cd40d0eb","target":"graph","created_at":"2026-05-18T00:04:25Z","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":"Link prediction in a graph is the problem of detecting the missing links that would be formed in the near future. Using a graph representation of the data, we can convert the problem of classification to the problem of link prediction which aims at finding the missing links between the unlabeled data (unlabeled nodes) and their classes. To our knowledge, despite the fact that numerous algorithms use the graph representation of the data for classification, none are using link prediction as the heart of their classifying procedure. In this work, we propose a novel algorithm called CULP (Classifi","authors_text":"Maryam Amir Haeri, Seyed Amin Fadaee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:21:33Z","title":"Classification Using Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00717","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:37f1825891f964e6592c39eaf55da561ff62b87e1eacaba0049f1657677f6d1a","target":"record","created_at":"2026-05-18T00:04:25Z","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":"f61becd4eab8d9906a0e08028745e3a5686be28d0b6bed9757b2aaad46c4e8ca","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:21:33Z","title_canon_sha256":"8b1e6ed73a238bd53a0db4302cebbe833dd5972b156c3ed7b54d05d89f7200e7"},"schema_version":"1.0","source":{"id":"1810.00717","kind":"arxiv","version":1}},"canonical_sha256":"c782870136e781b58d06157f29627a022208834e7bb7100a0dab349a3d6302b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c782870136e781b58d06157f29627a022208834e7bb7100a0dab349a3d6302b6","first_computed_at":"2026-05-18T00:04:25.024297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:25.024297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZKtOmkCDxr9Ybz4RWAffWuqNGYk7oo09QBJWQ30xrdDGNhgyhZNlv5zkrMM2l/HQj8LdSn1pVMUdkUz+vSoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:25.024852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37f1825891f964e6592c39eaf55da561ff62b87e1eacaba0049f1657677f6d1a","sha256:6b00b43f5b8383171d6b34c2be6a0bf647fe79e36d083730bca8d634cd40d0eb"],"state_sha256":"413be17ac7893df873a9e4a6ad1d12825d05ef62062a359a0c191d2193f5a5e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHlRktY9yT4a1zPvvgafrrQDpn93K112F5cdNJ6wyPO5Jj5tTaAId8yJOvqgJWLf0LM+cAeoCBbRDxSax+YuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:51:01.082056Z","bundle_sha256":"2464b6d7c01ea9676cc53e3cc18b880453875cbcff9d1297dd92e7af53531c48"}}