{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V3FGQX4YYNY6VGVRL5D4QNGCZD","short_pith_number":"pith:V3FGQX4Y","canonical_record":{"source":{"id":"1703.08668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-03-25T09:36:47Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"445835d1fbb33d1b1709d7a32c095b5e9d62fc3803eae052f1d8c7b0b0cb0ece","abstract_canon_sha256":"a4674fa3ed1278d2ed4904c5890763bf854d15c2ec92dcd19bb3d6564b3d785c"},"schema_version":"1.0"},"canonical_sha256":"aeca685f98c371ea9ab15f47c834c2c8ca4b78f015bfc88a0e7dda7eebc92f22","source":{"kind":"arxiv","id":"1703.08668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08668","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08668v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08668","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"V3FGQX4YYNY6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3FGQX4YYNY6VGVR","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3FGQX4Y","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V3FGQX4YYNY6VGVRL5D4QNGCZD","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-03-25T09:36:47Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"445835d1fbb33d1b1709d7a32c095b5e9d62fc3803eae052f1d8c7b0b0cb0ece","abstract_canon_sha256":"a4674fa3ed1278d2ed4904c5890763bf854d15c2ec92dcd19bb3d6564b3d785c"},"schema_version":"1.0"},"canonical_sha256":"aeca685f98c371ea9ab15f47c834c2c8ca4b78f015bfc88a0e7dda7eebc92f22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.915541Z","signature_b64":"jjF99khCc7LBSc64ErKWmgWn3qMtJoF4n6NGpsq8dachUdWLMm5O/OOBJV5eUTNKd5gRTGI9gewE0MKQEz/0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeca685f98c371ea9ab15f47c834c2c8ca4b78f015bfc88a0e7dda7eebc92f22","last_reissued_at":"2026-05-18T00:47:55.914794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.914794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08668","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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGdfUDbJlCGIUzkF8fN/TH6qF9xCuEL7mKnsQKUrK4REStnztPjEWnI3O4xeicuROTBF7i62UaRjmRhs+BWuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:37:58.607518Z"},"content_sha256":"aadfc3777c9fa7f24dee129184525c72fe4de1e5c1fb152cfbae91c20a0c031f","schema_version":"1.0","event_id":"sha256:aadfc3777c9fa7f24dee129184525c72fe4de1e5c1fb152cfbae91c20a0c031f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V3FGQX4YYNY6VGVRL5D4QNGCZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating k-Vertex Connected Components in Large Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Dong Wen, Lijun Chang, Lu Qin, Xuemin Lin, Ying Zhang","submitted_at":"2017-03-25T09:36:47Z","abstract_excerpt":"Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph metrics can guarantee good structural properties but may cause the free-rider effect. Here, by free-rider effect, we mean that some irrelevant subgraphs are combined as one subgraph if they only share a small number of vertices and edges. In this paper, we study k-vertex connected component (k-VCC) which can effectively eliminate the free-rider effect but less st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08668","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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tlmjh+btKMkfcq+2JIHed3RWoo0YnQGJ5p9SFknUfja+n1Zl6Du8KEIrj9WTwi2gTOysWM9FdByM1AQlQq8rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:37:58.607862Z"},"content_sha256":"0a63cdcbdee8fcd57b3000a63e650cef72a7ae7558d755acd0e852af7a63a2c3","schema_version":"1.0","event_id":"sha256:0a63cdcbdee8fcd57b3000a63e650cef72a7ae7558d755acd0e852af7a63a2c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/bundle.json","state_url":"https://pith.science/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/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-31T01:37:58Z","links":{"resolver":"https://pith.science/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD","bundle":"https://pith.science/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/bundle.json","state":"https://pith.science/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3FGQX4YYNY6VGVRL5D4QNGCZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V3FGQX4YYNY6VGVRL5D4QNGCZD","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":"a4674fa3ed1278d2ed4904c5890763bf854d15c2ec92dcd19bb3d6564b3d785c","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-03-25T09:36:47Z","title_canon_sha256":"445835d1fbb33d1b1709d7a32c095b5e9d62fc3803eae052f1d8c7b0b0cb0ece"},"schema_version":"1.0","source":{"id":"1703.08668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08668","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08668v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08668","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"V3FGQX4YYNY6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3FGQX4YYNY6VGVR","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3FGQX4Y","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:0a63cdcbdee8fcd57b3000a63e650cef72a7ae7558d755acd0e852af7a63a2c3","target":"graph","created_at":"2026-05-18T00:47:55Z","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":"Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph metrics can guarantee good structural properties but may cause the free-rider effect. Here, by free-rider effect, we mean that some irrelevant subgraphs are combined as one subgraph if they only share a small number of vertices and edges. In this paper, we study k-vertex connected component (k-VCC) which can effectively eliminate the free-rider effect but less st","authors_text":"Dong Wen, Lijun Chang, Lu Qin, Xuemin Lin, Ying Zhang","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-03-25T09:36:47Z","title":"Enumerating k-Vertex Connected Components in Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08668","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:aadfc3777c9fa7f24dee129184525c72fe4de1e5c1fb152cfbae91c20a0c031f","target":"record","created_at":"2026-05-18T00:47:55Z","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":"a4674fa3ed1278d2ed4904c5890763bf854d15c2ec92dcd19bb3d6564b3d785c","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-03-25T09:36:47Z","title_canon_sha256":"445835d1fbb33d1b1709d7a32c095b5e9d62fc3803eae052f1d8c7b0b0cb0ece"},"schema_version":"1.0","source":{"id":"1703.08668","kind":"arxiv","version":1}},"canonical_sha256":"aeca685f98c371ea9ab15f47c834c2c8ca4b78f015bfc88a0e7dda7eebc92f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeca685f98c371ea9ab15f47c834c2c8ca4b78f015bfc88a0e7dda7eebc92f22","first_computed_at":"2026-05-18T00:47:55.914794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.914794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jjF99khCc7LBSc64ErKWmgWn3qMtJoF4n6NGpsq8dachUdWLMm5O/OOBJV5eUTNKd5gRTGI9gewE0MKQEz/0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.915541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aadfc3777c9fa7f24dee129184525c72fe4de1e5c1fb152cfbae91c20a0c031f","sha256:0a63cdcbdee8fcd57b3000a63e650cef72a7ae7558d755acd0e852af7a63a2c3"],"state_sha256":"eb62ebe55bd12bf6f00b73f9bbaaf6d1bf870dc5b959304759b1f99e2d707297"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xt9ucJc4rCFuE/jHp9vL52qOPP1+G7KspcbvrPG1cBCw0ZpIMwANXSQEPzj+58gyIzkvNdJ3W5XXIbN7AEJDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:37:58.609813Z","bundle_sha256":"4315a4cfc7142369f103dc79a57aa27b06b2e2b29c8daebe1bd4d68548987fda"}}