{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YUT5CCXLIWHMMEOONZ6FNHWZ6N","short_pith_number":"pith:YUT5CCXL","canonical_record":{"source":{"id":"1509.05057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-16T20:33:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"32459b377410f35c6da706dc30b025c381e6c380c4ad8609d1975bdf3626226d","abstract_canon_sha256":"6643c389ab5fc93dfd80237c4cc366d895c00e4e2bce45440eb4e858d1433f79"},"schema_version":"1.0"},"canonical_sha256":"c527d10aeb458ec611ce6e7c569ed9f34f1114f4c24ee4375cc2cad7882f9208","source":{"kind":"arxiv","id":"1509.05057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05057","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05057v1","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05057","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"YUT5CCXLIWHM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YUT5CCXLIWHMMEOO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YUT5CCXL","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YUT5CCXLIWHMMEOONZ6FNHWZ6N","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-16T20:33:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"32459b377410f35c6da706dc30b025c381e6c380c4ad8609d1975bdf3626226d","abstract_canon_sha256":"6643c389ab5fc93dfd80237c4cc366d895c00e4e2bce45440eb4e858d1433f79"},"schema_version":"1.0"},"canonical_sha256":"c527d10aeb458ec611ce6e7c569ed9f34f1114f4c24ee4375cc2cad7882f9208","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:50.031542Z","signature_b64":"6G5o6FAgkX+SpCj6Yxl0U3WqRwR3hryjJ+/soeOTUC8064YUyPpgMG1+sg6lBE8y0Ozw76H5tRXX+GMC6DxZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c527d10aeb458ec611ce6e7c569ed9f34f1114f4c24ee4375cc2cad7882f9208","last_reissued_at":"2026-05-18T01:32:50.030761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:50.030761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05057","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-18T01:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BVU7P8IK3Kb5LObXJ6kPKphQfepnW7AByOZYbJlBRchbWgATEmHOQqfAyQCirY2PMwzKoRusq25ZjedD2IvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:43:08.559693Z"},"content_sha256":"93a076020c6ac62bafea0987228f46f478a9c97a4990f122bccde60084cbaf50","schema_version":"1.0","event_id":"sha256:93a076020c6ac62bafea0987228f46f478a9c97a4990f122bccde60084cbaf50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YUT5CCXLIWHMMEOONZ6FNHWZ6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On some conjectures concerning critical independent sets of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Taylor Short","submitted_at":"2015-09-16T20:33:40Z","abstract_excerpt":"Let $G$ be a simple graph with vertex set $V(G)$. A set $S\\subseteq V(G)$ is independent if no two vertices from $S$ are adjacent. For $X\\subseteq V(G)$, the difference of $X$ is $d(X) = |X|-|N(X)|$ and an independent set $A$ is critical if $d(A) = \\max \\{d(X): X\\subseteq V(G) \\text{ is an independent set}\\}$ (possibly $A=\\emptyset$). Let $\\text{nucleus}(G)$ and $\\text{diadem}(G)$ be the intersection and union, respectively, of all maximum size critical independent sets in $G$. In this paper, we will give two new characterizations of K\\\"{o}nig-Egerv\\'{a}ry graphs involving $\\text{nucleus}(G)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05057","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-18T01:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omGqmgfwjlZDy9C5tVxFSz1iYSeg5n9Ha7rYaIyQFr1MLsW3Z2QQ+vgURxHUdQhWkfTSfOm4K7QkjPPZ1PqxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:43:08.560059Z"},"content_sha256":"22bcf7972976bc1a070d90c5a5c0a9799857ff84407babda52f36116020353cf","schema_version":"1.0","event_id":"sha256:22bcf7972976bc1a070d90c5a5c0a9799857ff84407babda52f36116020353cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/bundle.json","state_url":"https://pith.science/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/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-25T11:43:08Z","links":{"resolver":"https://pith.science/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N","bundle":"https://pith.science/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/bundle.json","state":"https://pith.science/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUT5CCXLIWHMMEOONZ6FNHWZ6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YUT5CCXLIWHMMEOONZ6FNHWZ6N","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":"6643c389ab5fc93dfd80237c4cc366d895c00e4e2bce45440eb4e858d1433f79","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-16T20:33:40Z","title_canon_sha256":"32459b377410f35c6da706dc30b025c381e6c380c4ad8609d1975bdf3626226d"},"schema_version":"1.0","source":{"id":"1509.05057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05057","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05057v1","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05057","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"YUT5CCXLIWHM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YUT5CCXLIWHMMEOO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YUT5CCXL","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:22bcf7972976bc1a070d90c5a5c0a9799857ff84407babda52f36116020353cf","target":"graph","created_at":"2026-05-18T01:32:50Z","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":"Let $G$ be a simple graph with vertex set $V(G)$. A set $S\\subseteq V(G)$ is independent if no two vertices from $S$ are adjacent. For $X\\subseteq V(G)$, the difference of $X$ is $d(X) = |X|-|N(X)|$ and an independent set $A$ is critical if $d(A) = \\max \\{d(X): X\\subseteq V(G) \\text{ is an independent set}\\}$ (possibly $A=\\emptyset$). Let $\\text{nucleus}(G)$ and $\\text{diadem}(G)$ be the intersection and union, respectively, of all maximum size critical independent sets in $G$. In this paper, we will give two new characterizations of K\\\"{o}nig-Egerv\\'{a}ry graphs involving $\\text{nucleus}(G)$ ","authors_text":"Taylor Short","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-16T20:33:40Z","title":"On some conjectures concerning critical independent sets of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05057","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:93a076020c6ac62bafea0987228f46f478a9c97a4990f122bccde60084cbaf50","target":"record","created_at":"2026-05-18T01:32:50Z","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":"6643c389ab5fc93dfd80237c4cc366d895c00e4e2bce45440eb4e858d1433f79","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-16T20:33:40Z","title_canon_sha256":"32459b377410f35c6da706dc30b025c381e6c380c4ad8609d1975bdf3626226d"},"schema_version":"1.0","source":{"id":"1509.05057","kind":"arxiv","version":1}},"canonical_sha256":"c527d10aeb458ec611ce6e7c569ed9f34f1114f4c24ee4375cc2cad7882f9208","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c527d10aeb458ec611ce6e7c569ed9f34f1114f4c24ee4375cc2cad7882f9208","first_computed_at":"2026-05-18T01:32:50.030761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:50.030761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6G5o6FAgkX+SpCj6Yxl0U3WqRwR3hryjJ+/soeOTUC8064YUyPpgMG1+sg6lBE8y0Ozw76H5tRXX+GMC6DxZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:50.031542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a076020c6ac62bafea0987228f46f478a9c97a4990f122bccde60084cbaf50","sha256:22bcf7972976bc1a070d90c5a5c0a9799857ff84407babda52f36116020353cf"],"state_sha256":"1f9e80b9d2571d22ca653c06ea748f35422c4fddbf51ce5502bb4dcc9ff914f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exiFnN83qA+CQGonyVf+CKpTqrku+AzZISMZHosI7KBP90I6aMoeCtBBNT48YAs5pOrWoRX95api0lWtxKq3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:43:08.561985Z","bundle_sha256":"f2bdf508db576780593cc667477624a0c5b6bd337328380a03bd30c1587c968c"}}