{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SHW62VWV7RY6RVQWQC3YT3I2TO","short_pith_number":"pith:SHW62VWV","schema_version":"1.0","canonical_sha256":"91eded56d5fc71e8d61680b789ed1a9bbc3a6c02a6232f11d0d2163a93373dec","source":{"kind":"arxiv","id":"2211.12482","version":1},"attestation_state":"computed","paper":{"title":"GRATIS: Deep Learning Graph Representation with Task-specific Topology and Multi-dimensional Edge Features","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Luo, Hatice Gunes, Linlin Shen, Selim Kuzucu, Siyang Song, Weicheng Xie, Xi Jia, Yuxin Song, Zhijiang Guo, Zhiyuan Song","submitted_at":"2022-11-19T18:42:55Z","abstract_excerpt":"Graph is powerful for representing various types of real-world data. The topology (edges' presence) and edges' features of a graph decides the message passing mechanism among vertices within the graph. While most existing approaches only manually define a single-value edge to describe the connectivity or strength of association between a pair of vertices, task-specific and crucial relationship cues may be disregarded by such manually defined topology and single-value edge features. In this paper, we propose the first general graph representation learning framework (called GRATIS) which can gen"},"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":"2211.12482","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-19T18:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"5e5d8435276dc5b6372c9c38df5386ce72a9234fe258362f5df5d6d44a4fc10b","abstract_canon_sha256":"8881e631d8d6e49c3d05bb7edd4eccd1a8df0c2074cb9ef8b80f0ee986c3c66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:17.550132Z","signature_b64":"uKFc0xk4TX+h0FdlG/nqsGYBgLv4+8NCFjGRK8AzOAX3JTHjQvKE/KVh8r1d1yE2VtXZDbFj5tKwNUixdt3qBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91eded56d5fc71e8d61680b789ed1a9bbc3a6c02a6232f11d0d2163a93373dec","last_reissued_at":"2026-07-05T05:18:17.549696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:17.549696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRATIS: Deep Learning Graph Representation with Task-specific Topology and Multi-dimensional Edge Features","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Luo, Hatice Gunes, Linlin Shen, Selim Kuzucu, Siyang Song, Weicheng Xie, Xi Jia, Yuxin Song, Zhijiang Guo, Zhiyuan Song","submitted_at":"2022-11-19T18:42:55Z","abstract_excerpt":"Graph is powerful for representing various types of real-world data. The topology (edges' presence) and edges' features of a graph decides the message passing mechanism among vertices within the graph. While most existing approaches only manually define a single-value edge to describe the connectivity or strength of association between a pair of vertices, task-specific and crucial relationship cues may be disregarded by such manually defined topology and single-value edge features. In this paper, we propose the first general graph representation learning framework (called GRATIS) which can gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12482","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/2211.12482/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":"2211.12482","created_at":"2026-07-05T05:18:17.549753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12482v1","created_at":"2026-07-05T05:18:17.549753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12482","created_at":"2026-07-05T05:18:17.549753+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHW62VWV7RY6","created_at":"2026-07-05T05:18:17.549753+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHW62VWV7RY6RVQW","created_at":"2026-07-05T05:18:17.549753+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHW62VWV","created_at":"2026-07-05T05:18:17.549753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07935","citing_title":"REACT 2026: The Fourth Multiple Appropriate Facial Reaction Generation Challenge: Personalised MAFRG and Appropriate EEG Reaction Prediction","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO","json":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO.json","graph_json":"https://pith.science/api/pith-number/SHW62VWV7RY6RVQWQC3YT3I2TO/graph.json","events_json":"https://pith.science/api/pith-number/SHW62VWV7RY6RVQWQC3YT3I2TO/events.json","paper":"https://pith.science/paper/SHW62VWV"},"agent_actions":{"view_html":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO","download_json":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO.json","view_paper":"https://pith.science/paper/SHW62VWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12482&json=true","fetch_graph":"https://pith.science/api/pith-number/SHW62VWV7RY6RVQWQC3YT3I2TO/graph.json","fetch_events":"https://pith.science/api/pith-number/SHW62VWV7RY6RVQWQC3YT3I2TO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO/action/storage_attestation","attest_author":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO/action/author_attestation","sign_citation":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO/action/citation_signature","submit_replication":"https://pith.science/pith/SHW62VWV7RY6RVQWQC3YT3I2TO/action/replication_record"}},"created_at":"2026-07-05T05:18:17.549753+00:00","updated_at":"2026-07-05T05:18:17.549753+00:00"}