{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WFTSPL63P3DKZM4W6ZGAP42BJB","short_pith_number":"pith:WFTSPL63","schema_version":"1.0","canonical_sha256":"b16727afdb7ec6acb396f64c07f3414855cb5afe3f1b36367614aa1caed07428","source":{"kind":"arxiv","id":"1905.12712","version":1},"attestation_state":"computed","paper":{"title":"Path-Augmented Graph Transformer Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benson Chen, Regina Barzilay, Tommi Jaakkola","submitted_at":"2019-05-29T20:39:39Z","abstract_excerpt":"Much of the recent work on learning molecular representations has been based on Graph Convolution Networks (GCN). These models rely on local aggregation operations and can therefore miss higher-order graph properties. To remedy this, we propose Path-Augmented Graph Transformer Networks (PAGTN) that are explicitly built on longer-range dependencies in graph-structured data. Specifically, we use path features in molecular graphs to create global attention layers. We compare our PAGTN model against the GCN model and show that our model consistently outperforms GCNs on molecular property predictio"},"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.12712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:39:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"912eb45c727272a5732c5a0b60eb469491979ac303b23d9d65f38067b097b0e0","abstract_canon_sha256":"82bbd7d74d27000bce0cec22f97d17522966b7f176f5cfe36d558089660ae6e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.840556Z","signature_b64":"Jw35QAymGYuJC0qFYhp/cLQDMYYrsNU9CCgfEnC2ygNody2ELgYQHSaUmQe1hwtbS0qRJjF9QDy0YV7u7gIFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b16727afdb7ec6acb396f64c07f3414855cb5afe3f1b36367614aa1caed07428","last_reissued_at":"2026-05-17T23:44:39.840121Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.840121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-Augmented Graph Transformer Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benson Chen, Regina Barzilay, Tommi Jaakkola","submitted_at":"2019-05-29T20:39:39Z","abstract_excerpt":"Much of the recent work on learning molecular representations has been based on Graph Convolution Networks (GCN). These models rely on local aggregation operations and can therefore miss higher-order graph properties. To remedy this, we propose Path-Augmented Graph Transformer Networks (PAGTN) that are explicitly built on longer-range dependencies in graph-structured data. Specifically, we use path features in molecular graphs to create global attention layers. We compare our PAGTN model against the GCN model and show that our model consistently outperforms GCNs on molecular property predictio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12712","kind":"arxiv","version":1},"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":"1905.12712","created_at":"2026-05-17T23:44:39.840184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12712v1","created_at":"2026-05-17T23:44:39.840184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12712","created_at":"2026-05-17T23:44:39.840184+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFTSPL63P3DK","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFTSPL63P3DKZM4W","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFTSPL63","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB","json":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB.json","graph_json":"https://pith.science/api/pith-number/WFTSPL63P3DKZM4W6ZGAP42BJB/graph.json","events_json":"https://pith.science/api/pith-number/WFTSPL63P3DKZM4W6ZGAP42BJB/events.json","paper":"https://pith.science/paper/WFTSPL63"},"agent_actions":{"view_html":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB","download_json":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB.json","view_paper":"https://pith.science/paper/WFTSPL63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12712&json=true","fetch_graph":"https://pith.science/api/pith-number/WFTSPL63P3DKZM4W6ZGAP42BJB/graph.json","fetch_events":"https://pith.science/api/pith-number/WFTSPL63P3DKZM4W6ZGAP42BJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB/action/storage_attestation","attest_author":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB/action/author_attestation","sign_citation":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB/action/citation_signature","submit_replication":"https://pith.science/pith/WFTSPL63P3DKZM4W6ZGAP42BJB/action/replication_record"}},"created_at":"2026-05-17T23:44:39.840184+00:00","updated_at":"2026-05-17T23:44:39.840184+00:00"}