{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NSGPQTKMMVCOO757G3ACUMNVQF","short_pith_number":"pith:NSGPQTKM","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"},"canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","source":{"kind":"arxiv","id":"1809.08856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08856","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08856v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08856","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSGPQTKMMVCO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NSGPQTKMMVCOO757","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NSGPQTKM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NSGPQTKMMVCOO757G3ACUMNVQF","target":"record","payload":{"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"},"canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","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"},"source_kind":"arxiv","source_id":"1809.08856","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:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JAjUz0zBKUJ1t2sa+ysLIa7JuR1iN0oPJNVWz2of41RgWL7GB5AaYOuN8pyQ4f9nl6Cp6R4OkyJ6WybugdfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:52.723091Z"},"content_sha256":"38c8d8797d2e17d24fb128616d81773f833fecdae2a457a3c8ee305214db51ea","schema_version":"1.0","event_id":"sha256:38c8d8797d2e17d24fb128616d81773f833fecdae2a457a3c8ee305214db51ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NSGPQTKMMVCOO757G3ACUMNVQF","target":"graph","payload":{"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"},"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:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv735YJ5CXAjile0GCQpP3krYc8EujxFPnmkRL7KGWdhe7mlT3s3fDiN3m8XHroDteDmn8FwGBsopldca2kuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:52.723445Z"},"content_sha256":"0d7749eac5f9c198b20605966116cd1016a85056e7025293642f048127c444ca","schema_version":"1.0","event_id":"sha256:0d7749eac5f9c198b20605966116cd1016a85056e7025293642f048127c444ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/bundle.json","state_url":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSGPQTKMMVCOO757G3ACUMNVQF/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-01T16:44:52Z","links":{"resolver":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF","bundle":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/bundle.json","state":"https://pith.science/pith/NSGPQTKMMVCOO757G3ACUMNVQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSGPQTKMMVCOO757G3ACUMNVQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NSGPQTKMMVCOO757G3ACUMNVQF","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":"23b80c5b1de387050a48faf19b4039c4ce568588cc978968e837432074c8db2f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-24T11:46:07Z","title_canon_sha256":"62d5f0286eea695970dbb722be5f1abc283e1f4d094a165ec8b914e6700a154f"},"schema_version":"1.0","source":{"id":"1809.08856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08856","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08856v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08856","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSGPQTKMMVCO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NSGPQTKMMVCOO757","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NSGPQTKM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:0d7749eac5f9c198b20605966116cd1016a85056e7025293642f048127c444ca","target":"graph","created_at":"2026-05-18T00:05:03Z","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":"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","authors_text":"Joseph S. B. Mitchell, Sasanka Roy, Satyabrata Jana, Sourav Chakraborty, Sujoy Bhore, Supantha Pandit","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-24T11:46:07Z","title":"The Balanced Connected Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08856","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:38c8d8797d2e17d24fb128616d81773f833fecdae2a457a3c8ee305214db51ea","target":"record","created_at":"2026-05-18T00:05:03Z","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":"23b80c5b1de387050a48faf19b4039c4ce568588cc978968e837432074c8db2f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-24T11:46:07Z","title_canon_sha256":"62d5f0286eea695970dbb722be5f1abc283e1f4d094a165ec8b914e6700a154f"},"schema_version":"1.0","source":{"id":"1809.08856","kind":"arxiv","version":1}},"canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c8cf84d4c6544e77fbf36c02a31b58168890aa2adf75591060ff945543fcabe","first_computed_at":"2026-05-18T00:05:03.364409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:03.364409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/S+D5BqOHA0AZpGCgARn7qNDYEAVFj/+WEPGCHqnr1fB1W5gllfgPr4ZerLdzepuCZqEiYTXLfaU9AnPiOu6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:03.364828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c8d8797d2e17d24fb128616d81773f833fecdae2a457a3c8ee305214db51ea","sha256:0d7749eac5f9c198b20605966116cd1016a85056e7025293642f048127c444ca"],"state_sha256":"9e69716aee840e8b42b6d64352b4feae5f2a029a1294b53237fb2d57fcb93db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn5EhTHiPqYh985CLfjKiARUBw/xFLPCVklM32srhabRPJF+IKk4uJisrkTZ0tFbOt2+sSV6PqkToru7SLkbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:52.725245Z","bundle_sha256":"0ede6140426fd8b927bcb353a86537e591aa95c9236fa1fadf69393197ffc13f"}}