{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7L37V4F7OWUP4JO5DQUDLQJJT7","short_pith_number":"pith:7L37V4F7","schema_version":"1.0","canonical_sha256":"faf7faf0bf75a8fe25dd1c2835c1299fe078cc310fc98d5d2489dc5c062e16e0","source":{"kind":"arxiv","id":"1712.03563","version":1},"attestation_state":"computed","paper":{"title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Lang, Bo Wu, Lei Huang, Yang Liu","submitted_at":"2017-12-10T17:38:25Z","abstract_excerpt":"Convolutional neural networks (CNNs) can be applied to graph similarity matching, in which case they are called graph CNNs. Graph CNNs are attracting increasing attention due to their effectiveness and efficiency. However, the existing convolution approaches focus only on regular data forms and require the transfer of the graph or key node neighborhoods of the graph into the same fixed form. During this transfer process, structural information of the graph can be lost, and some redundant information can be incorporated. To overcome this problem, we propose the disordered graph convolutional ne"},"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":"1712.03563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-10T17:38:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f4067b00a5b6b6ed76904d202791dcdffe16cab19029cf0e76ff67e7c94295e4","abstract_canon_sha256":"f390c27e143b8628729ff43d6454644e6e7cba19cb91224289c6b245091e2158"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:20.813633Z","signature_b64":"zDEL+VxttvQqBmKfrxtpvEKqafRKBgMLGfGOJ2qjZ2Az2qUK3x0S/38LGjT8cIWmw8n0RUGOyiQQ0WFbQ8mZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faf7faf0bf75a8fe25dd1c2835c1299fe078cc310fc98d5d2489dc5c062e16e0","last_reissued_at":"2026-05-18T00:28:20.812909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:20.812909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Lang, Bo Wu, Lei Huang, Yang Liu","submitted_at":"2017-12-10T17:38:25Z","abstract_excerpt":"Convolutional neural networks (CNNs) can be applied to graph similarity matching, in which case they are called graph CNNs. Graph CNNs are attracting increasing attention due to their effectiveness and efficiency. However, the existing convolution approaches focus only on regular data forms and require the transfer of the graph or key node neighborhoods of the graph into the same fixed form. During this transfer process, structural information of the graph can be lost, and some redundant information can be incorporated. To overcome this problem, we propose the disordered graph convolutional ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03563","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.03563","created_at":"2026-05-18T00:28:20.813014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03563v1","created_at":"2026-05-18T00:28:20.813014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03563","created_at":"2026-05-18T00:28:20.813014+00:00"},{"alias_kind":"pith_short_12","alias_value":"7L37V4F7OWUP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7L37V4F7OWUP4JO5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7L37V4F7","created_at":"2026-05-18T12:31:05.417338+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/7L37V4F7OWUP4JO5DQUDLQJJT7","json":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7.json","graph_json":"https://pith.science/api/pith-number/7L37V4F7OWUP4JO5DQUDLQJJT7/graph.json","events_json":"https://pith.science/api/pith-number/7L37V4F7OWUP4JO5DQUDLQJJT7/events.json","paper":"https://pith.science/paper/7L37V4F7"},"agent_actions":{"view_html":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7","download_json":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7.json","view_paper":"https://pith.science/paper/7L37V4F7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03563&json=true","fetch_graph":"https://pith.science/api/pith-number/7L37V4F7OWUP4JO5DQUDLQJJT7/graph.json","fetch_events":"https://pith.science/api/pith-number/7L37V4F7OWUP4JO5DQUDLQJJT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7/action/storage_attestation","attest_author":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7/action/author_attestation","sign_citation":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7/action/citation_signature","submit_replication":"https://pith.science/pith/7L37V4F7OWUP4JO5DQUDLQJJT7/action/replication_record"}},"created_at":"2026-05-18T00:28:20.813014+00:00","updated_at":"2026-05-18T00:28:20.813014+00:00"}