{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C5AKPA7HNVDHSX3DYSWPT7G2QM","short_pith_number":"pith:C5AKPA7H","canonical_record":{"source":{"id":"1905.10224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T13:32:09Z","cross_cats_sorted":["cs.DM","cs.NE","math.NA","stat.ML"],"title_canon_sha256":"3fa5482fa5d29e871c7c45343b71d6c3dec56d4309e7c0bf6d48853d895352a4","abstract_canon_sha256":"0a8b3888c842e5360c474a8d7d8c966dd58a9d9e45d1b8ee674c1e70f970f752"},"schema_version":"1.0"},"canonical_sha256":"1740a783e76d46795f63c4acf9fcda8330eb4c8ef5ba20646fcc33881c1edc72","source":{"kind":"arxiv","id":"1905.10224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10224","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10224v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10224","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"C5AKPA7HNVDH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C5AKPA7HNVDHSX3D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C5AKPA7H","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C5AKPA7HNVDHSX3DYSWPT7G2QM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T13:32:09Z","cross_cats_sorted":["cs.DM","cs.NE","math.NA","stat.ML"],"title_canon_sha256":"3fa5482fa5d29e871c7c45343b71d6c3dec56d4309e7c0bf6d48853d895352a4","abstract_canon_sha256":"0a8b3888c842e5360c474a8d7d8c966dd58a9d9e45d1b8ee674c1e70f970f752"},"schema_version":"1.0"},"canonical_sha256":"1740a783e76d46795f63c4acf9fcda8330eb4c8ef5ba20646fcc33881c1edc72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.882355Z","signature_b64":"mKArbZ0SvSWsRg6W9iOirja7XWGnNE+VpujRJ5+5Zi0u/JQ0MQnXq/B6DrQQKOcOjSL4mrOu4k9KMw9USkfUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1740a783e76d46795f63c4acf9fcda8330eb4c8ef5ba20646fcc33881c1edc72","last_reissued_at":"2026-05-17T23:45:10.881631Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.881631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10224","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+ZXjf/nImelIEtdR9NO3z2rXUiFWBegkEeaNawVq1qNbutWARpdAgWc//wLKyGOuoRbtcL6xMizh5wzekjUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:30:26.876668Z"},"content_sha256":"3d9535d1e10a0bebb7f22831629350c4c6c46d60492144a9982cd649096e57ef","schema_version":"1.0","event_id":"sha256:3d9535d1e10a0bebb7f22831629350c4c6c46d60492144a9982cd649096e57ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C5AKPA7HNVDHSX3DYSWPT7G2QM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Classification on Non-Sparse Graphs Using Low-Rank Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NE","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dominik Alfke, Martin Stoll","submitted_at":"2019-05-24T13:32:09Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have proven to be successful tools for semi-supervised learning on graph-based datasets. For sparse graphs, linear and polynomial filter functions have yielded impressive results. For large non-sparse graphs, however, network training and evaluation becomes prohibitively expensive. By introducing low-rank filters, we gain significant runtime acceleration and simultaneously improved accuracy. We further propose an architecture change mimicking techniques from Model Order Reduction in what we call a reduced-order GCN. Moreover, we present how our method can al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10224","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igsoGQIPT4Wrt1L+iq7j07EI5AciWoCNk8JUJI81WJ3xlCh+x0IwcXKFSE8N/0TUhJ0Fef86ElvLIbz7HzbSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:30:26.877021Z"},"content_sha256":"a89c585d9085ced7fc7847363bef34a456cbdc3af9c5326f7c3281e4867d8335","schema_version":"1.0","event_id":"sha256:a89c585d9085ced7fc7847363bef34a456cbdc3af9c5326f7c3281e4867d8335"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/bundle.json","state_url":"https://pith.science/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/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-22T19:30:26Z","links":{"resolver":"https://pith.science/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM","bundle":"https://pith.science/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/bundle.json","state":"https://pith.science/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5AKPA7HNVDHSX3DYSWPT7G2QM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C5AKPA7HNVDHSX3DYSWPT7G2QM","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":"0a8b3888c842e5360c474a8d7d8c966dd58a9d9e45d1b8ee674c1e70f970f752","cross_cats_sorted":["cs.DM","cs.NE","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T13:32:09Z","title_canon_sha256":"3fa5482fa5d29e871c7c45343b71d6c3dec56d4309e7c0bf6d48853d895352a4"},"schema_version":"1.0","source":{"id":"1905.10224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10224","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10224v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10224","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"C5AKPA7HNVDH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C5AKPA7HNVDHSX3D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C5AKPA7H","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:a89c585d9085ced7fc7847363bef34a456cbdc3af9c5326f7c3281e4867d8335","target":"graph","created_at":"2026-05-17T23:45:10Z","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":"Graph Convolutional Networks (GCNs) have proven to be successful tools for semi-supervised learning on graph-based datasets. For sparse graphs, linear and polynomial filter functions have yielded impressive results. For large non-sparse graphs, however, network training and evaluation becomes prohibitively expensive. By introducing low-rank filters, we gain significant runtime acceleration and simultaneously improved accuracy. We further propose an architecture change mimicking techniques from Model Order Reduction in what we call a reduced-order GCN. Moreover, we present how our method can al","authors_text":"Dominik Alfke, Martin Stoll","cross_cats":["cs.DM","cs.NE","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T13:32:09Z","title":"Semi-Supervised Classification on Non-Sparse Graphs Using Low-Rank Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10224","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:3d9535d1e10a0bebb7f22831629350c4c6c46d60492144a9982cd649096e57ef","target":"record","created_at":"2026-05-17T23:45:10Z","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":"0a8b3888c842e5360c474a8d7d8c966dd58a9d9e45d1b8ee674c1e70f970f752","cross_cats_sorted":["cs.DM","cs.NE","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T13:32:09Z","title_canon_sha256":"3fa5482fa5d29e871c7c45343b71d6c3dec56d4309e7c0bf6d48853d895352a4"},"schema_version":"1.0","source":{"id":"1905.10224","kind":"arxiv","version":1}},"canonical_sha256":"1740a783e76d46795f63c4acf9fcda8330eb4c8ef5ba20646fcc33881c1edc72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1740a783e76d46795f63c4acf9fcda8330eb4c8ef5ba20646fcc33881c1edc72","first_computed_at":"2026-05-17T23:45:10.881631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.881631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mKArbZ0SvSWsRg6W9iOirja7XWGnNE+VpujRJ5+5Zi0u/JQ0MQnXq/B6DrQQKOcOjSL4mrOu4k9KMw9USkfUDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.882355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d9535d1e10a0bebb7f22831629350c4c6c46d60492144a9982cd649096e57ef","sha256:a89c585d9085ced7fc7847363bef34a456cbdc3af9c5326f7c3281e4867d8335"],"state_sha256":"f3c24e380a0ec8df2345a7a78301c4c1b45afa12cbd4d37b67b53f4991c5aa59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TK5/sXtizZEqGSAJEHBSLNw2e5Eyu/9mNr2Tq2/y0skCBNT/dAXlk9H/6jDy4jCRdf1gaUjzoxFzCrbg04BCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T19:30:26.879022Z","bundle_sha256":"23d9375adec7706994e13dca090f50624ac95210098cbdd4e8ea8bc6e02cbe82"}}