{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XUW66GQLSS767RSYPNBFUQYK24","short_pith_number":"pith:XUW66GQL","schema_version":"1.0","canonical_sha256":"bd2def1a0b94bfefc6587b425a430ad70526372ae1b7785be8f04b18793d4694","source":{"kind":"arxiv","id":"1905.13211","version":4},"attestation_state":"computed","paper":{"title":"What Can Neural Networks Reason About?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jingling Li, Ken-ichi Kawarabayashi, Keyulu Xu, Mozhi Zhang, Simon S. Du, Stefanie Jegelka","submitted_at":"2019-05-30T17:53:30Z","abstract_excerpt":"Neural networks have succeeded in many reasoning tasks. Empirically, these tasks require specialized network structures, e.g., Graph Neural Networks (GNNs) perform well on many such tasks, but less structured networks fail. Theoretically, there is limited understanding of why and when a network structure generalizes better than others, although they have equal expressive power. In this paper, we develop a framework to characterize which reasoning tasks a network can learn well, by studying how well its computation structure aligns with the algorithmic structure of the relevant reasoning proces"},"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":"1905.13211","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:53:30Z","cross_cats_sorted":["cs.AI","cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"cf9a65a4e8d59fd62f325f55b910842ffb4e15e13d1caca6406ab2f0696d1479","abstract_canon_sha256":"43b6ac78fffe87ff9432b455e07803c959eb29cca26585a0daca2ea478729aed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:55.734356Z","signature_b64":"yUO/PUuiyiREPYgZpEYE1cxrP3ILqghrHHfoZhxLDzZ89FYeSu2Y1pEZFoyumz/lY0LHohHgncOC1RSCguUMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd2def1a0b94bfefc6587b425a430ad70526372ae1b7785be8f04b18793d4694","last_reissued_at":"2026-07-05T00:40:55.733858Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:55.733858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Can Neural Networks Reason About?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jingling Li, Ken-ichi Kawarabayashi, Keyulu Xu, Mozhi Zhang, Simon S. Du, Stefanie Jegelka","submitted_at":"2019-05-30T17:53:30Z","abstract_excerpt":"Neural networks have succeeded in many reasoning tasks. Empirically, these tasks require specialized network structures, e.g., Graph Neural Networks (GNNs) perform well on many such tasks, but less structured networks fail. Theoretically, there is limited understanding of why and when a network structure generalizes better than others, although they have equal expressive power. In this paper, we develop a framework to characterize which reasoning tasks a network can learn well, by studying how well its computation structure aligns with the algorithmic structure of the relevant reasoning proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13211","kind":"arxiv","version":4},"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/1905.13211/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":"1905.13211","created_at":"2026-07-05T00:40:55.733915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13211v4","created_at":"2026-07-05T00:40:55.733915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13211","created_at":"2026-07-05T00:40:55.733915+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUW66GQLSS76","created_at":"2026-07-05T00:40:55.733915+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUW66GQLSS767RSY","created_at":"2026-07-05T00:40:55.733915+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUW66GQL","created_at":"2026-07-05T00:40:55.733915+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":101,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24","json":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24.json","graph_json":"https://pith.science/api/pith-number/XUW66GQLSS767RSYPNBFUQYK24/graph.json","events_json":"https://pith.science/api/pith-number/XUW66GQLSS767RSYPNBFUQYK24/events.json","paper":"https://pith.science/paper/XUW66GQL"},"agent_actions":{"view_html":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24","download_json":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24.json","view_paper":"https://pith.science/paper/XUW66GQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13211&json=true","fetch_graph":"https://pith.science/api/pith-number/XUW66GQLSS767RSYPNBFUQYK24/graph.json","fetch_events":"https://pith.science/api/pith-number/XUW66GQLSS767RSYPNBFUQYK24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24/action/storage_attestation","attest_author":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24/action/author_attestation","sign_citation":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24/action/citation_signature","submit_replication":"https://pith.science/pith/XUW66GQLSS767RSYPNBFUQYK24/action/replication_record"}},"created_at":"2026-07-05T00:40:55.733915+00:00","updated_at":"2026-07-05T00:40:55.733915+00:00"}