{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SSU2QG5Y2R576IZYLJ2RLJP3WW","short_pith_number":"pith:SSU2QG5Y","canonical_record":{"source":{"id":"1601.05305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"522ec971621a29dd0be294f310d848193920d32ab2a64466e74bb91ed8bf3109","abstract_canon_sha256":"94614bb61b1efab37a77139e43bccd5270b89be933e8a49031a2706044be6883"},"schema_version":"1.0"},"canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","source":{"kind":"arxiv","id":"1601.05305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05305","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05305v2","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05305","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"SSU2QG5Y2R57","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSU2QG5Y2R576IZY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSU2QG5Y","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SSU2QG5Y2R576IZYLJ2RLJP3WW","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"522ec971621a29dd0be294f310d848193920d32ab2a64466e74bb91ed8bf3109","abstract_canon_sha256":"94614bb61b1efab37a77139e43bccd5270b89be933e8a49031a2706044be6883"},"schema_version":"1.0"},"canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:19.622763Z","signature_b64":"Kk1J6Ha+Cpkpi8/qRH0kQ2pwG0EEwXOGafvtD9iGJpHXdapqciwIR7B4q/+X+NRVyt7GG02ciVa3k3oYwucoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","last_reissued_at":"2026-05-18T00:19:19.622299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:19.622299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05305","source_version":2,"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-18T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whK2OvsFME+ECqj/yuK2uSzmKGNMrGoPJ6ZHJboRuKOLpSIw92pWQ18JP4bxGUdsAVzO5XYCq+13SnuOVhGXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:36.416985Z"},"content_sha256":"7e5180dff4a27623867896c4785e0e899f2f1caed4123857b85676264c203013","schema_version":"1.0","event_id":"sha256:7e5180dff4a27623867896c4785e0e899f2f1caed4123857b85676264c203013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SSU2QG5Y2R576IZYLJ2RLJP3WW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal-size clique transversals in chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Daniel Kral, Jacob W. Cooper","submitted_at":"2016-01-20T15:31:56Z","abstract_excerpt":"The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have a clique transversal, i.e., a set of vertices meeting all non-trivial maximal cliques, of size at most n/4? We prove that every such graph G has a clique transversal of size at most 2(n-1)/7 if n>=5, which is the best possible bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05305","kind":"arxiv","version":2},"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-18T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vm2devTdtMr8ImMMamZxR2EHntdTSkQt+/zPq87r5kqGOXIFuc4C7WQP3guOvve9vF2L/KwvrfPIyIC9Ezp6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:36.417619Z"},"content_sha256":"25cdeffc51d59002f415dce70dbf5238c986950e1e2997c6e363cf8c7b14700b","schema_version":"1.0","event_id":"sha256:25cdeffc51d59002f415dce70dbf5238c986950e1e2997c6e363cf8c7b14700b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/bundle.json","state_url":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/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-08T04:41:36Z","links":{"resolver":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW","bundle":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/bundle.json","state":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SSU2QG5Y2R576IZYLJ2RLJP3WW","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":"94614bb61b1efab37a77139e43bccd5270b89be933e8a49031a2706044be6883","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","title_canon_sha256":"522ec971621a29dd0be294f310d848193920d32ab2a64466e74bb91ed8bf3109"},"schema_version":"1.0","source":{"id":"1601.05305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05305","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05305v2","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05305","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"SSU2QG5Y2R57","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSU2QG5Y2R576IZY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSU2QG5Y","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:25cdeffc51d59002f415dce70dbf5238c986950e1e2997c6e363cf8c7b14700b","target":"graph","created_at":"2026-05-18T00:19:19Z","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":"The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have a clique transversal, i.e., a set of vertices meeting all non-trivial maximal cliques, of size at most n/4? We prove that every such graph G has a clique transversal of size at most 2(n-1)/7 if n>=5, which is the best possible bound.","authors_text":"Andrzej Grzesik, Daniel Kral, Jacob W. Cooper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","title":"Optimal-size clique transversals in chordal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05305","kind":"arxiv","version":2},"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:7e5180dff4a27623867896c4785e0e899f2f1caed4123857b85676264c203013","target":"record","created_at":"2026-05-18T00:19:19Z","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":"94614bb61b1efab37a77139e43bccd5270b89be933e8a49031a2706044be6883","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","title_canon_sha256":"522ec971621a29dd0be294f310d848193920d32ab2a64466e74bb91ed8bf3109"},"schema_version":"1.0","source":{"id":"1601.05305","kind":"arxiv","version":2}},"canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","first_computed_at":"2026-05-18T00:19:19.622299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:19.622299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kk1J6Ha+Cpkpi8/qRH0kQ2pwG0EEwXOGafvtD9iGJpHXdapqciwIR7B4q/+X+NRVyt7GG02ciVa3k3oYwucoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:19.622763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e5180dff4a27623867896c4785e0e899f2f1caed4123857b85676264c203013","sha256:25cdeffc51d59002f415dce70dbf5238c986950e1e2997c6e363cf8c7b14700b"],"state_sha256":"38ba819952f5caa566e1cc7b2239b3f60242713ad6855de833f10d50eb67cfe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wu1fVXKlhes+DRyi6Q+/x5digPzYQZjb2FCpDq/qJ1cDvTGmDNjJJexEBMlOYwXS+kBu++SdYM1JMHZ9vL6LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:41:36.421414Z","bundle_sha256":"5c9edc56cf15566d90ef61bffe8e6d37a9fb32f46a8cc6dd6282aaab047c23fc"}}