{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YZIBJOYEE6DJWAXKU2I5Y2Z5JR","short_pith_number":"pith:YZIBJOYE","canonical_record":{"source":{"id":"1707.03494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-11T23:28:52Z","cross_cats_sorted":["cs.SI","stat.CO","stat.ME"],"title_canon_sha256":"bfa92062fe85cac8a87d5ecb28f968445ffe24791a4379a9b1dadb8b2af5a9b1","abstract_canon_sha256":"39e7c8894b5f4e659747c1e8856bb89e6f34847fe2829e7811bc373c7e75117c"},"schema_version":"1.0"},"canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","source":{"kind":"arxiv","id":"1707.03494","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03494","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03494v2","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03494","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"YZIBJOYEE6DJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZIBJOYEE6DJWAXK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZIBJOYE","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YZIBJOYEE6DJWAXKU2I5Y2Z5JR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-11T23:28:52Z","cross_cats_sorted":["cs.SI","stat.CO","stat.ME"],"title_canon_sha256":"bfa92062fe85cac8a87d5ecb28f968445ffe24791a4379a9b1dadb8b2af5a9b1","abstract_canon_sha256":"39e7c8894b5f4e659747c1e8856bb89e6f34847fe2829e7811bc373c7e75117c"},"schema_version":"1.0"},"canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:13.580900Z","signature_b64":"xIpDeuYoUZ9x3FSy2T57CC27R9GB8UZ/TngJJxh9NkCUwSbOugWe4+V4Wm7Lgb6qlOxWIpLxEGsQMvlXXbN1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","last_reissued_at":"2026-05-18T00:10:13.580261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:13.580261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03494","source_version":2,"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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIXJILb0aIuVNpdJY2GOp8UFFAWxg7makqjhFIvHEOmk9wwS0PCJbpUUK/bYS8B4EqYNyV7gp7mzcpCapgVOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:27:34.282391Z"},"content_sha256":"18c16f8d3546229d08bc17df139aac8397c9a5475474007290faca7c565c4fb3","schema_version":"1.0","event_id":"sha256:18c16f8d3546229d08bc17df139aac8397c9a5475474007290faca7c565c4fb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YZIBJOYEE6DJWAXKU2I5Y2Z5JR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised robust nonparametric learning of hidden community properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Akhilesh Gotmare, Martin Jaggi, Mikhail A. Langovoy","submitted_at":"2017-07-11T23:28:52Z","abstract_excerpt":"We consider learning of fundamental properties of communities in large noisy networks, in the prototypical situation where the nodes or users are split into two classes according to a binary property, e.g., according to their opinions or preferences on a topic. For learning these properties, we propose a nonparametric, unsupervised, and scalable graph scan procedure that is, in addition, robust against a class of powerful adversaries. In our setup, one of the communities can fall under the influence of a knowledgeable adversarial leader, who knows the full network structure, has unlimited comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03494","kind":"arxiv","version":2},"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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDlgKxugQ2PdAGLR7t/aihLd6H1Ildo7glabzfLyGqHaKsoBKYPZcfgGABI6KUVb6K1gJYSo4uxDUDfkuXZMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:27:34.282740Z"},"content_sha256":"6fc3a09c8e2dd562a4c376ef4be44c1ddb77eef8c98703b69992515ce7302bfc","schema_version":"1.0","event_id":"sha256:6fc3a09c8e2dd562a4c376ef4be44c1ddb77eef8c98703b69992515ce7302bfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/bundle.json","state_url":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/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-07-04T15:27:34Z","links":{"resolver":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR","bundle":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/bundle.json","state":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YZIBJOYEE6DJWAXKU2I5Y2Z5JR","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":"39e7c8894b5f4e659747c1e8856bb89e6f34847fe2829e7811bc373c7e75117c","cross_cats_sorted":["cs.SI","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-11T23:28:52Z","title_canon_sha256":"bfa92062fe85cac8a87d5ecb28f968445ffe24791a4379a9b1dadb8b2af5a9b1"},"schema_version":"1.0","source":{"id":"1707.03494","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03494","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03494v2","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03494","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"YZIBJOYEE6DJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZIBJOYEE6DJWAXK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZIBJOYE","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:6fc3a09c8e2dd562a4c376ef4be44c1ddb77eef8c98703b69992515ce7302bfc","target":"graph","created_at":"2026-05-18T00:10:13Z","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":"We consider learning of fundamental properties of communities in large noisy networks, in the prototypical situation where the nodes or users are split into two classes according to a binary property, e.g., according to their opinions or preferences on a topic. For learning these properties, we propose a nonparametric, unsupervised, and scalable graph scan procedure that is, in addition, robust against a class of powerful adversaries. In our setup, one of the communities can fall under the influence of a knowledgeable adversarial leader, who knows the full network structure, has unlimited comp","authors_text":"Akhilesh Gotmare, Martin Jaggi, Mikhail A. Langovoy","cross_cats":["cs.SI","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-11T23:28:52Z","title":"Unsupervised robust nonparametric learning of hidden community properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03494","kind":"arxiv","version":2},"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:18c16f8d3546229d08bc17df139aac8397c9a5475474007290faca7c565c4fb3","target":"record","created_at":"2026-05-18T00:10:13Z","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":"39e7c8894b5f4e659747c1e8856bb89e6f34847fe2829e7811bc373c7e75117c","cross_cats_sorted":["cs.SI","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-11T23:28:52Z","title_canon_sha256":"bfa92062fe85cac8a87d5ecb28f968445ffe24791a4379a9b1dadb8b2af5a9b1"},"schema_version":"1.0","source":{"id":"1707.03494","kind":"arxiv","version":2}},"canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","first_computed_at":"2026-05-18T00:10:13.580261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:13.580261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xIpDeuYoUZ9x3FSy2T57CC27R9GB8UZ/TngJJxh9NkCUwSbOugWe4+V4Wm7Lgb6qlOxWIpLxEGsQMvlXXbN1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:13.580900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03494","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c16f8d3546229d08bc17df139aac8397c9a5475474007290faca7c565c4fb3","sha256:6fc3a09c8e2dd562a4c376ef4be44c1ddb77eef8c98703b69992515ce7302bfc"],"state_sha256":"8f66156d4e0dfafe4238f026b85717edb904b76ef63c3c32df58977639b68c76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WxDkQRP1L4oiZWnRq0udLSw8rfO1K9IQgoRQfwYrXpnvDcslCQk1xS2zXJzOFSsJs/mef5AHrbE2YCP8hEnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:27:34.284594Z","bundle_sha256":"5cadd5db16b11588e4ff6569c8c2e7dc87056b0cce500c941491e6371e6e69fc"}}