{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3IYLBMFFBVOL63BVW7YITVEOZP","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":"98db5070db65c7da19dcb7816190c17fa1ebbe1c70a2482bda0dffeb1cafcb85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-13T17:11:44Z","title_canon_sha256":"a0bd38061a0ff73c85acb19fb24973f3afcd2a094049fe1cbc593b77cd116e87"},"schema_version":"1.0","source":{"id":"1203.2868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2868","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2868v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2868","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"3IYLBMFFBVOL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3IYLBMFFBVOL63BV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3IYLBMFF","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:2fd36b512dd3d0392e4d6579e6e1e7f7402d84dbdf4f4e4b9f6210fe4f04dd71","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"For any c >= 2, a c-strong coloring of the hypergraph G is an assignment of colors to the vertices of G such that for every edge e of G, the vertices of e are colored by at least min{c,|e|} distinct colors. The hypergraph G is t-intersecting if every two edges of G have at least t vertices in common. We ask: for fixed c >= 2 and t >= 1, what is the minimum number of colors that is sufficient to c-strong color any t-intersecting hypergraphs?\n  The purpose of this note is to answer the question for some values of t and c and, more importantly, to describe the settings for which the question is s","authors_text":"Amit Weinstein, Eric Blais, Yuichi Yoshida","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-13T17:11:44Z","title":"Semi-Strong Coloring of Intersecting Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2868","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:95acde0309270d4c9aa2936beab0beca26a9eda52319b88aff38d88f4e0f4dce","target":"record","created_at":"2026-05-18T04:00:14Z","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":"98db5070db65c7da19dcb7816190c17fa1ebbe1c70a2482bda0dffeb1cafcb85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-13T17:11:44Z","title_canon_sha256":"a0bd38061a0ff73c85acb19fb24973f3afcd2a094049fe1cbc593b77cd116e87"},"schema_version":"1.0","source":{"id":"1203.2868","kind":"arxiv","version":1}},"canonical_sha256":"da30b0b0a50d5cbf6c35b7f089d48ecbd64fa39605e3195010b15a3c6f0fcf41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da30b0b0a50d5cbf6c35b7f089d48ecbd64fa39605e3195010b15a3c6f0fcf41","first_computed_at":"2026-05-18T04:00:14.325309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.325309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BIv0ib/MKU7hXeega2brsO3bhvx9Hn1xaMhGgWRLdhKPP76OAf4Q+qp6qTbnSpZFqbkiPDIJcqlObVhpb4ZqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.326141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95acde0309270d4c9aa2936beab0beca26a9eda52319b88aff38d88f4e0f4dce","sha256:2fd36b512dd3d0392e4d6579e6e1e7f7402d84dbdf4f4e4b9f6210fe4f04dd71"],"state_sha256":"8cd510566ae4e19baee7570e9257bf29a2abef017c08f21c7d28d0b68da10c9c"}