{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GUKVCL5CYSKQDDQSUS6HIE36T5","short_pith_number":"pith:GUKVCL5C","canonical_record":{"source":{"id":"1611.06142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T16:17:19Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"1737dc8871ba39f34d4ba57b47a4adbd37b9305bb2191a2a41c28fd78848b389","abstract_canon_sha256":"9305b738a9a60ca09870ef9e4ec3aa546ae8cfa5377defb2e7a0304e91775ee3"},"schema_version":"1.0"},"canonical_sha256":"3515512fa2c495018e12a4bc74137e9f67ea992dc269042a2b4fd19a2e7d7a2b","source":{"kind":"arxiv","id":"1611.06142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06142","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06142v2","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06142","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"GUKVCL5CYSKQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GUKVCL5CYSKQDDQS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GUKVCL5C","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GUKVCL5CYSKQDDQSUS6HIE36T5","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T16:17:19Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"1737dc8871ba39f34d4ba57b47a4adbd37b9305bb2191a2a41c28fd78848b389","abstract_canon_sha256":"9305b738a9a60ca09870ef9e4ec3aa546ae8cfa5377defb2e7a0304e91775ee3"},"schema_version":"1.0"},"canonical_sha256":"3515512fa2c495018e12a4bc74137e9f67ea992dc269042a2b4fd19a2e7d7a2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.208973Z","signature_b64":"PusSdUPGZLrjn+db8MSNrfIqIlDct232NG3mfDnmVBEEGWm96WG3YZnxvQJu6oBJrntnMy+rZ1GC9m+rHRs+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3515512fa2c495018e12a4bc74137e9f67ea992dc269042a2b4fd19a2e7d7a2b","last_reissued_at":"2026-05-18T00:43:18.208248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.208248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06142","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:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TP/kQzBL/taVhbWwm9x9c1zcCTxQlPoOTvm2AA1ZF4tjYsLesF7q1+AG/EBRulLqMpRA0FFF8vpoLP8dQrk7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:30:08.961729Z"},"content_sha256":"6353702dabc9f96ba32112049978110c3ed6438f09f277b6547a9c61e9fb2d21","schema_version":"1.0","event_id":"sha256:6353702dabc9f96ba32112049978110c3ed6438f09f277b6547a9c61e9fb2d21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GUKVCL5CYSKQDDQSUS6HIE36T5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced independent sets in graphs omitting large cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Andres A. Lopez, Claude Laflamme, Daniel T. Soukup, Robert Woodrow","submitted_at":"2016-11-18T16:17:19Z","abstract_excerpt":"Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\\in \\mathbb N$ there is a minimal $r=r(G,m)$ such that for any balanced $r$-colouring of the vertices of $G$ one can find an independent set which meets at least $m$ colour classes in a set of size $|V|$. Answering a conjecture of S. Thomass\\'e, we express the exact value of $r(H_n,m)$ (using Ramsey-numbers for finite digraphs), where $H_n$ is Henson's countable universal homogeneous $K_n$-free graph. In tu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06142","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:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y03/K2rHzxNooV0MM4K1mfEf+PeTm4rl++7qMiO32WEe00m9ZfuOSzjGIIiPImUHompzz/6pN1+XXeTVi9h8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:30:08.962085Z"},"content_sha256":"bb6569b32fa66bcafd35fb89ca9413f293438d3cae4106962971779669491d51","schema_version":"1.0","event_id":"sha256:bb6569b32fa66bcafd35fb89ca9413f293438d3cae4106962971779669491d51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/bundle.json","state_url":"https://pith.science/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/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-01T05:30:08Z","links":{"resolver":"https://pith.science/pith/GUKVCL5CYSKQDDQSUS6HIE36T5","bundle":"https://pith.science/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/bundle.json","state":"https://pith.science/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUKVCL5CYSKQDDQSUS6HIE36T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GUKVCL5CYSKQDDQSUS6HIE36T5","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":"9305b738a9a60ca09870ef9e4ec3aa546ae8cfa5377defb2e7a0304e91775ee3","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T16:17:19Z","title_canon_sha256":"1737dc8871ba39f34d4ba57b47a4adbd37b9305bb2191a2a41c28fd78848b389"},"schema_version":"1.0","source":{"id":"1611.06142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06142","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06142v2","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06142","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"GUKVCL5CYSKQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GUKVCL5CYSKQDDQS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GUKVCL5C","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb6569b32fa66bcafd35fb89ca9413f293438d3cae4106962971779669491d51","target":"graph","created_at":"2026-05-18T00:43:18Z","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":"Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\\in \\mathbb N$ there is a minimal $r=r(G,m)$ such that for any balanced $r$-colouring of the vertices of $G$ one can find an independent set which meets at least $m$ colour classes in a set of size $|V|$. Answering a conjecture of S. Thomass\\'e, we express the exact value of $r(H_n,m)$ (using Ramsey-numbers for finite digraphs), where $H_n$ is Henson's countable universal homogeneous $K_n$-free graph. In tu","authors_text":"Andres A. Lopez, Claude Laflamme, Daniel T. Soukup, Robert Woodrow","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T16:17:19Z","title":"Balanced independent sets in graphs omitting large cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06142","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:6353702dabc9f96ba32112049978110c3ed6438f09f277b6547a9c61e9fb2d21","target":"record","created_at":"2026-05-18T00:43:18Z","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":"9305b738a9a60ca09870ef9e4ec3aa546ae8cfa5377defb2e7a0304e91775ee3","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T16:17:19Z","title_canon_sha256":"1737dc8871ba39f34d4ba57b47a4adbd37b9305bb2191a2a41c28fd78848b389"},"schema_version":"1.0","source":{"id":"1611.06142","kind":"arxiv","version":2}},"canonical_sha256":"3515512fa2c495018e12a4bc74137e9f67ea992dc269042a2b4fd19a2e7d7a2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3515512fa2c495018e12a4bc74137e9f67ea992dc269042a2b4fd19a2e7d7a2b","first_computed_at":"2026-05-18T00:43:18.208248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:18.208248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PusSdUPGZLrjn+db8MSNrfIqIlDct232NG3mfDnmVBEEGWm96WG3YZnxvQJu6oBJrntnMy+rZ1GC9m+rHRs+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:18.208973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6353702dabc9f96ba32112049978110c3ed6438f09f277b6547a9c61e9fb2d21","sha256:bb6569b32fa66bcafd35fb89ca9413f293438d3cae4106962971779669491d51"],"state_sha256":"b7d006d1dd8faebecfeb005ac44f71a3ca3388fea335c80b6b14ba1632eb29f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYk0L3zKzWJllXIYFFLQqZQXLQMKv4RBItKFOjTtN6eAxDj/jEL8IZJXSsyYrcxrCm/Z06jJ9RMb5hFj3rg/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:30:08.964285Z","bundle_sha256":"069c8fab86d0f99a83d5b421777688666f1985ae0eee8d312429ef39250e8460"}}