{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QMNL4ZV6TCFIJTSC4CC2LKKFEV","short_pith_number":"pith:QMNL4ZV6","canonical_record":{"source":{"id":"2412.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-03T06:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"d8e81527985a491729b31a4ec98f9bf1cbcc6cf0ce1a9b9443163e99a62b5a6b","abstract_canon_sha256":"e22c4c5923087cd506f4e5a918369717993e8e9b9911949cb979523ebf76eea4"},"schema_version":"1.0"},"canonical_sha256":"831abe66be988a84ce42e085a5a9452555aee9d467699b9be5c843e6a986856d","source":{"kind":"arxiv","id":"2412.02196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02196","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02196v1","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02196","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"QMNL4ZV6TCFI","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_16","alias_value":"QMNL4ZV6TCFIJTSC","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_8","alias_value":"QMNL4ZV6","created_at":"2026-07-05T09:43:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QMNL4ZV6TCFIJTSC4CC2LKKFEV","target":"record","payload":{"canonical_record":{"source":{"id":"2412.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-03T06:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"d8e81527985a491729b31a4ec98f9bf1cbcc6cf0ce1a9b9443163e99a62b5a6b","abstract_canon_sha256":"e22c4c5923087cd506f4e5a918369717993e8e9b9911949cb979523ebf76eea4"},"schema_version":"1.0"},"canonical_sha256":"831abe66be988a84ce42e085a5a9452555aee9d467699b9be5c843e6a986856d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:45.893233Z","signature_b64":"WkBlHIwep9SLcW14FZ3U6r3pQE4FmNjMM7B1SMLHtFqsxPiHVFAE8EAllF6jf1D5fPYDBVAGSM1eIQxOWFtkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831abe66be988a84ce42e085a5a9452555aee9d467699b9be5c843e6a986856d","last_reissued_at":"2026-07-05T09:43:45.892761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:45.892761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.02196","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDLisQQlp00qRBZjjLnZKpVJ3Qu5t7o8nDQkI5ueOUQ5i2VucCkIIr6TqA5GOduLZOgGGiCRuft0Oh3ZC4J8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:23:26.035492Z"},"content_sha256":"3847d9cbaf910555395cd9602c7872c2252c03bf3766fa5a6b2e404a94aa2bbf","schema_version":"1.0","event_id":"sha256:3847d9cbaf910555395cd9602c7872c2252c03bf3766fa5a6b2e404a94aa2bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QMNL4ZV6TCFIJTSC4CC2LKKFEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunfeng Yuan, Guanghui Zhu, Jingyan Chen, Limin Wang, Yihua Huang, Zipeng Ji","submitted_at":"2024-12-03T06:21:35Z","abstract_excerpt":"GNAS (Graph Neural Architecture Search) has demonstrated great effectiveness in automatically designing the optimal graph neural architectures for multiple downstream tasks, such as node classification and link prediction. However, most existing GNAS methods cannot efficiently handle large-scale graphs containing more than million-scale nodes and edges due to the expensive computational and memory overhead. To scale GNAS on large graphs while achieving better performance, we propose SA-GNAS, a novel framework based on seed architecture expansion for efficient large-scale GNAS. Similar to the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02196","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/2412.02196/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JajwTWe3Abj7PX4BzikrvPwomBi13Vs2hMWGV7Uf9MsmckgPbmAvIRutov7JqJp7L9HmrGxdUpF0Ag4DM3DiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:23:26.035991Z"},"content_sha256":"b18d66213bf863932fd360efb733738b4d055f3b7e0144d5cc14ac82af661a09","schema_version":"1.0","event_id":"sha256:b18d66213bf863932fd360efb733738b4d055f3b7e0144d5cc14ac82af661a09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/bundle.json","state_url":"https://pith.science/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T09:23:26Z","links":{"resolver":"https://pith.science/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV","bundle":"https://pith.science/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/bundle.json","state":"https://pith.science/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMNL4ZV6TCFIJTSC4CC2LKKFEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QMNL4ZV6TCFIJTSC4CC2LKKFEV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e22c4c5923087cd506f4e5a918369717993e8e9b9911949cb979523ebf76eea4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-03T06:21:35Z","title_canon_sha256":"d8e81527985a491729b31a4ec98f9bf1cbcc6cf0ce1a9b9443163e99a62b5a6b"},"schema_version":"1.0","source":{"id":"2412.02196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02196","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02196v1","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02196","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"QMNL4ZV6TCFI","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_16","alias_value":"QMNL4ZV6TCFIJTSC","created_at":"2026-07-05T09:43:45Z"},{"alias_kind":"pith_short_8","alias_value":"QMNL4ZV6","created_at":"2026-07-05T09:43:45Z"}],"graph_snapshots":[{"event_id":"sha256:b18d66213bf863932fd360efb733738b4d055f3b7e0144d5cc14ac82af661a09","target":"graph","created_at":"2026-07-05T09:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.02196/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"GNAS (Graph Neural Architecture Search) has demonstrated great effectiveness in automatically designing the optimal graph neural architectures for multiple downstream tasks, such as node classification and link prediction. However, most existing GNAS methods cannot efficiently handle large-scale graphs containing more than million-scale nodes and edges due to the expensive computational and memory overhead. To scale GNAS on large graphs while achieving better performance, we propose SA-GNAS, a novel framework based on seed architecture expansion for efficient large-scale GNAS. Similar to the c","authors_text":"Chunfeng Yuan, Guanghui Zhu, Jingyan Chen, Limin Wang, Yihua Huang, Zipeng Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-03T06:21:35Z","title":"SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02196","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3847d9cbaf910555395cd9602c7872c2252c03bf3766fa5a6b2e404a94aa2bbf","target":"record","created_at":"2026-07-05T09:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e22c4c5923087cd506f4e5a918369717993e8e9b9911949cb979523ebf76eea4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-03T06:21:35Z","title_canon_sha256":"d8e81527985a491729b31a4ec98f9bf1cbcc6cf0ce1a9b9443163e99a62b5a6b"},"schema_version":"1.0","source":{"id":"2412.02196","kind":"arxiv","version":1}},"canonical_sha256":"831abe66be988a84ce42e085a5a9452555aee9d467699b9be5c843e6a986856d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"831abe66be988a84ce42e085a5a9452555aee9d467699b9be5c843e6a986856d","first_computed_at":"2026-07-05T09:43:45.892761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:45.892761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WkBlHIwep9SLcW14FZ3U6r3pQE4FmNjMM7B1SMLHtFqsxPiHVFAE8EAllF6jf1D5fPYDBVAGSM1eIQxOWFtkCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:45.893233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3847d9cbaf910555395cd9602c7872c2252c03bf3766fa5a6b2e404a94aa2bbf","sha256:b18d66213bf863932fd360efb733738b4d055f3b7e0144d5cc14ac82af661a09"],"state_sha256":"55e0f9795cf9a754b0bcc448d465ad523c530b0055f4e7739e9a4d9610fe89e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJv+vrlRMPRLaYBelMqVHIa8gNsg6oP/cJIcM1h7H2ODfz/ilRquskbWz80odQ30sYjEB4sIa1qX7JZOuIfIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:23:26.040995Z","bundle_sha256":"47a3b77a20cb6f2ad5e73514119c3119f1566f8ab7ac2655a7e0662f586ef794"}}