{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7VKWKIVXEDM54ITT5QTO2MEL7K","short_pith_number":"pith:7VKWKIVX","canonical_record":{"source":{"id":"1810.00946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T12:05:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30e568e741d13f725f92409c89c29cd5502adafcc745e6ca4f7bfca337c63fb9","abstract_canon_sha256":"91c835403c0114a0023a004e1a9fcc72234044613840a9751a6284e21470f367"},"schema_version":"1.0"},"canonical_sha256":"fd556522b720d9de2273ec26ed308bfa9239bcceccc9b5782a893429e66e14db","source":{"kind":"arxiv","id":"1810.00946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00946","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00946v1","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00946","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"7VKWKIVXEDM5","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_16","alias_value":"7VKWKIVXEDM54ITT","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_8","alias_value":"7VKWKIVX","created_at":"2026-07-05T06:07:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7VKWKIVXEDM54ITT5QTO2MEL7K","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T12:05:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30e568e741d13f725f92409c89c29cd5502adafcc745e6ca4f7bfca337c63fb9","abstract_canon_sha256":"91c835403c0114a0023a004e1a9fcc72234044613840a9751a6284e21470f367"},"schema_version":"1.0"},"canonical_sha256":"fd556522b720d9de2273ec26ed308bfa9239bcceccc9b5782a893429e66e14db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:26.879758Z","signature_b64":"7TzCwqCPSycLDzYfCDFCKheNDKhoqWd970Vi+J30MFqqztz9Mjn4yT15o3UtyO51gqy7bOD6Cw53xnXhWPaECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd556522b720d9de2273ec26ed308bfa9239bcceccc9b5782a893429e66e14db","last_reissued_at":"2026-07-05T06:07:26.879392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:26.879392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00946","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-07-05T06:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Saul96+2T67wFUqzpJbSsx+z4xtITbM7QJ19C/OTRSRdqeMMfwMOyQwz/sQxFdr5OFM/MyfUC9pT4YN1nikVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:08:07.279268Z"},"content_sha256":"5dfe09e9fcc5c280a33811acdfe6361461bc2de7eb848174be9dc091365af1bf","schema_version":"1.0","event_id":"sha256:5dfe09e9fcc5c280a33811acdfe6361461bc2de7eb848174be9dc091365af1bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7VKWKIVXEDM54ITT5QTO2MEL7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Koh Takeuch, Makoto Onizuka, Seiji Maekawa","submitted_at":"2018-09-21T12:05:43Z","abstract_excerpt":"We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attributes in real-world graphs. We propose Non-linear Attributed Graph Clustering by Symmetric Non-negative Matrix Factorization with Positive Unlabeled Learning. The features of our method are three holds. 1) it learns a non-linear projection function between the different cluster assignments of the topology and the attributes of graphs so as to capture the complicated relationship"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00946","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.00946/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDKNU8378uH2kcAxStUM0H/7j85uKyolN1tAAV/kuIRs4QmaKeWi6GdN6wWPJV+3crMQQHKjqbl2KgWeMBXHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:08:07.280086Z"},"content_sha256":"a72177c8dd0136fa4a3f4a4766c5435ecb5c3e78d5e6b395332614f23f66a165","schema_version":"1.0","event_id":"sha256:a72177c8dd0136fa4a3f4a4766c5435ecb5c3e78d5e6b395332614f23f66a165"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/bundle.json","state_url":"https://pith.science/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/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-08-04T18:08:07Z","links":{"resolver":"https://pith.science/pith/7VKWKIVXEDM54ITT5QTO2MEL7K","bundle":"https://pith.science/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/bundle.json","state":"https://pith.science/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VKWKIVXEDM54ITT5QTO2MEL7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7VKWKIVXEDM54ITT5QTO2MEL7K","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":"91c835403c0114a0023a004e1a9fcc72234044613840a9751a6284e21470f367","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T12:05:43Z","title_canon_sha256":"30e568e741d13f725f92409c89c29cd5502adafcc745e6ca4f7bfca337c63fb9"},"schema_version":"1.0","source":{"id":"1810.00946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00946","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00946v1","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00946","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"7VKWKIVXEDM5","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_16","alias_value":"7VKWKIVXEDM54ITT","created_at":"2026-07-05T06:07:26Z"},{"alias_kind":"pith_short_8","alias_value":"7VKWKIVX","created_at":"2026-07-05T06:07:26Z"}],"graph_snapshots":[{"event_id":"sha256:a72177c8dd0136fa4a3f4a4766c5435ecb5c3e78d5e6b395332614f23f66a165","target":"graph","created_at":"2026-07-05T06:07:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.00946/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attributes in real-world graphs. We propose Non-linear Attributed Graph Clustering by Symmetric Non-negative Matrix Factorization with Positive Unlabeled Learning. The features of our method are three holds. 1) it learns a non-linear projection function between the different cluster assignments of the topology and the attributes of graphs so as to capture the complicated relationship","authors_text":"Koh Takeuch, Makoto Onizuka, Seiji Maekawa","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T12:05:43Z","title":"Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00946","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:5dfe09e9fcc5c280a33811acdfe6361461bc2de7eb848174be9dc091365af1bf","target":"record","created_at":"2026-07-05T06:07:26Z","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":"91c835403c0114a0023a004e1a9fcc72234044613840a9751a6284e21470f367","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T12:05:43Z","title_canon_sha256":"30e568e741d13f725f92409c89c29cd5502adafcc745e6ca4f7bfca337c63fb9"},"schema_version":"1.0","source":{"id":"1810.00946","kind":"arxiv","version":1}},"canonical_sha256":"fd556522b720d9de2273ec26ed308bfa9239bcceccc9b5782a893429e66e14db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd556522b720d9de2273ec26ed308bfa9239bcceccc9b5782a893429e66e14db","first_computed_at":"2026-07-05T06:07:26.879392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:07:26.879392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7TzCwqCPSycLDzYfCDFCKheNDKhoqWd970Vi+J30MFqqztz9Mjn4yT15o3UtyO51gqy7bOD6Cw53xnXhWPaECg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:07:26.879758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dfe09e9fcc5c280a33811acdfe6361461bc2de7eb848174be9dc091365af1bf","sha256:a72177c8dd0136fa4a3f4a4766c5435ecb5c3e78d5e6b395332614f23f66a165"],"state_sha256":"40cd9a1de5ce40aa39f2d9de1659efc59f47e81ba97fb67f9051773a2c3f9a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYa6s+oe2b8x3nhWatQCwajm5Taiit0XhGg4X9ovSvv0IH0i2Dq2TOMNIgmiILogN6RdjibOpkyLAl6ElAipDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T18:08:07.316860Z","bundle_sha256":"2fd76e7dfe4521a957aa73ec22c3dcf9bf544f6c829114cca39214f775e5075c"}}