{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B3KKF76Y73S4X5BTJAHVBKQS5T","short_pith_number":"pith:B3KKF76Y","schema_version":"1.0","canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","source":{"kind":"arxiv","id":"1805.07683","version":4},"attestation_state":"computed","paper":{"title":"Learning Graph-Level Representations with Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Joseph F. JaJa, Yu Jin","submitted_at":"2018-05-20T00:26:37Z","abstract_excerpt":"Recently a variety of methods have been developed to encode graphs into low-dimensional vectors that can be easily exploited by machine learning algorithms. The majority of these methods start by embedding the graph nodes into a low-dimensional vector space, followed by using some scheme to aggregate the node embeddings. In this work, we develop a new approach to learn graph-level representations, which includes a combination of unsupervised and supervised learning components. We start by learning a set of node representations in an unsupervised fashion. Graph nodes are mapped into node sequen"},"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":"1805.07683","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-20T00:26:37Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4076f7c23b3b7bade999f165541793f12fb7b294a1d57b1aedeecb8ea72af1da","abstract_canon_sha256":"14d9cebea1f3cc77723b92cb7bd4d8ab884946b4e6c4823d3cec3a8201c76124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.061050Z","signature_b64":"VNeb5yzxUk72QVxeBRwYAwtgPtsYNflu9DrMPO8yoVa5RCdH+VqAA0gaTIKbQ0Dtl/lbzyfOgp+NL9Xj7oIRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","last_reissued_at":"2026-05-18T00:05:56.060577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.060577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Graph-Level Representations with Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Joseph F. JaJa, Yu Jin","submitted_at":"2018-05-20T00:26:37Z","abstract_excerpt":"Recently a variety of methods have been developed to encode graphs into low-dimensional vectors that can be easily exploited by machine learning algorithms. The majority of these methods start by embedding the graph nodes into a low-dimensional vector space, followed by using some scheme to aggregate the node embeddings. In this work, we develop a new approach to learn graph-level representations, which includes a combination of unsupervised and supervised learning components. We start by learning a set of node representations in an unsupervised fashion. Graph nodes are mapped into node sequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07683","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":"1805.07683","created_at":"2026-05-18T00:05:56.060645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07683v4","created_at":"2026-05-18T00:05:56.060645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07683","created_at":"2026-05-18T00:05:56.060645+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3KKF76Y73S4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3KKF76Y73S4X5BT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3KKF76Y","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T","json":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T.json","graph_json":"https://pith.science/api/pith-number/B3KKF76Y73S4X5BTJAHVBKQS5T/graph.json","events_json":"https://pith.science/api/pith-number/B3KKF76Y73S4X5BTJAHVBKQS5T/events.json","paper":"https://pith.science/paper/B3KKF76Y"},"agent_actions":{"view_html":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T","download_json":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T.json","view_paper":"https://pith.science/paper/B3KKF76Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07683&json=true","fetch_graph":"https://pith.science/api/pith-number/B3KKF76Y73S4X5BTJAHVBKQS5T/graph.json","fetch_events":"https://pith.science/api/pith-number/B3KKF76Y73S4X5BTJAHVBKQS5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/action/storage_attestation","attest_author":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/action/author_attestation","sign_citation":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/action/citation_signature","submit_replication":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/action/replication_record"}},"created_at":"2026-05-18T00:05:56.060645+00:00","updated_at":"2026-05-18T00:05:56.060645+00:00"}