{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TRCSUJHKDDFK4KQCFRABZGDK2Q","short_pith_number":"pith:TRCSUJHK","schema_version":"1.0","canonical_sha256":"9c452a24ea18caae2a022c401c986ad42d8d390cc66defdd9b0b9475135708e4","source":{"kind":"arxiv","id":"2405.12521","version":1},"attestation_state":"computed","paper":{"title":"Unleash Graph Neural Networks from Heavy Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andi Han, Dai Shi, Junbin Gao, Lequan Lin, Zhiyong Wang","submitted_at":"2024-05-21T06:23:47Z","abstract_excerpt":"Graph Neural Networks (GNNs) are deep-learning architectures designed for graph-type data, where understanding relationships among individual observations is crucial. However, achieving promising GNN performance, especially on unseen data, requires comprehensive hyperparameter tuning and meticulous training. Unfortunately, these processes come with high computational costs and significant human effort. Additionally, conventional searching algorithms such as grid search may result in overfitting on validation data, diminishing generalization accuracy. To tackle these challenges, we propose a gr"},"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":"2405.12521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-21T06:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"a58ff6b586a8f1a92202cc55716b314db223d16518fad1cfd58d0fda13b84a52","abstract_canon_sha256":"a652fb8cf0a47535cc1e97e18b1d36c695e790a90e51eb9659ba498c1f1d5d99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:21.240180Z","signature_b64":"6wwzvmLekSD+EoLVLggcXeNlguZzBfFX+SFIXfaeRnMs8Yq3YsWObMl56eT5vVssDEdainyldS0D9MbsXnoHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c452a24ea18caae2a022c401c986ad42d8d390cc66defdd9b0b9475135708e4","last_reissued_at":"2026-07-05T08:21:21.239821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:21.239821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unleash Graph Neural Networks from Heavy Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andi Han, Dai Shi, Junbin Gao, Lequan Lin, Zhiyong Wang","submitted_at":"2024-05-21T06:23:47Z","abstract_excerpt":"Graph Neural Networks (GNNs) are deep-learning architectures designed for graph-type data, where understanding relationships among individual observations is crucial. However, achieving promising GNN performance, especially on unseen data, requires comprehensive hyperparameter tuning and meticulous training. Unfortunately, these processes come with high computational costs and significant human effort. Additionally, conventional searching algorithms such as grid search may result in overfitting on validation data, diminishing generalization accuracy. To tackle these challenges, we propose a gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12521","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/2405.12521/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":"2405.12521","created_at":"2026-07-05T08:21:21.239884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12521v1","created_at":"2026-07-05T08:21:21.239884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12521","created_at":"2026-07-05T08:21:21.239884+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRCSUJHKDDFK","created_at":"2026-07-05T08:21:21.239884+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRCSUJHKDDFK4KQC","created_at":"2026-07-05T08:21:21.239884+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRCSUJHK","created_at":"2026-07-05T08:21:21.239884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11587","citing_title":"Recurrent Diffusion for Large-Scale Parameter Generation","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q","json":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q.json","graph_json":"https://pith.science/api/pith-number/TRCSUJHKDDFK4KQCFRABZGDK2Q/graph.json","events_json":"https://pith.science/api/pith-number/TRCSUJHKDDFK4KQCFRABZGDK2Q/events.json","paper":"https://pith.science/paper/TRCSUJHK"},"agent_actions":{"view_html":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q","download_json":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q.json","view_paper":"https://pith.science/paper/TRCSUJHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12521&json=true","fetch_graph":"https://pith.science/api/pith-number/TRCSUJHKDDFK4KQCFRABZGDK2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/TRCSUJHKDDFK4KQCFRABZGDK2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q/action/storage_attestation","attest_author":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q/action/author_attestation","sign_citation":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q/action/citation_signature","submit_replication":"https://pith.science/pith/TRCSUJHKDDFK4KQCFRABZGDK2Q/action/replication_record"}},"created_at":"2026-07-05T08:21:21.239884+00:00","updated_at":"2026-07-05T08:21:21.239884+00:00"}