{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3ESZFPJWXLROPLPIAPJ36IQXMP","short_pith_number":"pith:3ESZFPJW","schema_version":"1.0","canonical_sha256":"d92592bd36bae2e7ade803d3bf221763d46fe76f04bc7c908a8430ecc16f1ae1","source":{"kind":"arxiv","id":"2507.15195","version":2},"attestation_state":"computed","paper":{"title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anwar Said, Mudassir Shabbir, Obaid Ullah Ahmad, Waseem Abbas, Xenofon Koutsoukos, Yifan Wei","submitted_at":"2025-07-21T02:45:55Z","abstract_excerpt":"In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in social network classification tasks. GNNs have proven highly effective in various network-based learning applications and require some form of node features to function. However, their performance is heavily influenced by the expressiveness of these features. In social networks, node features are often unavailable due to privacy constraints or the absence of inherent attributes, making it challenging for GNNs to ach"},"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":"2507.15195","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-21T02:45:55Z","cross_cats_sorted":[],"title_canon_sha256":"75efa5ea3f1dee408c645cb3da74772dff2ccf756f2aa919e0f981797ace76ae","abstract_canon_sha256":"476d8e081ef39fd4e37cdc6afc9dd8698ed81ee15958aed2c5ce2cf772f51c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:57.802303Z","signature_b64":"3Ws2ddNwtl0BPW5DXHEUKx7DQE0hI94rs4sRgyorfHoYv+rEqiRpSDq8ArnFA/I7dAad4kgSyb1jYSC2/LcQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92592bd36bae2e7ade803d3bf221763d46fe76f04bc7c908a8430ecc16f1ae1","last_reissued_at":"2026-07-05T11:40:57.801757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:57.801757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anwar Said, Mudassir Shabbir, Obaid Ullah Ahmad, Waseem Abbas, Xenofon Koutsoukos, Yifan Wei","submitted_at":"2025-07-21T02:45:55Z","abstract_excerpt":"In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in social network classification tasks. GNNs have proven highly effective in various network-based learning applications and require some form of node features to function. However, their performance is heavily influenced by the expressiveness of these features. In social networks, node features are often unavailable due to privacy constraints or the absence of inherent attributes, making it challenging for GNNs to ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15195","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/2507.15195/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":"2507.15195","created_at":"2026-07-05T11:40:57.801812+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15195v2","created_at":"2026-07-05T11:40:57.801812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15195","created_at":"2026-07-05T11:40:57.801812+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ESZFPJWXLRO","created_at":"2026-07-05T11:40:57.801812+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ESZFPJWXLROPLPI","created_at":"2026-07-05T11:40:57.801812+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ESZFPJW","created_at":"2026-07-05T11:40:57.801812+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/3ESZFPJWXLROPLPIAPJ36IQXMP","json":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP.json","graph_json":"https://pith.science/api/pith-number/3ESZFPJWXLROPLPIAPJ36IQXMP/graph.json","events_json":"https://pith.science/api/pith-number/3ESZFPJWXLROPLPIAPJ36IQXMP/events.json","paper":"https://pith.science/paper/3ESZFPJW"},"agent_actions":{"view_html":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP","download_json":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP.json","view_paper":"https://pith.science/paper/3ESZFPJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15195&json=true","fetch_graph":"https://pith.science/api/pith-number/3ESZFPJWXLROPLPIAPJ36IQXMP/graph.json","fetch_events":"https://pith.science/api/pith-number/3ESZFPJWXLROPLPIAPJ36IQXMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP/action/storage_attestation","attest_author":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP/action/author_attestation","sign_citation":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP/action/citation_signature","submit_replication":"https://pith.science/pith/3ESZFPJWXLROPLPIAPJ36IQXMP/action/replication_record"}},"created_at":"2026-07-05T11:40:57.801812+00:00","updated_at":"2026-07-05T11:40:57.801812+00:00"}