{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ULRM25AVVZQVQM6ZZD4VS2JJLO","short_pith_number":"pith:ULRM25AV","schema_version":"1.0","canonical_sha256":"a2e2cd7415ae615833d9c8f95969295b86a51b263d667d8045ba910f02f877e1","source":{"kind":"arxiv","id":"2206.08582","version":1},"attestation_state":"computed","paper":{"title":"DFG-NAS: Deep and Flexible Graph Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wentao Zhang, Yang Li, Yu Shen, Zheyu Lin, Zhi Yang","submitted_at":"2022-06-17T06:47:21Z","abstract_excerpt":"Graph neural networks (GNNs) have been intensively applied to various graph-based applications. Despite their success, manually designing the well-behaved GNNs requires immense human expertise. And thus it is inefficient to discover the potentially optimal data-specific GNN architecture. This paper proposes DFG-NAS, a new neural architecture search (NAS) method that enables the automatic search of very deep and flexible GNN architectures. Unlike most existing methods that focus on micro-architectures, DFG-NAS highlights another level of design: the search for macro-architectures on how atomic "},"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":"2206.08582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-17T06:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"6aace56b29bbe45af58c8b2384dc61781ac4798d4fca55d53c0ec92a1f4ae2ab","abstract_canon_sha256":"6d59ba61a23b8d77b46bd09f41801679f3914a1a387de23d5847e5b3569c3df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:31.491363Z","signature_b64":"xb5e/qUsYzT5AWoUjxyNzAEbPVrxv5JeEhZTCWjzfar/i4WaIK/fxW/J9QlReffoXZIczO0F0bCYiJSYDZh2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e2cd7415ae615833d9c8f95969295b86a51b263d667d8045ba910f02f877e1","last_reissued_at":"2026-07-05T04:32:31.490827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:31.490827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DFG-NAS: Deep and Flexible Graph Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wentao Zhang, Yang Li, Yu Shen, Zheyu Lin, Zhi Yang","submitted_at":"2022-06-17T06:47:21Z","abstract_excerpt":"Graph neural networks (GNNs) have been intensively applied to various graph-based applications. Despite their success, manually designing the well-behaved GNNs requires immense human expertise. And thus it is inefficient to discover the potentially optimal data-specific GNN architecture. This paper proposes DFG-NAS, a new neural architecture search (NAS) method that enables the automatic search of very deep and flexible GNN architectures. Unlike most existing methods that focus on micro-architectures, DFG-NAS highlights another level of design: the search for macro-architectures on how atomic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08582","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/2206.08582/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":"2206.08582","created_at":"2026-07-05T04:32:31.490887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.08582v1","created_at":"2026-07-05T04:32:31.490887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08582","created_at":"2026-07-05T04:32:31.490887+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULRM25AVVZQV","created_at":"2026-07-05T04:32:31.490887+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULRM25AVVZQVQM6Z","created_at":"2026-07-05T04:32:31.490887+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULRM25AV","created_at":"2026-07-05T04:32:31.490887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07598","citing_title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO","json":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO.json","graph_json":"https://pith.science/api/pith-number/ULRM25AVVZQVQM6ZZD4VS2JJLO/graph.json","events_json":"https://pith.science/api/pith-number/ULRM25AVVZQVQM6ZZD4VS2JJLO/events.json","paper":"https://pith.science/paper/ULRM25AV"},"agent_actions":{"view_html":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO","download_json":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO.json","view_paper":"https://pith.science/paper/ULRM25AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.08582&json=true","fetch_graph":"https://pith.science/api/pith-number/ULRM25AVVZQVQM6ZZD4VS2JJLO/graph.json","fetch_events":"https://pith.science/api/pith-number/ULRM25AVVZQVQM6ZZD4VS2JJLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO/action/storage_attestation","attest_author":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO/action/author_attestation","sign_citation":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO/action/citation_signature","submit_replication":"https://pith.science/pith/ULRM25AVVZQVQM6ZZD4VS2JJLO/action/replication_record"}},"created_at":"2026-07-05T04:32:31.490887+00:00","updated_at":"2026-07-05T04:32:31.490887+00:00"}