{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA","short_pith_number":"pith:EZ7RLXIJ","canonical_record":{"source":{"id":"1712.02870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8","abstract_canon_sha256":"03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275"},"schema_version":"1.0"},"canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","source":{"kind":"arxiv","id":"1712.02870","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02870","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02870v3","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02870","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"EZ7RLXIJRTOJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZ7RLXIJRTOJDZRM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZ7RLXIJ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8","abstract_canon_sha256":"03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275"},"schema_version":"1.0"},"canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.648988Z","signature_b64":"bsiCWVLm+6+XA9KA4qU5ZsCbRbbDzgkknan7xZeFJp6F6B3RBrp9ANaIFxYuJjE6SIMy9xNIIIUgQUzcgBJdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","last_reissued_at":"2026-05-18T00:19:56.648506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.648506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02870","source_version":3,"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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Nd2CqtFfFVpO55Q+5stzWEhG1X/7xiL/5rriuVlkfiRofOdVyA/w2o+jW5qxo4XGbEul1ntulyxe65S3XCmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:34:51.929142Z"},"content_sha256":"207a11921691d2bc37cfeec51299498bc3c2d30777d79130a4ce0ba81ab561b8","schema_version":"1.0","event_id":"sha256:207a11921691d2bc37cfeec51299498bc3c2d30777d79130a4ce0ba81ab561b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Maximum $k$-Order Bounded Component Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Shijin Rajakrishnan, Sounaka Mishra","submitted_at":"2017-11-29T09:52:09Z","abstract_excerpt":"Given a graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S \\subseteq V$ of maximum size such that each component in the induced graph $G[S]$ has at most $k$ vertices. We prove that for constant $k$, Max-$k$-OBCS is hard to approximate within a factor of $n^{1 -\\epsilon}$, for any $\\epsilon > 0$, unless $\\mathsf{P} = \\mathsf{NP}$. This is an improvement on the previous lower bound of $\\sqrt{n}$ for Max-2-OBCS due to Orlovich et al. We provide lower bounds on the approximability when $k$ is not a constant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02870","kind":"arxiv","version":3},"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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYxm6juzSDGaoL10PUiuoELeSr6R8wUHa6P1WDGLxmh4advGBtRffnw/NEjB3SO89UY6O7iEwDpQAQaKUnITBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:34:51.929489Z"},"content_sha256":"1f1f09cbc6e9be04159f045bc7960f59c29a3e51e54e95abb773aa72e755e734","schema_version":"1.0","event_id":"sha256:1f1f09cbc6e9be04159f045bc7960f59c29a3e51e54e95abb773aa72e755e734"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/bundle.json","state_url":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/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-24T00:34:51Z","links":{"resolver":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA","bundle":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/bundle.json","state":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA","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":"03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","title_canon_sha256":"e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8"},"schema_version":"1.0","source":{"id":"1712.02870","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02870","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02870v3","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02870","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"EZ7RLXIJRTOJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZ7RLXIJRTOJDZRM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZ7RLXIJ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1f1f09cbc6e9be04159f045bc7960f59c29a3e51e54e95abb773aa72e755e734","target":"graph","created_at":"2026-05-18T00:19:56Z","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 graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S \\subseteq V$ of maximum size such that each component in the induced graph $G[S]$ has at most $k$ vertices. We prove that for constant $k$, Max-$k$-OBCS is hard to approximate within a factor of $n^{1 -\\epsilon}$, for any $\\epsilon > 0$, unless $\\mathsf{P} = \\mathsf{NP}$. This is an improvement on the previous lower bound of $\\sqrt{n}$ for Max-2-OBCS due to Orlovich et al. We provide lower bounds on the approximability when $k$ is not a constant","authors_text":"Shijin Rajakrishnan, Sounaka Mishra","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","title":"The Complexity of Maximum $k$-Order Bounded Component Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02870","kind":"arxiv","version":3},"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:207a11921691d2bc37cfeec51299498bc3c2d30777d79130a4ce0ba81ab561b8","target":"record","created_at":"2026-05-18T00:19:56Z","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":"03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","title_canon_sha256":"e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8"},"schema_version":"1.0","source":{"id":"1712.02870","kind":"arxiv","version":3}},"canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","first_computed_at":"2026-05-18T00:19:56.648506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:56.648506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsiCWVLm+6+XA9KA4qU5ZsCbRbbDzgkknan7xZeFJp6F6B3RBrp9ANaIFxYuJjE6SIMy9xNIIIUgQUzcgBJdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:56.648988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02870","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:207a11921691d2bc37cfeec51299498bc3c2d30777d79130a4ce0ba81ab561b8","sha256:1f1f09cbc6e9be04159f045bc7960f59c29a3e51e54e95abb773aa72e755e734"],"state_sha256":"043ffb48a8ee59774a9aed69f4a8479113a7b6cb2326d62192f6602eb606e619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpLALBNHDSfYUWf9c2qlE83k+s9YK7OPh27GTRooJ8pUvYum+RdDlfbuJT/1erSZlj4aaT9Hh+HuSdlDuVZbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T00:34:51.931328Z","bundle_sha256":"946668fc92ccebb0eabf1c5046e2cbf25d2d6acc7cda55b5123803bcf6b35844"}}