{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Z7O4D53X7D7ORRPJM2KFKLCN7A","short_pith_number":"pith:Z7O4D53X","schema_version":"1.0","canonical_sha256":"cfddc1f777f8fee8c5e96694552c4df8313962f4729cbda24ba8653b21bd7f45","source":{"kind":"arxiv","id":"2008.11652","version":2},"attestation_state":"computed","paper":{"title":"Simplifying Architecture Search for Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Huan Zhao, Lanning Wei, Quanming Yao","submitted_at":"2020-08-26T16:24:03Z","abstract_excerpt":"Recent years have witnessed the popularity of Graph Neural Networks (GNN) in various scenarios. To obtain optimal data-specific GNN architectures, researchers turn to neural architecture search (NAS) methods, which have made impressive progress in discovering effective architectures in convolutional neural networks. Two preliminary works, GraphNAS and Auto-GNN, have made first attempt to apply NAS methods to GNN. Despite the promising results, there are several drawbacks in expressive capability and search efficiency of GraphNAS and Auto-GNN due to the designed search space. To overcome these "},"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":"2008.11652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-26T16:24:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3d617c25c499b48792d4d34c3e22034e841351124e986c9f6250e2f7ebce5f2a","abstract_canon_sha256":"18541e799529a87bed66f9ceff8b6ea17217ffc1a5b62710142ca765b2b137d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:22.694334Z","signature_b64":"aLeitEUDDlxNw0OATkVJvVvIZXHTf0vVrI2oGJrs+mC4tyQx+CRka5DVhETdL6K6qkNF2bnW0eOJbAN2/rLjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfddc1f777f8fee8c5e96694552c4df8313962f4729cbda24ba8653b21bd7f45","last_reissued_at":"2026-07-05T01:33:22.693839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:22.693839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Architecture Search for Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Huan Zhao, Lanning Wei, Quanming Yao","submitted_at":"2020-08-26T16:24:03Z","abstract_excerpt":"Recent years have witnessed the popularity of Graph Neural Networks (GNN) in various scenarios. To obtain optimal data-specific GNN architectures, researchers turn to neural architecture search (NAS) methods, which have made impressive progress in discovering effective architectures in convolutional neural networks. Two preliminary works, GraphNAS and Auto-GNN, have made first attempt to apply NAS methods to GNN. Despite the promising results, there are several drawbacks in expressive capability and search efficiency of GraphNAS and Auto-GNN due to the designed search space. To overcome these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.11652","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/2008.11652/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":"2008.11652","created_at":"2026-07-05T01:33:22.693894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.11652v2","created_at":"2026-07-05T01:33:22.693894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.11652","created_at":"2026-07-05T01:33:22.693894+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7O4D53X7D7O","created_at":"2026-07-05T01:33:22.693894+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7O4D53X7D7ORRPJ","created_at":"2026-07-05T01:33:22.693894+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7O4D53X","created_at":"2026-07-05T01:33:22.693894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.13228","citing_title":"Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive","ref_index":203,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A","json":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A.json","graph_json":"https://pith.science/api/pith-number/Z7O4D53X7D7ORRPJM2KFKLCN7A/graph.json","events_json":"https://pith.science/api/pith-number/Z7O4D53X7D7ORRPJM2KFKLCN7A/events.json","paper":"https://pith.science/paper/Z7O4D53X"},"agent_actions":{"view_html":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A","download_json":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A.json","view_paper":"https://pith.science/paper/Z7O4D53X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.11652&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7O4D53X7D7ORRPJM2KFKLCN7A/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7O4D53X7D7ORRPJM2KFKLCN7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A/action/storage_attestation","attest_author":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A/action/author_attestation","sign_citation":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A/action/citation_signature","submit_replication":"https://pith.science/pith/Z7O4D53X7D7ORRPJM2KFKLCN7A/action/replication_record"}},"created_at":"2026-07-05T01:33:22.693894+00:00","updated_at":"2026-07-05T01:33:22.693894+00:00"}