{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7OIN4IFF5RZXGYP25A7FDJB7HX","short_pith_number":"pith:7OIN4IFF","canonical_record":{"source":{"id":"1903.05246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-12T22:40:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"da0836d40af4ab91177376793b3f77863cdd18fdab4291c695ff648f41bbcd56","abstract_canon_sha256":"8a6bb81360f1acee11d405d73f3067e7c0e664fdf77b40b5dc5169be16bad755"},"schema_version":"1.0"},"canonical_sha256":"fb90de20a5ec737361fae83e51a43f3dc2a7322d483ae7a3295df6b156d9265f","source":{"kind":"arxiv","id":"1903.05246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05246","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05246v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05246","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"7OIN4IFF5RZX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OIN4IFF5RZXGYP2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OIN4IFF","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7OIN4IFF5RZXGYP25A7FDJB7HX","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-12T22:40:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"da0836d40af4ab91177376793b3f77863cdd18fdab4291c695ff648f41bbcd56","abstract_canon_sha256":"8a6bb81360f1acee11d405d73f3067e7c0e664fdf77b40b5dc5169be16bad755"},"schema_version":"1.0"},"canonical_sha256":"fb90de20a5ec737361fae83e51a43f3dc2a7322d483ae7a3295df6b156d9265f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.942986Z","signature_b64":"RwM2LP9oC6DUSQfTKfubp7QhWWl3U7WDzQbhmMf1BduZcj9RlPXsJf+XaEL0xtAGr4fk8qDr1owlNYLMjyuNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb90de20a5ec737361fae83e51a43f3dc2a7322d483ae7a3295df6b156d9265f","last_reissued_at":"2026-05-17T23:51:24.942444Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.942444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05246","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqB5dpKqPiMa19bM4rlN+BFEHJYSo3cgiH8IAgo9BP2r2Krn5sPck+a8FE0n/WsvAyWmr1/IZSssUmNg/RssCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:19:07.483746Z"},"content_sha256":"3cb30b5a4a8c1a4b70a6d495504e6e81c0fbcec769d86a277425500097798f7e","schema_version":"1.0","event_id":"sha256:3cb30b5a4a8c1a4b70a6d495504e6e81c0fbcec769d86a277425500097798f7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7OIN4IFF5RZXGYP25A7FDJB7HX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Resolution Parameters for Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Anthony Wirth, David F. Gleich, Nate Veldt","submitted_at":"2019-03-12T22:40:19Z","abstract_excerpt":"Finding clusters of well-connected nodes in a graph is an extensively studied problem in graph-based data analysis. Because of its many applications, a large number of distinct graph clustering objective functions and algorithms have already been proposed and analyzed. To aid practitioners in determining the best clustering approach to use in different applications, we present new techniques for automatically learning how to set clustering resolution parameters. These parameters control the size and structure of communities that are formed by optimizing a generalized objective function. We beg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05246","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGpv/DjZz3TV9djdGNzrOZqfGzBDxUGH6tCd57TKk84A9Fzvljt7z5oUgMUeE1qQpDuoIHVU6xYTzZ46FybxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:19:07.484098Z"},"content_sha256":"bef9bfb36518ae51d7d34d592aae5b7e4e593454cc637fd9ebef670a939d5096","schema_version":"1.0","event_id":"sha256:bef9bfb36518ae51d7d34d592aae5b7e4e593454cc637fd9ebef670a939d5096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/bundle.json","state_url":"https://pith.science/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/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-05-28T02:19:07Z","links":{"resolver":"https://pith.science/pith/7OIN4IFF5RZXGYP25A7FDJB7HX","bundle":"https://pith.science/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/bundle.json","state":"https://pith.science/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OIN4IFF5RZXGYP25A7FDJB7HX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7OIN4IFF5RZXGYP25A7FDJB7HX","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":"8a6bb81360f1acee11d405d73f3067e7c0e664fdf77b40b5dc5169be16bad755","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-12T22:40:19Z","title_canon_sha256":"da0836d40af4ab91177376793b3f77863cdd18fdab4291c695ff648f41bbcd56"},"schema_version":"1.0","source":{"id":"1903.05246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05246","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05246v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05246","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"7OIN4IFF5RZX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OIN4IFF5RZXGYP2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OIN4IFF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:bef9bfb36518ae51d7d34d592aae5b7e4e593454cc637fd9ebef670a939d5096","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"Finding clusters of well-connected nodes in a graph is an extensively studied problem in graph-based data analysis. Because of its many applications, a large number of distinct graph clustering objective functions and algorithms have already been proposed and analyzed. To aid practitioners in determining the best clustering approach to use in different applications, we present new techniques for automatically learning how to set clustering resolution parameters. These parameters control the size and structure of communities that are formed by optimizing a generalized objective function. We beg","authors_text":"Anthony Wirth, David F. Gleich, Nate Veldt","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-12T22:40:19Z","title":"Learning Resolution Parameters for Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05246","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:3cb30b5a4a8c1a4b70a6d495504e6e81c0fbcec769d86a277425500097798f7e","target":"record","created_at":"2026-05-17T23:51:24Z","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":"8a6bb81360f1acee11d405d73f3067e7c0e664fdf77b40b5dc5169be16bad755","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-12T22:40:19Z","title_canon_sha256":"da0836d40af4ab91177376793b3f77863cdd18fdab4291c695ff648f41bbcd56"},"schema_version":"1.0","source":{"id":"1903.05246","kind":"arxiv","version":1}},"canonical_sha256":"fb90de20a5ec737361fae83e51a43f3dc2a7322d483ae7a3295df6b156d9265f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb90de20a5ec737361fae83e51a43f3dc2a7322d483ae7a3295df6b156d9265f","first_computed_at":"2026-05-17T23:51:24.942444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.942444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RwM2LP9oC6DUSQfTKfubp7QhWWl3U7WDzQbhmMf1BduZcj9RlPXsJf+XaEL0xtAGr4fk8qDr1owlNYLMjyuNCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.942986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cb30b5a4a8c1a4b70a6d495504e6e81c0fbcec769d86a277425500097798f7e","sha256:bef9bfb36518ae51d7d34d592aae5b7e4e593454cc637fd9ebef670a939d5096"],"state_sha256":"66a01f7467963692d149554fa1fc1e2490161ac2b32fe7e8f097cedb948391e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kDi5MYjsZxL1dKSy8Mpx1IcyK1p51FV0hjCK86AMZhzdvTBdCU7FnvLeVn1YkM4bmVefCDEpVY1GOXVPkoj6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:19:07.486138Z","bundle_sha256":"46be56aa1b872534fc3cf82d457688649d9659d0d34cfbbc8bcaeaa17a75ac34"}}