{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VC6UXLG6GMOAQKLQOTPXZ7CNRN","short_pith_number":"pith:VC6UXLG6","canonical_record":{"source":{"id":"1212.6848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T10:01:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"925787b61a693b2a5c604192976abb1a1885bbd74a3cc6fcfa5e21e41be92493","abstract_canon_sha256":"aaad1af81563e514d1bb6c1ae570c9a71316af6932f83e92c25a6cd6bb300d10"},"schema_version":"1.0"},"canonical_sha256":"a8bd4bacde331c08297074df7cfc4d8b786c5b1ee4c2a48d9a8073f80eb0e34c","source":{"kind":"arxiv","id":"1212.6848","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6848","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6848v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6848","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"VC6UXLG6GMOA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VC6UXLG6GMOAQKLQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VC6UXLG6","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VC6UXLG6GMOAQKLQOTPXZ7CNRN","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T10:01:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"925787b61a693b2a5c604192976abb1a1885bbd74a3cc6fcfa5e21e41be92493","abstract_canon_sha256":"aaad1af81563e514d1bb6c1ae570c9a71316af6932f83e92c25a6cd6bb300d10"},"schema_version":"1.0"},"canonical_sha256":"a8bd4bacde331c08297074df7cfc4d8b786c5b1ee4c2a48d9a8073f80eb0e34c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.217937Z","signature_b64":"4jKkMXC2Nkdpcs7lr5qAwhdqKn7cyDqS1Ekj6tZb3ExdM8g7FPKAqfhejw/sVCAzxRALnC/Y8935NGzW1Q7BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8bd4bacde331c08297074df7cfc4d8b786c5b1ee4c2a48d9a8073f80eb0e34c","last_reissued_at":"2026-05-18T03:27:32.217127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.217127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6848","source_version":2,"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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3fcWcFcbV3xKlSsIU4PKYlNrmEqvYbcDCqWsY2COv5XUiT/OL6lg94QopJbSS0Ak1MC3aMm/ri3oTXl+HSYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:09.047124Z"},"content_sha256":"252802761ebe2e156aff75eeb293c93aca544203b5044220b4f271be41d569f5","schema_version":"1.0","event_id":"sha256:252802761ebe2e156aff75eeb293c93aca544203b5044220b4f271be41d569f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VC6UXLG6GMOAQKLQOTPXZ7CNRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Balanced Subgraph Problem Parameterized Above Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"G. Gutin, G. Muciaccia, M. Jones, R. Crowston","submitted_at":"2012-12-31T10:01:10Z","abstract_excerpt":"We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts $V_1$ and $V_2$ such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign $-$ (one of the parts may be empty). It is well-known that every connected signed graph with $n$ vertices and $m$ edges has a balanced subgraph with at least $\\frac{m}{2} + \\frac{n-1}{4}$ edges and this bound is tight. We consider the following parameterized problem: given a connected s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6848","kind":"arxiv","version":2},"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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zXOEcKSvI7sRIOe0Dj8l4HcMBSbHJC42MebH5UeFiAYJLhy0qG8/vQE/S+CTg7mHpX/IvUJQuYa6UNIbO5ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:09.047753Z"},"content_sha256":"9e8ea358813dc008e47844850b649e6b602bed57248f90d9899b508abd4768bd","schema_version":"1.0","event_id":"sha256:9e8ea358813dc008e47844850b649e6b602bed57248f90d9899b508abd4768bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/bundle.json","state_url":"https://pith.science/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/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-05-28T07:53:09Z","links":{"resolver":"https://pith.science/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN","bundle":"https://pith.science/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/bundle.json","state":"https://pith.science/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VC6UXLG6GMOAQKLQOTPXZ7CNRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VC6UXLG6GMOAQKLQOTPXZ7CNRN","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":"aaad1af81563e514d1bb6c1ae570c9a71316af6932f83e92c25a6cd6bb300d10","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T10:01:10Z","title_canon_sha256":"925787b61a693b2a5c604192976abb1a1885bbd74a3cc6fcfa5e21e41be92493"},"schema_version":"1.0","source":{"id":"1212.6848","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6848","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6848v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6848","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"VC6UXLG6GMOA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VC6UXLG6GMOAQKLQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VC6UXLG6","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:9e8ea358813dc008e47844850b649e6b602bed57248f90d9899b508abd4768bd","target":"graph","created_at":"2026-05-18T03:27:32Z","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":"We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts $V_1$ and $V_2$ such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign $-$ (one of the parts may be empty). It is well-known that every connected signed graph with $n$ vertices and $m$ edges has a balanced subgraph with at least $\\frac{m}{2} + \\frac{n-1}{4}$ edges and this bound is tight. We consider the following parameterized problem: given a connected s","authors_text":"G. Gutin, G. Muciaccia, M. Jones, R. Crowston","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T10:01:10Z","title":"Maximum Balanced Subgraph Problem Parameterized Above Lower Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6848","kind":"arxiv","version":2},"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:252802761ebe2e156aff75eeb293c93aca544203b5044220b4f271be41d569f5","target":"record","created_at":"2026-05-18T03:27:32Z","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":"aaad1af81563e514d1bb6c1ae570c9a71316af6932f83e92c25a6cd6bb300d10","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T10:01:10Z","title_canon_sha256":"925787b61a693b2a5c604192976abb1a1885bbd74a3cc6fcfa5e21e41be92493"},"schema_version":"1.0","source":{"id":"1212.6848","kind":"arxiv","version":2}},"canonical_sha256":"a8bd4bacde331c08297074df7cfc4d8b786c5b1ee4c2a48d9a8073f80eb0e34c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8bd4bacde331c08297074df7cfc4d8b786c5b1ee4c2a48d9a8073f80eb0e34c","first_computed_at":"2026-05-18T03:27:32.217127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.217127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4jKkMXC2Nkdpcs7lr5qAwhdqKn7cyDqS1Ekj6tZb3ExdM8g7FPKAqfhejw/sVCAzxRALnC/Y8935NGzW1Q7BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.217937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6848","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:252802761ebe2e156aff75eeb293c93aca544203b5044220b4f271be41d569f5","sha256:9e8ea358813dc008e47844850b649e6b602bed57248f90d9899b508abd4768bd"],"state_sha256":"255ba19c679e982a3d0fd8db86be151e52494a4c271cd8e46593733544ace4e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hm6Y61wR7iuXVVN0vTPh4xlugYrJ2Z2RvQy0E0dZDLQMWcvhnvRr6oUJFhFvwyAbEv8Ot3YaagKbC00j254cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:09.050770Z","bundle_sha256":"95117830ed98927ccfe915f9089f5d11ab526cba28a958300748e0d8c05dd68a"}}