{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:625MU3U7Q3E2HQJUQ3UXJ5KMWR","short_pith_number":"pith:625MU3U7","schema_version":"1.0","canonical_sha256":"f6baca6e9f86c9a3c13486e974f54cb446ee0e20d24dfdb8a867a3909505cd51","source":{"kind":"arxiv","id":"2006.10538","version":3},"attestation_state":"computed","paper":{"title":"Subgraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emily Alsentzer, Marinka Zitnik, Michelle M. Li, Samuel G. Finlayson","submitted_at":"2020-06-18T13:54:30Z","abstract_excerpt":"Deep learning methods for graphs achieve remarkable performance on many node-level and graph-level prediction tasks. However, despite the proliferation of the methods and their success, prevailing Graph Neural Networks (GNNs) neglect subgraphs, rendering subgraph prediction tasks challenging to tackle in many impactful applications. Further, subgraph prediction tasks present several unique challenges: subgraphs can have non-trivial internal topology, but also carry a notion of position and external connectivity information relative to the underlying graph in which they exist. Here, we introduc"},"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":"2006.10538","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-18T13:54:30Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"31272bc485d6a7264269e40b36dc53bf8cc08f1cc41d45d518964a755481ed9c","abstract_canon_sha256":"e01d8174d6e87218f19ef98f39b1d051a071aff3025c06c97f5041197bc5f83d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:52.755289Z","signature_b64":"UbmuwGlPOn36UiIxpJl+JvwdYFQ95RV2y5kyVkoUYFZ9zfess/FYyKsMF3nXKYrk+/UOq4d4gqTdfPXFYSVYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6baca6e9f86c9a3c13486e974f54cb446ee0e20d24dfdb8a867a3909505cd51","last_reissued_at":"2026-07-05T01:49:52.754948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:52.754948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emily Alsentzer, Marinka Zitnik, Michelle M. Li, Samuel G. Finlayson","submitted_at":"2020-06-18T13:54:30Z","abstract_excerpt":"Deep learning methods for graphs achieve remarkable performance on many node-level and graph-level prediction tasks. However, despite the proliferation of the methods and their success, prevailing Graph Neural Networks (GNNs) neglect subgraphs, rendering subgraph prediction tasks challenging to tackle in many impactful applications. Further, subgraph prediction tasks present several unique challenges: subgraphs can have non-trivial internal topology, but also carry a notion of position and external connectivity information relative to the underlying graph in which they exist. Here, we introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10538","kind":"arxiv","version":3},"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/2006.10538/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":"2006.10538","created_at":"2026-07-05T01:49:52.755000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.10538v3","created_at":"2026-07-05T01:49:52.755000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10538","created_at":"2026-07-05T01:49:52.755000+00:00"},{"alias_kind":"pith_short_12","alias_value":"625MU3U7Q3E2","created_at":"2026-07-05T01:49:52.755000+00:00"},{"alias_kind":"pith_short_16","alias_value":"625MU3U7Q3E2HQJU","created_at":"2026-07-05T01:49:52.755000+00:00"},{"alias_kind":"pith_short_8","alias_value":"625MU3U7","created_at":"2026-07-05T01:49:52.755000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07694","citing_title":"Methodology for Identifying Social Groups within a Transactional Graph","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR","json":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR.json","graph_json":"https://pith.science/api/pith-number/625MU3U7Q3E2HQJUQ3UXJ5KMWR/graph.json","events_json":"https://pith.science/api/pith-number/625MU3U7Q3E2HQJUQ3UXJ5KMWR/events.json","paper":"https://pith.science/paper/625MU3U7"},"agent_actions":{"view_html":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR","download_json":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR.json","view_paper":"https://pith.science/paper/625MU3U7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.10538&json=true","fetch_graph":"https://pith.science/api/pith-number/625MU3U7Q3E2HQJUQ3UXJ5KMWR/graph.json","fetch_events":"https://pith.science/api/pith-number/625MU3U7Q3E2HQJUQ3UXJ5KMWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR/action/storage_attestation","attest_author":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR/action/author_attestation","sign_citation":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR/action/citation_signature","submit_replication":"https://pith.science/pith/625MU3U7Q3E2HQJUQ3UXJ5KMWR/action/replication_record"}},"created_at":"2026-07-05T01:49:52.755000+00:00","updated_at":"2026-07-05T01:49:52.755000+00:00"}