{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HLCQK3YOFRGJHPHGVBYKSCYFPU","short_pith_number":"pith:HLCQK3YO","canonical_record":{"source":{"id":"1108.3756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-08-18T14:05:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3efc57c9f3373daa5dc4f4f69cb8c26c5fd3a349916c14e75cf4f086d1927286","abstract_canon_sha256":"015bd077e054f524ab93af8f99df895671a0de6cea763070d92bbd671cac0e30"},"schema_version":"1.0"},"canonical_sha256":"3ac5056f0e2c4c93bce6a870a90b057d16e69c59fc3869bbb836d0c049f413f4","source":{"kind":"arxiv","id":"1108.3756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3756","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3756v1","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3756","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"HLCQK3YOFRGJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLCQK3YOFRGJHPHG","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLCQK3YO","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HLCQK3YOFRGJHPHGVBYKSCYFPU","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-08-18T14:05:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3efc57c9f3373daa5dc4f4f69cb8c26c5fd3a349916c14e75cf4f086d1927286","abstract_canon_sha256":"015bd077e054f524ab93af8f99df895671a0de6cea763070d92bbd671cac0e30"},"schema_version":"1.0"},"canonical_sha256":"3ac5056f0e2c4c93bce6a870a90b057d16e69c59fc3869bbb836d0c049f413f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:07.518472Z","signature_b64":"9tIg029htNahOkLyUqth0pcstZ6CYHxWUP0xCyman4PZ5ApkEahFYwLZxC+I77ka2sN4TJyMcQi/baciRX2sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac5056f0e2c4c93bce6a870a90b057d16e69c59fc3869bbb836d0c049f413f4","last_reissued_at":"2026-05-18T04:15:07.517758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:07.517758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3756","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:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkPjJGkuoTpjPiVgpNRIntgGQj6bUkD1ry3S3rCA+WoEIUqbz1wNhOBcS4YFuhgozJaA9ib5kZFdqXT9QdAoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:47:51.346693Z"},"content_sha256":"83b1ef084766b98cf239398f7708e68bda881f9123627edcfa600132fcafa584","schema_version":"1.0","event_id":"sha256:83b1ef084766b98cf239398f7708e68bda881f9123627edcfa600132fcafa584"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HLCQK3YOFRGJHPHGVBYKSCYFPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Intersection of All Critical Sets of a Unicyclic 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-08-18T14:05:04Z","abstract_excerpt":"A set S is independent in a graph G if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the size of a maximum matching in G. If alpha(G)+mu(G)=|V|, then G=(V,E) is called a Konig-Egervary graph. The number d_{c}(G)=max{|A|-|N(A)|} is called the critical difference of G (Zhang, 1990). By core(G) (corona(G)) we denote the intersection (union, respectively) of all maximum independent sets, while by ker(G) we mean the intersection of all critical independent sets. A connected graph having only one cycle is called "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3756","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:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xz81SBQ2BA0600QFk36n2gFcL6/MboHmBqbGYD7BZURrCZQNt7muisqmg82mbLxsf3CWIjCRvTrqwrPQZVTSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:47:51.347330Z"},"content_sha256":"917830c31bd2f06d13cd4949c9f87857b07955cef1b707a89c8198f3ec5a6cd1","schema_version":"1.0","event_id":"sha256:917830c31bd2f06d13cd4949c9f87857b07955cef1b707a89c8198f3ec5a6cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/bundle.json","state_url":"https://pith.science/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/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-29T23:47:51Z","links":{"resolver":"https://pith.science/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU","bundle":"https://pith.science/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/bundle.json","state":"https://pith.science/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLCQK3YOFRGJHPHGVBYKSCYFPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HLCQK3YOFRGJHPHGVBYKSCYFPU","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":"015bd077e054f524ab93af8f99df895671a0de6cea763070d92bbd671cac0e30","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-08-18T14:05:04Z","title_canon_sha256":"3efc57c9f3373daa5dc4f4f69cb8c26c5fd3a349916c14e75cf4f086d1927286"},"schema_version":"1.0","source":{"id":"1108.3756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3756","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3756v1","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3756","created_at":"2026-05-18T04:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"HLCQK3YOFRGJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLCQK3YOFRGJHPHG","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLCQK3YO","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:917830c31bd2f06d13cd4949c9f87857b07955cef1b707a89c8198f3ec5a6cd1","target":"graph","created_at":"2026-05-18T04:15:07Z","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 is independent in a graph G if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the size of a maximum matching in G. If alpha(G)+mu(G)=|V|, then G=(V,E) is called a Konig-Egervary graph. The number d_{c}(G)=max{|A|-|N(A)|} is called the critical difference of G (Zhang, 1990). By core(G) (corona(G)) we denote the intersection (union, respectively) of all maximum independent sets, while by ker(G) we mean the intersection of all critical independent sets. A connected graph having only one cycle is called ","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-08-18T14:05:04Z","title":"On the Intersection of All Critical Sets of a Unicyclic Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3756","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:83b1ef084766b98cf239398f7708e68bda881f9123627edcfa600132fcafa584","target":"record","created_at":"2026-05-18T04:15:07Z","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":"015bd077e054f524ab93af8f99df895671a0de6cea763070d92bbd671cac0e30","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-08-18T14:05:04Z","title_canon_sha256":"3efc57c9f3373daa5dc4f4f69cb8c26c5fd3a349916c14e75cf4f086d1927286"},"schema_version":"1.0","source":{"id":"1108.3756","kind":"arxiv","version":1}},"canonical_sha256":"3ac5056f0e2c4c93bce6a870a90b057d16e69c59fc3869bbb836d0c049f413f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac5056f0e2c4c93bce6a870a90b057d16e69c59fc3869bbb836d0c049f413f4","first_computed_at":"2026-05-18T04:15:07.517758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:07.517758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9tIg029htNahOkLyUqth0pcstZ6CYHxWUP0xCyman4PZ5ApkEahFYwLZxC+I77ka2sN4TJyMcQi/baciRX2sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:07.518472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b1ef084766b98cf239398f7708e68bda881f9123627edcfa600132fcafa584","sha256:917830c31bd2f06d13cd4949c9f87857b07955cef1b707a89c8198f3ec5a6cd1"],"state_sha256":"a33f4ee46fc80b3c85bdb886279c17211672b15c47e0ba6aa9065654eeb87ea0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCM0rQjEoy0k9wWkNZfNZnIfdtqiiuF7ejh3sf+lWZh8FkjP0Ocx7tjFlz/iIAqk2dAcosRIuTlT7ydO4xrDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:47:51.351179Z","bundle_sha256":"6833dedf59801765332ad1693dfa57bc0b0af20337d9ecbdebed94a30225bbd6"}}