{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6SOUWSSS2GXNZI5XQLY2EEY4IH","short_pith_number":"pith:6SOUWSSS","canonical_record":{"source":{"id":"1703.06227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-18T00:44:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2e5b26f659272a1934468d922e9e15edf5e0ee5f5efdfe008bc455a9995b4587","abstract_canon_sha256":"81b536b0c7fb02d8c3b5271a9f2f10d35da275bd4794f50aade45bf142fb6ce4"},"schema_version":"1.0"},"canonical_sha256":"f49d4b4a52d1aedca3b782f1a2131c41ca283c1a113dcbc534d455cbe8b0de9d","source":{"kind":"arxiv","id":"1703.06227","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06227","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06227v3","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06227","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"6SOUWSSS2GXN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6SOUWSSS2GXNZI5X","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6SOUWSSS","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6SOUWSSS2GXNZI5XQLY2EEY4IH","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-18T00:44:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2e5b26f659272a1934468d922e9e15edf5e0ee5f5efdfe008bc455a9995b4587","abstract_canon_sha256":"81b536b0c7fb02d8c3b5271a9f2f10d35da275bd4794f50aade45bf142fb6ce4"},"schema_version":"1.0"},"canonical_sha256":"f49d4b4a52d1aedca3b782f1a2131c41ca283c1a113dcbc534d455cbe8b0de9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:42.384636Z","signature_b64":"Lh+3Te5IUWZUgGuqG/OZ2WGbeZ8JmHMX3pYgv97sj9G8hma0Mh2g0U/HdJvYgPycL5i26Bl+XJhsth+EOcVtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49d4b4a52d1aedca3b782f1a2131c41ca283c1a113dcbc534d455cbe8b0de9d","last_reissued_at":"2026-05-18T00:19:42.383992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:42.383992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06227","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-18T00:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWmXCdDsoTVpb4Rg5Gw4CyRoAyaiC/dlfyBJv0a149EPXAZaoat8nhG0i1MI4zEYJNRMr3PbEag7Rp6+p6koAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:22:33.063823Z"},"content_sha256":"d00598ab1045b1b3b7615f08a6160a077b46f7c7eac45d288a39171aaf2ddd96","schema_version":"1.0","event_id":"sha256:d00598ab1045b1b3b7615f08a6160a077b46f7c7eac45d288a39171aaf2ddd96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6SOUWSSS2GXNZI5XQLY2EEY4IH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Distance-Based Network Indices with Application to Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2017-03-18T00:44:38Z","abstract_excerpt":"In large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial. The second shortcoming is that a huge number of vertices may have exactly the same score. The third shortcoming is that in many applications, the distance between two vertices not only depends on the length of shortest paths, but also on the number of shortest paths. In this paper, first we develop a new distance measure between vertices of a graph that yields discriminative distance-based ce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06227","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-18T00:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDYkB80LNufNE2VNV20bOUifJVsb0fcLRxHpFaBUBblGWr30xy3ZcISrljH0oufpJndRPoQYxSHS0k2Jv1+MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:22:33.064173Z"},"content_sha256":"c04ac85fe80ba876e308341f4cc164472bed0fa3035e656d05d49df042c200d1","schema_version":"1.0","event_id":"sha256:c04ac85fe80ba876e308341f4cc164472bed0fa3035e656d05d49df042c200d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/bundle.json","state_url":"https://pith.science/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/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-25T15:22:33Z","links":{"resolver":"https://pith.science/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH","bundle":"https://pith.science/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/bundle.json","state":"https://pith.science/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SOUWSSS2GXNZI5XQLY2EEY4IH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6SOUWSSS2GXNZI5XQLY2EEY4IH","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":"81b536b0c7fb02d8c3b5271a9f2f10d35da275bd4794f50aade45bf142fb6ce4","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-18T00:44:38Z","title_canon_sha256":"2e5b26f659272a1934468d922e9e15edf5e0ee5f5efdfe008bc455a9995b4587"},"schema_version":"1.0","source":{"id":"1703.06227","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06227","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06227v3","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06227","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"6SOUWSSS2GXN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6SOUWSSS2GXNZI5X","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6SOUWSSS","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c04ac85fe80ba876e308341f4cc164472bed0fa3035e656d05d49df042c200d1","target":"graph","created_at":"2026-05-18T00:19:42Z","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 large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial. The second shortcoming is that a huge number of vertices may have exactly the same score. The third shortcoming is that in many applications, the distance between two vertices not only depends on the length of shortest paths, but also on the number of shortest paths. In this paper, first we develop a new distance measure between vertices of a graph that yields discriminative distance-based ce","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-18T00:44:38Z","title":"Discriminative Distance-Based Network Indices with Application to Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06227","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:d00598ab1045b1b3b7615f08a6160a077b46f7c7eac45d288a39171aaf2ddd96","target":"record","created_at":"2026-05-18T00:19:42Z","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":"81b536b0c7fb02d8c3b5271a9f2f10d35da275bd4794f50aade45bf142fb6ce4","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-18T00:44:38Z","title_canon_sha256":"2e5b26f659272a1934468d922e9e15edf5e0ee5f5efdfe008bc455a9995b4587"},"schema_version":"1.0","source":{"id":"1703.06227","kind":"arxiv","version":3}},"canonical_sha256":"f49d4b4a52d1aedca3b782f1a2131c41ca283c1a113dcbc534d455cbe8b0de9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f49d4b4a52d1aedca3b782f1a2131c41ca283c1a113dcbc534d455cbe8b0de9d","first_computed_at":"2026-05-18T00:19:42.383992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:42.383992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lh+3Te5IUWZUgGuqG/OZ2WGbeZ8JmHMX3pYgv97sj9G8hma0Mh2g0U/HdJvYgPycL5i26Bl+XJhsth+EOcVtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:42.384636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06227","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00598ab1045b1b3b7615f08a6160a077b46f7c7eac45d288a39171aaf2ddd96","sha256:c04ac85fe80ba876e308341f4cc164472bed0fa3035e656d05d49df042c200d1"],"state_sha256":"55233833b552ed3f1288d15c0da6e38e724b4eb7dd37c1494f77b87a6a5f8c05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XeilpxA5vpTA5jjqUSrOuYXvR0WxJwkmqq9jluopqOEgRNKSBeobvoE+I3BBNrbjwf5fI5GnlW7pwCZ29AiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T15:22:33.066141Z","bundle_sha256":"e9b86cb30c3a0af169a12fcc4956feaf99e68a378d1774d7e310738afaef056a"}}