{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZBI6QWAYSOQ6UXPATWR77A7VZO","short_pith_number":"pith:ZBI6QWAY","canonical_record":{"source":{"id":"1102.1141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:21:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"16d9050c224de0df690ea15a3fe5856ef0106210764460d0ebfd577d80fb9e02","abstract_canon_sha256":"607da9fc972f9b91e6a0b8c9cf4802ae955e72ad32c84a2d3a116088eeb88225"},"schema_version":"1.0"},"canonical_sha256":"c851e8581893a1ea5de09da3ff83f5cbac7961910776f78295baab9274666b66","source":{"kind":"arxiv","id":"1102.1141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1141","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1141v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1141","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZBI6QWAYSOQ6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZBI6QWAYSOQ6UXPA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZBI6QWAY","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZBI6QWAYSOQ6UXPATWR77A7VZO","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:21:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"16d9050c224de0df690ea15a3fe5856ef0106210764460d0ebfd577d80fb9e02","abstract_canon_sha256":"607da9fc972f9b91e6a0b8c9cf4802ae955e72ad32c84a2d3a116088eeb88225"},"schema_version":"1.0"},"canonical_sha256":"c851e8581893a1ea5de09da3ff83f5cbac7961910776f78295baab9274666b66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.949350Z","signature_b64":"KLzrxFloVA/XQeh+b2qbuyItLs6K2y/KzcS4tb/iK6QoCtJqRBYe8T4GSjFy62NAJuLpsjsNlS6vunxIi1IxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c851e8581893a1ea5de09da3ff83f5cbac7961910776f78295baab9274666b66","last_reissued_at":"2026-05-18T04:29:54.948784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.948784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1141","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-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UK077GN6ik4zkG7bQFdcPsBuCT2JvGy5Pc4qeDKPRwVTmTUPOEYyn0kh5dpJsu4KVLA0KCIwm83KnChCi4ZqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:12.675544Z"},"content_sha256":"5a33a215ea3d03a20e3d78fb8ac29ea74af85d53dc66f21feb629fb1980b409f","schema_version":"1.0","event_id":"sha256:5a33a215ea3d03a20e3d78fb8ac29ea74af85d53dc66f21feb629fb1980b409f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZBI6QWAYSOQ6UXPATWR77A7VZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm Computing the Core of a Konig-Egervary Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2011-02-06T11:21:00Z","abstract_excerpt":"A set S of vertices is independent in a graph G if no two vertices from S are adjacent, and alpha(G) is the cardinality of a maximum independent set of G.\n  G is called a Konig-Egervary graph if its order equals alpha(G)+mu(G), where mu(G) denotes the size of a maximum matching. By core(G) we mean the intersection of all maximum independent sets of G.\n  To decide whether core(G) is empty is known to be NP-hard.\n  In this paper, we present some polynomial time algorithms finding core(G) of a Konig-Egervary graph G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1141","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-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLOhJJ8pzbesMAUQwuXxHAjwMgIAZTeksuXXEyGxu9yyY7TSCNTiq+I5ZPMqTJ+NH+FC8F4RiZoy4cawxoRVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:12.676254Z"},"content_sha256":"a9d4d6282fecb8fe97a9a1c2c7ce98a0ee2ae212b142649c094d96fcca21631a","schema_version":"1.0","event_id":"sha256:a9d4d6282fecb8fe97a9a1c2c7ce98a0ee2ae212b142649c094d96fcca21631a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/bundle.json","state_url":"https://pith.science/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/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-29T21:13:12Z","links":{"resolver":"https://pith.science/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO","bundle":"https://pith.science/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/bundle.json","state":"https://pith.science/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBI6QWAYSOQ6UXPATWR77A7VZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZBI6QWAYSOQ6UXPATWR77A7VZO","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":"607da9fc972f9b91e6a0b8c9cf4802ae955e72ad32c84a2d3a116088eeb88225","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:21:00Z","title_canon_sha256":"16d9050c224de0df690ea15a3fe5856ef0106210764460d0ebfd577d80fb9e02"},"schema_version":"1.0","source":{"id":"1102.1141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1141","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1141v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1141","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZBI6QWAYSOQ6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZBI6QWAYSOQ6UXPA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZBI6QWAY","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:a9d4d6282fecb8fe97a9a1c2c7ce98a0ee2ae212b142649c094d96fcca21631a","target":"graph","created_at":"2026-05-18T04:29:54Z","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":"A set S of vertices is independent in a graph G if no two vertices from S are adjacent, and alpha(G) is the cardinality of a maximum independent set of G.\n  G is called a Konig-Egervary graph if its order equals alpha(G)+mu(G), where mu(G) denotes the size of a maximum matching. By core(G) we mean the intersection of all maximum independent sets of G.\n  To decide whether core(G) is empty is known to be NP-hard.\n  In this paper, we present some polynomial time algorithms finding core(G) of a Konig-Egervary graph G.","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:21:00Z","title":"An Algorithm Computing the Core of a Konig-Egervary Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1141","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:5a33a215ea3d03a20e3d78fb8ac29ea74af85d53dc66f21feb629fb1980b409f","target":"record","created_at":"2026-05-18T04:29:54Z","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":"607da9fc972f9b91e6a0b8c9cf4802ae955e72ad32c84a2d3a116088eeb88225","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:21:00Z","title_canon_sha256":"16d9050c224de0df690ea15a3fe5856ef0106210764460d0ebfd577d80fb9e02"},"schema_version":"1.0","source":{"id":"1102.1141","kind":"arxiv","version":1}},"canonical_sha256":"c851e8581893a1ea5de09da3ff83f5cbac7961910776f78295baab9274666b66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c851e8581893a1ea5de09da3ff83f5cbac7961910776f78295baab9274666b66","first_computed_at":"2026-05-18T04:29:54.948784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:54.948784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KLzrxFloVA/XQeh+b2qbuyItLs6K2y/KzcS4tb/iK6QoCtJqRBYe8T4GSjFy62NAJuLpsjsNlS6vunxIi1IxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:54.949350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a33a215ea3d03a20e3d78fb8ac29ea74af85d53dc66f21feb629fb1980b409f","sha256:a9d4d6282fecb8fe97a9a1c2c7ce98a0ee2ae212b142649c094d96fcca21631a"],"state_sha256":"686bbed83e07e435ce7253cbb7360828e1afa7b01802256b2ccbc2f022044149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsM+DcrEWj+s9IptSideTPhHwJ76lE1X359uxS+QeDdID//Ya/gFAvbD1sg6R6oV/KIyYVul4pSpO+DVAWxHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:13:12.679852Z","bundle_sha256":"ce19864ed11a55b1742f739d923c438b27f041f04ac72a6a5402bed60a6f3770"}}