{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3GM34GFUBIFJNRHZBSW6L3ZLWU","short_pith_number":"pith:3GM34GFU","canonical_record":{"source":{"id":"1312.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T19:26:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"03c7bec0e8c5f142377120ddc9f5cb5603918ac3e20f1a2cc9d9ac1412258c28","abstract_canon_sha256":"a23ead0af2addaca91beb98f085a9c4c5f01bc98c7ecd083201969f83621f940"},"schema_version":"1.0"},"canonical_sha256":"d999be18b40a0a96c4f90cade5ef2bb531820381ea56cd34dd242d06c1988d30","source":{"kind":"arxiv","id":"1312.3288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3288","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3288v1","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3288","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"3GM34GFUBIFJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3GM34GFUBIFJNRHZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3GM34GFU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3GM34GFUBIFJNRHZBSW6L3ZLWU","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T19:26:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"03c7bec0e8c5f142377120ddc9f5cb5603918ac3e20f1a2cc9d9ac1412258c28","abstract_canon_sha256":"a23ead0af2addaca91beb98f085a9c4c5f01bc98c7ecd083201969f83621f940"},"schema_version":"1.0"},"canonical_sha256":"d999be18b40a0a96c4f90cade5ef2bb531820381ea56cd34dd242d06c1988d30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:59.983859Z","signature_b64":"FrL2vcOT807w8I2OP5Fz4W6ltGYNofSV6D+w2q2MpQrVrFoAD/1kfgmtODthp3MSdWH5SK7nwathAq7R5+nvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d999be18b40a0a96c4f90cade5ef2bb531820381ea56cd34dd242d06c1988d30","last_reissued_at":"2026-05-18T03:04:59.983371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:59.983371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3288","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-18T03:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVhFGRrYP7lkYIRO76AafdYZ9HB/x1aGCeScvn0B0Yk+Vk50t4lzKxoIRZS/eYjlNSDzSykvowqvcKSBxeF9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:22:55.889807Z"},"content_sha256":"4be95d5812e268e900a926da49fa9f4f6e5c723f6f34f6d6db836c77bcde208f","schema_version":"1.0","event_id":"sha256:4be95d5812e268e900a926da49fa9f4f6e5c723f6f34f6d6db836c77bcde208f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3GM34GFUBIFJNRHZBSW6L3ZLWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving Manufacturing Cell Formation via Bicluster Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Anand Subramanian, F\\'abio Protti, Ivan C. Martins, Luidi G. Simonetti, Luiz S. Ochi, Rian G. S. Pinheiro","submitted_at":"2013-12-11T19:26:34Z","abstract_excerpt":"This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for the BGEP that consists of a Branch-and-Cut approach combined with a special separation algorithm based on dynamic programming. We also describe a new preprocessing procedure for the BGEP derived from theoretical results on vertex distances in the input graph. Computational experiments performed on randomly generated instances with various levels of difficulty show that our separation algorithm accelerates the conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3288","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-18T03:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9zRu1aOr4DQbtNuLSZQOQnDGGFDEaGlEkidgn2eoUuUFsno5BAAkcb/9VnG/+9rAMlKRyv78jwTUhdS9AG0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:22:55.890185Z"},"content_sha256":"772658119663c59e75563f5a3ebca67696295b85d5b6fa6b19b6c2c79ccaa36f","schema_version":"1.0","event_id":"sha256:772658119663c59e75563f5a3ebca67696295b85d5b6fa6b19b6c2c79ccaa36f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/bundle.json","state_url":"https://pith.science/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/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-11T11:22:55Z","links":{"resolver":"https://pith.science/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU","bundle":"https://pith.science/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/bundle.json","state":"https://pith.science/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GM34GFUBIFJNRHZBSW6L3ZLWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3GM34GFUBIFJNRHZBSW6L3ZLWU","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":"a23ead0af2addaca91beb98f085a9c4c5f01bc98c7ecd083201969f83621f940","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T19:26:34Z","title_canon_sha256":"03c7bec0e8c5f142377120ddc9f5cb5603918ac3e20f1a2cc9d9ac1412258c28"},"schema_version":"1.0","source":{"id":"1312.3288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3288","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3288v1","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3288","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"3GM34GFUBIFJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3GM34GFUBIFJNRHZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3GM34GFU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:772658119663c59e75563f5a3ebca67696295b85d5b6fa6b19b6c2c79ccaa36f","target":"graph","created_at":"2026-05-18T03:04:59Z","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":"This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for the BGEP that consists of a Branch-and-Cut approach combined with a special separation algorithm based on dynamic programming. We also describe a new preprocessing procedure for the BGEP derived from theoretical results on vertex distances in the input graph. Computational experiments performed on randomly generated instances with various levels of difficulty show that our separation algorithm accelerates the conver","authors_text":"Anand Subramanian, F\\'abio Protti, Ivan C. Martins, Luidi G. Simonetti, Luiz S. Ochi, Rian G. S. Pinheiro","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T19:26:34Z","title":"On Solving Manufacturing Cell Formation via Bicluster Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3288","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:4be95d5812e268e900a926da49fa9f4f6e5c723f6f34f6d6db836c77bcde208f","target":"record","created_at":"2026-05-18T03:04:59Z","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":"a23ead0af2addaca91beb98f085a9c4c5f01bc98c7ecd083201969f83621f940","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T19:26:34Z","title_canon_sha256":"03c7bec0e8c5f142377120ddc9f5cb5603918ac3e20f1a2cc9d9ac1412258c28"},"schema_version":"1.0","source":{"id":"1312.3288","kind":"arxiv","version":1}},"canonical_sha256":"d999be18b40a0a96c4f90cade5ef2bb531820381ea56cd34dd242d06c1988d30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d999be18b40a0a96c4f90cade5ef2bb531820381ea56cd34dd242d06c1988d30","first_computed_at":"2026-05-18T03:04:59.983371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:59.983371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FrL2vcOT807w8I2OP5Fz4W6ltGYNofSV6D+w2q2MpQrVrFoAD/1kfgmtODthp3MSdWH5SK7nwathAq7R5+nvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:59.983859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4be95d5812e268e900a926da49fa9f4f6e5c723f6f34f6d6db836c77bcde208f","sha256:772658119663c59e75563f5a3ebca67696295b85d5b6fa6b19b6c2c79ccaa36f"],"state_sha256":"f62cba71d40f54018741fcebb8e2b79e072acc9e4ac3284eb837237a2ed1ad91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RvR8Y5y3p4MkClh0UQX5JyYB9Qg7hMk/OXB/P0XkwWrdUe69goXcoGsIw33+05LyVZqJIISqZem69EAchviiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:22:55.892103Z","bundle_sha256":"a35c7f929f7ad17fe051fb660c3ba516cba2c2512a79a2285f15dd9a5a3390ff"}}