{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DGECIVYHZFFPZXBA6YU6RE5TMH","short_pith_number":"pith:DGECIVYH","canonical_record":{"source":{"id":"1211.1790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-08T08:33:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"46e30347a547cd8ed58a305c4a21aa189d08709a23f0819d0fb16564e901e5e0","abstract_canon_sha256":"049d422ab0ed987cc544ee1e5d9b626329cc08296077ed036d52fdb1d7506094"},"schema_version":"1.0"},"canonical_sha256":"1988245707c94afcdc20f629e893b361f843452a3850498af5cc4b845a8489bc","source":{"kind":"arxiv","id":"1211.1790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1790","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1790v1","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1790","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"DGECIVYHZFFP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DGECIVYHZFFPZXBA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DGECIVYH","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DGECIVYHZFFPZXBA6YU6RE5TMH","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-08T08:33:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"46e30347a547cd8ed58a305c4a21aa189d08709a23f0819d0fb16564e901e5e0","abstract_canon_sha256":"049d422ab0ed987cc544ee1e5d9b626329cc08296077ed036d52fdb1d7506094"},"schema_version":"1.0"},"canonical_sha256":"1988245707c94afcdc20f629e893b361f843452a3850498af5cc4b845a8489bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:13.472589Z","signature_b64":"0eSyytprI9JKJy5AnOQ3O/DJ1w9phF4h/biMEv8Ft1oZD8P6fPdr9aGVVtNkmg5FXIwdNN4Zdohn9eGOnx0MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1988245707c94afcdc20f629e893b361f843452a3850498af5cc4b845a8489bc","last_reissued_at":"2026-05-18T03:41:13.472053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:13.472053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1790","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:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pT2YDp/My0OovfmFa8SBGF9KIvrjdcAc1CmYSXv77v5t+U0Z+NwK3oOjJp8zb2odIu8Fjlj6nlbbt/gF94DJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:22:12.686920Z"},"content_sha256":"2ff857b42c5a53d07dbbfe8e30624d6188fefc5a1564ede6e7c3153f3565099c","schema_version":"1.0","event_id":"sha256:2ff857b42c5a53d07dbbfe8e30624d6188fefc5a1564ede6e7c3153f3565099c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DGECIVYHZFFPZXBA6YU6RE5TMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link Prediction in Complex Networks by Multi Degree Preferential-Attachment Indices","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ju Xiang, Ke Hu, Wanchun Yang, Xiaoke Xu, Yi Tang","submitted_at":"2012-11-08T08:33:32Z","abstract_excerpt":"In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of preferential attachment indices which are different from the previous one. Traditionally, the preferential attachment index is defined by the product of the related nodes degrees, while the new indices will define the similarity score of a pair of nodes by either the maximum in the two nodes degrees or the summarization of their degrees. Extensive experiments ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1790","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:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yON6WqesY4NAfzU66GLUCJSe5XPFAxb3nZB5nQIMuq3inoyLgq4Jz1SKSXvc9HjjvF8oLnsx/++vArDVBaQIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:22:12.687695Z"},"content_sha256":"4e77b018bd868475226686321f89ff645460053dffbb7444d426db0a2f6ae90e","schema_version":"1.0","event_id":"sha256:4e77b018bd868475226686321f89ff645460053dffbb7444d426db0a2f6ae90e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/bundle.json","state_url":"https://pith.science/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/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-31T10:22:12Z","links":{"resolver":"https://pith.science/pith/DGECIVYHZFFPZXBA6YU6RE5TMH","bundle":"https://pith.science/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/bundle.json","state":"https://pith.science/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGECIVYHZFFPZXBA6YU6RE5TMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DGECIVYHZFFPZXBA6YU6RE5TMH","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":"049d422ab0ed987cc544ee1e5d9b626329cc08296077ed036d52fdb1d7506094","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-08T08:33:32Z","title_canon_sha256":"46e30347a547cd8ed58a305c4a21aa189d08709a23f0819d0fb16564e901e5e0"},"schema_version":"1.0","source":{"id":"1211.1790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1790","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1790v1","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1790","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"DGECIVYHZFFP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DGECIVYHZFFPZXBA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DGECIVYH","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:4e77b018bd868475226686321f89ff645460053dffbb7444d426db0a2f6ae90e","target":"graph","created_at":"2026-05-18T03:41:13Z","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":"In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of preferential attachment indices which are different from the previous one. Traditionally, the preferential attachment index is defined by the product of the related nodes degrees, while the new indices will define the similarity score of a pair of nodes by either the maximum in the two nodes degrees or the summarization of their degrees. Extensive experiments ar","authors_text":"Ju Xiang, Ke Hu, Wanchun Yang, Xiaoke Xu, Yi Tang","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-08T08:33:32Z","title":"Link Prediction in Complex Networks by Multi Degree Preferential-Attachment Indices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1790","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:2ff857b42c5a53d07dbbfe8e30624d6188fefc5a1564ede6e7c3153f3565099c","target":"record","created_at":"2026-05-18T03:41:13Z","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":"049d422ab0ed987cc544ee1e5d9b626329cc08296077ed036d52fdb1d7506094","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-08T08:33:32Z","title_canon_sha256":"46e30347a547cd8ed58a305c4a21aa189d08709a23f0819d0fb16564e901e5e0"},"schema_version":"1.0","source":{"id":"1211.1790","kind":"arxiv","version":1}},"canonical_sha256":"1988245707c94afcdc20f629e893b361f843452a3850498af5cc4b845a8489bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1988245707c94afcdc20f629e893b361f843452a3850498af5cc4b845a8489bc","first_computed_at":"2026-05-18T03:41:13.472053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:13.472053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0eSyytprI9JKJy5AnOQ3O/DJ1w9phF4h/biMEv8Ft1oZD8P6fPdr9aGVVtNkmg5FXIwdNN4Zdohn9eGOnx0MDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:13.472589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ff857b42c5a53d07dbbfe8e30624d6188fefc5a1564ede6e7c3153f3565099c","sha256:4e77b018bd868475226686321f89ff645460053dffbb7444d426db0a2f6ae90e"],"state_sha256":"d318179ebf889d301de89e59965f1899b435a78068056964adb11096640cd638"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KJ2idtuRmy5TGP5M5BbTjj0gcUPg4e8CHi5o8XSCdpw8h0tcYP1JtcwqQIIcAgi8bX54YF/H657EJAAUTDRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:22:12.691831Z","bundle_sha256":"9b7c576a27cde41d1d7205b6e6e7257630f6fc7aeef623b054f85940567507b3"}}