{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZCNSPD4ZZNJPESDGA3NZWFYTVP","short_pith_number":"pith:ZCNSPD4Z","canonical_record":{"source":{"id":"1905.09462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-22T14:06:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"407a956ae02e70eff7b203509f44c3342bd4b7edbf01d6fd92021b514be1f77d","abstract_canon_sha256":"4ea3b9a0d17937327772a722fb1ce238301a975e41d079f0d9a1b689c0c0ae49"},"schema_version":"1.0"},"canonical_sha256":"c89b278f99cb52f2486606db9b1713abf211827837daef3964df36e973307c6b","source":{"kind":"arxiv","id":"1905.09462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09462","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09462v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09462","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZCNSPD4ZZNJP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCNSPD4ZZNJPESDG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCNSPD4Z","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZCNSPD4ZZNJPESDGA3NZWFYTVP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-22T14:06:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"407a956ae02e70eff7b203509f44c3342bd4b7edbf01d6fd92021b514be1f77d","abstract_canon_sha256":"4ea3b9a0d17937327772a722fb1ce238301a975e41d079f0d9a1b689c0c0ae49"},"schema_version":"1.0"},"canonical_sha256":"c89b278f99cb52f2486606db9b1713abf211827837daef3964df36e973307c6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:16.962733Z","signature_b64":"6jM1HIJihdTK+M3VxRCxlA3pI7Zt7s8wLajfl7A4lNq20ZzrSmG0TTBlKQzD8g6hcZav9KTaKGT0G+d86hdLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c89b278f99cb52f2486606db9b1713abf211827837daef3964df36e973307c6b","last_reissued_at":"2026-05-17T23:45:16.962099Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:16.962099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09462","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-17T23:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6/anxqwNqO9v+u/APhgHIFeSND4fPoxQExoxs+Jz/68Yf2vBoOmDLgt12WfNLPimUvud+rlCP+PW+X5VdIUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:18:19.069173Z"},"content_sha256":"eb8829dc70fc2ed8ef0da984c7b3cfe77c72740e637461584dcaaf8baf08a3f6","schema_version":"1.0","event_id":"sha256:eb8829dc70fc2ed8ef0da984c7b3cfe77c72740e637461584dcaaf8baf08a3f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZCNSPD4ZZNJPESDGA3NZWFYTVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Critical Difference of Almost Bipartite Graphs","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":"2019-05-22T14:06:22Z","abstract_excerpt":"A set $S\\subseteq V$ is \\textit{independent} in a graph $G=\\left( V,E\\right) $ if no two vertices from $S$ are adjacent. The \\textit{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)$ equals the order of $G$, then $G$ is called a \\textit{K\\\"{o}nig-Egerv\\'{a}ry graph }\\cite{dem,ster}. The number $d\\left( G\\right) =\\max\\{\\left\\vert A\\right\\vert -\\left\\vert N\\left( A\\right) \\right\\vert :A\\subseteq V\\}$ is called the \\textit{critical difference} of $G$ \\cite{Zhang} (where $N\\left( A\\right)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09462","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-17T23:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QhPEcr7HGQF9zxW4SHzx0ZOHcLXd4kE6+FnVdxAQ0Nuqst4Hl4RUH4AQPQaNLV45tCydo0vf8u6vurcgHAeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:18:19.069536Z"},"content_sha256":"7ead3ded3a9e5253d52dd03b7fb807c37161ee2bb680d4707149d1549529167f","schema_version":"1.0","event_id":"sha256:7ead3ded3a9e5253d52dd03b7fb807c37161ee2bb680d4707149d1549529167f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/bundle.json","state_url":"https://pith.science/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/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-05T11:18:19Z","links":{"resolver":"https://pith.science/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP","bundle":"https://pith.science/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/bundle.json","state":"https://pith.science/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCNSPD4ZZNJPESDGA3NZWFYTVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZCNSPD4ZZNJPESDGA3NZWFYTVP","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":"4ea3b9a0d17937327772a722fb1ce238301a975e41d079f0d9a1b689c0c0ae49","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-22T14:06:22Z","title_canon_sha256":"407a956ae02e70eff7b203509f44c3342bd4b7edbf01d6fd92021b514be1f77d"},"schema_version":"1.0","source":{"id":"1905.09462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09462","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09462v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09462","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZCNSPD4ZZNJP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCNSPD4ZZNJPESDG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCNSPD4Z","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7ead3ded3a9e5253d52dd03b7fb807c37161ee2bb680d4707149d1549529167f","target":"graph","created_at":"2026-05-17T23:45:16Z","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\\subseteq V$ is \\textit{independent} in a graph $G=\\left( V,E\\right) $ if no two vertices from $S$ are adjacent. The \\textit{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)$ equals the order of $G$, then $G$ is called a \\textit{K\\\"{o}nig-Egerv\\'{a}ry graph }\\cite{dem,ster}. The number $d\\left( G\\right) =\\max\\{\\left\\vert A\\right\\vert -\\left\\vert N\\left( A\\right) \\right\\vert :A\\subseteq V\\}$ is called the \\textit{critical difference} of $G$ \\cite{Zhang} (where $N\\left( A\\right)","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":"2019-05-22T14:06:22Z","title":"On the Critical Difference of Almost Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09462","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:eb8829dc70fc2ed8ef0da984c7b3cfe77c72740e637461584dcaaf8baf08a3f6","target":"record","created_at":"2026-05-17T23:45:16Z","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":"4ea3b9a0d17937327772a722fb1ce238301a975e41d079f0d9a1b689c0c0ae49","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-22T14:06:22Z","title_canon_sha256":"407a956ae02e70eff7b203509f44c3342bd4b7edbf01d6fd92021b514be1f77d"},"schema_version":"1.0","source":{"id":"1905.09462","kind":"arxiv","version":1}},"canonical_sha256":"c89b278f99cb52f2486606db9b1713abf211827837daef3964df36e973307c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c89b278f99cb52f2486606db9b1713abf211827837daef3964df36e973307c6b","first_computed_at":"2026-05-17T23:45:16.962099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:16.962099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6jM1HIJihdTK+M3VxRCxlA3pI7Zt7s8wLajfl7A4lNq20ZzrSmG0TTBlKQzD8g6hcZav9KTaKGT0G+d86hdLAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:16.962733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8829dc70fc2ed8ef0da984c7b3cfe77c72740e637461584dcaaf8baf08a3f6","sha256:7ead3ded3a9e5253d52dd03b7fb807c37161ee2bb680d4707149d1549529167f"],"state_sha256":"38c1ef5523f4f96ababc86ef60b784de4e835ddf0f617006d66e1270f38d5b4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHh5eScHEiz8hGOeLLws/4AsMYFNWNQZ/8xNvWzdqcFXCC2LxdV5ePeX1Jrw7v/iJIxTrVie8/bWbtTItPNNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:18:19.071488Z","bundle_sha256":"8a4c0161a3faf58cc3001d46b4a71a78de91573f6fe4e8261667c67a06176a3c"}}