{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N5E573K7P42U2PXZBAASE3TDCX","short_pith_number":"pith:N5E573K7","canonical_record":{"source":{"id":"1810.02080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-04T07:39:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cc6b8dfef4c7712efb20273c0c6793633f15a762ba0cc2e2516cd18f21ad2fab","abstract_canon_sha256":"c67b5c8e2e32a71799a35bf49bff2ca1af82364bdca7e2aace3c292b64b52c45"},"schema_version":"1.0"},"canonical_sha256":"6f49dfed5f7f354d3ef90801226e6315e178b59b45b8749144483078f406c0e6","source":{"kind":"arxiv","id":"1810.02080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02080","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02080v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02080","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"N5E573K7P42U","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5E573K7P42U2PXZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5E573K7","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N5E573K7P42U2PXZBAASE3TDCX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-04T07:39:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cc6b8dfef4c7712efb20273c0c6793633f15a762ba0cc2e2516cd18f21ad2fab","abstract_canon_sha256":"c67b5c8e2e32a71799a35bf49bff2ca1af82364bdca7e2aace3c292b64b52c45"},"schema_version":"1.0"},"canonical_sha256":"6f49dfed5f7f354d3ef90801226e6315e178b59b45b8749144483078f406c0e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.333489Z","signature_b64":"cuaMUUSp6RStY2qmwA7kWHTh1vHqjmRpKkHuzfKokZGqow32wkLMuOFJR4Zbvn+f0HzE6XeVN9HTJ8OvaPJoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f49dfed5f7f354d3ef90801226e6315e178b59b45b8749144483078f406c0e6","last_reissued_at":"2026-05-18T00:04:06.332786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.332786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02080","source_version":1,"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"294W4eINHcKHRXVOI5Q0g+p7d44YUYmKRFx/waJkDquHAWLJO4rD7JSPUjpdK2GcvKl+4kl5Mq3bms6SL9VAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:40:45.479820Z"},"content_sha256":"5ec009f2798595aefd4744b7148a952bdd77bc12216fa3152a77abecb959a74a","schema_version":"1.0","event_id":"sha256:5ec009f2798595aefd4744b7148a952bdd77bc12216fa3152a77abecb959a74a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N5E573K7P42U2PXZBAASE3TDCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Convolutional Neural Network for Graph of Graphs Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hirotaka Akita, Hisashi Kashima, Ichigaku Takigawa, Masashi Tsubaki, Shonosuke Harada, Yoshihiro Yamanishi, Yukino Baba","submitted_at":"2018-10-04T07:39:31Z","abstract_excerpt":"Graphs are general and powerful data representations which can model complex real-world phenomena, ranging from chemical compounds to social networks; however, effective feature extraction from graphs is not a trivial task, and much work has been done in the field of machine learning and data mining. The recent advances in graph neural networks have made automatic and flexible feature extraction from graphs possible and have improved the predictive performance significantly. In this paper, we go further with this line of research and address a more general problem of learning with a graph of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02080","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":""},"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvV+AqUg2vJTeoajjJe6h/QBm/fcao2X9M2RJofcC1V1MoiIE8NsPIvPEA0WEk6odlQeSvx4BKk20Ejb31ZhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:40:45.480366Z"},"content_sha256":"37a69745dd4475f55e6e1ab6f8311be9b1a26c3decfe7aab43c562ca29d641b1","schema_version":"1.0","event_id":"sha256:37a69745dd4475f55e6e1ab6f8311be9b1a26c3decfe7aab43c562ca29d641b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5E573K7P42U2PXZBAASE3TDCX/bundle.json","state_url":"https://pith.science/pith/N5E573K7P42U2PXZBAASE3TDCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5E573K7P42U2PXZBAASE3TDCX/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-27T09:40:45Z","links":{"resolver":"https://pith.science/pith/N5E573K7P42U2PXZBAASE3TDCX","bundle":"https://pith.science/pith/N5E573K7P42U2PXZBAASE3TDCX/bundle.json","state":"https://pith.science/pith/N5E573K7P42U2PXZBAASE3TDCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5E573K7P42U2PXZBAASE3TDCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N5E573K7P42U2PXZBAASE3TDCX","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":"c67b5c8e2e32a71799a35bf49bff2ca1af82364bdca7e2aace3c292b64b52c45","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-04T07:39:31Z","title_canon_sha256":"cc6b8dfef4c7712efb20273c0c6793633f15a762ba0cc2e2516cd18f21ad2fab"},"schema_version":"1.0","source":{"id":"1810.02080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02080","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02080v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02080","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"N5E573K7P42U","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5E573K7P42U2PXZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5E573K7","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:37a69745dd4475f55e6e1ab6f8311be9b1a26c3decfe7aab43c562ca29d641b1","target":"graph","created_at":"2026-05-18T00:04:06Z","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":"Graphs are general and powerful data representations which can model complex real-world phenomena, ranging from chemical compounds to social networks; however, effective feature extraction from graphs is not a trivial task, and much work has been done in the field of machine learning and data mining. The recent advances in graph neural networks have made automatic and flexible feature extraction from graphs possible and have improved the predictive performance significantly. In this paper, we go further with this line of research and address a more general problem of learning with a graph of g","authors_text":"Hirotaka Akita, Hisashi Kashima, Ichigaku Takigawa, Masashi Tsubaki, Shonosuke Harada, Yoshihiro Yamanishi, Yukino Baba","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-04T07:39:31Z","title":"Dual Convolutional Neural Network for Graph of Graphs Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02080","kind":"arxiv","version":1},"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:5ec009f2798595aefd4744b7148a952bdd77bc12216fa3152a77abecb959a74a","target":"record","created_at":"2026-05-18T00:04:06Z","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":"c67b5c8e2e32a71799a35bf49bff2ca1af82364bdca7e2aace3c292b64b52c45","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-04T07:39:31Z","title_canon_sha256":"cc6b8dfef4c7712efb20273c0c6793633f15a762ba0cc2e2516cd18f21ad2fab"},"schema_version":"1.0","source":{"id":"1810.02080","kind":"arxiv","version":1}},"canonical_sha256":"6f49dfed5f7f354d3ef90801226e6315e178b59b45b8749144483078f406c0e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f49dfed5f7f354d3ef90801226e6315e178b59b45b8749144483078f406c0e6","first_computed_at":"2026-05-18T00:04:06.332786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:06.332786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cuaMUUSp6RStY2qmwA7kWHTh1vHqjmRpKkHuzfKokZGqow32wkLMuOFJR4Zbvn+f0HzE6XeVN9HTJ8OvaPJoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:06.333489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec009f2798595aefd4744b7148a952bdd77bc12216fa3152a77abecb959a74a","sha256:37a69745dd4475f55e6e1ab6f8311be9b1a26c3decfe7aab43c562ca29d641b1"],"state_sha256":"03af4945bc7689d4ab83aca40d4b3300c2ae37295f82ed39655617d7d3873147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0MmZTOGVZ3Lr/it6yvzOjtRO4ycgXHKW7MCgXbU32c8dHUOz5GZQaeh3GAF8WpVrREQHewNFhoWoKTXwifHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:40:45.483969Z","bundle_sha256":"a830b55773bc468798211ec3f3a26f35281bf1359e3ac9b354533cc392ab1fd3"}}