{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3IYLBMFFBVOL63BVW7YITVEOZP","short_pith_number":"pith:3IYLBMFF","schema_version":"1.0","canonical_sha256":"da30b0b0a50d5cbf6c35b7f089d48ecbd64fa39605e3195010b15a3c6f0fcf41","source":{"kind":"arxiv","id":"1203.2868","version":1},"attestation_state":"computed","paper":{"title":"Semi-Strong Coloring of Intersecting Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amit Weinstein, Eric Blais, Yuichi Yoshida","submitted_at":"2012-03-13T17:11:44Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.2868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-13T17:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"a0bd38061a0ff73c85acb19fb24973f3afcd2a094049fe1cbc593b77cd116e87","abstract_canon_sha256":"98db5070db65c7da19dcb7816190c17fa1ebbe1c70a2482bda0dffeb1cafcb85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.326141Z","signature_b64":"BIv0ib/MKU7hXeega2brsO3bhvx9Hn1xaMhGgWRLdhKPP76OAf4Q+qp6qTbnSpZFqbkiPDIJcqlObVhpb4ZqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da30b0b0a50d5cbf6c35b7f089d48ecbd64fa39605e3195010b15a3c6f0fcf41","last_reissued_at":"2026-05-18T04:00:14.325309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.325309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Strong Coloring of Intersecting Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amit Weinstein, Eric Blais, Yuichi Yoshida","submitted_at":"2012-03-13T17:11:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2868","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.2868","created_at":"2026-05-18T04:00:14.325472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2868v1","created_at":"2026-05-18T04:00:14.325472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2868","created_at":"2026-05-18T04:00:14.325472+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IYLBMFFBVOL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IYLBMFFBVOL63BV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IYLBMFF","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP","json":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP.json","graph_json":"https://pith.science/api/pith-number/3IYLBMFFBVOL63BVW7YITVEOZP/graph.json","events_json":"https://pith.science/api/pith-number/3IYLBMFFBVOL63BVW7YITVEOZP/events.json","paper":"https://pith.science/paper/3IYLBMFF"},"agent_actions":{"view_html":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP","download_json":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP.json","view_paper":"https://pith.science/paper/3IYLBMFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2868&json=true","fetch_graph":"https://pith.science/api/pith-number/3IYLBMFFBVOL63BVW7YITVEOZP/graph.json","fetch_events":"https://pith.science/api/pith-number/3IYLBMFFBVOL63BVW7YITVEOZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP/action/storage_attestation","attest_author":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP/action/author_attestation","sign_citation":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP/action/citation_signature","submit_replication":"https://pith.science/pith/3IYLBMFFBVOL63BVW7YITVEOZP/action/replication_record"}},"created_at":"2026-05-18T04:00:14.325472+00:00","updated_at":"2026-05-18T04:00:14.325472+00:00"}