{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HIAQEJLMMJMGF73CBWQJUO5Z2J","short_pith_number":"pith:HIAQEJLM","schema_version":"1.0","canonical_sha256":"3a0102256c625862ff620da09a3bb9d244c291d10efc02274c0d8460077b14a2","source":{"kind":"arxiv","id":"1206.2199","version":3},"attestation_state":"computed","paper":{"title":"Predicting link directions via a recursive subgraph-based ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Fangjian Guo, Tao Zhou, Zimo Yang","submitted_at":"2012-06-11T13:38:04Z","abstract_excerpt":"Link directions are essential to the functionality of networks and their prediction is helpful towards a better knowledge of directed networks from incomplete real-world data. We study the problem of predicting the directions of some links by using the existence and directions of the rest of links. We propose a solution by first ranking nodes in a specific order and then predicting each link as stemming from a lower-ranked node towards a higher-ranked one. The proposed ranking method works recursively by utilizing local indicators on multiple scales, each corresponding to a subgraph extracted "},"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":"1206.2199","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-06-11T13:38:04Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"71177cc7f182c843972252b739edd86ba8172717392619ae5fb0d453b8080f51","abstract_canon_sha256":"468df8c1d2c6c77f3191f28275435e5b1591adb3c3bb606f96c1a6159b6712d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:31.811665Z","signature_b64":"ZagOlKLusYsDQxLUjyNfcaVpsTCZ5sv7gIidSRiwnMJPsotAeP7e5dkjDrvyJ0EE8hSZ+Husx9zmDlRNyR+6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a0102256c625862ff620da09a3bb9d244c291d10efc02274c0d8460077b14a2","last_reissued_at":"2026-05-18T03:18:31.810957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:31.810957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting link directions via a recursive subgraph-based ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Fangjian Guo, Tao Zhou, Zimo Yang","submitted_at":"2012-06-11T13:38:04Z","abstract_excerpt":"Link directions are essential to the functionality of networks and their prediction is helpful towards a better knowledge of directed networks from incomplete real-world data. We study the problem of predicting the directions of some links by using the existence and directions of the rest of links. We propose a solution by first ranking nodes in a specific order and then predicting each link as stemming from a lower-ranked node towards a higher-ranked one. The proposed ranking method works recursively by utilizing local indicators on multiple scales, each corresponding to a subgraph extracted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2199","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.2199","created_at":"2026-05-18T03:18:31.811064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2199v3","created_at":"2026-05-18T03:18:31.811064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2199","created_at":"2026-05-18T03:18:31.811064+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIAQEJLMMJMG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIAQEJLMMJMGF73C","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIAQEJLM","created_at":"2026-05-18T12:27:09.501522+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/HIAQEJLMMJMGF73CBWQJUO5Z2J","json":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J.json","graph_json":"https://pith.science/api/pith-number/HIAQEJLMMJMGF73CBWQJUO5Z2J/graph.json","events_json":"https://pith.science/api/pith-number/HIAQEJLMMJMGF73CBWQJUO5Z2J/events.json","paper":"https://pith.science/paper/HIAQEJLM"},"agent_actions":{"view_html":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J","download_json":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J.json","view_paper":"https://pith.science/paper/HIAQEJLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2199&json=true","fetch_graph":"https://pith.science/api/pith-number/HIAQEJLMMJMGF73CBWQJUO5Z2J/graph.json","fetch_events":"https://pith.science/api/pith-number/HIAQEJLMMJMGF73CBWQJUO5Z2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J/action/storage_attestation","attest_author":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J/action/author_attestation","sign_citation":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J/action/citation_signature","submit_replication":"https://pith.science/pith/HIAQEJLMMJMGF73CBWQJUO5Z2J/action/replication_record"}},"created_at":"2026-05-18T03:18:31.811064+00:00","updated_at":"2026-05-18T03:18:31.811064+00:00"}