{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YZIBJOYEE6DJWAXKU2I5Y2Z5JR","short_pith_number":"pith:YZIBJOYE","schema_version":"1.0","canonical_sha256":"c65014bb0427869b02eaa691dc6b3d4c4f36aaa79577942c483061172c5f8a13","source":{"kind":"arxiv","id":"1707.03494","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03494","created_at":"2026-05-18T00:10:13.580380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03494v2","created_at":"2026-05-18T00:10:13.580380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03494","created_at":"2026-05-18T00:10:13.580380+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZIBJOYEE6DJ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZIBJOYEE6DJWAXK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZIBJOYE","created_at":"2026-05-18T12:31:59.375834+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/YZIBJOYEE6DJWAXKU2I5Y2Z5JR","json":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR.json","graph_json":"https://pith.science/api/pith-number/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/graph.json","events_json":"https://pith.science/api/pith-number/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/events.json","paper":"https://pith.science/paper/YZIBJOYE"},"agent_actions":{"view_html":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR","download_json":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR.json","view_paper":"https://pith.science/paper/YZIBJOYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03494&json=true","fetch_graph":"https://pith.science/api/pith-number/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/graph.json","fetch_events":"https://pith.science/api/pith-number/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/action/storage_attestation","attest_author":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/action/author_attestation","sign_citation":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/action/citation_signature","submit_replication":"https://pith.science/pith/YZIBJOYEE6DJWAXKU2I5Y2Z5JR/action/replication_record"}},"created_at":"2026-05-18T00:10:13.580380+00:00","updated_at":"2026-05-18T00:10:13.580380+00:00"}