{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:73BZHJFQ5NPEHGSMNQ3W5RPAHW","short_pith_number":"pith:73BZHJFQ","canonical_record":{"source":{"id":"1708.04675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-10T01:55:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"084eb8efc9718b162ab9c9d87589f95cd98d7c8fc1ac79554170130cbfbec484","abstract_canon_sha256":"60639064a356cb87c8f00910ffe0b4fc06fedced5d3508d3b53913d1c24e7f0d"},"schema_version":"1.0"},"canonical_sha256":"fec393a4b0eb5e439a4c6c376ec5e03d9cf55f53f09ad2890a8ac43dbb028f4e","source":{"kind":"arxiv","id":"1708.04675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04675","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04675v1","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04675","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"73BZHJFQ5NPE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73BZHJFQ5NPEHGSM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73BZHJFQ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:73BZHJFQ5NPEHGSMNQ3W5RPAHW","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-10T01:55:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"084eb8efc9718b162ab9c9d87589f95cd98d7c8fc1ac79554170130cbfbec484","abstract_canon_sha256":"60639064a356cb87c8f00910ffe0b4fc06fedced5d3508d3b53913d1c24e7f0d"},"schema_version":"1.0"},"canonical_sha256":"fec393a4b0eb5e439a4c6c376ec5e03d9cf55f53f09ad2890a8ac43dbb028f4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.221680Z","signature_b64":"jVaE1KWe6jw34fIJBkig4/z0bfVnDM3S+baOFf4hYk1g2vzoONe75rgNDAogz4C1wKGICa4qS9b+SFxCLhntDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fec393a4b0eb5e439a4c6c376ec5e03d9cf55f53f09ad2890a8ac43dbb028f4e","last_reissued_at":"2026-05-18T00:37:58.221031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.221031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04675","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:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE0cqAk7fgj6QpeAzn7FtwDEzMOE0E0mfz/mO//0vN1rjaJGvwFCp2qEkoKNxUpSiSRAmmV5RIc54Z9eC2fuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:24:56.768016Z"},"content_sha256":"205f5fe7148a37e4ea1c9b8ad748933b4cd8c1b96cca6819ac757627a0fe475b","schema_version":"1.0","event_id":"sha256:205f5fe7148a37e4ea1c9b8ad748933b4cd8c1b96cca6819ac757627a0fe475b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:73BZHJFQ5NPEHGSMNQ3W5RPAHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Graph While Training: An Evolving Graph Convolutional Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Ruoyu Li","submitted_at":"2017-08-10T01:55:01Z","abstract_excerpt":"Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chemical molecular data, clustering or coarsening for simplifying the graphs is hard to be justified chemically. In this paper, we propose a more general and flexible graph convolution network (EGCN) fed by batch of arbitrarily shaped data together with their evolving graph Laplacian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04675","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:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qB6R5P1PLNEOrWwsz6cBLP4SMc0b2kfUeAI0nDevrb+xJ6Qdp+W6s3G2qvk+mO+clT0yGNzbpvh4fJJsgARYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:24:56.768677Z"},"content_sha256":"2e4d5a495475b6c92abd65fb41d25587e42dd2b15f5d34f702e35d73eb8919b6","schema_version":"1.0","event_id":"sha256:2e4d5a495475b6c92abd65fb41d25587e42dd2b15f5d34f702e35d73eb8919b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/bundle.json","state_url":"https://pith.science/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/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-05-31T06:24:56Z","links":{"resolver":"https://pith.science/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW","bundle":"https://pith.science/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/bundle.json","state":"https://pith.science/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73BZHJFQ5NPEHGSMNQ3W5RPAHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:73BZHJFQ5NPEHGSMNQ3W5RPAHW","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":"60639064a356cb87c8f00910ffe0b4fc06fedced5d3508d3b53913d1c24e7f0d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-10T01:55:01Z","title_canon_sha256":"084eb8efc9718b162ab9c9d87589f95cd98d7c8fc1ac79554170130cbfbec484"},"schema_version":"1.0","source":{"id":"1708.04675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04675","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04675v1","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04675","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"73BZHJFQ5NPE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73BZHJFQ5NPEHGSM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73BZHJFQ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:2e4d5a495475b6c92abd65fb41d25587e42dd2b15f5d34f702e35d73eb8919b6","target":"graph","created_at":"2026-05-18T00:37:58Z","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":"Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chemical molecular data, clustering or coarsening for simplifying the graphs is hard to be justified chemically. In this paper, we propose a more general and flexible graph convolution network (EGCN) fed by batch of arbitrarily shaped data together with their evolving graph Laplacian","authors_text":"Junzhou Huang, Ruoyu Li","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-10T01:55:01Z","title":"Learning Graph While Training: An Evolving Graph Convolutional Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04675","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:205f5fe7148a37e4ea1c9b8ad748933b4cd8c1b96cca6819ac757627a0fe475b","target":"record","created_at":"2026-05-18T00:37:58Z","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":"60639064a356cb87c8f00910ffe0b4fc06fedced5d3508d3b53913d1c24e7f0d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-10T01:55:01Z","title_canon_sha256":"084eb8efc9718b162ab9c9d87589f95cd98d7c8fc1ac79554170130cbfbec484"},"schema_version":"1.0","source":{"id":"1708.04675","kind":"arxiv","version":1}},"canonical_sha256":"fec393a4b0eb5e439a4c6c376ec5e03d9cf55f53f09ad2890a8ac43dbb028f4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fec393a4b0eb5e439a4c6c376ec5e03d9cf55f53f09ad2890a8ac43dbb028f4e","first_computed_at":"2026-05-18T00:37:58.221031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:58.221031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVaE1KWe6jw34fIJBkig4/z0bfVnDM3S+baOFf4hYk1g2vzoONe75rgNDAogz4C1wKGICa4qS9b+SFxCLhntDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:58.221680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:205f5fe7148a37e4ea1c9b8ad748933b4cd8c1b96cca6819ac757627a0fe475b","sha256:2e4d5a495475b6c92abd65fb41d25587e42dd2b15f5d34f702e35d73eb8919b6"],"state_sha256":"636422cf40bbd4d75855ebc0edd9ccb5553f45e90583a97ce2a30868c7d25030"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iVZ3fLpDs9f6n2uKFRQTSOriXXEWJuIHm/ogCvXRQnj5YpuffoBulR+V+D+bGFVWJvy4GECqZsv2P4GzCQlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:24:56.771747Z","bundle_sha256":"e09a6954afaebb40219aafe99f520e8da677f7179ec7512db5c31cd75394acae"}}