{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B3KKF76Y73S4X5BTJAHVBKQS5T","short_pith_number":"pith:B3KKF76Y","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"},"canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","source":{"kind":"arxiv","id":"1805.07683","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07683","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07683v4","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07683","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"B3KKF76Y73S4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3KKF76Y73S4X5BT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3KKF76Y","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B3KKF76Y73S4X5BTJAHVBKQS5T","target":"record","payload":{"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"},"canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","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"},"source_kind":"arxiv","source_id":"1805.07683","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4a75aPgGmbz3wZVX+7XKFozmajOa9GB41uhNTVm1BYkM8X85fGvdUsX8NMauWmmhyp2WGd7AwRvSg8fA/M/tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:14:25.282971Z"},"content_sha256":"132be2ea49d60567d369210ee64f6ef20b76d24a55f74d7f1de7325016273165","schema_version":"1.0","event_id":"sha256:132be2ea49d60567d369210ee64f6ef20b76d24a55f74d7f1de7325016273165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B3KKF76Y73S4X5BTJAHVBKQS5T","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16TMdxV299ZsSCI0uw8fGv4zbduQBJSdh9NHetf2LsSKjnKJULWePt4960n0RKu+UZMWIpWwHop0U0WDAyo9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:14:25.283639Z"},"content_sha256":"cda0b6141e86bbf63dda43693e7e73c689441a61fb7bcdb20c61a4ce7accd550","schema_version":"1.0","event_id":"sha256:cda0b6141e86bbf63dda43693e7e73c689441a61fb7bcdb20c61a4ce7accd550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/bundle.json","state_url":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T19:14:25Z","links":{"resolver":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T","bundle":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/bundle.json","state":"https://pith.science/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3KKF76Y73S4X5BTJAHVBKQS5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B3KKF76Y73S4X5BTJAHVBKQS5T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"14d9cebea1f3cc77723b92cb7bd4d8ab884946b4e6c4823d3cec3a8201c76124","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-20T00:26:37Z","title_canon_sha256":"4076f7c23b3b7bade999f165541793f12fb7b294a1d57b1aedeecb8ea72af1da"},"schema_version":"1.0","source":{"id":"1805.07683","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07683","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07683v4","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07683","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"B3KKF76Y73S4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3KKF76Y73S4X5BT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3KKF76Y","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:cda0b6141e86bbf63dda43693e7e73c689441a61fb7bcdb20c61a4ce7accd550","target":"graph","created_at":"2026-05-18T00:05:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Joseph F. JaJa, Yu Jin","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-20T00:26:37Z","title":"Learning Graph-Level Representations with Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07683","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:132be2ea49d60567d369210ee64f6ef20b76d24a55f74d7f1de7325016273165","target":"record","created_at":"2026-05-18T00:05:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"14d9cebea1f3cc77723b92cb7bd4d8ab884946b4e6c4823d3cec3a8201c76124","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-20T00:26:37Z","title_canon_sha256":"4076f7c23b3b7bade999f165541793f12fb7b294a1d57b1aedeecb8ea72af1da"},"schema_version":"1.0","source":{"id":"1805.07683","kind":"arxiv","version":4}},"canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed4a2ffd8fee5cbf433480f50aa12ecd1fbebda131be8308eb14e49e87194bb","first_computed_at":"2026-05-18T00:05:56.060577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.060577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNeb5yzxUk72QVxeBRwYAwtgPtsYNflu9DrMPO8yoVa5RCdH+VqAA0gaTIKbQ0Dtl/lbzyfOgp+NL9Xj7oIRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.061050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07683","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:132be2ea49d60567d369210ee64f6ef20b76d24a55f74d7f1de7325016273165","sha256:cda0b6141e86bbf63dda43693e7e73c689441a61fb7bcdb20c61a4ce7accd550"],"state_sha256":"d8d02c3cfdb02dc3675a2703bee8344bd0954723a9c90bc601487aed4168a4de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfMbVM2FzBkBgWJDnV6AX7V62FpvuIpfACcapAir4rCI1RtaMoF7/Bs+FlPxo0eZ2hlM4RfsZt73qUg7cKwfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:14:25.287635Z","bundle_sha256":"bc06f339075f8d9ccdc4a16ceaed8cff3e66ce4acc3c81f8e4e2d8a429007ebe"}}