{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JAVYFXGARXSIBYNFCPCFMJSWCN","short_pith_number":"pith:JAVYFXGA","schema_version":"1.0","canonical_sha256":"482b82dcc08de480e1a513c4562656136ed0a68f45824e60737d1251270cc8c4","source":{"kind":"arxiv","id":"2201.01288","version":2},"attestation_state":"computed","paper":{"title":"Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haoyang Li, Wenwu Zhu, Xin Wang, Ziwei Zhang","submitted_at":"2022-01-04T18:31:31Z","abstract_excerpt":"Graph machine learning has been extensively studied in both academic and industry. However, as the literature on graph learning booms with a vast number of emerging methods and techniques, it becomes increasingly difficult to manually design the optimal machine learning algorithm for different graph-related tasks. To tackle the challenge, automated graph machine learning, which aims at discovering the best hyper-parameter and neural architecture configuration for different graph tasks/data without manual design, is gaining an increasing number of attentions from the research community. In this"},"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":"2201.01288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-04T18:31:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a686c8c9334373e138371d752292d0fed98fba15d85fbdc6e3fc81cb6effe86","abstract_canon_sha256":"52aba8b04ff18dd87719255cb5e489141c80b5f312e654c2d98baa0f410af7e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:47.175177Z","signature_b64":"/ATq0xmYMJGfWQ/SgRm70dbPjj1padc/5fr0uJsDQLH21wS46zTAWCLDXTtaPcFJWoSYF+AvY4m3AMb/P2TBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"482b82dcc08de480e1a513c4562656136ed0a68f45824e60737d1251270cc8c4","last_reissued_at":"2026-07-05T08:14:47.174693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:47.174693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haoyang Li, Wenwu Zhu, Xin Wang, Ziwei Zhang","submitted_at":"2022-01-04T18:31:31Z","abstract_excerpt":"Graph machine learning has been extensively studied in both academic and industry. However, as the literature on graph learning booms with a vast number of emerging methods and techniques, it becomes increasingly difficult to manually design the optimal machine learning algorithm for different graph-related tasks. To tackle the challenge, automated graph machine learning, which aims at discovering the best hyper-parameter and neural architecture configuration for different graph tasks/data without manual design, is gaining an increasing number of attentions from the research community. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.01288","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/2201.01288/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":"2201.01288","created_at":"2026-07-05T08:14:47.174748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.01288v2","created_at":"2026-07-05T08:14:47.174748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.01288","created_at":"2026-07-05T08:14:47.174748+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAVYFXGARXSI","created_at":"2026-07-05T08:14:47.174748+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAVYFXGARXSIBYNF","created_at":"2026-07-05T08:14:47.174748+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAVYFXGA","created_at":"2026-07-05T08:14:47.174748+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14529","citing_title":"Automated Decision-Making on Networks with LLMs through Knowledge-Guided Evolution","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN","json":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN.json","graph_json":"https://pith.science/api/pith-number/JAVYFXGARXSIBYNFCPCFMJSWCN/graph.json","events_json":"https://pith.science/api/pith-number/JAVYFXGARXSIBYNFCPCFMJSWCN/events.json","paper":"https://pith.science/paper/JAVYFXGA"},"agent_actions":{"view_html":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN","download_json":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN.json","view_paper":"https://pith.science/paper/JAVYFXGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.01288&json=true","fetch_graph":"https://pith.science/api/pith-number/JAVYFXGARXSIBYNFCPCFMJSWCN/graph.json","fetch_events":"https://pith.science/api/pith-number/JAVYFXGARXSIBYNFCPCFMJSWCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN/action/storage_attestation","attest_author":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN/action/author_attestation","sign_citation":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN/action/citation_signature","submit_replication":"https://pith.science/pith/JAVYFXGARXSIBYNFCPCFMJSWCN/action/replication_record"}},"created_at":"2026-07-05T08:14:47.174748+00:00","updated_at":"2026-07-05T08:14:47.174748+00:00"}