shangqing-liu / ccsd-benchmark-for-code-summarization Goto Github PK

Hello!
Thanks for the great paper of code summarization.
I have a question about the edge embedding in the dynamic graph. Since you want to create a fully-connected graph, what is the embedding of arbitrary node pairs? Does this depend on the node type of every node? or derived from shortest part in the graph?

Don't hide your data pls

Thank you for providing CCSD dataset. Can you please share all github repositories for all functions? Or How can I get/download/clone all repositories?

Hi, the full data is shared but the train/valid/test split is not provided. Do you plan to share it soon? Without the split (in-domain, out-of-domain), we won't be able to compare results with the numbers provided in the paper.