{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:32I7SXP5VSFSVYWSO3OU23L4WJ","short_pith_number":"pith:32I7SXP5","canonical_record":{"source":{"id":"1611.09084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:47:52Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"abd5570ea723c36d3697887e4b779bd874e9ad286d40f2fd47056ae2335bc3b7","abstract_canon_sha256":"b50f53ae07855f2de3251fd2b40c15309fced7d29a3316ff765d07ac1af90f17"},"schema_version":"1.0"},"canonical_sha256":"de91f95dfdac8b2ae2d276dd4d6d7cb24e8171a07ef23b91e0b8783012c3f52b","source":{"kind":"arxiv","id":"1611.09084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09084","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09084v1","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09084","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"32I7SXP5VSFS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32I7SXP5VSFSVYWS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32I7SXP5","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:32I7SXP5VSFSVYWSO3OU23L4WJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:47:52Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"abd5570ea723c36d3697887e4b779bd874e9ad286d40f2fd47056ae2335bc3b7","abstract_canon_sha256":"b50f53ae07855f2de3251fd2b40c15309fced7d29a3316ff765d07ac1af90f17"},"schema_version":"1.0"},"canonical_sha256":"de91f95dfdac8b2ae2d276dd4d6d7cb24e8171a07ef23b91e0b8783012c3f52b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:29.224668Z","signature_b64":"izhExu6EGygmdQmtLEaW3mOrImHoCto125/yPCvKHjiaw4OA3zarWilHw6HSOC74TOTXI64OA/Ea99uPEMClAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de91f95dfdac8b2ae2d276dd4d6d7cb24e8171a07ef23b91e0b8783012c3f52b","last_reissued_at":"2026-05-18T00:56:29.224012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:29.224012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09084","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:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gPDL76rhjgWSqrd5bRo1KjUj3RFqgcXMtYsHnG9zTJQ7gn5Bf49tc+TTrZV7S8V+U2q/1z/ca8oq1o4z2tGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:30:53.885162Z"},"content_sha256":"fdbe08fc0d9910af9be1cac6d74e5e3888bfb170ecfa34dd9b45d2768b41df40","schema_version":"1.0","event_id":"sha256:fdbe08fc0d9910af9be1cac6d74e5e3888bfb170ecfa34dd9b45d2768b41df40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:32I7SXP5VSFSVYWSO3OU23L4WJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Hyperlink Prediction for the WWW","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.DS","authors_text":"Dario Garcia-Gasulla, Eduard Ayguad\\'e, Jes\\'us Labarta, Toyotaro Suzumura, Ulises Cort\\'es","submitted_at":"2016-11-28T11:47:52Z","abstract_excerpt":"The hyperlink prediction task, that of proposing new links between webpages, can be used to improve search engines, expand the visibility of web pages, and increase the connectivity and navigability of the web. Hyperlink prediction is typically performed on webgraphs composed by thousands or millions of vertices, where on average each webpage contains less than fifty links. Algorithms processing graphs so large and sparse require to be both scalable and precise, a challenging combination. Similarity-based algorithms are among the most scalable solutions within the link prediction field, due to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09084","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:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLRVC0TeBK43w7NATKcxRepvVEfo+6BN0MSZxsOdaqx36JyyAMECIPiJHTf/irsNpqOnmjYpAs8sIeDeXZsvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:30:53.885566Z"},"content_sha256":"8e8b0303781e009e2dece636b2b75d33d597b32c39a5b82c8f4ca4f364e4921e","schema_version":"1.0","event_id":"sha256:8e8b0303781e009e2dece636b2b75d33d597b32c39a5b82c8f4ca4f364e4921e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/bundle.json","state_url":"https://pith.science/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/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-30T07:30:53Z","links":{"resolver":"https://pith.science/pith/32I7SXP5VSFSVYWSO3OU23L4WJ","bundle":"https://pith.science/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/bundle.json","state":"https://pith.science/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32I7SXP5VSFSVYWSO3OU23L4WJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:32I7SXP5VSFSVYWSO3OU23L4WJ","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":"b50f53ae07855f2de3251fd2b40c15309fced7d29a3316ff765d07ac1af90f17","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:47:52Z","title_canon_sha256":"abd5570ea723c36d3697887e4b779bd874e9ad286d40f2fd47056ae2335bc3b7"},"schema_version":"1.0","source":{"id":"1611.09084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09084","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09084v1","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09084","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"32I7SXP5VSFS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32I7SXP5VSFSVYWS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32I7SXP5","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8e8b0303781e009e2dece636b2b75d33d597b32c39a5b82c8f4ca4f364e4921e","target":"graph","created_at":"2026-05-18T00:56:29Z","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":"The hyperlink prediction task, that of proposing new links between webpages, can be used to improve search engines, expand the visibility of web pages, and increase the connectivity and navigability of the web. Hyperlink prediction is typically performed on webgraphs composed by thousands or millions of vertices, where on average each webpage contains less than fifty links. Algorithms processing graphs so large and sparse require to be both scalable and precise, a challenging combination. Similarity-based algorithms are among the most scalable solutions within the link prediction field, due to","authors_text":"Dario Garcia-Gasulla, Eduard Ayguad\\'e, Jes\\'us Labarta, Toyotaro Suzumura, Ulises Cort\\'es","cross_cats":["cs.IR","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:47:52Z","title":"Hierarchical Hyperlink Prediction for the WWW"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09084","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:fdbe08fc0d9910af9be1cac6d74e5e3888bfb170ecfa34dd9b45d2768b41df40","target":"record","created_at":"2026-05-18T00:56:29Z","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":"b50f53ae07855f2de3251fd2b40c15309fced7d29a3316ff765d07ac1af90f17","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:47:52Z","title_canon_sha256":"abd5570ea723c36d3697887e4b779bd874e9ad286d40f2fd47056ae2335bc3b7"},"schema_version":"1.0","source":{"id":"1611.09084","kind":"arxiv","version":1}},"canonical_sha256":"de91f95dfdac8b2ae2d276dd4d6d7cb24e8171a07ef23b91e0b8783012c3f52b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de91f95dfdac8b2ae2d276dd4d6d7cb24e8171a07ef23b91e0b8783012c3f52b","first_computed_at":"2026-05-18T00:56:29.224012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:29.224012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izhExu6EGygmdQmtLEaW3mOrImHoCto125/yPCvKHjiaw4OA3zarWilHw6HSOC74TOTXI64OA/Ea99uPEMClAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:29.224668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdbe08fc0d9910af9be1cac6d74e5e3888bfb170ecfa34dd9b45d2768b41df40","sha256:8e8b0303781e009e2dece636b2b75d33d597b32c39a5b82c8f4ca4f364e4921e"],"state_sha256":"ec03a6832dd83d927c7e66091623b2ae4923ee88de6d107a4e545a5c3d4ffbaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I11gP4efTkMiDdN1TKYJPjeO/JRTi3MxAtWWH+HUj+ctEe2H8PX56Et5oea65Jt4gTwW4qnkNJcdPDMtoIpzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:30:53.887873Z","bundle_sha256":"a51eb00ad26506231332156e99f68e067ecc65580e416bb5179f4d72e07ac886"}}