{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:A6EYW37SEAMKSCNWWBF2ZLOY2I","short_pith_number":"pith:A6EYW37S","schema_version":"1.0","canonical_sha256":"07898b6ff22018a909b6b04bacadd8d235b656119fe22a80edffc72f2dafb566","source":{"kind":"arxiv","id":"2108.10733","version":2},"attestation_state":"computed","paper":{"title":"Graph Neural Networks: Methods, Applications, and Opportunities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Lilapati Waikhom, Ripon Patgiri","submitted_at":"2021-08-24T13:46:19Z","abstract_excerpt":"In the last decade or so, we have witnessed deep learning reinvigorating the machine learning field. It has solved many problems in the domains of computer vision, speech recognition, natural language processing, and various other tasks with state-of-the-art performance. The data is generally represented in the Euclidean space in these domains. Various other domains conform to non-Euclidean space, for which graph is an ideal representation. Graphs are suitable for representing the dependencies and interrelationships between various entities. Traditionally, handcrafted features for graphs are i"},"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":"2108.10733","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-24T13:46:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"876608eb2630181b746005b9bbafdec6ac20ade2d0f39343a32185cc3317b2bd","abstract_canon_sha256":"8858559589920d0bf31f935ce64dc030e2d15356db024e759fc77ac1c1ab25dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:28.529230Z","signature_b64":"g0MsDx49bM8nHGfdo65SX8rPOAhgmxOeuhMdIqJReO4nBfzB0Z19wgAICyQXBc8xd6mus7K6bmy85XWdQjq1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07898b6ff22018a909b6b04bacadd8d235b656119fe22a80edffc72f2dafb566","last_reissued_at":"2026-07-05T03:12:28.528679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:28.528679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks: Methods, Applications, and Opportunities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Lilapati Waikhom, Ripon Patgiri","submitted_at":"2021-08-24T13:46:19Z","abstract_excerpt":"In the last decade or so, we have witnessed deep learning reinvigorating the machine learning field. It has solved many problems in the domains of computer vision, speech recognition, natural language processing, and various other tasks with state-of-the-art performance. The data is generally represented in the Euclidean space in these domains. Various other domains conform to non-Euclidean space, for which graph is an ideal representation. Graphs are suitable for representing the dependencies and interrelationships between various entities. Traditionally, handcrafted features for graphs are i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10733","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/2108.10733/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":"2108.10733","created_at":"2026-07-05T03:12:28.528738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.10733v2","created_at":"2026-07-05T03:12:28.528738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10733","created_at":"2026-07-05T03:12:28.528738+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6EYW37SEAMK","created_at":"2026-07-05T03:12:28.528738+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6EYW37SEAMKSCNW","created_at":"2026-07-05T03:12:28.528738+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6EYW37S","created_at":"2026-07-05T03:12:28.528738+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31016","citing_title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2407.20067","citing_title":"xAI-Drop: Don't Use What You Cannot Explain","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15242","citing_title":"Logical Grammar Induction via Graph Kolmogorov Complexity: A Neuro-Symbolic Framework for Self-Healing Clinical Data Integrity","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I","json":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I.json","graph_json":"https://pith.science/api/pith-number/A6EYW37SEAMKSCNWWBF2ZLOY2I/graph.json","events_json":"https://pith.science/api/pith-number/A6EYW37SEAMKSCNWWBF2ZLOY2I/events.json","paper":"https://pith.science/paper/A6EYW37S"},"agent_actions":{"view_html":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I","download_json":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I.json","view_paper":"https://pith.science/paper/A6EYW37S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.10733&json=true","fetch_graph":"https://pith.science/api/pith-number/A6EYW37SEAMKSCNWWBF2ZLOY2I/graph.json","fetch_events":"https://pith.science/api/pith-number/A6EYW37SEAMKSCNWWBF2ZLOY2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I/action/storage_attestation","attest_author":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I/action/author_attestation","sign_citation":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I/action/citation_signature","submit_replication":"https://pith.science/pith/A6EYW37SEAMKSCNWWBF2ZLOY2I/action/replication_record"}},"created_at":"2026-07-05T03:12:28.528738+00:00","updated_at":"2026-07-05T03:12:28.528738+00:00"}