{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZRPCI7SNN2E6T7AK6Z5YMWUJ2T","short_pith_number":"pith:ZRPCI7SN","schema_version":"1.0","canonical_sha256":"cc5e247e4d6e89e9fc0af67b865a89d4d910133f27370aed4036dfcc95d5ae5b","source":{"kind":"arxiv","id":"2111.00064","version":3},"attestation_state":"computed","paper":{"title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Eli Chien, Hsiang-Fu Yu, Inderjit S Dhillon, Jiong Zhang, Olgica Milenkovic, Wei-Cheng Chang","submitted_at":"2021-10-29T19:55:12Z","abstract_excerpt":"Learning on graphs has attracted significant attention in the learning community due to numerous real-world applications. In particular, graph neural networks (GNNs), which take numerical node features and graph structure as inputs, have been shown to achieve state-of-the-art performance on various graph-related learning tasks. Recent works exploring the correlation between numerical node features and graph structure via self-supervised learning have paved the way for further performance improvements of GNNs. However, methods used for extracting numerical node features from raw data are still "},"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":"2111.00064","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-29T19:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"d9db156be967715627666bd3995d66418c208085f0eb885487b3751256489d7e","abstract_canon_sha256":"8f7c044744a355d802904c9715fa23861b031ee226ed7b26412b0f91a62b8bd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:55.149991Z","signature_b64":"iEKacaF0ntIC+7nQMtbCr0s4k4wiWwF4w0kH+cgVLHQsJuT3pYni2624ubi5bPU/sRkPfOBbnGVQrXd/0myGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc5e247e4d6e89e9fc0af67b865a89d4d910133f27370aed4036dfcc95d5ae5b","last_reissued_at":"2026-07-05T04:03:55.149556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:55.149556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Eli Chien, Hsiang-Fu Yu, Inderjit S Dhillon, Jiong Zhang, Olgica Milenkovic, Wei-Cheng Chang","submitted_at":"2021-10-29T19:55:12Z","abstract_excerpt":"Learning on graphs has attracted significant attention in the learning community due to numerous real-world applications. In particular, graph neural networks (GNNs), which take numerical node features and graph structure as inputs, have been shown to achieve state-of-the-art performance on various graph-related learning tasks. Recent works exploring the correlation between numerical node features and graph structure via self-supervised learning have paved the way for further performance improvements of GNNs. However, methods used for extracting numerical node features from raw data are still "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00064","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/2111.00064/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":"2111.00064","created_at":"2026-07-05T04:03:55.149614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00064v3","created_at":"2026-07-05T04:03:55.149614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00064","created_at":"2026-07-05T04:03:55.149614+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRPCI7SNN2E6","created_at":"2026-07-05T04:03:55.149614+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRPCI7SNN2E6T7AK","created_at":"2026-07-05T04:03:55.149614+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRPCI7SN","created_at":"2026-07-05T04:03:55.149614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.01410","citing_title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12814","citing_title":"Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17411","citing_title":"DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs","ref_index":120,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T","json":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T.json","graph_json":"https://pith.science/api/pith-number/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/graph.json","events_json":"https://pith.science/api/pith-number/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/events.json","paper":"https://pith.science/paper/ZRPCI7SN"},"agent_actions":{"view_html":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T","download_json":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T.json","view_paper":"https://pith.science/paper/ZRPCI7SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00064&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/action/storage_attestation","attest_author":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/action/author_attestation","sign_citation":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/action/citation_signature","submit_replication":"https://pith.science/pith/ZRPCI7SNN2E6T7AK6Z5YMWUJ2T/action/replication_record"}},"created_at":"2026-07-05T04:03:55.149614+00:00","updated_at":"2026-07-05T04:03:55.149614+00:00"}