{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RNCBNCVNSDIUNA7TR3IQMYRXIH","short_pith_number":"pith:RNCBNCVN","canonical_record":{"source":{"id":"1807.07516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"5d8d192cf86eb33923bf52f3e3f5a7bd5657025a5ea66c82eb541d5ea701079e","abstract_canon_sha256":"1d9d96bb35b0bc8068d62afdd137669a9aeef5eddad442c5bca410542ef24190"},"schema_version":"1.0"},"canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","source":{"kind":"arxiv","id":"1807.07516","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07516","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07516v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07516","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"RNCBNCVNSDIU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNCBNCVNSDIUNA7T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNCBNCVN","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RNCBNCVNSDIUNA7TR3IQMYRXIH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"5d8d192cf86eb33923bf52f3e3f5a7bd5657025a5ea66c82eb541d5ea701079e","abstract_canon_sha256":"1d9d96bb35b0bc8068d62afdd137669a9aeef5eddad442c5bca410542ef24190"},"schema_version":"1.0"},"canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.730772Z","signature_b64":"c7A1HWF4g/aozgJQGn3vRLnEfA7VAAZlngNz5VpbIHBmosObOgtRzVXqBfjVV/1bDKwItzrlaR8MG4KP73E5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","last_reissued_at":"2026-05-17T23:57:46.730218Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.730218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07516","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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBOALn+MIfB/X9xDzi8z2N+O75mHtIO+RHLqbrzmftsYj70f6WtciZJDQo1KjHDNTnLUD/C28UUSofU6olhdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:52:19.819490Z"},"content_sha256":"f5c431bcb7400f5c747c1416290aa3a67a032f1564dff63ebe8202cd040818ce","schema_version":"1.0","event_id":"sha256:f5c431bcb7400f5c747c1416290aa3a67a032f1564dff63ebe8202cd040818ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RNCBNCVNSDIUNA7TR3IQMYRXIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Marten Picker, Rolf Niedermeier","submitted_at":"2018-07-19T16:14:01Z","abstract_excerpt":"Finding large \"cliquish\" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter at most two (these are 2-clubs). A drawback of the 2-club model is that it produces star-like hub-and-spoke structures as maximum-cardinality solutions. Hence, we study 2-clubs with the additional constraint to be well-connected. More specifically, we investigate the algorithmic complexity for three variants of well-connected 2-clubs, all established in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07516","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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yRMwVnEwiWwksW9Xddse8dYOtUWnrErSIQMmhUkFdAgghsMXIbS9LRVEuuBxReCFjkmjpGVluOWNvwvpMDqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:52:19.819827Z"},"content_sha256":"2feebb6e63af2de1e19057d40ac8582f182a59c49efc2d6b49526d0c5ba88bda","schema_version":"1.0","event_id":"sha256:2feebb6e63af2de1e19057d40ac8582f182a59c49efc2d6b49526d0c5ba88bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/bundle.json","state_url":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/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-01T14:52:19Z","links":{"resolver":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH","bundle":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/bundle.json","state":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RNCBNCVNSDIUNA7TR3IQMYRXIH","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":"1d9d96bb35b0bc8068d62afdd137669a9aeef5eddad442c5bca410542ef24190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","title_canon_sha256":"5d8d192cf86eb33923bf52f3e3f5a7bd5657025a5ea66c82eb541d5ea701079e"},"schema_version":"1.0","source":{"id":"1807.07516","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07516","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07516v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07516","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"RNCBNCVNSDIU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNCBNCVNSDIUNA7T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNCBNCVN","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2feebb6e63af2de1e19057d40ac8582f182a59c49efc2d6b49526d0c5ba88bda","target":"graph","created_at":"2026-05-17T23:57:46Z","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 large \"cliquish\" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter at most two (these are 2-clubs). A drawback of the 2-club model is that it produces star-like hub-and-spoke structures as maximum-cardinality solutions. Hence, we study 2-clubs with the additional constraint to be well-connected. More specifically, we investigate the algorithmic complexity for three variants of well-connected 2-clubs, all established in the ","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Marten Picker, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","title":"Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07516","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:f5c431bcb7400f5c747c1416290aa3a67a032f1564dff63ebe8202cd040818ce","target":"record","created_at":"2026-05-17T23:57:46Z","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":"1d9d96bb35b0bc8068d62afdd137669a9aeef5eddad442c5bca410542ef24190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","title_canon_sha256":"5d8d192cf86eb33923bf52f3e3f5a7bd5657025a5ea66c82eb541d5ea701079e"},"schema_version":"1.0","source":{"id":"1807.07516","kind":"arxiv","version":2}},"canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","first_computed_at":"2026-05-17T23:57:46.730218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.730218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c7A1HWF4g/aozgJQGn3vRLnEfA7VAAZlngNz5VpbIHBmosObOgtRzVXqBfjVV/1bDKwItzrlaR8MG4KP73E5Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.730772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07516","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5c431bcb7400f5c747c1416290aa3a67a032f1564dff63ebe8202cd040818ce","sha256:2feebb6e63af2de1e19057d40ac8582f182a59c49efc2d6b49526d0c5ba88bda"],"state_sha256":"6aadd3e1ed73b417cf8477d8f35615f5060dc6d6a0e316ef843a1261552dd688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFMuAQidNFrolv0oHyrK4ZeIjoOARS3yc/ZWioMVDqZD+grC4kBsBQeLsO6XYxZnihoQ2gol/u3JXHJDFuloAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:52:19.821793Z","bundle_sha256":"7cc83e2ff504edda846b1bfb37b9e5826d186c67868379462aa4dd2f485f9dba"}}