{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CMMDI2WQM6RYF74NRW32GKQLI3","short_pith_number":"pith:CMMDI2WQ","schema_version":"1.0","canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","source":{"kind":"arxiv","id":"2407.08064","version":1},"attestation_state":"computed","paper":{"title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Yanning Shen, Yezi Liu","submitted_at":"2024-07-10T21:54:12Z","abstract_excerpt":"Training graph neural networks (GNNs) on large-scale graphs can be challenging due to the high computational expense caused by the massive number of nodes and high-dimensional nodal features. Existing graph condensation studies tackle this problem only by reducing the number of nodes in the graph. However, the resulting condensed graph data can still be cumbersome. Specifically, although the nodes of the Citeseer dataset are reduced to 0.9% (30 nodes) in training, the number of features is 3,703, severely exceeding the training sample magnitude. Faced with this challenge, we study the problem "},"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":"2407.08064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2de0356438f84c3c403dd5567b57085a7040f802425fe728763910250968aef7","abstract_canon_sha256":"9e4c3474b663084c8b763b5b198f8fceea24970453b52751ea34a5b2f08848ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:42.670729Z","signature_b64":"8jzvIgXpPH2HKlBw7kGJwGT7jXCtGuvY6h/1tTOxI2KYYpLoSqkzLUgWzNO2rL00Qka+ECiK4/vykSmFRio2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","last_reissued_at":"2026-07-05T08:42:42.670310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:42.670310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Yanning Shen, Yezi Liu","submitted_at":"2024-07-10T21:54:12Z","abstract_excerpt":"Training graph neural networks (GNNs) on large-scale graphs can be challenging due to the high computational expense caused by the massive number of nodes and high-dimensional nodal features. Existing graph condensation studies tackle this problem only by reducing the number of nodes in the graph. However, the resulting condensed graph data can still be cumbersome. Specifically, although the nodes of the Citeseer dataset are reduced to 0.9% (30 nodes) in training, the number of features is 3,703, severely exceeding the training sample magnitude. Faced with this challenge, we study the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08064","kind":"arxiv","version":1},"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/2407.08064/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":"2407.08064","created_at":"2026-07-05T08:42:42.670378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08064v1","created_at":"2026-07-05T08:42:42.670378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08064","created_at":"2026-07-05T08:42:42.670378+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMMDI2WQM6RY","created_at":"2026-07-05T08:42:42.670378+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMMDI2WQM6RYF74N","created_at":"2026-07-05T08:42:42.670378+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMMDI2WQ","created_at":"2026-07-05T08:42:42.670378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09702","citing_title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3","json":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3.json","graph_json":"https://pith.science/api/pith-number/CMMDI2WQM6RYF74NRW32GKQLI3/graph.json","events_json":"https://pith.science/api/pith-number/CMMDI2WQM6RYF74NRW32GKQLI3/events.json","paper":"https://pith.science/paper/CMMDI2WQ"},"agent_actions":{"view_html":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3","download_json":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3.json","view_paper":"https://pith.science/paper/CMMDI2WQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08064&json=true","fetch_graph":"https://pith.science/api/pith-number/CMMDI2WQM6RYF74NRW32GKQLI3/graph.json","fetch_events":"https://pith.science/api/pith-number/CMMDI2WQM6RYF74NRW32GKQLI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/action/storage_attestation","attest_author":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/action/author_attestation","sign_citation":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/action/citation_signature","submit_replication":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/action/replication_record"}},"created_at":"2026-07-05T08:42:42.670378+00:00","updated_at":"2026-07-05T08:42:42.670378+00:00"}