{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IWDY3XBDZMG4ENDKC4ZFBH4OGY","short_pith_number":"pith:IWDY3XBD","canonical_record":{"source":{"id":"1501.07348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-29T05:46:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a57b364e8083e1c72e77a65fdd6787323bf941e7483cf9dc9d476384aa1be0e4","abstract_canon_sha256":"ed98cbb0aaf6dc9af88cb8dbe803a9819dc76a2ac4077bf7c1b08f9a1351fbb0"},"schema_version":"1.0"},"canonical_sha256":"45878ddc23cb0dc2346a1732509f8e361228fb960c2dc53d2471c71bc5575ce4","source":{"kind":"arxiv","id":"1501.07348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07348","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07348v1","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07348","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"IWDY3XBDZMG4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWDY3XBDZMG4ENDK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWDY3XBD","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IWDY3XBDZMG4ENDKC4ZFBH4OGY","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-29T05:46:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a57b364e8083e1c72e77a65fdd6787323bf941e7483cf9dc9d476384aa1be0e4","abstract_canon_sha256":"ed98cbb0aaf6dc9af88cb8dbe803a9819dc76a2ac4077bf7c1b08f9a1351fbb0"},"schema_version":"1.0"},"canonical_sha256":"45878ddc23cb0dc2346a1732509f8e361228fb960c2dc53d2471c71bc5575ce4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:22.203074Z","signature_b64":"PRaF8K/Y7Id3vaKiD8O8QwLVhgAahIbVlw95LzAJz4s76BN9U5ULKRSYQZ1ToLh6P4Q5oB/O4aPBUbV4J+SUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45878ddc23cb0dc2346a1732509f8e361228fb960c2dc53d2471c71bc5575ce4","last_reissued_at":"2026-05-18T02:28:22.202456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:22.202456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07348","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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cXsYyZvbtA3pTOofWMgG+iFbw5//wnOaLEyXhUU1GY9qdn6nNduRFyfyO2sVdm41Ek5DxNU92IV97V6yc2dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:12.609536Z"},"content_sha256":"f8a653c7a18ae69bba6f1a5c5a637c7dbe92a986354ec2d20d210625fd306546","schema_version":"1.0","event_id":"sha256:f8a653c7a18ae69bba6f1a5c5a637c7dbe92a986354ec2d20d210625fd306546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IWDY3XBDZMG4ENDKC4ZFBH4OGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Connected Dense $k$-Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Changjun Wang, Xiaodong Hu, Xujin Chen","submitted_at":"2015-01-29T05:46:55Z","abstract_excerpt":"Given a connected graph $G$ on $n$ vertices and a positive integer $k\\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$ such that its density is at least a factor $\\Omega(\\max\\{n^{-2/5},k^2/n^2\\})$ of the density of the densest $k$-subgraph in $G$ (which is not necessarily connected). These particularly provide the first non-trivial approximations for the densest connected $k$-subgraph problem on general graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07348","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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLrUfNooECUiSZW6quftfPtoUHjSPw9mbn50uO6EEgDyaz5eIEqv8GQBJT/FKKAo74N16Wp7ED6bQwGQkZq8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:12.610195Z"},"content_sha256":"24b34cd9f92032c7733c1474da569c9791b406c48f567e0b99f1d3b4bb99902b","schema_version":"1.0","event_id":"sha256:24b34cd9f92032c7733c1474da569c9791b406c48f567e0b99f1d3b4bb99902b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/bundle.json","state_url":"https://pith.science/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/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-30T06:54:12Z","links":{"resolver":"https://pith.science/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY","bundle":"https://pith.science/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/bundle.json","state":"https://pith.science/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWDY3XBDZMG4ENDKC4ZFBH4OGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IWDY3XBDZMG4ENDKC4ZFBH4OGY","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":"ed98cbb0aaf6dc9af88cb8dbe803a9819dc76a2ac4077bf7c1b08f9a1351fbb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-29T05:46:55Z","title_canon_sha256":"a57b364e8083e1c72e77a65fdd6787323bf941e7483cf9dc9d476384aa1be0e4"},"schema_version":"1.0","source":{"id":"1501.07348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07348","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07348v1","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07348","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"IWDY3XBDZMG4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWDY3XBDZMG4ENDK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWDY3XBD","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:24b34cd9f92032c7733c1474da569c9791b406c48f567e0b99f1d3b4bb99902b","target":"graph","created_at":"2026-05-18T02:28:22Z","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":"Given a connected graph $G$ on $n$ vertices and a positive integer $k\\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$ such that its density is at least a factor $\\Omega(\\max\\{n^{-2/5},k^2/n^2\\})$ of the density of the densest $k$-subgraph in $G$ (which is not necessarily connected). These particularly provide the first non-trivial approximations for the densest connected $k$-subgraph problem on general graphs.","authors_text":"Changjun Wang, Xiaodong Hu, Xujin Chen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-29T05:46:55Z","title":"Finding Connected Dense $k$-Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07348","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:f8a653c7a18ae69bba6f1a5c5a637c7dbe92a986354ec2d20d210625fd306546","target":"record","created_at":"2026-05-18T02:28:22Z","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":"ed98cbb0aaf6dc9af88cb8dbe803a9819dc76a2ac4077bf7c1b08f9a1351fbb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-29T05:46:55Z","title_canon_sha256":"a57b364e8083e1c72e77a65fdd6787323bf941e7483cf9dc9d476384aa1be0e4"},"schema_version":"1.0","source":{"id":"1501.07348","kind":"arxiv","version":1}},"canonical_sha256":"45878ddc23cb0dc2346a1732509f8e361228fb960c2dc53d2471c71bc5575ce4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45878ddc23cb0dc2346a1732509f8e361228fb960c2dc53d2471c71bc5575ce4","first_computed_at":"2026-05-18T02:28:22.202456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:22.202456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PRaF8K/Y7Id3vaKiD8O8QwLVhgAahIbVlw95LzAJz4s76BN9U5ULKRSYQZ1ToLh6P4Q5oB/O4aPBUbV4J+SUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:22.203074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8a653c7a18ae69bba6f1a5c5a637c7dbe92a986354ec2d20d210625fd306546","sha256:24b34cd9f92032c7733c1474da569c9791b406c48f567e0b99f1d3b4bb99902b"],"state_sha256":"fdb60d403cdbb8e1c0c9cecbf0580fa7949b502a4b63a321c9b03f0601c19af7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLGJHBjwe8hQdNp10kUrBlYe+m7y2q7Bj9UuGawghiYMnXf1xpfO9YpquRURLXipKRJaTNAHn0p0UOfMNsIuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:12.613473Z","bundle_sha256":"964c08c9c1c2303e7fd3ed7363ab06691211169d50ddf1b0db75822bb0558240"}}