{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KFANWJWS3Q3Z2KDJN3IW45ZZ6Q","short_pith_number":"pith:KFANWJWS","canonical_record":{"source":{"id":"1504.03666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"6a256ff084a148b01cb1021c9e7eb705f912d987077e66cb8cd65e71ec5ec7a3","abstract_canon_sha256":"07623458ef8f0ca253ad3dbaa1e5669661c4db94f9e31802c2448c1074330e85"},"schema_version":"1.0"},"canonical_sha256":"5140db26d2dc379d28696ed16e7739f43592870e6e72e15c3aa57bc70460e03b","source":{"kind":"arxiv","id":"1504.03666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03666","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03666v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03666","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"KFANWJWS3Q3Z","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KFANWJWS3Q3Z2KDJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KFANWJWS","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KFANWJWS3Q3Z2KDJN3IW45ZZ6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"6a256ff084a148b01cb1021c9e7eb705f912d987077e66cb8cd65e71ec5ec7a3","abstract_canon_sha256":"07623458ef8f0ca253ad3dbaa1e5669661c4db94f9e31802c2448c1074330e85"},"schema_version":"1.0"},"canonical_sha256":"5140db26d2dc379d28696ed16e7739f43592870e6e72e15c3aa57bc70460e03b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:50.258955Z","signature_b64":"5QgX3DEY1SVllDHI4inn8MUqiMK6MnKCDshN6t8/CVtwEVRwsHxmvjaHDRjnEVA7yrV7kTRM4g/uRjASh0CVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5140db26d2dc379d28696ed16e7739f43592870e6e72e15c3aa57bc70460e03b","last_reissued_at":"2026-05-18T02:18:50.258457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:50.258457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03666","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+ozcKANeyAM1YdP2zSxTedWLudSejux4v3N1SScspLgqeyC5OitLXE0uXgqER0QSZ4+xAXFGIXtGHsdtENrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:45.269964Z"},"content_sha256":"31e9f572b6136bd428edd88bf40af1689881b33e71d95d671c8710b645dc39d6","schema_version":"1.0","event_id":"sha256:31e9f572b6136bd428edd88bf40af1689881b33e71d95d671c8710b645dc39d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KFANWJWS3Q3Z2KDJN3IW45ZZ6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximum Cut Problem in Co-bipartite Chain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arman Boyac{\\i}, Mordechai Shalom, T{\\i}naz Ekim","submitted_at":"2015-04-14T19:21:05Z","abstract_excerpt":"A \\emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known that the maximum cut problem (MaxCut) is NP-Hard in co-bipartite graphs. We consider MaxCut in co-bipartite chain graphs. We first consider the twin-free case and present an explicit solution. We then show that MaxCut is polynomial time solvable in this graph class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03666","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41it7SNJ5Pd5fNGnamhgVpnOf1Nq97ldUlpNR6/rq755A05Oz3k83VQNIPXv3xxc3DHUV+YoZkxCYn1n/fTUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:45.270602Z"},"content_sha256":"f0ebd934e5ddcc921e5d33443169299ba83a552e4d59b01bbd2d61f512371d3b","schema_version":"1.0","event_id":"sha256:f0ebd934e5ddcc921e5d33443169299ba83a552e4d59b01bbd2d61f512371d3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/bundle.json","state_url":"https://pith.science/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/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-04T05:50:45Z","links":{"resolver":"https://pith.science/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q","bundle":"https://pith.science/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/bundle.json","state":"https://pith.science/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFANWJWS3Q3Z2KDJN3IW45ZZ6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KFANWJWS3Q3Z2KDJN3IW45ZZ6Q","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":"07623458ef8f0ca253ad3dbaa1e5669661c4db94f9e31802c2448c1074330e85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:21:05Z","title_canon_sha256":"6a256ff084a148b01cb1021c9e7eb705f912d987077e66cb8cd65e71ec5ec7a3"},"schema_version":"1.0","source":{"id":"1504.03666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03666","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03666v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03666","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"KFANWJWS3Q3Z","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KFANWJWS3Q3Z2KDJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KFANWJWS","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:f0ebd934e5ddcc921e5d33443169299ba83a552e4d59b01bbd2d61f512371d3b","target":"graph","created_at":"2026-05-18T02:18:50Z","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":"A \\emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known that the maximum cut problem (MaxCut) is NP-Hard in co-bipartite graphs. We consider MaxCut in co-bipartite chain graphs. We first consider the twin-free case and present an explicit solution. We then show that MaxCut is polynomial time solvable in this graph class.","authors_text":"Arman Boyac{\\i}, Mordechai Shalom, T{\\i}naz Ekim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:21:05Z","title":"The Maximum Cut Problem in Co-bipartite Chain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03666","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:31e9f572b6136bd428edd88bf40af1689881b33e71d95d671c8710b645dc39d6","target":"record","created_at":"2026-05-18T02:18:50Z","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":"07623458ef8f0ca253ad3dbaa1e5669661c4db94f9e31802c2448c1074330e85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:21:05Z","title_canon_sha256":"6a256ff084a148b01cb1021c9e7eb705f912d987077e66cb8cd65e71ec5ec7a3"},"schema_version":"1.0","source":{"id":"1504.03666","kind":"arxiv","version":1}},"canonical_sha256":"5140db26d2dc379d28696ed16e7739f43592870e6e72e15c3aa57bc70460e03b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5140db26d2dc379d28696ed16e7739f43592870e6e72e15c3aa57bc70460e03b","first_computed_at":"2026-05-18T02:18:50.258457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:50.258457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5QgX3DEY1SVllDHI4inn8MUqiMK6MnKCDshN6t8/CVtwEVRwsHxmvjaHDRjnEVA7yrV7kTRM4g/uRjASh0CVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:50.258955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31e9f572b6136bd428edd88bf40af1689881b33e71d95d671c8710b645dc39d6","sha256:f0ebd934e5ddcc921e5d33443169299ba83a552e4d59b01bbd2d61f512371d3b"],"state_sha256":"78e33e4a312586ad4c50fafa58a5be3121485315d3eea60723bb7199302341a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4ONw5zHYemHaE+wGjbPXWWXlehJzM+5SUKn8i3Drd9IiOSVsSjkyoffHeGsrmBTiKq/V1KhYcONXRItXYppBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:50:45.274199Z","bundle_sha256":"812fadd46c107803e2dd6e6f0256203008f0d9d67398d8d90aa53741bb0bd5f7"}}