{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UJWYXLSCGF4NUYH7Z2LJHRZ3FB","short_pith_number":"pith:UJWYXLSC","schema_version":"1.0","canonical_sha256":"a26d8bae423178da60ffce9693c73b287852f7528b1be2a1cb928dfa969d301e","source":{"kind":"arxiv","id":"2309.15728","version":2},"attestation_state":"computed","paper":{"title":"Line Graph Neural Networks for Link Weight Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chengyi Xia, Cunlai Pu, Jinbi Liang, Xiangbo Shu, Yongxiang Xia","submitted_at":"2023-09-27T15:34:44Z","abstract_excerpt":"In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the prediction performance. In this paper, we propose a new link weight prediction method, namely Line Graph Neural Networks for Link Weight Prediction (LGLWP), which learns deeper graph features through deep learning. In our method, we first extract the enclosing subgraph around a target link and then employ a weighted graph labeling algorithm to label the subgraph n"},"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":"2309.15728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-09-27T15:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"588f08e5b2b5d28c33acac9ec37951a63b6117964c1eec0ffa8d9832e99aae8b","abstract_canon_sha256":"fb78ce3b29a11802c35e41477be319022a935c5b768f496cc2864f2eeee41647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:56.164353Z","signature_b64":"OygnSWc36GR3SBjeONTQ6V0tZq6fZp9WPfLn6Iowb9k98rVXw0GPNEQo4m3z/h9xoz/d3xlrM/rn9HQKfFBdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a26d8bae423178da60ffce9693c73b287852f7528b1be2a1cb928dfa969d301e","last_reissued_at":"2026-07-05T09:26:56.163892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:56.163892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line Graph Neural Networks for Link Weight Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chengyi Xia, Cunlai Pu, Jinbi Liang, Xiangbo Shu, Yongxiang Xia","submitted_at":"2023-09-27T15:34:44Z","abstract_excerpt":"In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the prediction performance. In this paper, we propose a new link weight prediction method, namely Line Graph Neural Networks for Link Weight Prediction (LGLWP), which learns deeper graph features through deep learning. In our method, we first extract the enclosing subgraph around a target link and then employ a weighted graph labeling algorithm to label the subgraph n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15728","kind":"arxiv","version":2},"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/2309.15728/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":"2309.15728","created_at":"2026-07-05T09:26:56.163950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15728v2","created_at":"2026-07-05T09:26:56.163950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15728","created_at":"2026-07-05T09:26:56.163950+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJWYXLSCGF4N","created_at":"2026-07-05T09:26:56.163950+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJWYXLSCGF4NUYH7","created_at":"2026-07-05T09:26:56.163950+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJWYXLSC","created_at":"2026-07-05T09:26:56.163950+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/UJWYXLSCGF4NUYH7Z2LJHRZ3FB","json":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB.json","graph_json":"https://pith.science/api/pith-number/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/graph.json","events_json":"https://pith.science/api/pith-number/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/events.json","paper":"https://pith.science/paper/UJWYXLSC"},"agent_actions":{"view_html":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB","download_json":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB.json","view_paper":"https://pith.science/paper/UJWYXLSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15728&json=true","fetch_graph":"https://pith.science/api/pith-number/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/graph.json","fetch_events":"https://pith.science/api/pith-number/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/action/storage_attestation","attest_author":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/action/author_attestation","sign_citation":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/action/citation_signature","submit_replication":"https://pith.science/pith/UJWYXLSCGF4NUYH7Z2LJHRZ3FB/action/replication_record"}},"created_at":"2026-07-05T09:26:56.163950+00:00","updated_at":"2026-07-05T09:26:56.163950+00:00"}