{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3UAC5JPXLBUFTPXSDDF73MG4JO","short_pith_number":"pith:3UAC5JPX","canonical_record":{"source":{"id":"1808.08213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-24T17:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"a332476aaca45c8155ffd3cfcab575654455ae74a1dd5986ffc2f15cc3a846fd","abstract_canon_sha256":"1e1ec84448ec4ccf96dd74c9eb7fb9b85ad34819bed22a5486798ee48de648b6"},"schema_version":"1.0"},"canonical_sha256":"dd002ea5f7586859bef218cbfdb0dc4b8a643334bf7f799cceb081393f8c9e69","source":{"kind":"arxiv","id":"1808.08213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08213","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08213v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08213","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"3UAC5JPXLBUF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3UAC5JPXLBUFTPXS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3UAC5JPX","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3UAC5JPXLBUFTPXSDDF73MG4JO","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-24T17:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"a332476aaca45c8155ffd3cfcab575654455ae74a1dd5986ffc2f15cc3a846fd","abstract_canon_sha256":"1e1ec84448ec4ccf96dd74c9eb7fb9b85ad34819bed22a5486798ee48de648b6"},"schema_version":"1.0"},"canonical_sha256":"dd002ea5f7586859bef218cbfdb0dc4b8a643334bf7f799cceb081393f8c9e69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:22.056226Z","signature_b64":"lB+WSDvfZb+afZj1NRLLxdj8rbnBMPr1x7bTxG4Ue28+McujvmKa8bSNvZPuCKE7drFUs5Eiu1qBPWBkVOXFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd002ea5f7586859bef218cbfdb0dc4b8a643334bf7f799cceb081393f8c9e69","last_reissued_at":"2026-05-18T00:07:22.055493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:22.055493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08213","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:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0jzDhydU3HcTc0zsp47JcD+cBrrrnzRQE9hekM+p+QIpAT4W5epd8dxjhZbzMIl5le+MBFlg9rXBud/eq1zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:40:21.046898Z"},"content_sha256":"80db178c99c2287ccebe321ffc7c9e61f92fb2eea1eac07756edc5f39f1aea8a","schema_version":"1.0","event_id":"sha256:80db178c99c2287ccebe321ffc7c9e61f92fb2eea1eac07756edc5f39f1aea8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3UAC5JPXLBUFTPXSDDF73MG4JO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Future Automation Engineering using Structural Graph Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arquimedes Canedo, Blake S. Pollard, Jiang Wan, Mohammad Abdullah Al Faruque, Palash Goyal, Sujit Rokka Chhetri","submitted_at":"2018-08-24T17:07:05Z","abstract_excerpt":"The digitalization of automation engineering generates large quantities of engineering data that is interlinked in knowledge graphs. Classifying and clustering subgraphs according to their functionality is useful to discover functionally equivalent engineering artifacts that exhibit different graph structures. This paper presents a new graph learning algorithm designed to classify engineering data artifacts -- represented in the form of graphs -- according to their structure and neighborhood features. Our Structural Graph Convolutional Neural Network (SGCNN) is capable of learning graphs and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08213","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:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtxUrqPWSc6KuqxTISXutRwpR6ueaeSYQrckKsPesvtMYW+30arN+s0QjptrkFiXIWAN+KqNUnG7eJLPSvIeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:40:21.047530Z"},"content_sha256":"ca0241e934ff52cabea1ddf6f295585de4004f6302d0cc3686d9ab01242ea2c7","schema_version":"1.0","event_id":"sha256:ca0241e934ff52cabea1ddf6f295585de4004f6302d0cc3686d9ab01242ea2c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/bundle.json","state_url":"https://pith.science/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/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-28T16:40:21Z","links":{"resolver":"https://pith.science/pith/3UAC5JPXLBUFTPXSDDF73MG4JO","bundle":"https://pith.science/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/bundle.json","state":"https://pith.science/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UAC5JPXLBUFTPXSDDF73MG4JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3UAC5JPXLBUFTPXSDDF73MG4JO","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":"1e1ec84448ec4ccf96dd74c9eb7fb9b85ad34819bed22a5486798ee48de648b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-24T17:07:05Z","title_canon_sha256":"a332476aaca45c8155ffd3cfcab575654455ae74a1dd5986ffc2f15cc3a846fd"},"schema_version":"1.0","source":{"id":"1808.08213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08213","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08213v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08213","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"3UAC5JPXLBUF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3UAC5JPXLBUFTPXS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3UAC5JPX","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:ca0241e934ff52cabea1ddf6f295585de4004f6302d0cc3686d9ab01242ea2c7","target":"graph","created_at":"2026-05-18T00:07:22Z","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":"The digitalization of automation engineering generates large quantities of engineering data that is interlinked in knowledge graphs. Classifying and clustering subgraphs according to their functionality is useful to discover functionally equivalent engineering artifacts that exhibit different graph structures. This paper presents a new graph learning algorithm designed to classify engineering data artifacts -- represented in the form of graphs -- according to their structure and neighborhood features. Our Structural Graph Convolutional Neural Network (SGCNN) is capable of learning graphs and s","authors_text":"Arquimedes Canedo, Blake S. Pollard, Jiang Wan, Mohammad Abdullah Al Faruque, Palash Goyal, Sujit Rokka Chhetri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-24T17:07:05Z","title":"Future Automation Engineering using Structural Graph Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08213","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:80db178c99c2287ccebe321ffc7c9e61f92fb2eea1eac07756edc5f39f1aea8a","target":"record","created_at":"2026-05-18T00:07:22Z","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":"1e1ec84448ec4ccf96dd74c9eb7fb9b85ad34819bed22a5486798ee48de648b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-24T17:07:05Z","title_canon_sha256":"a332476aaca45c8155ffd3cfcab575654455ae74a1dd5986ffc2f15cc3a846fd"},"schema_version":"1.0","source":{"id":"1808.08213","kind":"arxiv","version":1}},"canonical_sha256":"dd002ea5f7586859bef218cbfdb0dc4b8a643334bf7f799cceb081393f8c9e69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd002ea5f7586859bef218cbfdb0dc4b8a643334bf7f799cceb081393f8c9e69","first_computed_at":"2026-05-18T00:07:22.055493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:22.055493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lB+WSDvfZb+afZj1NRLLxdj8rbnBMPr1x7bTxG4Ue28+McujvmKa8bSNvZPuCKE7drFUs5Eiu1qBPWBkVOXFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:22.056226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80db178c99c2287ccebe321ffc7c9e61f92fb2eea1eac07756edc5f39f1aea8a","sha256:ca0241e934ff52cabea1ddf6f295585de4004f6302d0cc3686d9ab01242ea2c7"],"state_sha256":"5f2fe066fd6e2cec96a181c251e6fb32bafb7532b2e096a8fa5c694854d3f57d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGlaBEklRoq8QIVTEWOoJTlk7hipbZKeh9PxeY7DP5U2kUOGZ8sJe1QE+fel7APdtFWOz9OXlhKH0AEyEJW9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:40:21.050335Z","bundle_sha256":"4ac4cd9543fbec5c8b92912e610665dfe3a7f64a0698fdd386f9f6dec03f4bf7"}}