{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RQ7TQEC7PS53GOOBY4EDIN66TT","short_pith_number":"pith:RQ7TQEC7","canonical_record":{"source":{"id":"1312.4345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-16T13:10:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2153f41b6d7c11b75d0dfd0a36f4e312327dadcdbd213b332a95d71f3b76d270","abstract_canon_sha256":"76ffc9ed53c5b252886682f09b54126bb29ab1deca2b58c1aa1d2f7990baab86"},"schema_version":"1.0"},"canonical_sha256":"8c3f38105f7cbbb339c1c7083437de9cd439559143f5da03cdf62da43cbb3284","source":{"kind":"arxiv","id":"1312.4345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4345","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4345v1","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4345","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"RQ7TQEC7PS53","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RQ7TQEC7PS53GOOB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RQ7TQEC7","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RQ7TQEC7PS53GOOBY4EDIN66TT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-16T13:10:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2153f41b6d7c11b75d0dfd0a36f4e312327dadcdbd213b332a95d71f3b76d270","abstract_canon_sha256":"76ffc9ed53c5b252886682f09b54126bb29ab1deca2b58c1aa1d2f7990baab86"},"schema_version":"1.0"},"canonical_sha256":"8c3f38105f7cbbb339c1c7083437de9cd439559143f5da03cdf62da43cbb3284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:34.843936Z","signature_b64":"fk6FnPjLV2XQJA+PXuCnSRK4P3gRUmFtsA1jnn7AlaX5jc9dmrCkUoszeZ3s+MdnECdTttrWoiR5v6XckilqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3f38105f7cbbb339c1c7083437de9cd439559143f5da03cdf62da43cbb3284","last_reissued_at":"2026-05-18T03:04:34.842993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:34.842993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4345","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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyJGnyTc5/6t0D+Hv/lZcWX+djwY8g1EjFS9GayiNeiYYTp+KN40AjgxRzVoV4jJEA7fcukPzpQv0hftkKGAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:17:10.224379Z"},"content_sha256":"f73b0be74da71c68b9584918067a00ff0a4bcb31b51c2448f76987027e11ddf9","schema_version":"1.0","event_id":"sha256:f73b0be74da71c68b9584918067a00ff0a4bcb31b51c2448f76987027e11ddf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RQ7TQEC7PS53GOOBY4EDIN66TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Rosa Figueiredo, Yuri Frota","submitted_at":"2013-12-16T13:10:06Z","abstract_excerpt":"The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interested in the exact solution of the problem: an improved version of a branch-and-cut algorithm is proposed. Extensive computational experiments are carried out on a set of instances from three applications previously discussed in the literature as well as on a set of random instances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4345","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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SITJCrK8QcNp50bcPmfZBKwB49htZ1rWBKHD8Jkz+p+71Rn4k+R/duShLiQfdw0L3OL9uihE/i4zF59d7dQLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:17:10.224738Z"},"content_sha256":"4ec70d3f04eac69818c82b17baebf138295704bd65093c8655f45277e28bde47","schema_version":"1.0","event_id":"sha256:4ec70d3f04eac69818c82b17baebf138295704bd65093c8655f45277e28bde47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/bundle.json","state_url":"https://pith.science/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/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-22T10:17:10Z","links":{"resolver":"https://pith.science/pith/RQ7TQEC7PS53GOOBY4EDIN66TT","bundle":"https://pith.science/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/bundle.json","state":"https://pith.science/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQ7TQEC7PS53GOOBY4EDIN66TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RQ7TQEC7PS53GOOBY4EDIN66TT","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":"76ffc9ed53c5b252886682f09b54126bb29ab1deca2b58c1aa1d2f7990baab86","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-16T13:10:06Z","title_canon_sha256":"2153f41b6d7c11b75d0dfd0a36f4e312327dadcdbd213b332a95d71f3b76d270"},"schema_version":"1.0","source":{"id":"1312.4345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4345","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4345v1","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4345","created_at":"2026-05-18T03:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"RQ7TQEC7PS53","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RQ7TQEC7PS53GOOB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RQ7TQEC7","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4ec70d3f04eac69818c82b17baebf138295704bd65093c8655f45277e28bde47","target":"graph","created_at":"2026-05-18T03:04:34Z","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 Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interested in the exact solution of the problem: an improved version of a branch-and-cut algorithm is proposed. Extensive computational experiments are carried out on a set of instances from three applications previously discussed in the literature as well as on a set of random instances.","authors_text":"Rosa Figueiredo, Yuri Frota","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-16T13:10:06Z","title":"An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4345","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:f73b0be74da71c68b9584918067a00ff0a4bcb31b51c2448f76987027e11ddf9","target":"record","created_at":"2026-05-18T03:04:34Z","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":"76ffc9ed53c5b252886682f09b54126bb29ab1deca2b58c1aa1d2f7990baab86","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-16T13:10:06Z","title_canon_sha256":"2153f41b6d7c11b75d0dfd0a36f4e312327dadcdbd213b332a95d71f3b76d270"},"schema_version":"1.0","source":{"id":"1312.4345","kind":"arxiv","version":1}},"canonical_sha256":"8c3f38105f7cbbb339c1c7083437de9cd439559143f5da03cdf62da43cbb3284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c3f38105f7cbbb339c1c7083437de9cd439559143f5da03cdf62da43cbb3284","first_computed_at":"2026-05-18T03:04:34.842993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:34.842993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fk6FnPjLV2XQJA+PXuCnSRK4P3gRUmFtsA1jnn7AlaX5jc9dmrCkUoszeZ3s+MdnECdTttrWoiR5v6XckilqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:34.843936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f73b0be74da71c68b9584918067a00ff0a4bcb31b51c2448f76987027e11ddf9","sha256:4ec70d3f04eac69818c82b17baebf138295704bd65093c8655f45277e28bde47"],"state_sha256":"3cfcf0e18a8f838a07836d8182d048b660d9267e04a4a1cdbcf9d198f9b9d75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soe2kOWp7fm8cNEduow+WKTEZw732Qg6lrEeL/UE8/y1WE2Q7+m/YvBP37Kb1kZNEul32/vHmcDVWbKEcL/3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:17:10.226745Z","bundle_sha256":"7a4f8c3e0d21b38aebb034a50e764d2cc25c280c55ca5aaab278be65dc004164"}}