{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:R4AUGYXZWQTUQZSGIWEH5IO2ZV","short_pith_number":"pith:R4AUGYXZ","schema_version":"1.0","canonical_sha256":"8f014362f9b42748664645887ea1dacd72fc91b878a3dc23d08b315b7cfb9444","source":{"kind":"arxiv","id":"2101.03464","version":1},"attestation_state":"computed","paper":{"title":"SPAGAN: Shortest Path Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Junsong Yuan, Mingli Song, Xinchao Wang, Yiding Yang","submitted_at":"2021-01-10T03:18:34Z","abstract_excerpt":"Graph convolutional networks (GCN) have recently demonstrated their potential in analyzing non-grid structure data that can be represented as graphs. The core idea is to encode the local topology of a graph, via convolutions, into the feature of a center node. In this paper, we propose a novel GCN model, which we term as Shortest Path Graph Attention Network (SPAGAN). Unlike conventional GCN models that carry out node-based attentions within each layer, the proposed SPAGAN conducts path-based attention that explicitly accounts for the influence of a sequence of nodes yielding the minimum cost,"},"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":"2101.03464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-10T03:18:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3d7e05a0f70656e09f1f894fd8110b6ad9e33d77525cb86d7c49cd0ab206821d","abstract_canon_sha256":"8bda3e11207a6cd6be5af1df6af39ee1f97b15e12a1a280c231936a182327705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:50.488572Z","signature_b64":"3t93Gp8zcKTfNg9cCMGsx285WtX1wszdqMetGoTEEU8u8ivmO/oCIi+czQ4ZSXhtlqwYPuAOqnC2A9h6SFC5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f014362f9b42748664645887ea1dacd72fc91b878a3dc23d08b315b7cfb9444","last_reissued_at":"2026-07-05T02:05:50.488192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:50.488192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPAGAN: Shortest Path Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Junsong Yuan, Mingli Song, Xinchao Wang, Yiding Yang","submitted_at":"2021-01-10T03:18:34Z","abstract_excerpt":"Graph convolutional networks (GCN) have recently demonstrated their potential in analyzing non-grid structure data that can be represented as graphs. The core idea is to encode the local topology of a graph, via convolutions, into the feature of a center node. In this paper, we propose a novel GCN model, which we term as Shortest Path Graph Attention Network (SPAGAN). Unlike conventional GCN models that carry out node-based attentions within each layer, the proposed SPAGAN conducts path-based attention that explicitly accounts for the influence of a sequence of nodes yielding the minimum cost,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03464","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.03464/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":"2101.03464","created_at":"2026-07-05T02:05:50.488256+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.03464v1","created_at":"2026-07-05T02:05:50.488256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03464","created_at":"2026-07-05T02:05:50.488256+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4AUGYXZWQTU","created_at":"2026-07-05T02:05:50.488256+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4AUGYXZWQTUQZSG","created_at":"2026-07-05T02:05:50.488256+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4AUGYXZ","created_at":"2026-07-05T02:05:50.488256+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07028","citing_title":"Large Language Model Evaluated Stand-alone Attention-Assisted Graph Neural Network with Spatial and Structural Information Interaction for Precise Endoscopic Image Segmentation","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV","json":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV.json","graph_json":"https://pith.science/api/pith-number/R4AUGYXZWQTUQZSGIWEH5IO2ZV/graph.json","events_json":"https://pith.science/api/pith-number/R4AUGYXZWQTUQZSGIWEH5IO2ZV/events.json","paper":"https://pith.science/paper/R4AUGYXZ"},"agent_actions":{"view_html":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV","download_json":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV.json","view_paper":"https://pith.science/paper/R4AUGYXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.03464&json=true","fetch_graph":"https://pith.science/api/pith-number/R4AUGYXZWQTUQZSGIWEH5IO2ZV/graph.json","fetch_events":"https://pith.science/api/pith-number/R4AUGYXZWQTUQZSGIWEH5IO2ZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV/action/storage_attestation","attest_author":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV/action/author_attestation","sign_citation":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV/action/citation_signature","submit_replication":"https://pith.science/pith/R4AUGYXZWQTUQZSGIWEH5IO2ZV/action/replication_record"}},"created_at":"2026-07-05T02:05:50.488256+00:00","updated_at":"2026-07-05T02:05:50.488256+00:00"}