{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SUEMJ6XTO32DYASDDNPBWHU3R6","short_pith_number":"pith:SUEMJ6XT","schema_version":"1.0","canonical_sha256":"9508c4faf376f43c02431b5e1b1e9b8f95e4b5347e55e7a825bdd598e606a675","source":{"kind":"arxiv","id":"1511.05493","version":4},"attestation_state":"computed","paper":{"title":"Gated Graph Sequence Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Tarlow, Marc Brockschmidt, Richard Zemel, Yujia Li","submitted_at":"2015-11-17T18:10:12Z","abstract_excerpt":"Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modify to use gated recurrent units and modern optimization techniques and then extend to output sequences. The result is a flexible and broadly useful class of neural network models that has favorable inductive biases relative to purely sequence-based models (e.g., LSTMs) when the pr"},"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":"1511.05493","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T18:10:12Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"95ca8e85d86541abb87905df01467cfaba5187a4dfa286510512f6ab95bcaec4","abstract_canon_sha256":"ee8435be23922ee54526d53a9cbb930559d9d7395c5e9aacde81e322189d802e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.866762Z","signature_b64":"HQtcS+eTBfNW9TUMjp72AvzcIIREcvXANz83423V2MvW+RFAPkWiAiPzqveQ4l06Id6FqQWfCWJs+XMPltfQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9508c4faf376f43c02431b5e1b1e9b8f95e4b5347e55e7a825bdd598e606a675","last_reissued_at":"2026-05-18T00:34:31.866341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.866341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gated Graph Sequence Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Tarlow, Marc Brockschmidt, Richard Zemel, Yujia Li","submitted_at":"2015-11-17T18:10:12Z","abstract_excerpt":"Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modify to use gated recurrent units and modern optimization techniques and then extend to output sequences. The result is a flexible and broadly useful class of neural network models that has favorable inductive biases relative to purely sequence-based models (e.g., LSTMs) when the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05493","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":""},"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":"1511.05493","created_at":"2026-05-18T00:34:31.866414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05493v4","created_at":"2026-05-18T00:34:31.866414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05493","created_at":"2026-05-18T00:34:31.866414+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUEMJ6XTO32D","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUEMJ6XTO32DYASD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUEMJ6XT","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":9,"sample":[{"citing_arxiv_id":"1906.12330","citing_title":"Graph Star Net for Generalized Multi-Task Learning","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02136","citing_title":"Learning Blended, Precise Semantic Program Embeddings","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22963","citing_title":"Graph Alignment Topology as an Inductive Bias for Grounding Detection","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"1908.05387","citing_title":"HONEM: Learning Embedding for Higher Order Networks","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2304.10726","citing_title":"Usenix'23 Extended Version: Smart Learning to Find Dumb Contracts","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2409.08036","citing_title":"Heterogeneous Sheaf Neural Networks","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2503.07243","citing_title":"Beyond the Edge of Function: Unraveling the Patterns of Type Recovery in Binary Code","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2603.07520","citing_title":"On the Effectiveness of Code Representation in Deep Learning-Based Automated Patch Correctness Assessment","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2003.03485","citing_title":"Neural Operator: Graph Kernel Network for Partial Differential Equations","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18939","citing_title":"TabEmb: Joint Semantic-Structure Embedding for Table Annotation","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15370","citing_title":"TopFeaRe: Locating Critical State of Adversarial Resilience for Graphs Regarding Topology-Feature Entanglement","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23514","citing_title":"Probabilistic Graphical Model using Graph Neural Networks for Bayesian Inversion of Discrete Structural Component States","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6","json":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6.json","graph_json":"https://pith.science/api/pith-number/SUEMJ6XTO32DYASDDNPBWHU3R6/graph.json","events_json":"https://pith.science/api/pith-number/SUEMJ6XTO32DYASDDNPBWHU3R6/events.json","paper":"https://pith.science/paper/SUEMJ6XT"},"agent_actions":{"view_html":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6","download_json":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6.json","view_paper":"https://pith.science/paper/SUEMJ6XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05493&json=true","fetch_graph":"https://pith.science/api/pith-number/SUEMJ6XTO32DYASDDNPBWHU3R6/graph.json","fetch_events":"https://pith.science/api/pith-number/SUEMJ6XTO32DYASDDNPBWHU3R6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6/action/storage_attestation","attest_author":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6/action/author_attestation","sign_citation":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6/action/citation_signature","submit_replication":"https://pith.science/pith/SUEMJ6XTO32DYASDDNPBWHU3R6/action/replication_record"}},"created_at":"2026-05-18T00:34:31.866414+00:00","updated_at":"2026-05-18T00:34:31.866414+00:00"}