{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S55C2BWYEBAO7DPXIXWGWJ3GF3","short_pith_number":"pith:S55C2BWY","canonical_record":{"source":{"id":"1205.2234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-10T11:22:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7a8037b988e56cffaf85a798b08a9bfc297acb2be1e4d2689b45290665c7510e","abstract_canon_sha256":"2a622c20b80dca28a9d1bad4d7b1c338aead9de2739508dd54b140c39484129f"},"schema_version":"1.0"},"canonical_sha256":"977a2d06d82040ef8df745ec6b27662ef827505b7c42f8430c6f9f45b43ea570","source":{"kind":"arxiv","id":"1205.2234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2234","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2234v1","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2234","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"S55C2BWYEBAO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S55C2BWYEBAO7DPX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S55C2BWY","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S55C2BWYEBAO7DPXIXWGWJ3GF3","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-10T11:22:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7a8037b988e56cffaf85a798b08a9bfc297acb2be1e4d2689b45290665c7510e","abstract_canon_sha256":"2a622c20b80dca28a9d1bad4d7b1c338aead9de2739508dd54b140c39484129f"},"schema_version":"1.0"},"canonical_sha256":"977a2d06d82040ef8df745ec6b27662ef827505b7c42f8430c6f9f45b43ea570","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.461217Z","signature_b64":"rhvYQ9t5vuN9trmGpiZbHiziZ4hO6pPYyLa+og7VaQvNn9Df7kTc1frKWsGMrhb/Che6x/gTUBwouBCZmj7RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977a2d06d82040ef8df745ec6b27662ef827505b7c42f8430c6f9f45b43ea570","last_reissued_at":"2026-05-18T02:21:10.460717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.460717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2234","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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSxDckaKPdoly5Ozod3L2g//WVVn8YKBtFheeeSI5Lp2aICcaDtOMUsN1cwv60N/Zqwoetf3bTxq/LoLN3slAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:57:26.204690Z"},"content_sha256":"ff9c1c29baa4b1b2427d40e31e9ddcdb62031945be0775f397e205dd50585c7f","schema_version":"1.0","event_id":"sha256:ff9c1c29baa4b1b2427d40e31e9ddcdb62031945be0775f397e205dd50585c7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S55C2BWYEBAO7DPXIXWGWJ3GF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Semi-random Graph Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2012-05-10T11:22:24Z","abstract_excerpt":"In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and planted random model of Bui, Chaudhuri, Leighton and Sipser.\n  We develop a general framework for solving semi-random instances and apply it to several problems of interest. We present constant factor bi-criteria approximation algorithms for semi-random instances of the Balanced Cut, Multicut, Min Uncut, Sparsest Cut and Small Set Expansion problems. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2234","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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXTS9SR6h1fMGN1mI78JT40gfeNUxCGsf97waCwnqKDaj3shDXW99KmnwM/ekCScKc0hNt5w5G+rgz8GTjgnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:57:26.205038Z"},"content_sha256":"281d64bae98f06c73a6c0d50e32ec9842e15d46073056f19603b6562bd7e6c7d","schema_version":"1.0","event_id":"sha256:281d64bae98f06c73a6c0d50e32ec9842e15d46073056f19603b6562bd7e6c7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/bundle.json","state_url":"https://pith.science/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/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-03T13:57:26Z","links":{"resolver":"https://pith.science/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3","bundle":"https://pith.science/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/bundle.json","state":"https://pith.science/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S55C2BWYEBAO7DPXIXWGWJ3GF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S55C2BWYEBAO7DPXIXWGWJ3GF3","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":"2a622c20b80dca28a9d1bad4d7b1c338aead9de2739508dd54b140c39484129f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-10T11:22:24Z","title_canon_sha256":"7a8037b988e56cffaf85a798b08a9bfc297acb2be1e4d2689b45290665c7510e"},"schema_version":"1.0","source":{"id":"1205.2234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2234","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2234v1","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2234","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"S55C2BWYEBAO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S55C2BWYEBAO7DPX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S55C2BWY","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:281d64bae98f06c73a6c0d50e32ec9842e15d46073056f19603b6562bd7e6c7d","target":"graph","created_at":"2026-05-18T02:21:10Z","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":"In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and planted random model of Bui, Chaudhuri, Leighton and Sipser.\n  We develop a general framework for solving semi-random instances and apply it to several problems of interest. We present constant factor bi-criteria approximation algorithms for semi-random instances of the Balanced Cut, Multicut, Min Uncut, Sparsest Cut and Small Set Expansion problems. We als","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-10T11:22:24Z","title":"Approximation Algorithms for Semi-random Graph Partitioning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2234","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:ff9c1c29baa4b1b2427d40e31e9ddcdb62031945be0775f397e205dd50585c7f","target":"record","created_at":"2026-05-18T02:21:10Z","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":"2a622c20b80dca28a9d1bad4d7b1c338aead9de2739508dd54b140c39484129f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-10T11:22:24Z","title_canon_sha256":"7a8037b988e56cffaf85a798b08a9bfc297acb2be1e4d2689b45290665c7510e"},"schema_version":"1.0","source":{"id":"1205.2234","kind":"arxiv","version":1}},"canonical_sha256":"977a2d06d82040ef8df745ec6b27662ef827505b7c42f8430c6f9f45b43ea570","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977a2d06d82040ef8df745ec6b27662ef827505b7c42f8430c6f9f45b43ea570","first_computed_at":"2026-05-18T02:21:10.460717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:10.460717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhvYQ9t5vuN9trmGpiZbHiziZ4hO6pPYyLa+og7VaQvNn9Df7kTc1frKWsGMrhb/Che6x/gTUBwouBCZmj7RDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:10.461217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff9c1c29baa4b1b2427d40e31e9ddcdb62031945be0775f397e205dd50585c7f","sha256:281d64bae98f06c73a6c0d50e32ec9842e15d46073056f19603b6562bd7e6c7d"],"state_sha256":"0b77f98c9cfd92a8ff93e958b99c3fc7c7c1d8b7a3b2110e2720f8a96adaf8e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKy6Rz8+c1ptLSKwmK2E7kFd/V0cjJfPWNQYvgm5cHlVGyKaMeRB7z0gVBDRcJ8kX6MCB4ZEVbaBTJKaHTHcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:57:26.206971Z","bundle_sha256":"384ec8068f6c45860cf3301a4cdf770e7f640426dd782a054508b43fc21faa4c"}}