{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TJRCZ7RCZPKKU5YH6KH3UN7VZS","short_pith_number":"pith:TJRCZ7RC","schema_version":"1.0","canonical_sha256":"9a622cfe22cbd4aa7707f28fba37f5ccbf9e78fb095902e469bb39f3a78acca9","source":{"kind":"arxiv","id":"2402.07999","version":3},"attestation_state":"computed","paper":{"title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Christos Faloutsos, Da Zheng, Haiyang Yu, Jian Zhang, Meng-Chieh Lee, Soji Adeshina, Vassilis N. Ioannidis, Xiang Song","submitted_at":"2024-02-12T19:04:32Z","abstract_excerpt":"Given a node-attributed graph, and a graph task (link prediction or node classification), can we tell if a graph neural network (GNN) will perform well? More specifically, do the graph structure and the node features carry enough usable information for the task? Our goals are (1) to develop a fast tool to measure how much information is in the graph structure and in the node features, and (2) to exploit the information to solve the task, if there is enough. We propose NetInfoF, a framework including NetInfoF_Probe and NetInfoF_Act, for the measurement and the exploitation of network usable inf"},"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":"2402.07999","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T19:04:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"547fb3a419f582c6e723f59f714897b40aaa6580fc41077ae3c37c524e9d7fbb","abstract_canon_sha256":"fa30f7dd52f4c199f19d793c6bf7c4671d3d60adb531b92474d768475d38a5aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:27.531281Z","signature_b64":"ArVxrrKC+oAhE1J+rf0K1OMNySoByUNE6nLPaWY/SGeFytA6T3a0pW5YvTrD+pWVoBfTNazDLOmdMLku6xc+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a622cfe22cbd4aa7707f28fba37f5ccbf9e78fb095902e469bb39f3a78acca9","last_reissued_at":"2026-07-05T07:58:27.530747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:27.530747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Christos Faloutsos, Da Zheng, Haiyang Yu, Jian Zhang, Meng-Chieh Lee, Soji Adeshina, Vassilis N. Ioannidis, Xiang Song","submitted_at":"2024-02-12T19:04:32Z","abstract_excerpt":"Given a node-attributed graph, and a graph task (link prediction or node classification), can we tell if a graph neural network (GNN) will perform well? More specifically, do the graph structure and the node features carry enough usable information for the task? Our goals are (1) to develop a fast tool to measure how much information is in the graph structure and in the node features, and (2) to exploit the information to solve the task, if there is enough. We propose NetInfoF, a framework including NetInfoF_Probe and NetInfoF_Act, for the measurement and the exploitation of network usable inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07999","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.07999/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":"2402.07999","created_at":"2026-07-05T07:58:27.530813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07999v3","created_at":"2026-07-05T07:58:27.530813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07999","created_at":"2026-07-05T07:58:27.530813+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJRCZ7RCZPKK","created_at":"2026-07-05T07:58:27.530813+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJRCZ7RCZPKKU5YH","created_at":"2026-07-05T07:58:27.530813+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJRCZ7RC","created_at":"2026-07-05T07:58:27.530813+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/TJRCZ7RCZPKKU5YH6KH3UN7VZS","json":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS.json","graph_json":"https://pith.science/api/pith-number/TJRCZ7RCZPKKU5YH6KH3UN7VZS/graph.json","events_json":"https://pith.science/api/pith-number/TJRCZ7RCZPKKU5YH6KH3UN7VZS/events.json","paper":"https://pith.science/paper/TJRCZ7RC"},"agent_actions":{"view_html":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS","download_json":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS.json","view_paper":"https://pith.science/paper/TJRCZ7RC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07999&json=true","fetch_graph":"https://pith.science/api/pith-number/TJRCZ7RCZPKKU5YH6KH3UN7VZS/graph.json","fetch_events":"https://pith.science/api/pith-number/TJRCZ7RCZPKKU5YH6KH3UN7VZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS/action/storage_attestation","attest_author":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS/action/author_attestation","sign_citation":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS/action/citation_signature","submit_replication":"https://pith.science/pith/TJRCZ7RCZPKKU5YH6KH3UN7VZS/action/replication_record"}},"created_at":"2026-07-05T07:58:27.530813+00:00","updated_at":"2026-07-05T07:58:27.530813+00:00"}