{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LY3TVT5HXLC6HDTX4WSAUQSKS6","short_pith_number":"pith:LY3TVT5H","canonical_record":{"source":{"id":"1706.09487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T21:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"26a10bd8bcd76911dfd747e68e5ce56cd82b7913c4f7b7b1e0ba64e5b28902c3","abstract_canon_sha256":"9246e19ddd2ef382622269e40aa7c75bae97c3709e94862358920ea7b5c9a435"},"schema_version":"1.0"},"canonical_sha256":"5e373acfa7bac5e38e77e5a40a424a97aa22fc1e3e2e54ba922de25ad8cf4a5e","source":{"kind":"arxiv","id":"1706.09487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09487","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09487v1","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09487","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"LY3TVT5HXLC6","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LY3TVT5HXLC6HDTX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LY3TVT5H","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LY3TVT5HXLC6HDTX4WSAUQSKS6","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T21:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"26a10bd8bcd76911dfd747e68e5ce56cd82b7913c4f7b7b1e0ba64e5b28902c3","abstract_canon_sha256":"9246e19ddd2ef382622269e40aa7c75bae97c3709e94862358920ea7b5c9a435"},"schema_version":"1.0"},"canonical_sha256":"5e373acfa7bac5e38e77e5a40a424a97aa22fc1e3e2e54ba922de25ad8cf4a5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:14.944602Z","signature_b64":"ZEIPZ5+5bmsSyen5VR6tcYPedTJsomOX1M2yki2WE4Vj/VlPDRNIGYe8ga5JDLtv39Qs8c9+urCEuaIP5VRzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e373acfa7bac5e38e77e5a40a424a97aa22fc1e3e2e54ba922de25ad8cf4a5e","last_reissued_at":"2026-05-18T00:41:14.943891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:14.943891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09487","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-18T00:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAoLlsMzT+ta4qjK3lkz4X7783MHszqctl7IQMhIwLf56mFIoDVuFOC84cf3ot454C0b4mdJ8NljGKSD+28MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:05:16.814265Z"},"content_sha256":"638234f9c4b95bc5b357c3beb268407ec3220cf244c244c6076376be22aed379","schema_version":"1.0","event_id":"sha256:638234f9c4b95bc5b357c3beb268407ec3220cf244c244c6076376be22aed379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LY3TVT5HXLC6HDTX4WSAUQSKS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ivan Bliznets, Nikolai Karpov","submitted_at":"2017-06-28T21:12:40Z","abstract_excerpt":"Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally defined as cliques. However, such an approach might be too restrictive as in some applications, not all objects from the same cluster must be connected. That is why different types of cliques relaxations often considered as clusters.\n  In our work, we consider a problem of partitioning graph into clusters and a problem of isolating cluster of a special type whereby cluster we mean highly connected subgraph. Initially"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09487","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-18T00:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjdN0LYiyvTSNZu41/QUDhoEmLGQUNS56Ye0XR32QUNx5kAwl1RZhbEe5QwcDU8FfZE6GjBN1hEiLYlhWJFsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:05:16.814971Z"},"content_sha256":"878a9b28941092fc85e4603ce79a0e8a3d39653aa42bc03b722b9d34a7294086","schema_version":"1.0","event_id":"sha256:878a9b28941092fc85e4603ce79a0e8a3d39653aa42bc03b722b9d34a7294086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/bundle.json","state_url":"https://pith.science/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/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-05T02:05:16Z","links":{"resolver":"https://pith.science/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6","bundle":"https://pith.science/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/bundle.json","state":"https://pith.science/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY3TVT5HXLC6HDTX4WSAUQSKS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LY3TVT5HXLC6HDTX4WSAUQSKS6","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":"9246e19ddd2ef382622269e40aa7c75bae97c3709e94862358920ea7b5c9a435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T21:12:40Z","title_canon_sha256":"26a10bd8bcd76911dfd747e68e5ce56cd82b7913c4f7b7b1e0ba64e5b28902c3"},"schema_version":"1.0","source":{"id":"1706.09487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09487","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09487v1","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09487","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"LY3TVT5HXLC6","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LY3TVT5HXLC6HDTX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LY3TVT5H","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:878a9b28941092fc85e4603ce79a0e8a3d39653aa42bc03b722b9d34a7294086","target":"graph","created_at":"2026-05-18T00:41:14Z","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":"Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally defined as cliques. However, such an approach might be too restrictive as in some applications, not all objects from the same cluster must be connected. That is why different types of cliques relaxations often considered as clusters.\n  In our work, we consider a problem of partitioning graph into clusters and a problem of isolating cluster of a special type whereby cluster we mean highly connected subgraph. Initially","authors_text":"Ivan Bliznets, Nikolai Karpov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T21:12:40Z","title":"Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09487","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:638234f9c4b95bc5b357c3beb268407ec3220cf244c244c6076376be22aed379","target":"record","created_at":"2026-05-18T00:41:14Z","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":"9246e19ddd2ef382622269e40aa7c75bae97c3709e94862358920ea7b5c9a435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T21:12:40Z","title_canon_sha256":"26a10bd8bcd76911dfd747e68e5ce56cd82b7913c4f7b7b1e0ba64e5b28902c3"},"schema_version":"1.0","source":{"id":"1706.09487","kind":"arxiv","version":1}},"canonical_sha256":"5e373acfa7bac5e38e77e5a40a424a97aa22fc1e3e2e54ba922de25ad8cf4a5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e373acfa7bac5e38e77e5a40a424a97aa22fc1e3e2e54ba922de25ad8cf4a5e","first_computed_at":"2026-05-18T00:41:14.943891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:14.943891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZEIPZ5+5bmsSyen5VR6tcYPedTJsomOX1M2yki2WE4Vj/VlPDRNIGYe8ga5JDLtv39Qs8c9+urCEuaIP5VRzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:14.944602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638234f9c4b95bc5b357c3beb268407ec3220cf244c244c6076376be22aed379","sha256:878a9b28941092fc85e4603ce79a0e8a3d39653aa42bc03b722b9d34a7294086"],"state_sha256":"4ca155164c5c2cc3a2f4ee6d88ce01e7b9bfe127a8edcbd0934e124573f4876d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGXp7sNAr5Ag8TNlVfVEgLj5QGIsdDOGl9ACJ7oEgBcA1XqFehUZBTNtf3MsIWk7q75rIBtRJ0MemTPQ/WVSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:05:16.818702Z","bundle_sha256":"97fae5b4f1217b4193836ce8f6830034a1de4687e02eea2a6b728bb7ff2dd963"}}