{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NGR5OPG334JXZ4MTWSIXDYJW35","short_pith_number":"pith:NGR5OPG3","schema_version":"1.0","canonical_sha256":"69a3d73cdbdf137cf193b49171e136df7b20ed1623b44e887cbd0627131b3a6b","source":{"kind":"arxiv","id":"1909.01076","version":1},"attestation_state":"computed","paper":{"title":"Link Prediction in Networks Using Effective Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","math.SP"],"primary_cat":"cs.SI","authors_text":"Benjamin Webb, Bryn Balls-Barker","submitted_at":"2019-08-12T23:32:25Z","abstract_excerpt":"We introduce a new method for predicting the formation of links in real-world networks, which we refer to as the method of effective transitions. This method relies on the theory of isospectral matrix reductions to compute the probability of eventually transitioning from one vertex to another in a (biased) random walk on the network. Unlike the large majority of link prediction techniques, this method can be used to predict links in networks that are directed or undirected which are either weighted or unweighted. We apply this method to a number of social, technological, and natural networks a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1909.01076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-12T23:32:25Z","cross_cats_sorted":["math.CO","math.PR","math.SP"],"title_canon_sha256":"21142c1c7bfc645871e1e627eedcaed06f92b774df25503ee8365f4faeeef7cd","abstract_canon_sha256":"a11670596e9187985abe41ae7353323037c6394ba1a008dc962f8af52b1410ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:15.685429Z","signature_b64":"i89w/xzGtKAXiQ3uZou8MpmZzMFW/Xk0JMIe8TAGaQKr+/R2iJVNF0BmOQOHMHC6IekFCgDjiqrZQ+6y+y6kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a3d73cdbdf137cf193b49171e136df7b20ed1623b44e887cbd0627131b3a6b","last_reissued_at":"2026-07-05T00:01:15.684959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:15.684959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link Prediction in Networks Using Effective Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","math.SP"],"primary_cat":"cs.SI","authors_text":"Benjamin Webb, Bryn Balls-Barker","submitted_at":"2019-08-12T23:32:25Z","abstract_excerpt":"We introduce a new method for predicting the formation of links in real-world networks, which we refer to as the method of effective transitions. This method relies on the theory of isospectral matrix reductions to compute the probability of eventually transitioning from one vertex to another in a (biased) random walk on the network. Unlike the large majority of link prediction techniques, this method can be used to predict links in networks that are directed or undirected which are either weighted or unweighted. We apply this method to a number of social, technological, and natural networks a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01076","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.01076/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1909.01076","created_at":"2026-07-05T00:01:15.685025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01076v1","created_at":"2026-07-05T00:01:15.685025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01076","created_at":"2026-07-05T00:01:15.685025+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGR5OPG334JX","created_at":"2026-07-05T00:01:15.685025+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGR5OPG334JXZ4MT","created_at":"2026-07-05T00:01:15.685025+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGR5OPG3","created_at":"2026-07-05T00:01:15.685025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35","json":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35.json","graph_json":"https://pith.science/api/pith-number/NGR5OPG334JXZ4MTWSIXDYJW35/graph.json","events_json":"https://pith.science/api/pith-number/NGR5OPG334JXZ4MTWSIXDYJW35/events.json","paper":"https://pith.science/paper/NGR5OPG3"},"agent_actions":{"view_html":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35","download_json":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35.json","view_paper":"https://pith.science/paper/NGR5OPG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01076&json=true","fetch_graph":"https://pith.science/api/pith-number/NGR5OPG334JXZ4MTWSIXDYJW35/graph.json","fetch_events":"https://pith.science/api/pith-number/NGR5OPG334JXZ4MTWSIXDYJW35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35/action/storage_attestation","attest_author":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35/action/author_attestation","sign_citation":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35/action/citation_signature","submit_replication":"https://pith.science/pith/NGR5OPG334JXZ4MTWSIXDYJW35/action/replication_record"}},"created_at":"2026-07-05T00:01:15.685025+00:00","updated_at":"2026-07-05T00:01:15.685025+00:00"}