{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3XBKI3I4I4DLPQF3CIBB7P7R5U","short_pith_number":"pith:3XBKI3I4","canonical_record":{"source":{"id":"1207.5696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T13:34:31Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"4427ed0a60b818baac5ac49ea7388a34fc79f44486884e47c4c03371b08150fe","abstract_canon_sha256":"8dffb4a48330fee83d2b179911d7f621e52c6b715fd8e0a1194cf25f8581c4a2"},"schema_version":"1.0"},"canonical_sha256":"ddc2a46d1c4706b7c0bb12021fbff1ed34d0ca3940792726572974ce4357dbb7","source":{"kind":"arxiv","id":"1207.5696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5696","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5696v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5696","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"3XBKI3I4I4DL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3XBKI3I4I4DLPQF3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3XBKI3I4","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3XBKI3I4I4DLPQF3CIBB7P7R5U","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T13:34:31Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"4427ed0a60b818baac5ac49ea7388a34fc79f44486884e47c4c03371b08150fe","abstract_canon_sha256":"8dffb4a48330fee83d2b179911d7f621e52c6b715fd8e0a1194cf25f8581c4a2"},"schema_version":"1.0"},"canonical_sha256":"ddc2a46d1c4706b7c0bb12021fbff1ed34d0ca3940792726572974ce4357dbb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.603793Z","signature_b64":"HZ1clsje5IC0QCHn1Vk636p6fxr3xF4jTTwU6aAkYyemLFVxiz7QouoMMW1uz6kfZQZrdRLk5u6DetNdb2EJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc2a46d1c4706b7c0bb12021fbff1ed34d0ca3940792726572974ce4357dbb7","last_reissued_at":"2026-05-18T03:50:11.603206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.603206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5696","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:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tMEXWtjSeQwCFV2AgAgJ2LczY23QZZalCnr2P1lnnkZrHnpBKjUe25unxEUsg+8wjdPvScnevdeKP+h2tcSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:00:14.351580Z"},"content_sha256":"c5f72ea5372ab9d5babb4b1ca6ba0d2b9e69eb463ee61dbc3b988142734ef185","schema_version":"1.0","event_id":"sha256:c5f72ea5372ab9d5babb4b1ca6ba0d2b9e69eb463ee61dbc3b988142734ef185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3XBKI3I4I4DLPQF3CIBB7P7R5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Max-Cut: \\lambda-Extendible Properties Parameterized Above the Poljak-Turz\\'{i}k Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Geevarghese Philip, Matthias Mnich, Ond\\v{r}ej Such\\'y, Saket Saurabh","submitted_at":"2012-07-24T13:34:31Z","abstract_excerpt":"Poljak and Turz\\'ik (Discrete Math. 1986) introduced the notion of \\lambda-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0<\\lambda<1 and \\lambda-extendible property \\Pi, any connected graph G on n vertices and m edges contains a subgraph H \\in {\\Pi} with at least \\lambda m+ (1-\\lambda)/2 (n-1) edges. The property of being bipartite is 1/2-extendible, and thus this bound generalizes the Edwards-Erd\\H{o}s bound for Max-Cut.\n  We define a variant, namely strong \\lambda-extendibility, to which the bound applies. For a strongly \\lam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5696","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:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mjt1EpD5Yuy45outMKK2KHqM4wmQEu3xfuP+Am976LIwWcY0WAt88paNFRrJXz/b3JfhOwbxB6pRQVPeVXwbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:00:14.351931Z"},"content_sha256":"666ee801c108764758d471d51aefdba51210bb68fd973a8d8daaf3bb1347c129","schema_version":"1.0","event_id":"sha256:666ee801c108764758d471d51aefdba51210bb68fd973a8d8daaf3bb1347c129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/bundle.json","state_url":"https://pith.science/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/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-30T13:00:14Z","links":{"resolver":"https://pith.science/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U","bundle":"https://pith.science/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/bundle.json","state":"https://pith.science/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XBKI3I4I4DLPQF3CIBB7P7R5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3XBKI3I4I4DLPQF3CIBB7P7R5U","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":"8dffb4a48330fee83d2b179911d7f621e52c6b715fd8e0a1194cf25f8581c4a2","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T13:34:31Z","title_canon_sha256":"4427ed0a60b818baac5ac49ea7388a34fc79f44486884e47c4c03371b08150fe"},"schema_version":"1.0","source":{"id":"1207.5696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5696","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5696v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5696","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"3XBKI3I4I4DL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3XBKI3I4I4DLPQF3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3XBKI3I4","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:666ee801c108764758d471d51aefdba51210bb68fd973a8d8daaf3bb1347c129","target":"graph","created_at":"2026-05-18T03:50:11Z","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":"Poljak and Turz\\'ik (Discrete Math. 1986) introduced the notion of \\lambda-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0<\\lambda<1 and \\lambda-extendible property \\Pi, any connected graph G on n vertices and m edges contains a subgraph H \\in {\\Pi} with at least \\lambda m+ (1-\\lambda)/2 (n-1) edges. The property of being bipartite is 1/2-extendible, and thus this bound generalizes the Edwards-Erd\\H{o}s bound for Max-Cut.\n  We define a variant, namely strong \\lambda-extendibility, to which the bound applies. For a strongly \\lam","authors_text":"Geevarghese Philip, Matthias Mnich, Ond\\v{r}ej Such\\'y, Saket Saurabh","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T13:34:31Z","title":"Beyond Max-Cut: \\lambda-Extendible Properties Parameterized Above the Poljak-Turz\\'{i}k Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5696","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:c5f72ea5372ab9d5babb4b1ca6ba0d2b9e69eb463ee61dbc3b988142734ef185","target":"record","created_at":"2026-05-18T03:50:11Z","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":"8dffb4a48330fee83d2b179911d7f621e52c6b715fd8e0a1194cf25f8581c4a2","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T13:34:31Z","title_canon_sha256":"4427ed0a60b818baac5ac49ea7388a34fc79f44486884e47c4c03371b08150fe"},"schema_version":"1.0","source":{"id":"1207.5696","kind":"arxiv","version":1}},"canonical_sha256":"ddc2a46d1c4706b7c0bb12021fbff1ed34d0ca3940792726572974ce4357dbb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddc2a46d1c4706b7c0bb12021fbff1ed34d0ca3940792726572974ce4357dbb7","first_computed_at":"2026-05-18T03:50:11.603206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:11.603206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZ1clsje5IC0QCHn1Vk636p6fxr3xF4jTTwU6aAkYyemLFVxiz7QouoMMW1uz6kfZQZrdRLk5u6DetNdb2EJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:11.603793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5f72ea5372ab9d5babb4b1ca6ba0d2b9e69eb463ee61dbc3b988142734ef185","sha256:666ee801c108764758d471d51aefdba51210bb68fd973a8d8daaf3bb1347c129"],"state_sha256":"490390d38c1475613b2b78fb7ce4b6dc63a83d24cbc9f9307786db897b3c9a53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQ8HSo4IgxYuGCRr4m6Om8LFEQQjd23FUU7N1evE6NIRql/u649AH378qNisSTz9SnU9g9SEyXFZd/1YzoTlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:00:14.353928Z","bundle_sha256":"c0ae6689d82f01e04170801b81087f866bb720641fbe0b395ee4649759668950"}}