{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NSGPQTKMMVCOO757G3ACUMNVQF","short_pith_number":"pith:NSGPQTKM","schema_version":"1.0","canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","source":{"kind":"arxiv","id":"1809.08856","version":1},"attestation_state":"computed","paper":{"title":"The Balanced Connected Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Joseph S. B. Mitchell, Sasanka Roy, Satyabrata Jana, Sourav Chakraborty, Sujoy Bhore, Supantha Pandit","submitted_at":"2018-09-24T11:46:07Z","abstract_excerpt":"The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly, BCS) problem. The input is a graph $G=(V,E)$, with each vertex in the set $V$ having an assigned color, \"red\" or \"blue\". We seek a maximum-cardinality subset $V'\\subseteq V$ of vertices that is color-balanced (having exactly $|V'|/2$ red nodes and $|V'|/2$ blue nodes), such that the subgraph induced by the vertex set $V'$ in $G$ is connected. We show that t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.08856","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-24T11:46:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"62d5f0286eea695970dbb722be5f1abc283e1f4d094a165ec8b914e6700a154f","abstract_canon_sha256":"23b80c5b1de387050a48faf19b4039c4ce568588cc978968e837432074c8db2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.364828Z","signature_b64":"/S+D5BqOHA0AZpGCgARn7qNDYEAVFj/+WEPGCHqnr1fB1W5gllfgPr4ZerLdzepuCZqEiYTXLfaU9AnPiOu6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","last_reissued_at":"2026-05-18T00:05:03.364409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.364409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Balanced Connected Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Joseph S. B. Mitchell, Sasanka Roy, Satyabrata Jana, Sourav Chakraborty, Sujoy Bhore, Supantha Pandit","submitted_at":"2018-09-24T11:46:07Z","abstract_excerpt":"The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly, BCS) problem. The input is a graph $G=(V,E)$, with each vertex in the set $V$ having an assigned color, \"red\" or \"blue\". We seek a maximum-cardinality subset $V'\\subseteq V$ of vertices that is color-balanced (having exactly $|V'|/2$ red nodes and $|V'|/2$ blue nodes), such that the subgraph induced by the vertex set $V'$ in $G$ is connected. We show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08856","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.08856","created_at":"2026-05-18T00:05:03.364479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08856v1","created_at":"2026-05-18T00:05:03.364479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08856","created_at":"2026-05-18T00:05:03.364479+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSGPQTKMMVCO","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSGPQTKMMVCOO757","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSGPQTKM","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF","json":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF.json","graph_json":"https://pith.science/api/pith-number/NSGPQTKMMVCOO757G3ACUMNVQF/graph.json","events_json":"https://pith.science/api/pith-number/NSGPQTKMMVCOO757G3ACUMNVQF/events.json","paper":"https://pith.science/paper/NSGPQTKM"},"agent_actions":{"view_html":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF","download_json":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF.json","view_paper":"https://pith.science/paper/NSGPQTKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08856&json=true","fetch_graph":"https://pith.science/api/pith-number/NSGPQTKMMVCOO757G3ACUMNVQF/graph.json","fetch_events":"https://pith.science/api/pith-number/NSGPQTKMMVCOO757G3ACUMNVQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/action/storage_attestation","attest_author":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/action/author_attestation","sign_citation":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/action/citation_signature","submit_replication":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/action/replication_record"}},"created_at":"2026-05-18T00:05:03.364479+00:00","updated_at":"2026-05-18T00:05:03.364479+00:00"}